Provisioning of Deadline-Driven Requests With Flexible Transmission Rates in WDM Mesh Networks
- 30 October 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 18 (2) , 353-366
Abstract
With the increasing diversity of applications supported over optical networks, new service guarantees must be offered to network customers. Among the emerging data-intensive applications are those which require their data to be transferred before a predefined deadline. We call these deadline-driven requests (DDRs). In such applications, data-transfer finish time (which must be accomplished before the deadline) is the key service guarantee that the customer wants. In fact, the amount of bandwidth allocated to transfer a request is not a concern for the customer as long as its service deadline is met. Hence, the service provider can choose the bandwidth (transmission rate) to provision the request. In this case, even though DDRs impose a deadline constraint, they provide scheduling flexibility for the service provider since it can choose the transmission rate while achieving two objectives: 1) satisfying the guaranteed deadline; and 2) optimizing the network's resource utilization. We investigate the problem of provisioning DDRs with flexible transmission rates in wavelength-division multiplexing (WDM) mesh networks, although this approach is generalizable to other networks also. We investigate several (fixed and adaptive to network state) bandwidth-allocation policies and study the benefit of allowing dynamic bandwidth adjustment, which is found to generally improve network performance. We show that the performance of the bandwidth-allocation algorithms depends on the DDR traffic distribution and on the node architecture and its parameters. In addition, we develop a mathematical formulation for our problem as a mixed integer linear program (MILP), which allows choosing flexible transmission rates and provides a lower bound for our provisioning algorithms.Keywords
This publication has 22 references indexed in Scilit:
- Holding-Time-Aware Dynamic Traffic GroomingIEEE Journal on Selected Areas in Communications, 2008
- Reliable Multipath Provisioning for High-Capacity Backbone Mesh NetworksIEEE/ACM Transactions on Networking, 2007
- OPN09-02: Lightpath Scheduling and Allocation Under a Flexible Scheduled Traffic Model2006
- Provisioning fault-tolerant scheduled lightpath demands in WDM mesh networks2004
- PESO: Low overhead protection for ethernet over SONET transport2004
- Dynamic traffic grooming in WDM mesh networks using a novel graph model2003
- Routing and wavelength assignment of scheduled lightpath demandsIEEE Journal on Selected Areas in Communications, 2003
- A comprehensive study on next-generation optical grooming switchesIEEE Journal on Selected Areas in Communications, 2003
- A novel generic graph model for traffic grooming in heterogeneous WDM mesh networksIEEE/ACM Transactions on Networking, 2003
- Traffic grooming in an optical WDM mesh networkIEEE Journal on Selected Areas in Communications, 2002