Dynamic Lightpath Scheduling in Next-Generation WDM Optical Networks

Shen, Lu; Todimala, A.; Ramamurthy, Byrav; Yang, Xi

doi:10.1109/infocom.2006.31

Cited by 6 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are three main aspects of the design process: choosing a start time (for requests with flexible starting time), selecting a route, and allocating wavelengths. These processes are well suited to centralized operation, where batch scheduling can be executed to improve optimality, or where the reserved resources can be re-optimized [38,39] for scheduled connections that are not yet in service. Scheduling is more challenging in a distributed set-up as it requires information of the resources that have already been reserved while accommodating a new AR connection request.…”

Section: Scheduled or Advance Reservationmentioning

confidence: 99%

Planning and Provisioning Strategies for Optical Core Networks

Muhammad

2015

View full text Add to dashboard Cite

Optical communication networks are considered the main catalyst for the transformation of communication technology, and serve as the backbone of today's Internet. The inclusion of exciting technologies, such as, optical amplifiers, wavelength division multiplexing (WDM), and reconfigurable optical add/drop multiplexers (ROADM) in optical networks have made the cost of information transmission around the world negligible. However, to maintain the cost effectiveness for the growing bandwidth demand, facilitate faster provisioning, and provide richer sets of service functionality, optical networks must continue to evolve. With the proliferation of cloud computing the demand for a promptly responsive network has increased. Moreover, there are several applications, such as, real time multimedia services that can become realizable, depending on the achievable connection set-up time.Given the high bandwidth requirements and strict service level specifications (SLSs) of such applications, dynamic on-demand WDM networks are advocated as a first step in this evolution. SLSs are metrics of a service level agreement (SLA), which is a contract between a customer and network operator. Apart from the other candidate parameters, the set-up delay tolerance, and connection holding-time have been defined as metrics of SLA. Exploiting these SLA parameters for on-line provisioning strategies exhibits a good potential in improving the overall network blocking performance. However, in a scenario where connection requests are grouped in different service classes, the provisioning success rate might be unbalanced towards those connection requests with less stringent requirements, i.e., not all the connection requests are treated in a fair way.The first part of this thesis focuses on different scheduling strategies for promoting the requests belonging to smaller set-up delay tolerance service classes. The first part also addresses the problem of how to guarantee the signal quality and the fair provisioning of different service classes, where iii each class corresponds to a specified target of quality of transmission. Furthermore, for delay impatient applications the thesis proposes a provisioning approach, which employs the possibility to tolerate a slight degradation in quality of transmission during a small fraction of the holding-time.The next essential phase for scaling system capacity and satisfying the diverse customer demands is the introduction of flexibility in the underlying technology. In this context, the new optical transport networks, namely elastic optical networks (EON) are considered as a worthwhile solution to efficiently utilize the available spectrum resources. Similarly, space division multiplexing (SDM) is envisaged as a promising technology for the capacity expansion of future networks. Among the alternative for flexible nodes, the architecture on demand (AoD) node has the capability to dynamically adapt its composition according to the switching and processing needs of the network traffic.The second part o...

show abstract

Section: Scheduled or Advance Reservationmentioning

confidence: 99%

Planning and Provisioning Strategies for Optical Core Networks

Muhammad

2015

View full text Add to dashboard Cite

show abstract

“…The algorithms retain maximum resources unused to accommodate future traffic. The studies in [30][31][32] investigate ligthpath migration schemes for flexible connection set-up time and known t h connections. The proposed schemes calculate new RWA for the scheduled (but not yet active) connection requests in order to provision the newly arrived request and to keep the network in an optimal state.…”

Section: Related Workmentioning

confidence: 99%

Service Differentiated Provisioning in Dynamic WDM Networks Based on Set-Up Delay Tolerance

Muhammad

Çavdar

Wosinska

et al. 2013

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Optical networks are expected to provide a unified platform for a diverse set of emerging applications (three-dimensional TV, digital cinema, e-health, grid computing, etc). The service differentiation will be an essential feature of these networks. Considering the fact that users have different levels of patience for different network applications, referred to as set-up delay tolerance, it will be one of the key parameters for service differentiation. Service differentiation based on set-up delay tolerance will not only enable network users to select an appropriate service class (SC) in compliance with their requirements, but will also provide an opportunity to optimize the network resource provisioning by exploiting this information, resulting in an improvement in the overall performance. Improvement in network performance can be further enhanced by exploiting the connection holding-time awareness. However, when multiple classes of service with different set-up delay tolerances are competing for network resources, the connection requests belonging to SCs with higher set-up delay tolerance have better chances to grab the resources and leave less room for the others, resulting in degradation in the blocking performance of less patient customers. This study proposes different scheduling strategies for promoting the requests belonging to smaller set-up delay tolerance SCs, such as giving priority, reserving some fraction of available resources, and augmenting the research space by providing some extra paths. Extensive simulation results show that 1) priority in the rescheduling queue is not always sufficient for eradicating the degradation effect of high delay tolerant SCs on the provisioning rate of the most stringent SC, and 2) by utilizing the proposed strategies, resource efficiency and overall network blocking performance improve significantly in all SCs.

show abstract

“…The scenario of unicast connection was investigated as a scheduled lightpath demand problem in [30]. Then, [31] extended the work in [30], considering the case in which connection requests arrive dynamically (arrive before start times), leading to the associated dynamic scheduling lightpath demand problem. This problem is how to schedule the routings and resource allocations for connections.…”

Section: A Related Workmentioning

confidence: 99%

Design of Light-Tree Based Optical Inter-Datacenter Networks

Lin¹,

Zukerman

Shen

et al. 2013

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Nowadays, people's daily lives are increasingly dependent on Internet applications provided by cloud service providers that replicate their content among geographically distributed datacenters using interdatacenter wide area networks to meet performance and reliability requirements. This paper provides means for efficient design of inter-datacenter networks with static traffic scenarios, where unicast and multicast connection requests are known a priori along with their start and end times. Also, the optical channel setup/teardown time is given. Integer linear programming (ILP) formulations that consider light-tree and lightpath connections are developed to minimize the network resource consumption. Since solving ILP formulations is time consuming for large networks, we also propose efficient heuristic algorithms. We demonstrate by simulations an advantage in efficiency for a light-tree based heuristic algorithm over its lightpath counterpart. This is due to its ability to construct and extend light-trees to groom more connections. Both heuristic algorithms perform very close to the corresponding ILP optimal results in the case of a small network.

show abstract

Dynamic Lightpath Scheduling in Next-Generation WDM Optical Networks

Cited by 6 publications

References 5 publications

Planning and Provisioning Strategies for Optical Core Networks

Planning and Provisioning Strategies for Optical Core Networks

Service Differentiated Provisioning in Dynamic WDM Networks Based on Set-Up Delay Tolerance

Design of Light-Tree Based Optical Inter-Datacenter Networks

Contact Info

Product

Resources

About