Article

Core selection with end-to-end QoS support

Authors:

Wanida Putthividhya,

Wallapak Tavanapong,

Johnny WongAuthors Info & Claims

SAC '04: Proceedings of the 2004 ACM symposium on Applied computing

Pages 328 - 333

https://doi.org/10.1145/967900.967972

Published: 14 March 2004 Publication History

Abstract

Core-based routing with Quality of Service (QoS) support is essential to facilitate multi-sender multimedia multicast applications such as video conferencing and virtual collaboration applications. In this paper, we introduce (i) a new application-level service class framework that allows group members to easily indicate their desired service quality and (ii) the use of as many cores per group as necessary in corebased routing to maximize the number of group members with satisfied QoS requirements. Under the service class framework, we formulate the novel core selection problem that selects as many cores as necessary while maximizing the number of satisfied group members. We propose a new core selection algorithm to address the problem and provide a complete core selection protocol using the algorithm. Experimental results show that our core selection algorithm performs as well as the optimal algorithm and significantly outperforms a recent core selection algorithm with QoS support using a single core.

References

[1]

T. Ballardie, P. Francis, and J. Crowcroft. Core based tree (CBT): An architecture for scalable inter-domain multicast routing. In SIGCOMM, pages 85--95, Ithaca, New York, USA, September 1993.

Digital Library

[2]

M. Berkelaar. Lp_solve:linear programming code. 1996.

[3]

S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for Differentiated Service. In RFC 2475, IETF, http://www.faqs.org/rfcs/rfc2475.html, December 1998.

Digital Library

[4]

L. Blazevic and J. L. Boudec. Distributed core multicast (DCM): a multicast routing protocol for many groups with few receivers. ACM SIGCOMM Computer Communication Review, 29(5):6--21, October 1999.

Digital Library

[5]

K. Calvert, M. Doar, and E. Zegura. Modeling Internet topology. IEEE Communications Magazine, 35(6):160--163, June 1997.

Digital Library

[6]

K. Calvert and E. Zegura. Georgia Tech Internetwork topology models. 1996.

[7]

K. Calvert, E. Zegura, and M. Donahoo. Core selection methods for multicast routing. In Proc. of International Conference on Computer Communications and Networks (ICCCN), pages 638--642, Las Vegas, Nevada, USA, September 1995.

Digital Library

[8]

K. Carlberg and J. Crowcroft. Building shared trees using a one-to-many joining mechanism. Computer Communication Review, pages 5--11, January 1997.

Digital Library

[9]

S. Chen, K. Nahrstedt, and Y. Shavitt. A QoS-aware multicast routing protocol. IEEE journal on Selected Areas in Communications, 18(12):2490--2498, December 2000.

Digital Library

[10]

S. Chung and C. Youn. Core selection algorithm for multicast routing under multiple QoS constraints. Electronic Letters 17th February 2000, 36(4):378--379, February 2000.

[11]

T. Cormen, C. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw Hill, 2000.

Digital Library

[12]

S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C. Liu, and L. Wei. An architecture for wide-area multicast routing. In Proc. of ACM SIGCOMM, pages 125--135, London, UK, August 1994.

Digital Library

[13]

S. Deering, B. Fenner, D. Estrin, A. Helmy, D. Farinacci, L. Wei, M. Handley, V. Jacobson, and D. Thaler. Hierarchical PIM-SM architecture for inter-domain multicast routing. In Internet Draft, http://netweb.usc.edu/ahelmy/interdomainmulticast/interdom-1-19.ps, December 1995.

[14]

M. Donahoo and E. Zegura. Core migration for dynamic multicast routing. In International Conference on Computer Communications and Networks (ICCCN), Washington, DC., USA, October 1996.

[15]

M. Faloutsos, A. Banerjea, and R. Pankaj. QoSMIC: Quality of service sensitive multicast internet protocol. In Proc. of ACM SIGCOMM, pages 144--153, Van Couver, Canada, September 1998.

Digital Library

[16]

E. Fleury and Y. Huang. On the performance and feasibility of multicast core selection heuristics. In Proc. of 7th International Conference on Computer Communications and Networks (ICCCN), pages 296--303, Lafayette, LA, USA, October 1998.

Digital Library

[17]

Y. Huang, E. Fleury, and P. McKinley. LCM: A multicast core management protocol for link-state routing networks. IEEE International Conference on Communications, 2:1197--1201, June 1998.

[18]

