A multi-constrained quality of service routing based on metrics transform

被引：2

作者：

Yu, Wang ^{[1
]}

Lemin, Li ^{[1
]}

Du, Xu ^{[1
]}

机构：

[1] Univ Elect Sci & Technol China, Key Lab Broadband Opt Fiber Transmiss & Commun Na, Chengdu 610054, Peoples R China

来源：

2007 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING, AND CONTROL, VOLS 1 AND 2 | 2007年

关键词：

QoS routing; multi-constrained QoS routing; BFS;

D O I：

10.1109/ICNSC.2007.372833

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The problem of multi-constrained QoS (Quality of Service) routing is known to be NP-complete. It has absorbed many attentions. Varied heuristic algorithms have been presented to solve it Most of them were based on basic algorithms, for example BFS (Bread First Search), DFS (Depth First Search), Dijkstra, and Bellman-Ford. Among them, BFS has least computation complexity. Whereas BFS can deal with only one QoS constraint, this paper introduces an average idea of QoS metrics integrated with BFS fronting to multiple constraints. By the idea, additive metrics are converted to concave metrics (in average. As this idea transforms additive metrics to concave metrics and uses BFS, we name it as Additive-to-Concave-BFS, or ATC-BFS.

引用

页码：525 / 529

页数：5

共 12 条

[1]

CASETTI C, 2000, P INFOCOM, V2, P715

[2]

COSTA LHM, 2001, P IEEE ICC 2001 HELS

[3] Developing scalable protocols for three-metric QoS routing [J].

Costa, LHMK ;

Fdida, S ;

Duarte, OCMB .

COMPUTER NETWORKS, 2002, 39 (06) :713-727

[4]

Cui Y, 2003, IEEE IPCCC, P141

[5]

GOODRIDGE W, 2005, P 3 ANN COMM NETW SE

[6]

GOODRIDGE W, 2005, INAUGURAL ISSUE INT

[7]

KEPING L, 2001, HIGH TECHNOLOGY LETT

[8]

KORKMAZ T, 2001, COMPUTER NETWORKS, P252

[9]

KUIPERS FA, 2005, IEEE ACM T NETWORKIN, V13

[10] Quality-of-service routing for supporting multimedia applications [J].

Wang, Z ;

Crowcroft, J .

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1996, 14 (07) :1228-1234

← 1 2 →