A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Provisioning Fault-Tolerant Scheduled Lightpath Demands in WDM Mesh Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Optical WDM Networks (Optical Networks)
Optical WDM Networks (Optical Networks)
Reliable multipath provisioning for high-capacity backbone mesh networks
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Parallel and Distributed Systems
End-to-end quality of service for high-end applications
Computer Communications
The optical network control plane: state of the standards and deployment
IEEE Communications Magazine
Traffic grooming in an optical WDM mesh network
IEEE Journal on Selected Areas in Communications
A comprehensive study on next-generation optical grooming switches
IEEE Journal on Selected Areas in Communications
Routing and wavelength assignment of scheduled lightpath demands
IEEE Journal on Selected Areas in Communications
Holding-Time-Aware Dynamic Traffic Grooming
IEEE Journal on Selected Areas in Communications - Part 2
Improved EDF-based management of the setup of connections in opaque and transparent optical networks
Photonic Network Communications
| Hi-index | 0.00 |
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.