Elsevier

Computer Networks

Volume 54, Issue 11, 2 August 2010, Pages 1792-1804
Computer Networks

Deadline-based connection setup in wavelength-routed WDM networks

https://doi.org/10.1016/j.comnet.2010.02.008Get rights and content

Abstract

This article addresses the ubiquitous topic of quality of service (QoS) aware connection provisioning in wavelength-routed WDM optical networks. The impact of the connection setup time of an optical connection has not been adequately addressed in the open literature. As such, this paper presents a novel approach that uses the optical connection setup time as a service differentiator during connection provisioning. The proposed approach utilizes the Earliest Deadline First (EDF) queueing algorithm to achieve deadline-based connection setup management with the deadline being the setup time requirement of an optical connection. The proposed EDF-based approach would allow the network operator to improve the QoS perceived by the end clients. Performance of this novel scheme is analyzed by accurately calculating various parameters, such as the fraction of connections provisioned on-time (i.e. prior to deadline expiration) and the average time it takes to successfully setup a connection. In addition, the presented approach is validated by a simulation that analyzes the performance of the proposed connection setup scheme in the specific context of the National Science Foundation Network (NSFNET). The obtained results show that a deadline-based setup strategy can minimize blocking probability while achieving QoS differentiation.

Introduction

Wavelength Division Multiplexing (WDM) is becoming the de facto technology for driving up the transmission capacity of optical networks and thus enabling optical operators to keep up with the continuous growth of data traffic. WDM multiplexes many non-overlapping WDM channels onto the same optical fiber, where each of these channels can be operated at the peak rate of several gigabits per second. Optical fiber communication is therefore being firmly established as the preferred means of communications for the ever-emerging bandwidth consuming applications and services. However, the perpetual advent of new applications, each having different QoS requirements, aggravated by the need to carry these applications over optical networks, is proving to be the next big challenge for future WDM optical networks. This is especially true since existing optical networks still need to evolve from single service networks to multi-service ones [1], in which different types of services with different QoS requirements can be supported. Hence, the main trend is leaning towards migrating from a plain optical network with static point-to-point connections to a new era of dynamic, wavelength-routed, all-optical WDM optical networks [2].

In a wavelength-routed WDM network, an Optical Cross-Connect (OXC) switches the optical signal on a WDM channel from an input fiber to an output fiber; thus a connection (lightpath) may be established from a source to a destination. In this regard, numerous research efforts [3], [4], [5] have contemplated equipping these networks with a multi-service capability making them provide predictable quality of transport services. Quality of transport is measured by the set of parameters that affect the data flow after the lightpath is established.

However, most of the previous efforts did not consider in their formulations the crucial parameter of connection setup time. Inspired by these observations, this work focuses on the connection setup time parameter that is likely to become a common feature of a customer’s service profile. The authors in [6], [7] presented the connection setup time as a potential service differentiator in Service Level Agreements (SLAs) between optical operators and their customers.

The connection setup time is widely defined as the amount of time separating the instant a lightpath (i.e. a service) setup request is received by the operator and the moment the requested lightpath is established. This paper investigates the impact of the connection setup time on the setup of a connection as a service differentiator. The work is motivated by the need to consider the optical connection setup time as a timely increasing priority indicator (a type of competition-oriented parameter which may be linked to pricing) during the setup process.

Therefore, connection setup time can be viewed as a deadline. A connection setup request arriving at an optical source node A at instant t with a setup time requirement equal to S will be assigned a deadline of t+S. If such a setup request cannot be met due to a lack of optical resources, the blocked connection request at A is stored in an Earliest Deadline First queue. In other words, instead of dropping connection requests that cannot be satisfied by the optical network, they will be queued at the entry point of the network in an order consistent with their respective priorities (deadlines).

The proposed approach utilizes an adaptation of the well-known Earliest Deadline First scheduling algorithm aimed at optical connection setup management. More specifically, blocked connection setup requests are inserted into a queue and are then served according to an EDF scheduling discipline, whereby the connection request with the earliest setup time deadline, is served first. The main advantage of this technique is to enforce quality of service differentiation among customers having different connection setup time requirements.

The rest of this paper is structured as follows: in Section 2, the deadline-based connection setup approach is described and its relation to the literature is discussed. Section 3 introduces a mathematical model to compute the success probability of a deadline-driven connection setup request. Numerical results to evaluate the benefits of the proposed approach are presented in Section 4. Section 5 highlights further the merits of the deadline-based setup scheme through a simulation in the context of the National Science Foundation Network (NSFNET). Finally, Section 6 concludes the paper and presents future perspectives for research.

Section snippets

Description of the deadline-based connection setup approach

Different applications and services have different connection setup time requirements. As new applications continue to emerge, this gap in the deadline requirements is expected to become more pronounced. For instance, online trading and stock market applications are expected to have stringent connection setup requirements compared to IP best effort and database backup applications. Taking this diversity into consideration would offer the network operators the opportunity to maximize throughput

The Markovian model

In what follows, the word customer denotes a connection setup request, the term server refers to a lightpath, and the term laxity represents connection setup time.

Definition

Proposition 1 is now applied to the proposed EDF-based connection setup mechanism. In what follows, there is a distinction between metrics related to the probability of absorption (POA) and metrics related to the mean time to service (MTTS). It is important to note that each one of these metrics is a function of the initial position N and the initial laxity L of the target customer C.

