loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'01)
Traffic Engineering Label Switched Paths in IP Networks using a Pre-Planned Flow Optimization Model
Cincinnati, Ohio
August 15-August 18
ISBN: 0-7695-1315-8
ASCII Text
x 
 
A.B. Bagula, A.E. Krzesinski, "Traffic Engineering Label Switched Paths in IP Networks using a Pre-Planned Flow Optimization Model," Modeling, Analysis, and Simulation of Computer Systems, International Symposium on, pp. 0070, Ninth IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'01), 2001.
 
 
BibTex
x
 
@article{ 10.1109/MASCOT.2001.948855,
author = {A.B. Bagula and A.E. Krzesinski},
title = {Traffic Engineering Label Switched Paths in IP Networks using a Pre-Planned Flow Optimization Model},
journal ={Modeling, Analysis, and Simulation of Computer Systems, International Symposium on},
volume = {0},
year = {2001},
isbn = {0-7695-1315-8},
pages = {0070},
doi = {http://doi.ieeecomputersociety.org/10.1109/MASCOT.2001.948855},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on
TI - Traffic Engineering Label Switched Paths in IP Networks using a Pre-Planned Flow Optimization Model
SN - 0-7695-1315-8
SP
EP
A1 - A.B. Bagula,
A1 - A.E. Krzesinski,
PY - 2001
VL - 0
JA - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on
ER -
 
A.B. Bagula, University of Stellenbosch
A.E. Krzesinski, University of Stellenbosch
Abstract: We present a flow optimization model for IP networks where end-to-end paths are identified for each ingressegress pair in the MPLS-capable part of the network. The model computes link- and path flows by incrementally distributing the offered traffic among the paths. Fault-tolerance and congestion control are achieved by spreading the offered traffic over a set of active paths. A set of back-up paths is reserved for carrying the traffic of failed or congested paths. The routing performance of this model is evaluated through two algorithms: weighted traffic distribution (WTD) and flow deviation (FLD). WTD distributes the offered traffic among the available paths using weights allocated to these paths. FLD is a variant of the well-known flow deviation algorithm.
Citation:
A.B. Bagula, A.E. Krzesinski, "Traffic Engineering Label Switched Paths in IP Networks using a Pre-Planned Flow Optimization Model," mascots, pp.0070, Ninth IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.