Abstract
This paper studies the problem of finding optimal routes for premium class traffic in a DiffServ network such that (1) loop-freedom is guaranteed in the entire network under hop-by-hop routing assumption; and (2) the maximum relative congestion among all links is minimized. This problem is called the Extended Optimal Premium Routing (eOPR) problem, which is proven to be NP-hard. We use the integer programming method to mathematically formulate the eOPR problem and find the optimal solutions for small scale networks. We also study heuristic algorithms in order to handle large scale networks. Simulation results are compared with the optimal solutions obtained by solving the integer programming models. The results show that the Bandwidth-inversion Shortest Path (BSP) algorithm can be a good candidate to route premium traffic in DiffServ networks.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 188-192 |
| Number of pages | 5 |
| Journal | IEEE International Conference on Communications |
| Volume | 1 |
| State | Published - 2003 |
| Event | 2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States Duration: May 11 2003 → May 15 2003 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering