loading...
Alternate Path Routing Algorithm for Traffic Engineering in the Internet
Las Vegas, Nevada April 28-April 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITCC.2003.1197557International Conference on Informati ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Shyam Subramanian, Venkatesan Muthukumar, "Alternate Path Routing Algorithm for Traffic Engineering in the Internet," Information Technology: Coding and Computing, International Conference on, pp. 367, International Conference on Information Technology: Computers and Communications, 2003.
 
 
BibTex
x
 
@article{ 10.1109/ITCC.2003.1197557,
author = {Shyam Subramanian and Venkatesan Muthukumar},
title = {Alternate Path Routing Algorithm for Traffic Engineering in the Internet},
journal ={Information Technology: Coding and Computing, International Conference on},
volume = {0},
year = {2003},
isbn = {0-7695-1916-4},
pages = {367},
doi = {http://doi.ieeecomputersociety.org/10.1109/ITCC.2003.1197557},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Information Technology: Coding and Computing, International Conference on
TI - Alternate Path Routing Algorithm for Traffic Engineering in the Internet
SN - 0-7695-1916-4
SP
EP
A1 - Shyam Subramanian,
A1 - Venkatesan Muthukumar,
PY - 2003
KW - null
VL - 0
JA - Information Technology: Coding and Computing, International Conference on
ER -
 
Shyam Subramanian, Department of Electrical and Computer Engineering
Venkatesan Muthukumar, Department of Electrical and Computer Engineering
In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the network that are responsible for congestion The traffic in the network is routed through the paths that have no or least number of critical links. This avoids congestion in the critical links and increases the performance of the network. The performance of the algorithm is compared with the shortest path (Dijkstra?s) algorithm.
Citation:
Shyam Subramanian, Venkatesan Muthukumar, "Alternate Path Routing Algorithm for Traffic Engineering in the Internet," itcc, pp.367, International Conference on Information Technology: Computers and Communications, 2003
Usage of this product signifies your acceptance of the Terms of Use.