Consider the following POA-related metrics:

  • Conformed setup completion probability, denoted by Pcs(N,L). This is

Simulation study and numerical results

To gain further insight into the proposed EDF-based setup approach, an in-house Java-based discrete event simulator was implemented to analyze the technique’s performance in the context of the NSFNET topology shown in Fig. 10. The topology contains 24 nodes and 43 bidirectional fiber links. The aim of the simulation is twofold: first, to quantify the performance of the EDF-based setup strategy in the context of a real life optical network topology; and second, to get away from some of the rigid

Concluding remarks and future work

This paper introduced a novel approach for connection setup in wavelength-routed optical WDM networks. The proposed setup mechanism is based on the concept of treating the setup time of an incoming connection request as a priority indicator during connection provisioning. In view of this, the EDF queueing policy was adapted to the particular case of connection setup scheduling, by giving the highest priority to those connections with the shortest setup time requirement.

Furthermore, a

Wissam Fawaz received a B.E. in Computer Engineering with high honors from the Lebanese University in 2001. In 2002, he earned an M.Sc. degree in Network and Information technology with high honors from the University of Paris VI. Next, he received a Ph.D. degree in Network and Information Technology with excellent distinction from the University of Paris XIII in 2005. Between 2001 and 2004, he managed a scientific research project on Optical Service Management at ALCATEL Research and

References (26)

  • A. Szymanski

    Grade-of-Service-based routing in optical networks

    IEEE Communications Magazine

    (2007)
  • R. Ramaswami

    Optical fiber communication: from transmission to networking

    IEEE Communications Magazine

    (2002)
  • A. Szymanski et al., Performance evaluation of the Grade-of-Service routing strategies for optical networks, in:...
  • C. Pinart

    Challenges and requirements for introducing impairement awareness into the management and control planes of ASON/GMPLS WDM networks

    IEEE Communications Magazine

    (2006)
  • A. Jukan et al.

    Path selection methods with multiple constraints in service-guaranteed WDM networks

    IEEE/ACM Transactions on Networking

    (2004)
  • C. Pinart et al.

    On managing optical services in future control-plane-enabled IP/WDM networks

    IEEE Journal of Lightwave Technology

    (2005)
  • W. Fawaz

    Service Level Agreement and provisioning in optical networks

    IEEE Communications Magazine

    (2004)
  • W. Fawaz, K. Chen, A Shortest Setup Time First optical connection setup management approach with quantifiable success...
  • W. Fawaz et al.

    A novel connection setup management approach for optical WDM networks

    IEEE Communications Letters

    (2007)
  • D. Andrei, M. Batayneh, C.U. Martel, B. Mukherjee, Provisioning of Deadline-Driven Requests with flexible transmission...
  • D. Andrei, M. Batayneh, C.U. Martel, B. Mukherjee, Deadline-Driven bandwidth allocation with flexible transmission...
  • R.W. Conway et al.

    Theory of Scheduling

    (1967)
  • J. Peha, F. Tobagi, Evaluation scheduling algorithms for traffic with heterogenous performance objectifs, in:...
  • Cited by (0)

    Wissam Fawaz received a B.E. in Computer Engineering with high honors from the Lebanese University in 2001. In 2002, he earned an M.Sc. degree in Network and Information technology with high honors from the University of Paris VI. Next, he received a Ph.D. degree in Network and Information Technology with excellent distinction from the University of Paris XIII in 2005. Between 2001 and 2004, he managed a scientific research project on Optical Service Management at ALCATEL Research and Innovation, Marcoussis, France. At the University of Paris XIII, between 2002 and 2006 he worked as a Teaching Assistant of Computer Engineering. Since October 2006, he is an Assistant Professor of Electrical and Computer Engineering at the Lebanese American University where he teaches the following courses: computer programming, data structures, computer networks, optical networks and queueing theory. His current research interests are in the areas of next generation optical networks, survivable network design and queueing theory. He is the recipient of the French ministry of research and education scholarship for distinguished students in 2002 and of a Fulbright research award in 2008.

    Iyad Ouaiss is assistant professor of computer engineering at the Lebanese American University; Byblos, Lebanon. He received a Bachelor’s in Computer Engineering from University of Cincinnati, College of Engineering; Cincinnati, Ohio, attended the NATO Advanced Study Institute in Barga, Italy, and received his PhD in computer engineering from University of Cincinnati.

    Ken Chen was born in Shanghai (China) on 1960. He received the Engineer Diploma from SUPELEC (Institute on electric and electronic engineering, France) in 1985, and the Doctorate Degree from University Paris 11 (France), in 1988. From 1988 to 1990, he has been a researcher at INRIA. From 1990 to 1997, he served as a Maitre de Conference at ENST (Institue on Telecommunications). Since 1997, he joined the university Paris 13 as a Professor. His current interests are in the area of computer network architecture and performance analysis as well as real-time systems.

    Harry G. Perros is an IEEE Fellow, a Professor of Computer Science, an Alumni Distinguished Graduate Professor, and the Program Coordinator of the Master of Science degree in Computer Networks at NC State University. He received the B.Sc. degree in Mathematics in 1970 from Athens University, Greece, the M.Sc. degree in Operational Research with Computing from Leeds University, England, in 1971, and the Ph.D. degree in Operations Research from Trinity College Dublin, Ireland, in 1975. His current research interests are in the areas of next generation networks, multi-domain routing, resource allocation under QoS, service science management and engineering (SSME), and queueing theory.

    View full text