Scalable Two Phases QoS Routing Scheme 


Vol. 28,  No. 12, pp. 1066-1080, Dec.  2003


PDF
  Abstract

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase I, every border node periodically pre-computes the QoW distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independent of the QoS request from an application. In Phase Ⅱ, distributed graph construction algorithm is performed to model the net work as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Kim, "Scalable Two Phases QoS Routing Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 12, pp. 1066-1080, 2003. DOI: .

[ACM Style]

Seung-Hoon Kim. 2003. Scalable Two Phases QoS Routing Scheme. The Journal of Korean Institute of Communications and Information Sciences, 28, 12, (2003), 1066-1080. DOI: .

[KICS Style]

Seung-Hoon Kim, "Scalable Two Phases QoS Routing Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 12, pp. 1066-1080, 12. 2003.