ACM Home Page
Please provide us with feedback. Feedback
Quality of service based routing: a performance perspective
Full text PdfPdf (1.72 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication table of contents
Vancouver, British Columbia, Canada
Pages: 17 - 28  
Year of Publication: 1998
ISBN:1-58113-003-1
Also published in ...
Authors
George Apostolopoulos  Computer Science Department, University of Maryland, College Park, MD
Roch Guérin  IBM T. J. Watson, Research Center, Yorktown Heights, NY
Sanjay Kamat  IBM T. J. Watson, Research Center, Yorktown Heights, NY
Satish K. Tripathi  Bourns College of Engineering, University of California, Riverside, CA
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 75,   Citation Count: 57
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/285237.285251
What is a DOI?

ABSTRACT

Recent studies provide evidence that Quality of Service (QoS) routing can provide increased network utilization compared to routing that is not sensitive to QoS requirements of traffic. However, there are still strong concerns about the increased cost of QoS routing, both in terms of more complex and frequent computations and increased routing protocol overhead. The main goals of this paper are to study these two cost components, and propose solutions that achieve good routing performance with reduced processing cost. First, we identify the parameters that determine the protocol traffic overhead, namely (a) policy for triggering updates, (b) sensitivity of this policy, and (c) clamp down timers that limit the rate of updates. Using simulation, we study the relative significance of these factors and investigate the relationship between routing performance and the amount of update traffic. In addition, we explore a range of design options to reduce the processing cost of QoS routing algorithms, and study their effect on routing performance. Based on the conclusions of these studies, we develop extensions to the basic QoS routing, that can achieve good routing performance with limited update generation rates. The paper also addresses the impact on the results of a number of secondary factors such as topology, high level admission control, and characteristics of network traffic.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. S. Krupp, "Stabilization of Alternate Routing Networks," in IEEE International Communication Conference, Philadelphia, PA, 1982
 
2
R.J. Gibbens, F. P. Kelly, and P. B. Key, "Dynamic Alternate Routing- Modeling and Behaviour," in Teletrafic Science for New Cost-Effective Systems, Networks and Services, ITC-12, Elsevier Science Publishers, 1989
 
3
E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick, "A Framework for QoS-based Routing in the Internet," Internet Draft, QoS Routing Working Group, Internet Engineering Task Force, expires October 1998
 
4
"Interim Inter-Switch Signalling Protocol Version 1," ATM Forum, af-pnni-O055.000, March 1996
 
5
R. Braden, Ed., L. Zhang, S. Berson, S. Herzog, S. Jamin, "Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification," Request For Comments 2205, Internet Engineering Task Force, September 1997
 
6
H. Ahmadi, J. S.-C. Chen, and R. Gu~rin, "Dynamic Routing and Call Control in High-Speed Integrated Networks", Proc. Proc. Workshop Sys. Eng. Traf. Eng., ITC'13, 1991
 
7
 
8
 
9
Z. Wang, and J. Crowcroft, "Quality of Service Routing for Supporting Multimedia Applications," IEEE Journal Selected Areas in Communications, 14(7):1228- 1234, 1996
 
10
W. C. Lee, M. G. Hluchyj, and P. A. Humblet, "Routing Subject to Quality of Service Constraints in Integrated Communication Networks," IEEE Networks, pages 46- 55, July/August 1995
 
11
R. Widyonon, "The Design and Evaluation of Routing Algorithms for real-time Channels," Technical Report TR-94-024, University of California at Berkeley, June 1994
 
12
V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, "Two Distributed Algorithms for the Constrained Steiner Tree Problem," in proceedings of 2nd International Conference on Computer Communication and Networking, pages 343-349, 1993
 
13
R. Gu~rin, D. Williams, and A. Orda, "QoS Routing Mechanisms and QSPF extensions," in proceedings of GLOBECOM, 1997
 
14
A. Shaikh, J. Rex. ford, and K. Shin, "Dynamics of quality-of-service routing with inaccurate link-state information," University of Michigan Technical Report CSE-TR-350-97, November 1997
 
15
J. Moy, "OSPF Version 2,' Request For Comments 2178, Internet Engineering Task Force, July 1997
 
16
C. Alaettinoglu, A. U. Shankar K. Dussa-Zieger, and I. Matta. "Design and Implementation of MARS: A Routing Testbed," Journal of Internetworking Research and Experience, 5(1):17-41, 1994

CITED BY  57

Collaborative Colleagues:
George Apostolopoulos: colleagues
Roch Guérin: colleagues
Sanjay Kamat: colleagues
Satish K. Tripathi: colleagues