G. Manimaran, H. S. Rahul, and C. S. R. Murthy. A new distributed route selection approach for channel establishment in real-time networks. IEEE/ACM Transactions on Networking, 7(5):698--709, October 1997.

Digital Library

[19]

I. Mas, V. Fodor, and G. Karlsson. Probe-based admission control for multicast. In Proc. of IWQoS, pages 97--109, Miami Beach, FL, USA, May 2002.

Digital Library

[20]

W. Putthividhya, W. Tavanapong, M. Tran, and J. Wong. A novel core selection with end-to-end QoS support for multi-sender multimedia multicast applications. Technical Report: Department of Computer Science, Iowa State University, (TR-03--07), 2003.

[21]

R. Sriram, G. Manimaran, and C. S. R. Murthy. Preferred link based delay-constrained least-cost routing in wide area networks. Computer Communications, 21:1655--1669, May 1998.

Digital Library

[22]

D. Thaler and C. Ravishankar. Distributed center-location algorithms. IEEE journal on Selected Areas in Communications, 15(3):273--276, April 1997.

Digital Library

[23]

VRAC. Virtual reality applications center. In Iowa State University, http://www.vrac.iastate.edu.

[24]

D. Zappala, A. Fabbri, and V. Lo. An evaluation of shared multicast trees with multiple cores. Journal of Telecommunication Systems Kluwer Academic Publishers, 19(3--4), March 2002.

[25]

E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In Proc. of IEEE Infocomm'96, pages 594--602, San Francisco, CA, USA, 1996.

Digital Library

Cited By

Ray SLinderman MZhang D(2010)Supporting time-critical clients in scalable pub-sub systemsInternational Journal of High Performance Computing and Networking10.1504/IJHPCN.2010.0377966:3/4(220-225)Online publication date: 1-Dec-2010
https://dl.acm.org/doi/10.1504/IJHPCN.2010.037796
Ray SLindermann MZhang D(2006)Supporting Time-Critical Clients in Scalable Pub-Sub SystemsProceedings of the 2006 International Workshop on Networking, Architecture, and Storages10.1109/IWNAS.2006.43(125-132)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.1109/IWNAS.2006.43

Core selection with end-to-end QoS support
1. Networks
  1. Network protocols
    1. Network layer protocols

Recommendations

Providing deterministic end-to-end fairness guarantees in core-stateless networks
IWQoS'03: Proceedings of the 11th international conference on Quality of service

End-to-end fairness guarantee is an important service semantics that network providers would like to offer to their customers. A network provider can offer such service semantics by deploying a network where each router employs a fair packet scheduling ...
Future internet video multicasting with essentially perfect resource utilization and QoS guarantees
IWQoS '11: Proceedings of the Nineteenth International Workshop on Quality of Service

The multicasting of aggregated digital video over a proposed Future Internet backbone network with essentially perfect throughput, resource-utilization and QoS guarantees is summarized. The Future Internet routers require only minor modifications to the ...
QoS protocols for end-to-end delay guarantee of instantaneous jobs on computer networks

QoS (Quality of Service) guarantee is highly desirable for many service-oriented computer and network applications on the Internet. This paper focuses on the timeliness aspect of QoS, especially the end-to-end delay guarantee. Resource reSerVation ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '04: Proceedings of the 2004 ACM symposium on Applied computing

March 2004

1733 pages

ISBN:1581138121

DOI:10.1145/967900

Conference Chair:
Hisham M. Haddad
Kennesaw State University
,
Program Chairs:
Andrea Omicini
Università degli Studi di Bologna a Cesena
,
Roger L. Wainwright
University of Tulsa
,
Publications Chair:
Lorie M. Liebrock
New Mexico Institute of Mining and Technology

Copyright © 2004 ACM.

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

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 March 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC04

Sponsor:

SIGAPP

SAC04: The 2004 ACM Symposium on Applied Computing

March 14 - 17, 2004

Nicosia, Cyprus

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
386
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ray SLinderman MZhang D(2010)Supporting time-critical clients in scalable pub-sub systemsInternational Journal of High Performance Computing and Networking10.1504/IJHPCN.2010.0377966:3/4(220-225)Online publication date: 1-Dec-2010
https://dl.acm.org/doi/10.1504/IJHPCN.2010.037796
Ray SLindermann MZhang D(2006)Supporting Time-Critical Clients in Scalable Pub-Sub SystemsProceedings of the 2006 International Workshop on Networking, Architecture, and Storages10.1109/IWNAS.2006.43(125-132)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.1109/IWNAS.2006.43

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents