Investigation and analysis of multi-class routing algorithms for IP networks
No Thumbnail Available
URL
Journal Title
Journal ISSN
Volume Title
Helsinki University of Technology |
Diplomityö
Checking the digitized thesis and permission for publishing
Instructions for the author
Instructions for the author
Authors
Date
2003
Department
Major/Subject
Tietoverkkotekniikka
Mcode
S-38
Degree programme
Language
en
Pages
ix + 54
Series
Abstract
Multi-Class Routing (MCR) is to route different traffic classes using different routing metrics or routing algorithms, while Single-Class Routing (SCR) routes different traffic classes using the same routing metric or algorithm. The optimal MCR scheme in fixed IP networks and relative analyses are investigated in this thesis. We investigate and analyze the cost function based optimal capacity allocation in MCR when source routing is used. A novel cost function is proposed for low-level traffic optimization when the capacities of links for each traffic class are fixed. Further more, a heuristic way is introduced for allocating capacity dynamically. Simulations are made and we investigate the results from our heuristic method. Then, the BE class optimization problem (BECOP) is defined in MCR and a novel MCR scheme is introduced when hop-by-hop routing is considered. A simplified traffic model for SCR and MCR is introduced here and some analyses are made based on it. We furthermore explore the proper routing algorithms by simulations to find the best combination of routing algorithms used for different traffic classes. According to our analysis and simulations, MCR performs better than Single Class Routing (SCR) on most conditions.Description
Supervisor
Kantola, RaimoThesis advisor
Zhang, PengKeywords
QoSR, palvelun laatu, MCR, reititys, BECOP, luokkakohtainen reititys