A randomized algorithm for finding a path subject to multiple QoS constraints

An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies end-to-end QoS requirements of a connection request while efficiently using network resources. In general, finding a path subject to multiple additive constraint...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Global Telecommunications Conference (GLOBECOM), 1999 IEEE Ročník 3; s. 1694 - 1698 vol.3
Hlavní autoři: Korkmaz, T., Krunz, M.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1999
Témata:
Approximation algorithms
Bandwidth
Computational complexity
Computer networks
Costs
Delay
Heuristic algorithms
Polynomials
Quality of service
Routing
ISBN:0780357965, 9780780357969
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies end-to-end QoS requirements of a connection request while efficiently using network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem. For this problem, we propose a randomized heuristic algorithm with polynomial-time complexity. Our algorithm first prunes all the links that cannot be on any feasible paths. It then uses a randomized heuristic search to find a feasible path, if one exists. The worst-case computational complexity of our algorithm is O(n/sup 2/), where n is the number of nodes. The storage complexity of the algorithm is O(n). Using extensive simulations, we show that our algorithm gives very high success rate in finding feasible paths.
AbstractList An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies end-to-end QoS requirements of a connection request while efficiently using network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem. For this problem, we propose a randomized heuristic algorithm with polynomial-time complexity. Our algorithm first prunes all the links that cannot be on any feasible paths. It then uses a randomized heuristic search to find a feasible path, if one exists. The worst-case computational complexity of our algorithm is O(n/sup 2/), where n is the number of nodes. The storage complexity of the algorithm is O(n). Using extensive simulations, we show that our algorithm gives very high success rate in finding feasible paths.
Author Krunz, M.
Korkmaz, T.
Author_xml – sequence: 1
  givenname: T.
  surname: Korkmaz
  fullname: Korkmaz, T.
  organization: Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA
– sequence: 2
  givenname: M.
  surname: Krunz
  fullname: Krunz, M.
BookMark eNotj99KwzAcRgMq6OZeYFd5gdak-ddcjqJT6CiiXo80_XXLaJPSZBf69A627-bAuTjwLdC9Dx4QWlOSU0r0y7ZuqmaXU611XrKCi-IOLYgqCRNKS_GIVjGeyGWCKELoE9pt8Gx8F0b3Bx02wyHMLh1H3IcZ9853zh-wwZNJRxzP7Qlswing8TwkNw2AP8MXtsHHNBvnU3xGD70ZIqxuXKKft9fv6j2rm-1HtakzRwlPmRQgbFdqSUppZV9wVipuqerAEAoXbXpmLVeMSaBtSzvLjWVFq3QLoHTBlmh97ToA2E-zG838u78eZv9J9k6U
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/GLOCOM.1999.832452
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EndPage 1698 vol.3
ExternalDocumentID 832452
GroupedDBID 6IE
6IH
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-i104t-65e5cd896086c6f243874c17dea01e960af3cc47336e1bb1dc4ac32b79bee7923
IEDL.DBID RIE
ISBN 0780357965
9780780357969
ISICitedReferencesCount 13
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000089882700298&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Tue Aug 26 17:28:25 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i104t-65e5cd896086c6f243874c17dea01e960af3cc47336e1bb1dc4ac32b79bee7923
ParticipantIDs ieee_primary_832452
PublicationCentury 1900
PublicationDate 19990000
PublicationDateYYYYMMDD 1999-01-01
PublicationDate_xml – year: 1999
  text: 19990000
PublicationDecade 1990
PublicationTitle Global Telecommunications Conference (GLOBECOM), 1999 IEEE
PublicationTitleAbbrev GLOCOM
PublicationYear 1999
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000507001
Score 1.2940036
Snippet An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies end-to-end QoS...
SourceID ieee
SourceType Publisher
StartPage 1694
SubjectTerms Approximation algorithms
Bandwidth
Computational complexity
Computer networks
Costs
Delay
Heuristic algorithms
Polynomials
Quality of service
Routing
Title A randomized algorithm for finding a path subject to multiple QoS constraints
URI https://ieeexplore.ieee.org/document/832452
Volume 3
WOSCitedRecordID wos000089882700298&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYmDiVcRbHlhN83BjZ0QVhYE-ECB1q_w4l0o0QW3KwK_n7LRFSCxsiQcrck6-787-vo-Qa5fkykNbpo12jCsNTHHDmRVSZ1ZjyCgbzCZEvy9Ho3y40tkOXBgACJfP4MY_hrN8W5qlb5W1MPp4G_fbbSFETdXatFMixDW444bCXEapZ1i2V_o66_d8zZmJ8tb946Az6HmqHoZKmPWXu0pILt29f33WPmn-kPTocJN-DsgWFEekd0sx-dhyNv0CS9X7pMTi_21GEZrScDxdTKii3oaYLpba92BoVdL1rUL6VD5T4xGjN46oFk3y2r176TywlWMCm2JZVbGsDZ7sj1WJzEzmEp5KwU0sLKgoBhxWLjWGewlEiLWOreHKpIkWuQbwSoLHpFGUBZwQmuaA0A_xW5SmHLO-dE5pk2SWcye51Kfk0K_E-KMWxRjXi3D25-g52a3VDnzn4oI0qvkSLsmO-aymi_lV-JHf6Oeb2w
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELUQIMGJrYgdH7iGJrGTOEdUUYrohihSb5WXSalEE9SmHPh6xk5bhMSFW-KDFTkjz5ux33uE3GRhKi209ZRWmcelAk9yzT2TCBUbhSEjjTObSLpdMRym_aXOtuPCAIC7fAa39tGd5ZtCL2yrrI7RxyPcb7cizsOgImutGyo-Ihvcc11pLnxmOZbRUmFn9Z6uWDN-Wn9o9xq9jiXrYbC4eX_5q7j00tz714ftk9oPTY_21wnogGxAfkQ6dxTTjymmky8wVL6PCyz_36YUwSl1B9T5mEpqjYjpfKFsF4aWBV3dK6TPxQvVFjNa64hyXiOvzftBo-UtPRO8CRZWpRdHYOn-WJeIWMdZyJlIuA4SA9IPAIdlxrTmVgQRAqUCo7nULFRJqgCsluAx2cyLHE4IZSkg-EME5zPGMe-LLJNKh7HhPBNcqFNyaFdi9FHJYoyqRTj7c_Sa7LQGnfao_dh9Oie7lfaB7WNckM1ytoBLsq0_y8l8duV-6jc4g58i
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Global+Telecommunications+Conference+%28GLOBECOM%29%2C+1999+IEEE&rft.atitle=A+randomized+algorithm+for+finding+a+path+subject+to+multiple+QoS+constraints&rft.au=Korkmaz%2C+T.&rft.au=Krunz%2C+M.&rft.date=1999-01-01&rft.pub=IEEE&rft.isbn=9780780357969&rft.volume=3&rft.spage=1694&rft.epage=1698+vol.3&rft_id=info:doi/10.1109%2FGLOCOM.1999.832452&rft.externalDocID=832452
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780357969/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780357969/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780357969/sc.gif&client=summon&freeimage=true