Formulation and optimization of the connection preemption problem

In the literature, the connection preemption policy is proposed for the resource allocation method in the prioritized multi-class networks. However, the connection preemption problem that is defined in the literature does not consider the rerouting of the preempted connections. When some connections...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer communications 2004-02, Vol.27 (3), p.253-261
Hauptverfasser: Jeon, Sung-eok, Abler, Randal T
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 261
container_issue 3
container_start_page 253
container_title Computer communications
container_volume 27
creator Jeon, Sung-eok
Abler, Randal T
description In the literature, the connection preemption policy is proposed for the resource allocation method in the prioritized multi-class networks. However, the connection preemption problem that is defined in the literature does not consider the rerouting of the preempted connections. When some connections are preempted at a connection preemption event, a part of the preempted connections will be rerouted with their own preemption priorities. Therefore, each rerouted connection setup can also trigger new connection preemption events. In this work, we propose to extend the existing connection preemption problem to include the subsequent connection preemption events (triggered by new or rerouted connections). We call the new extended problem the extended connection preemption problem. We formulate the existing connection preemption problem and the extended connection preemption problem with their decision variables and cost function. This is the first work that formulates the connection preemption problem in terms of its cost function. And we also analyze how to optimize the cost function of the extended connection preemption problem.
doi_str_mv 10.1016/j.comcom.2003.08.012
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_57590879</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0140366403002731</els_id><sourcerecordid>57590879</sourcerecordid><originalsourceid>FETCH-LOGICAL-c315t-fef9189cef9c4f700505d079bfa29f0db32db541613a6cdbaa251319455c15d93</originalsourceid><addsrcrecordid>eNqFkE9LxDAQxYMouK5-Aw89eWudNEnTXoRlcVVY8KLgLaT5g1napiZdQT-9WbtnhYEZhvfeMD-ErjEUGHB1uyuU71MVJQApoC4AlydogWtOcg7k7RQtAFPISVXRc3QR4w4AKOdkgVYbH_p9Jyfnh0wOOvPj5Hr3PS-8zaZ3kyk_DEb9bsZgTD8eR992pr9EZ1Z20Vwd-xK9bu5f1o_59vnhab3a5opgNuXW2AbXjUpNUcsBGDANvGmtLBsLuiWlbhnFFSayUrqVsmSY4IYypjDTDVmimzk33f3YmziJ3kVluk4Oxu-jYJw1UPP_hWWNSY0ZTUI6C1XwMQZjxRhcL8OXwCAOYMVOzGDFAayAWiSwyXY320z69tOZIKJyZlBGu5AoCe3d3wE_LDOEGA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28138154</pqid></control><display><type>article</type><title>Formulation and optimization of the connection preemption problem</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Jeon, Sung-eok ; Abler, Randal T</creator><creatorcontrib>Jeon, Sung-eok ; Abler, Randal T</creatorcontrib><description>In the literature, the connection preemption policy is proposed for the resource allocation method in the prioritized multi-class networks. However, the connection preemption problem that is defined in the literature does not consider the rerouting of the preempted connections. When some connections are preempted at a connection preemption event, a part of the preempted connections will be rerouted with their own preemption priorities. Therefore, each rerouted connection setup can also trigger new connection preemption events. In this work, we propose to extend the existing connection preemption problem to include the subsequent connection preemption events (triggered by new or rerouted connections). We call the new extended problem the extended connection preemption problem. We formulate the existing connection preemption problem and the extended connection preemption problem with their decision variables and cost function. This is the first work that formulates the connection preemption problem in terms of its cost function. And we also analyze how to optimize the cost function of the extended connection preemption problem.</description><identifier>ISSN: 0140-3664</identifier><identifier>EISSN: 1873-703X</identifier><identifier>DOI: 10.1016/j.comcom.2003.08.012</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Connection preemption ; Cost function ; Decision variable ; Extended connection preemption ; Label switched path ; Multiprotocol label switching networks ; Networks ; Priority-based networks ; Routing</subject><ispartof>Computer communications, 2004-02, Vol.27 (3), p.253-261</ispartof><rights>2003 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c315t-fef9189cef9c4f700505d079bfa29f0db32db541613a6cdbaa251319455c15d93</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0140366403002731$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids></links><search><creatorcontrib>Jeon, Sung-eok</creatorcontrib><creatorcontrib>Abler, Randal T</creatorcontrib><title>Formulation and optimization of the connection preemption problem</title><title>Computer communications</title><description>In the literature, the connection preemption policy is proposed for the resource allocation method in the prioritized multi-class networks. However, the connection preemption problem that is defined in the literature does not consider the rerouting of the preempted connections. When some connections are preempted at a connection preemption event, a part of the preempted connections will be rerouted with their own preemption priorities. Therefore, each rerouted connection setup can also trigger new connection preemption events. In this work, we propose to extend the existing connection preemption problem to include the subsequent connection preemption events (triggered by new or rerouted connections). We call the new extended problem the extended connection preemption problem. We formulate the existing connection preemption problem and the extended connection preemption problem with their decision variables and cost function. This is the first work that formulates the connection preemption problem in terms of its cost function. And we also analyze how to optimize the cost function of the extended connection preemption problem.</description><subject>Connection preemption</subject><subject>Cost function</subject><subject>Decision variable</subject><subject>Extended connection preemption</subject><subject>Label switched path</subject><subject>Multiprotocol label switching networks</subject><subject>Networks</subject><subject>Priority-based networks</subject><subject>Routing</subject><issn>0140-3664</issn><issn>1873-703X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNqFkE9LxDAQxYMouK5-Aw89eWudNEnTXoRlcVVY8KLgLaT5g1napiZdQT-9WbtnhYEZhvfeMD-ErjEUGHB1uyuU71MVJQApoC4AlydogWtOcg7k7RQtAFPISVXRc3QR4w4AKOdkgVYbH_p9Jyfnh0wOOvPj5Hr3PS-8zaZ3kyk_DEb9bsZgTD8eR992pr9EZ1Z20Vwd-xK9bu5f1o_59vnhab3a5opgNuXW2AbXjUpNUcsBGDANvGmtLBsLuiWlbhnFFSayUrqVsmSY4IYypjDTDVmimzk33f3YmziJ3kVluk4Oxu-jYJw1UPP_hWWNSY0ZTUI6C1XwMQZjxRhcL8OXwCAOYMVOzGDFAayAWiSwyXY320z69tOZIKJyZlBGu5AoCe3d3wE_LDOEGA</recordid><startdate>20040201</startdate><enddate>20040201</enddate><creator>Jeon, Sung-eok</creator><creator>Abler, Randal T</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>E3H</scope><scope>F2A</scope></search><sort><creationdate>20040201</creationdate><title>Formulation and optimization of the connection preemption problem</title><author>Jeon, Sung-eok ; Abler, Randal T</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c315t-fef9189cef9c4f700505d079bfa29f0db32db541613a6cdbaa251319455c15d93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Connection preemption</topic><topic>Cost function</topic><topic>Decision variable</topic><topic>Extended connection preemption</topic><topic>Label switched path</topic><topic>Multiprotocol label switching networks</topic><topic>Networks</topic><topic>Priority-based networks</topic><topic>Routing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jeon, Sung-eok</creatorcontrib><creatorcontrib>Abler, Randal T</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Library &amp; Information Sciences Abstracts (LISA)</collection><collection>Library &amp; Information Science Abstracts (LISA)</collection><jtitle>Computer communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jeon, Sung-eok</au><au>Abler, Randal T</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Formulation and optimization of the connection preemption problem</atitle><jtitle>Computer communications</jtitle><date>2004-02-01</date><risdate>2004</risdate><volume>27</volume><issue>3</issue><spage>253</spage><epage>261</epage><pages>253-261</pages><issn>0140-3664</issn><eissn>1873-703X</eissn><abstract>In the literature, the connection preemption policy is proposed for the resource allocation method in the prioritized multi-class networks. However, the connection preemption problem that is defined in the literature does not consider the rerouting of the preempted connections. When some connections are preempted at a connection preemption event, a part of the preempted connections will be rerouted with their own preemption priorities. Therefore, each rerouted connection setup can also trigger new connection preemption events. In this work, we propose to extend the existing connection preemption problem to include the subsequent connection preemption events (triggered by new or rerouted connections). We call the new extended problem the extended connection preemption problem. We formulate the existing connection preemption problem and the extended connection preemption problem with their decision variables and cost function. This is the first work that formulates the connection preemption problem in terms of its cost function. And we also analyze how to optimize the cost function of the extended connection preemption problem.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.comcom.2003.08.012</doi><tpages>9</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0140-3664
ispartof Computer communications, 2004-02, Vol.27 (3), p.253-261
issn 0140-3664
1873-703X
language eng
recordid cdi_proquest_miscellaneous_57590879
source Elsevier ScienceDirect Journals Complete
subjects Connection preemption
Cost function
Decision variable
Extended connection preemption
Label switched path
Multiprotocol label switching networks
Networks
Priority-based networks
Routing
title Formulation and optimization of the connection preemption problem
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T15%3A31%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Formulation%20and%20optimization%20of%20the%20connection%20preemption%20problem&rft.jtitle=Computer%20communications&rft.au=Jeon,%20Sung-eok&rft.date=2004-02-01&rft.volume=27&rft.issue=3&rft.spage=253&rft.epage=261&rft.pages=253-261&rft.issn=0140-3664&rft.eissn=1873-703X&rft_id=info:doi/10.1016/j.comcom.2003.08.012&rft_dat=%3Cproquest_cross%3E57590879%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28138154&rft_id=info:pmid/&rft_els_id=S0140366403002731&rfr_iscdi=true