Scheduling of periodic connections with flexibility

Authors:
Wei Su;Galen Sasaki;Ching-Fong Su;Ashok Balasubramanian
Affiliations:
Leadtek Research Inc., 46732 Lakeview Blvd., Fremont, CA 94538, United States;Department of Electrical Engineering, University of Hawaii at Manoa, 2540 Dole St., Honolulu, HI 96822, United States;Fujitsu Laboratories of America, 1240 E. Arques Ave. #345, Sunnyvale, CA 94085, United States;Department of Electrical Engineering, University of Hawaii at Manoa, 2540 Dole St., Honolulu, HI 96822, United States
Venue:
Optical Switching and Networking
Year:
2006

Citing 10
Cited 0

Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem

Artificial Intelligence
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Exact admission control for networks with a bounded delay service

IEEE/ACM Transactions on Networking (TON)
Congestion-dependent pricing of network services

IEEE/ACM Transactions on Networking (TON)
Bandwidth provisioning and pricing for networks with multiple classes of service

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
The economic impact of network pricing intervals

QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
A calculus for network delay. I. Network elements in isolation

IEEE Transactions on Information Theory
Scheduling multirate sessions in time division multiplexed wavelength-routing networks

IEEE Journal on Selected Areas in Communications
Routing and wavelength assignment of scheduled lightpath demands

IEEE Journal on Selected Areas in Communications
Routing and time-slot assignment in optical TDM networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Applications that require periodic optical connectivity may be serviced by scheduled lightpaths. Many applications are flexible about when exactly the scheduled lightpaths should occur. Lightpath service providers can exploit this flexibility to schedule connections for 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, are 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.