Abstract
The Bandwidth Distribution Scheme (BDS) [Hna03] was designed to combine the advantages of the Integrated and Differentiated Services models and to provide support for scalable per-flow Quality of Service. In recent studies Hnatyshin et al. showed that the variation of the Bandwidth Distribution Scheme called the Exact Requested Bandwidth Range BDS (X-BDS), can support per-flow minimum bandwidth guarantees in a scalable manner [HS03, Hna03]. The X-BDS achieves per-flow QoS by maintaining aggregate flow requirements in the network core and distributing these requirements as needed. Based on the obtained information the edge nodes determine the fair allocation of available bandwidth among the active flows. This paper introduces an optimization which allows the X-BDS approach to operate seamlessly in the event of network topology changes. The primary challenge of addressing this problem is determining how to correctly update the aggregate flow requirements maintained in the network core. This paper examines two instances of topology changes, link failure and link restoration, and presents an algorithm which enables the routers in the X-BDS network to properly update the aggregate flow requirements in each of these cases. This paper examines the performance of the introduced algorithm through simulation [Opn].
| Original language | English (US) |
|---|---|
| Pages | 215-222 |
| Number of pages | 8 |
| State | Published - 2004 |
| Event | 23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 - Phoenix, AZ., United States Duration: Apr 15 2004 → Apr 17 2004 |
Other
| Other | 23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 |
|---|---|
| Country/Territory | United States |
| City | Phoenix, AZ. |
| Period | 4/15/04 → 4/17/04 |
All Science Journal Classification (ASJC) codes
- Media Technology