skip to main content
10.1145/2020723.2020725acmotherconferencesArticle/Chapter ViewAbstractPublication PagesinternetwareConference Proceedingsconference-collections
research-article

A binary graph reduction algorithm for multi-constrained QoS routing

Published: 03 November 2010 Publication History

Abstract

A lot of network services and applications are being designed to support quality-of-service (QoS) routing. One of the key problems is to find a feasible path that satisfies multiple QoS requirements, i.e., Multi-Constrained Path (MCP) problem which is known to be NP-complete. Many heuristic and approximation algorithms have been proposed to solve this problem. However, most of them converted it into the classic shortest path problem by transforming multiple QoS weights into single weight. In this paper, we propose a binary graph reduction (BGR) algorithm to convert network graph into a simplified graph by removing redundant edges before constructing a routing path. BGR improves system performance from two aspects: i) BGR decreases the decision-making time, which then decreases the delay of end users; ii) BGR removes some abnormal anti-heuristic redundant edges from network graph, so that the actual routing algorithm could get a better result. We use a multimedia delivery system to illustrate these advantages in this paper. Simulation results also approve the efficiency of the proposed BGR algorithm.

References

[1]
R. Andersen, F. Chung, A. Sen, and G. Xue. On disjoint path pairs with wavelength continuity constraint in wdm networks. In IEEE INFOCOM 2004, volume 1, page 535, 7--11 2004.
[2]
S. Chen and K. Nahrstedt. On finding multi-constrained paths. In IEEE ICC, pages 874--897, 1998.
[3]
D. E. Comer. Internetworking with TCP/IP Vol. 1: Principles, Protocols, and Architecture. Prentice Hall, 4th edition, January 2000.
[4]
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2nd revised edition edition, September 2001.
[5]
H. de Neve and P. van Mieghem. A multiple quality of service routing algorithm for pnni. In IEEE ATM Workshop Proceedings 1998, pages 324--328, May 1998.
[6]
F. Ergün, R. K. Sinha, and L. Zhang. An improved fptas for restricted shortest path. Inf. Process. Lett., 83(5):287--291, 2002.
[7]
A. Forum/95-0013R8. Atm forum traffic management specification version 4.0, 1995.
[8]
A. Goel, K. Ramakrishnan, D. Kataria, and D. Logothetis. Efficient computation of delay-sensitive routes from one source to all destinations. In IEEE INFOCOM 2001, volume 2, pages 854--858 vol. 2, 2001.
[9]
X. Gu and K. Nahrstedt. Distributed multimedia service composition with statistical qos assurances. IEEE Transactions on Multimedia, 8(1):141--151, feb. 2006.
[10]
X. Gu, K. Nahrstedt, and B. Yu. Spidernet: an integrated peer-to-peer service composition framework. In IEEE HPDC 2004, pages 110--119, 4--6 2004.
[11]
J. M. Jaffe. Algorithms for finding paths with multiple constraints. Networks, 14(1):95--116, 1984.
[12]
S. Kalasapur, M. Kumar, and B. Shirazi. Dynamic service composition in pervasive computing. IEEE TPDS, 18(7):907--918, july 2007.
[13]
T. Korkmaz and M. Krunz. Multi-constrained optimal path selection. In IEEE INFOCOM 2001, pages 834--843, 2001.
[14]
T. Korkmaz, M. Krunz, and S. Tragoudas. An efficient algorithm for finding a path subject to two additive constraints. In ACM SIGMETRICS, pages 318--327, 2000.
[15]
S. Misra, G. Xue, and D. Yang. Polynomial time approximations for multi-path routing with bandwidth and delay constraints. In IEEE INFOCOM 2009, pages 558--566, April 2009.
[16]
K. Nahrstedt and W.-T. Balke. A taxonomy for multimedia service composition. In ACM MULTIMEDIA 2004, pages 88--95, New York, NY, USA, 2004. ACM.
[17]
K. Nahrstedt and W.-T. Balke. Towards building large scale multimedia systems and applications: challenges and status. In ACM MSC 2005, pages 3--10, New York, NY, USA, 2005. ACM.
[18]
Z. Qian, M. Guo, S. Zhang, and S. Lu. Service-oriented multimedia delivery in pervasive space. In IEEE WCNC 2009, pages 1--6, 5--8 2009.
[19]
Z. Wang and J. Crowcroft. Quality-of-service routing for supporting multimedia applications. IEEE JSAC, 14(7):1228--1234, 1996.
[20]
X. Xiao and L. Ni. Internet qos: a big picture. IEEE Network, 13(2):8--18, Mar/Apr 1999.
[21]
G. Xue and W. Zhang. Multiconstrained qos routing: Greedy is good. In IEEE GLOBECOM 2007, pages 1866--1871, 2007.
[22]
Y. Zhao. Vehicle Location and Navigation and Navigation Systems. Boston, Mass: Artech House, 1997.

Index Terms

  1. A binary graph reduction algorithm for multi-constrained QoS routing

                        Recommendations

                        Comments

                        Information & Contributors

                        Information

                        Published In

                        cover image ACM Other conferences
                        Internetware '10: Proceedings of the Second Asia-Pacific Symposium on Internetware
                        November 2010
                        159 pages
                        ISBN:9781450306942
                        DOI:10.1145/2020723
                        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                        Sponsors

                        • Nanjing University of Aeronautics and Astronautics
                        • CCF: China Computer Federation

                        In-Cooperation

                        Publisher

                        Association for Computing Machinery

                        New York, NY, United States

                        Publication History

                        Published: 03 November 2010

                        Permissions

                        Request permissions for this article.

                        Check for updates

                        Author Tags

                        1. QoS routing
                        2. binary reduction
                        3. multi-constrained

                        Qualifiers

                        • Research-article

                        Funding Sources

                        Conference

                        Internetware 2010
                        Sponsor:
                        • CCF

                        Acceptance Rates

                        Overall Acceptance Rate 55 of 111 submissions, 50%

                        Contributors

                        Other Metrics

                        Bibliometrics & Citations

                        Bibliometrics

                        Article Metrics

                        • 0
                          Total Citations
                        • 93
                          Total Downloads
                        • Downloads (Last 12 months)0
                        • Downloads (Last 6 weeks)0
                        Reflects downloads up to 25 Dec 2024

                        Other Metrics

                        Citations

                        View Options

                        Login options

                        View options

                        PDF

                        View or Download as a PDF file.

                        PDF

                        eReader

                        View online with eReader.

                        eReader

                        Media

                        Figures

                        Other

                        Tables

                        Share

                        Share

                        Share this Publication link

                        Share on social media