Hierarchical Inter-domain Load Balanced QoS Routing


KIPS Transactions on Computer and Communication Systems, Vol. 9, No. 5, pp. 671-678, Oct. 2002
10.3745/KIPSTC.2002.9.5.671,   PDF Download:

Abstract

In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources' costs for precomputation schemes in hierarchical routing is proposed, and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection.The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And these schemes make possible both global network resources' utilization and also load balancing.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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]
J. J. Hong, S. H. Kim and K. H. Lee, "Hierarchical Inter-domain Load Balanced QoS Routing," KIPS Journal C (2001 ~ 2012) , vol. 9, no. 5, pp. 671-678, 2002. DOI: 10.3745/KIPSTC.2002.9.5.671.

[ACM Style]
Jong Joon Hong, Seung Hoon Kim, and Kyoon Ha Lee. 2002. Hierarchical Inter-domain Load Balanced QoS Routing. KIPS Journal C (2001 ~ 2012) , 9, 5, (2002), 671-678. DOI: 10.3745/KIPSTC.2002.9.5.671.