Routing foreseeable lightpath demands using a tabu search meta-heuristic

Kuri, J.; Puech, Nicolas; Gagnaire, Maurice; Dotaro, Emmanuel

doi:10.1109/glocom.2002.1189140

Cited by 33 publications

(20 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This classication is also valid for dierent types of requests in media production networks and all classes are supported in our work. In optical networks, the static advance reservation problem is rst introduced by Kuri et al [16,17], who focus on requests with specied start time and duration and proposed heuristics and meta-heuristics to solve the static problem. The authors in [18,19] were the rst to propose dynamic advance reservation in xed time-slotted networks.…”

Section: Advance Resource Reservationmentioning

confidence: 99%

Design and evaluation of a dual dynamic adaptive reservation approach in media production networks

Barshan

Moens

Volckaert

et al. 2017

Journal of Network and Computer Applications

View full text Add to dashboard Cite

Media production networks require an ecient collaboration between geographically distributed actors and oer predictable workloads, making it possible to exploit this predictability and use advance bandwidth reservation services to achieve greater bandwidth utilization and service guarantees. To oer reliable reservations, the incorporation of fault-tolerance related features in bandwidth reservation strategies is a necessity, although this imposes a waste of capacity and extra performance overhead. As a rst provisional stage to oer a robust reservation system, deploying protection mechanisms ensures that the reservations remain valid when the system is in operation. To maximally utilize the network, and to ensure there is a quick response in a dynamic network environment, constant monitoring and optimization is needed. In this article, we propose an ecient dual optimization approach consisting of two consecutive processes. First, a schedule is produced by a resilient advance reservation algorithm. Then, the generated schedule is continually updated over time using a runtime adaptation approach in order to be capable of dynamically adapting the network to changing conditions and mitigating the side eects of provisioned reliability. This step uses the interconnecting network links' leftover capacity, resulting in an increased performance both in steady and unsteady network conditions. Our evaluations show that in failure-prone environments, the proposed approach leads to signicant increase in the success rate of admitted requests, up to 6.77 times, compared to the resilient advance reservation algorithms.

show abstract

Section: Advance Resource Reservationmentioning

confidence: 99%

Design and evaluation of a dual dynamic adaptive reservation approach in media production networks

Barshan

Moens

Volckaert

et al. 2017

Journal of Network and Computer Applications

View full text Add to dashboard Cite

show abstract

“…Several simple routing and wavelength assignment (RWA) algorithms were proposed to schedule S-SLDs. In [3], the authors presented a tabu-search meta heuristic for routing time-fixed S-SLDs with the objective of minimizing the number of wavelength-links. More recently, the authors in [4] studied the static lightpath scheduling problem.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Lightpath Scheduling in Next-Generation WDM Optical Networks

Shen

Todimala

Ramamurthy

et al. 2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-Lightpath scheduling is an important capability in next-generation wavelength-division multiplexing (WDM) optical networks to reserve resources in advance for a specified time period while provisioning end-to-end lightpaths. In this study, we propose an approach to support dynamic lightpath scheduling in such networks. To minimize blocking probability in a network that accommodates dynamic scheduled lightpath demands (DSLDs), resource allocation should be optimized in a dynamic manner. However, for the network users who desire deterministic services, resources must be reserved in advance and guaranteed for future use. These two objectives may be mutually incompatible. Therefore, we propose a two-phase dynamic lightpath scheduling approach to tackle this issue. The first phase is the deterministic lightpath scheduling phase. When a lightpath request arrives, the network control plane schedules a path with guaranteed resources so that the user can get a quick response with the deterministic lightpath schedule. The second phase is the lightpath re-optimization phase, in which the network control plane re-provisions some already scheduled lightpaths. Experimental results show that our proposed two-phase dynamic lightpath scheduling approach can greatly reduce WDM network blocking.

show abstract

“…An example feasible assignment is shown in Figure 1, when W = 2 and T = 8. The lightpath requests are (4,6,4), (3,3,2), (7,1,3), and (1,3,4). Note that the lightpath service for (4,6,4) wraps around.…”

mentioning

confidence: 99%

“…Note that the lightpath service for (4,6,4) wraps around. Also note that (3,3,2) has no flexibility and the other requests have time flexibilities of 2. An alternative to modeling traffic as a batch-of-requests is to model requests as arriving in some sequence over time.…”

mentioning

confidence: 99%

“…Time division multiplexed (TDM), WDM networks, as studied in [9], [10], and [11], focus on assigning time slots in a periodic frame and routing for constant-bit-rate, sub-wavelength connections. The concept of scheduled lightpaths is presented in [1] and [2] but without time flexibility. The problem of scheduling on a single WDM link with no flexibility is related to the circular interval graph coloring problem [14].…”

mentioning

confidence: 99%

See 1 more Smart Citation

Scheduling of periodic connections with flexibility

Su¹,

Sasaki²,

et al. 2006

Optical Switching and Networking

View full text Add to dashboard Cite

Applications that require periodic optical connectivity may be serviced by scheduled lightpaths. Many applications have flexibility about when exactly the scheduled lightpaths should occur. Lightpath service providers can exploit the flexibility to schedule the connections to better utilization of resources, and presumably lower prices for clients. To find the relationship between network resources and time flexibility, a simple WDM link and a leaky bucket traffic model are considered. The network resources, and in particular the required number of wavelengths W, is shown to be a function of the traffic parameters and the time flexibility. For random traffic, simulations are used to measure the sensitivity of W with time flexibility.

show abstract

Routing foreseeable lightpath demands using a tabu search meta-heuristic

Cited by 33 publications

References 3 publications

Design and evaluation of a dual dynamic adaptive reservation approach in media production networks

Design and evaluation of a dual dynamic adaptive reservation approach in media production networks

Dynamic Lightpath Scheduling in Next-Generation WDM Optical Networks

Scheduling of periodic connections with flexibility

Contact Info

Product

Resources

About