A distributed traffic control scheme based on edge-centric resource management

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A distributed traffic control scheme based on edge-centric resource management

Full text

Pdf (317 KB)

Source

ACM SIGCOMM Computer Communication Review archive
Volume 36 , Issue 2 (April 2006) table of contents

FEATURE: Reviewed articles table of contents

Pages: 5 - 16

Year of Publication: 2006

ISSN:0146-4833

Authors

Yingxin Jiang	University of Notre Dame, Notre Dame, IN
Aaron Striegel	University of Notre Dame, Notre Dame, IN

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 45, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1129582.1129585 What is a DOI?

ABSTRACT

The correct admission of flows in the Differentiated Services (DiffServ) environment is critical to provide stable and predictable quality of service (QoS) to the end user. Without a scalable and precise admission control scheme, the service provider is faced with either over-provisioning the network or accepting periods of best-effort like behavior. In this paper, we propose a novel approach for admission control that exploits the unique architectural aspects of DiffServ. Through the use of periodic heartbeats emanating from edge routers to probe the network state on the available egress paths, edge routers are able to quickly conduct admission control with a tunable degree of precision. In this paper, we detail our approach, Edge-centric Resource Management (ERM), and conduct detailed simulation studies regarding the effectiveness of the approach.

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	W. Almesberger, T. Ferrari, and J. L. Boulder. Scalable resource reservation for the Internet. In Proc. of IEEE IWQoS '98, Napa, CA, USA, 1998.
	2	Anindya Basu , Alvin Lin , Sharad Ramanathan, Routing using potentials: a dynamic traffic-aware routing algorithm, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, August 25-29, 2003, Karlsruhe, Germany [doi>10.1145/863955.863962]
	3	S. Bhattacharyya. An overview of source-specific multicast (SSM). RFC 3569, July 2003.
	4	G. Bianchi and N. Blefari-Melazzi. Admission Control over Assured Forwarding PHBs: A Way to Provide Service Accuracy in a DiffServ Framework. In Proc. of GLOBECOM, San Antonio, Texas, Nov. 2001.
	5	G. Bianchi , F. Borgonovo , A. Capone , L. Fratta , C. Petrioli, Endpoint admission control with delay variation measurements for QoS in IP networks, ACM SIGCOMM Computer Communication Review, v.32 n.2, p.61-69, April 2002 [doi>10.1145/568567.568571]
	6	G. Bianchi, A. Capone, and C. Petrioli. Throughput analysis of end-to-end measurement-based admission control in IP. In Proc. of IEEE INFOCOM 2000, Israel, Mar. 2000.
	7	N. Blefari-Melazzi and M. Femminella. A comparison of the utilization efficiency between a stateful and a stateless admission control in IP networks in a heterogeneous traffic case. Telecommunication Systems, Kluwer Academic Publishers, pages 231--258, March/April 2004.
	8	T. Bonald , J. W. Roberts, Congestion at flow level and the impact of user behaviour, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.42 n.4, p.521-536, 15 July 2003 [doi>10.1016/S1389-1286(03)00200-7]
	9	R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin. Resource ReSerVation Protocol (RSVP) Version 1, Functional Specification. IETF RFC 2205, Sept. 1997.
	10	Lee Breslau , Edward W. Knightly , Scott Shenker , Ion Stoica , Hui Zhang, Endpoint admission control: architectural issues and performance, Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, p.57-69, August 28-September 01, 2000, Stockholm, Sweden
	11	R. Caceres, N. Duffield, J. Horowitz, and D. Towsley. Multicast-based inference of network-internal loss characteristics. IEEE Transactions on Information Theory, 45(7):2462--2480, Nov. 1999.
	12	C. Dovrolis, P. Ramanathan, and D. Moore. What do packet dispersion techniques measure? In Proc.of IEEE INFOCOM, Apr. 2001.
	13	V. Elek, G. Karlsson, and R. Ronngren. Admission control based on end-to-end measurements. In IEEE INFOCOM 2000, Israel,2000.
	14	Kevin Lai , Mary Baker, Measuring link bandwidths using a deterministic model of packet delay, Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, p.283-294, August 28-September 01, 2000, Stockholm, Sweden
	15	J. Moy. OSPF Version 2. IETF RFC 1583, June 1994.
	16	K. Nichols, S. Blake, F. Baker, and D. Black. Definition of the Differentiated Services field (DS Field)in the IPv4 and IPv6 headers. IETF RFC 2474, Dec. 1998.
	17	R. Braden, D. Clark, and S. Shenkar. Integrated Services in the Internet architecture: An overview. IETF RFC 1633, June 1994.
	18	F. Reichmeyer, K. Chan, D. Durham, R. Yavatkar, S. Gai, K. McCloghrie, and S. Herzog. COPS usage for Differentiated Services. IETF Internet Draft, Nov. 1998. Work in Progress.
	19	Aaron Striegel , G. Manimaran, Edge-Based Fault Detection in a DiffServ Network, Proceedings of the 2002 International Conference on Dependable Systems and Networks, p.79-88, June 23-26, 2002
	20	Dapeng Zhu , Mark Gritter , David R. Cheriton, Feedback based routing, ACM SIGCOMM Computer Communication Review, v.33 n.1, p.71-76, January 2003 [doi>10.1145/774763.774774]