Policy Based QoS support using BGP routing

Nanda, P; Simmonds, AJ

Policy Based QoS support using BGP routing

Nanda, P

Simmonds, AJ

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings of the 2006 International Conference on Communications in Computing, CIC 2006, 2006, pp. 63 - 69
Issue Date:: 2006-12-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download full textAdobe PDF (516.78 kB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Nanda, P https://orcid.org/0000-0002-5748-155X	en_US
dc.contributor.author	Simmonds, AJ	en_US
dc.date.issued	2006-12-01	en_US
dc.identifier.citation	Proceedings of the 2006 International Conference on Communications in Computing, CIC 2006, 2006, pp. 63 - 69	en_US
dc.identifier.isbn	1601320124	en_US
dc.identifier.isbn	9781601320124	en_US
dc.identifier.uri	http://hdl.handle.net/10453/6816
dc.description.abstract	Routing protocols are important to exchange routing information between neighboring routers. Such information is used to update routing tables and to share in formation about status of the network so that traffics to appropriate destinations will be fast and efficient. Different types of routing protocols are in widespread use across the Internet. Apart from determining optimal routing paths and canying traffics through the networks, these routing protocols should have additional functionalities to support network policies, traffic engineering and security'. In this paper we discuss the use of one such routing protocol the Border Gateway Protocol (BGP) which is the industry standard. We also present an algorithm in which each Autonomous System (AS) decides how to forward its traffic satisfying end-to-end- QoS for its users and services. Our proposed algorithm is dynamic in that network status and route advertisements, which change with time and based on naffic loads in the network, are monitored and taken as input to the final decision on n affic fomwding between ASs. Copyright © 2006 CSREA Press.	en_US
dc.relation.ispartof	Proceedings of the 2006 International Conference on Communications in Computing, CIC 2006	en_US
dc.title	Policy Based QoS support using BGP routing	en_US
dc.type	Conference Proceeding
utslib.for	080503 Networking and Communications	en_US
dc.location.activity	Las Vegas, USA	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Systems, Management and Leadership
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
pubs.organisational-group	/University of Technology Sydney/Strength - INEXT - Innovation in IT Services and Applications
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US

Abstract:

Routing protocols are important to exchange routing information between neighboring routers. Such information is used to update routing tables and to share in formation about status of the network so that traffics to appropriate destinations will be fast and efficient. Different types of routing protocols are in widespread use across the Internet. Apart from determining optimal routing paths and canying traffics through the networks, these routing protocols should have additional functionalities to support network policies, traffic engineering and security'. In this paper we discuss the use of one such routing protocol the Border Gateway Protocol (BGP) which is the industry standard. We also present an algorithm in which each Autonomous System (AS) decides how to forward its traffic satisfying end-to-end- QoS for its users and services. Our proposed algorithm is dynamic in that network status and route advertisements, which change with time and based on naffic loads in the network, are monitored and taken as input to the final decision on n affic fomwding between ASs. Copyright © 2006 CSREA Press.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/6816