Provisioning of Deadline-driven Requests with Flexible Transmission Rates inWDMMesh Networks

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.

Existing System:

Capacity measures for a network connection across the Internet are useful to many applications. Its applicability encompasses QoS guarantees, congestion control and other related areas. In this paper we define and measure the available capacity of a connection, through observations at endpoints only. Our measurements account for the variability of cross traffic that passes through the routers handling this connection.

Related to the estimation of available capacity, we suggest modifications to current techniques to measure the packet service time of the “bottleneck” router of the connection. Finally, we present estimation results on wide-area network connections from our experiments to multiple sites

Proposed System:

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.


  • Network Module

  • Sub Path Bandwidth Measurement

  • Shared Bandwidth Capacity

  • Evaluating Bandwidth