Restricted shortest path routing with concave costs

被引：1

作者：

Khadivi, Pejman ^{[1
]}

Samavi, Shadrokh ^{[1
]}

Saidi, Hossein ^{[1
]}

机构：

[1] Isfahan Univ Technol, Dept Elect & Comp Engn, Esfahan, Iran

来源：

2006 IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1-3 | 2006年

关键词：

D O I：

10.1109/AICCSA.2006.205090

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Multi-constraint qualiiy-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the important problems studied in the field of QoS routing. Various solutions have been proposed for RSP and other problems related to the QoS routing, in practical situations. Restricted shortest path problem with concave route costs are studied in this paper. This is a special version of the traditional RSP problem and is widely applicable in wireless and mobile ad hoc networks. In this paper, we propose new algorithms for this kind of routing. The effectiveness of our proposed solutions is shown through analytical reasoning and simulations.

引用

页码：200 / +

页数：2

共 50 条

[1] An improved FPTAS for Restricted Shortest Path
Ergun, F
Sinha, R
Zhang, L
[J]. INFORMATION PROCESSING LETTERS, 2002, 83 (05) : 287 - 291
[2] On the complexity of equal shortest path routing
Giroire, Frederic
Perennes, Stephane
Tahiri, Issam
[J]. NETWORKS, 2015, 65 (04) : 344 - 352
[3] Large margin shortest path routing
Yadamsuren Lutbat
Rentsen Enkhbat
Won-Joo Hwang
[J]. Optimization Letters, 2012, 6 : 1281 - 1290
[4] A Routing Algorithm with Candidate Shortest Path
潘启敬
[J]. Journal of Computer Science & Technology, 1986, (03) : 33 - 52
[5] Complexity of Inverse Shortest Path Routing
Call, Mikael
Holmberg, Kaj
[J]. NETWORK OPTIMIZATION, 2011, 6701 : 339 - 353
[6] Large margin shortest path routing
Lutbat, Yadamsuren
Enkhbat, Rentsen
Hwang, Won-Joo
[J]. OPTIMIZATION LETTERS, 2012, 6 (07) : 1281 - 1290
[7] A Spatial Restricted Heuristic Algorithm of Shortest Path
Liu Ying-chun
Yang Dong-he
[J]. 2009 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, VOL II, PROCEEDINGS, 2009, : 36 - +
[8] Multiperiod Planning with Controlled Shortest Path Routing
Kronberger, Clara
Schupke, Dominic A.
Eberspaecher, Joerg
[J]. 2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
[9] Effective shortest path routing for Gigabit Ethernet
Reinemo, Sven-Arne
Skeie, Tor
[J]. 2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 6419 - 6424
[10] Approximability of Unsplittable Shortest Path Routing Problems
Bley, Andreas
[J]. NETWORKS, 2009, 54 (01) : 23 - 46

← 1 2 3 4 5 →