Burst scheduling for differentiated services in optical burst switching WDM networks

Optical burst switching (OBS) is one of the most important switching technologies for future optical wavelength division multiplexing (WDM) networks and the Internet. The model of differentiated services has been proposed to support quality of service (QoS) in the IP‐based Internet. It is also very important to have differentiated service support in OBS networks. When the burst scheduling in an OBS network is set up appropriately, network can support differentiated services. In this paper, we proposed a new burst scheduling scheme, called differentiated scheduling with identical priority offset time (DSIPO). In DSIPO, the same priority offset time is used for all the bursts destined to the same edge node regardless of their priorities. Differentiated services in terms of burst loss probability are achieved by processing the control packets of higher priority class bursts, thus reserving resources for their data bursts, more promptly upon their arrival than those of lower priority class bursts. Each intermediate (core) node can adjust the burst loss probabilities of various burst classes by choosing its own differentiated processing delay value for each priority class or its own differentiated processing delay difference value between any pair of adjacent priority classes. We model and analyse DSIPO in terms of the burst loss probability for each priority class with simulation validation. The performance of DISPO is evaluated by simulation. Copyright © 2004 John Wiley & Sons, Ltd.     

A cost-based scheduling algorithm for differentiated service on WDM optical networks

One of the important issues in the design of future generation of high-speed networks is to provide differentiated services to different types of traffic with various time constraints. We propose an adaptive scheme to manage message transmission in single-hop passive-star coupler based wavelength-division multiplexing (WDM) optical networks. This study suggests that when scheduling message transmission in WDM networks a differentiated service should be considered in order to meet the time constraint to transmission of real-time messages while non real-time messages are being served so that the overall performance of the network could be improved.     

Enabling differentiated services using generalized power control model in optical networks

This paper considers a generalized framework to study OSNR optimization-based end-to-end link level power control problems in optical networks. We combine favorable features of game-theoretical approach and central cost approach to allow different service groups within the network. We develop solutions concepts for both cases of empty and nonempty feasible sets. In addition, we derive and prove the convergence of a distributed iterative algorithm for different classes of users. In the end, we use numerical examples to illustrate the novel framework.     

Providing differentiated services for multi-class traffic in IP/MPLS over WDM networks

Providing differentiated services in IP/MPLS over WDM networks has attracted a lot of recent attention. This article extends the Path Inflation Control (PIC) policy recently proposed by us to provide differentiated services in IP/MPLS over WDM networks with traffic grooming. Three different algorithms are considered for provisioning differentiated services. The simulation results show that, with two of the three algorithms, the network cannot only provide differentiated services when the traffic load is high but also gives significantly lower blocking for the lower priority class traffic and for the overall traffic at low traffic loads.

A scheduling application for WDM optical networks

Optical networking using WDM technology has matured considerably, and commercial WDM network equipment and WDM network control and management prototypes have appeared. To use such a network efficiently, a scheduling facility and its enabling mechanisms have to be provided. This scheduling facility should be integrated to interoperate with the rest of the network control and management software such as connection manager or signaling daemon. We present a scheduling application to address this need. The architecture for the application and its key components are presented. Agent-related enabling mechanisms are introduced to monitor the optical signal quality and collect performance measurements. A resource broker is used to manage the communication and interoperability between agents and the application. An event service is developed to decouple the communication between the agents and the scheduling application, and to enable the communication among the agents themselves. The scheduling application consists of the quality of signal information and threshold objects, current network usage, history data module, scheduling module, and access to a performance database. To provide traffic control and high network resource utilization, the application is equipped with wavelength scheduling algorithms. An experimental study for the basic scheduling algorithms has been conducted over the MONET DC network.     

A computational model for estimating blocking probabilities of multifiber WDM optical networks

In this letter, we propose a computational model for calculating blocking probabilities of multifiber wavelength division multiplexing (WDM) optical networks. We first derive the blocking probability of a fiber based on a Markov chain, from which the blocking probability of a link is derived by means of conditional probabilities. The blocking probability of a lightpath can be computed by a recursive formula. Finally, the network-wide blocking probability can be expressed as the ratio of the total blocked load versus the total offered load. Simulation results for different fiber-wavelength configurations conform closely to the numerical results based on our proposed model, thus demonstrating the feasibility of our proposed model for estimating the blocking performance of multifiber WDM optical networks.     

Protection interoperability for WDM optical networks

The failure of a single optical link or node in a wavelength division multiplexing (WDM) network may cause the simultaneous failure of several optical channels. In some cases, this simultaneity may make it impossible for the higher level (SONET or IP) to restore service. This occurs when the higher level is not aware of the internal details of network design at the WDM level. We call this phenomenon “failure propagation.” We analyze three types of failure propagation, called “bottleneck,” “connectivity,” and “multiple groups.” Then we present a solution based on the definition of appropriate requirements at network design and a WDM channel placement algorithm, protection interoperability for WDM (PIW). Our method does not require the higher level to be aware of WDM internals, but still avoids the three types of failure propagation mentioned above. We finally show the result on various network examples     

Provisioning algorithms for WDM optical networks

This paper concerns connection provisioning for optical networks employing wavelength division multiplexing. A heuristic algorithm is developed and numerically studied for routing and wavelength assignment of a set of static connection requests. The algorithm runs much faster than the optimum solution of this problem. An adaptation of the algorithm is proposed to design restorable networks which can handle a specified set of failures. The proposed algorithm is based on taking all failures into consideration simultaneously, and performs better than developing independent designs for each failure     

Design protection for WDM optical networks

With wavelength division multiplexing (WDM) networks the failure of a single link or component may cause the simultaneous failure of several optical channels, potentially making impossible restoration by rerouting directly in higher layers directly using the optical network (SDH, ATM, internal protocol (IP)). To address this, we introduce the concept of design protection, which aims at making such failure propagations impossible. We present the disjoint alternate path (DAP) algorithm which places optical channels in order to maximize design protection. We show the result on various network examples     

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

This paper presents the design and experimental implementation of a service-oriented Internet Protocol (IP)/wavelength division multiplexing (WDM) management plane. In the proposed approach, compliant with International Telecommunication Union Telecommunication Standardization Sector (ITU-T)'s automatic-switched optical network (ASON), a distributed control plane performs signaling, routing, and discovery functions, and a decentralized management plane, both at information and architectural levels, performs cross-plane actions to enforce service establishment and monitoring with a view to guarantee service level agreements (SLAs). In-service monitoring provides status of optical resources and services by using spectral- and time-domain information. Some performance aspects of the approach are evaluated in a real testbed featuring dense wavelength multiplexing and a control plane based on the Internet Engineering Task Force (IETF)'s generalized multiprotocol label switching (GMPLS).     

WDM 光网络中一种新的备用路由算法

文章基于负载均衡和禁忌搜索提出一种新的备用路由算法,实现了优化解搜索及对链路负载方差和拥塞的优化.路由选择后,采用首次命中按长通道优先原则为各光通道分配波长.在环网和网状网静态业务模式下对不同路由算法进行了仿真,仿真结果表明,新算法能充分利用网络资源安排最佳路由,有效降低了对波长的需求.     

A reservation-based multicast protocol for WDM optical star networks

In this paper, we present a reservation-based medium access control (MAC) protocol with multicast support for wavelength-division multiplexing networks. Our system is based on the single-hop, passive optical star architecture. Of the available wavelengths (channels), one channel is designated as a control channel, and the remaining channels are used for data transmission. Each node is equipped with a pair of fixed transceiver to access the control channel, and a fixed transmitter and a tunable receiver to access data channels. For easy implementation of the protocol in hardware and for precisely computing the protocol's processing overhead, we give a register-transfer model of the protocol. We simulate the protocol to study its throughput behavior, and present its analytic model. For a node to be able to send data packets in successive data slots with no time gap between them, in spite of the situation that the protocol's execution time may be longer than data transmission time, we propose the idea of multiple MAC units at each node. Unicast throughput of our protocol reaches the theoretically possible maximum throughput for MAC protocols with distributed control, and the multicast throughput is at least as good as, and even better than, those delivered by existing MAC protocols with distributed control.     

A bicriteria routing model for multi-fibre WDM networks

All-optical WDM networks are characterised by multiple metrics (hop-count, cost, delay, available band- width, loss probability, reliability), but generally routing algorithms only optimise one metric. Having in mind the inherent limitations of this type of approach, it seems potentially advantageous in the development of multicriteria models capable of explicitly representing the different performance objectives and enabling to treat in a consistent manner the trade off among the various criteria. A bicriteria model for obtaining a topological path (unidirectional or symmetric bidirectional) for each lightpath request in a WDM network is proposed. The first criterion is related to bandwidth usage in the links (or arcs) of the network. The second criterion is the number of links (hops) of the path. The model resolution approach uses a k-shortest path algorithm as well as preference thresholds defined in the objective function space, combined with a Chebyshev distance to a reference point (which changes with the analysed preference region). The solution of this bicriteria model is a non-dominated topological path. A heuristic procedure is then used to assign wavelengths to the links. The performance of the bicriteria model is analysed by comparing it with two monocriterion approaches, using two test networks.     

Tunable optical filters for dense WDM networks

WDM is currently taking over as the leading technology in point-to-point transmission links. For optical implementation of WDM networks, logical functionalities such as wavelength (channel) selection should be carried out in the wavelength domain; thus, the development of dynamic optical devices is required. One key device is a tunable optical filter. Important features of such a filter include low insertion loss, narrow bandwidth, high sidelobe suppression, large dynamic range, fast tuning speed, a simple control mechanism, small size, and cost effectiveness. Here, an extensive overview of the different technologies used to produce tunable optical filters is presented. Among them, fiber filters such as fiber Bragg gratings and fiber Fabry Perot are the most commercialized, yet inherently limited in their dynamic speeds. For high demanding dynamics, micro-machined and acousto-optic filters can offer a good solution for microsecond tuning speeds. Faster tunable devices, in nanosecond tuning speeds, might emerge out of microresonators, electrooptic filters, and active DBR filters     

Optimal WDM schedules for optical star networks

We consider single-hop wavelength-division multiplexed networks in which the transmitters take a nonzero amount of time, called tuning latency, to tune from one wavelength to another. For such networks, we show that, under certain conditions on the traffic matrix, there exist polynomial-time algorithms that produce the optimal schedule. Further, the tuning latency is masked in the length of the optimal schedule. Using Chernoff-Hoeffding bounds, we show that the condition on the traffic matrix is satisfied with high probability when the wavelength reuse factor is large, i.e., the number of nodes is large compared to the number of wavelengths. Simulation results show the dramatic improvement in the performance of the network using our algorithm as compared with other heuristics     

Differentiated QoS for survivable WDM optical networks

Optical networks based on WDM technology have become a promising solution to realize transport networks that can meet the ever-increasing demand for bandwidth. As WDM networks carry a huge volume of traffic, maintaining a high level of survivability is an important and critical issue. The. development of GMPLS switching technology led to the direct integration of IP and WDM. In these IP-over-WDM networks different applications/end users need different levels of fault tolerance and differ in how much they are willing to pay for the service they get. The current trend in network development is moving toward a unified solution providing support for voice, data, and various multimedia services. Therefore, it imperative that WDM networks incorporate fault tolerance to single or multiple component failures, protection bandwidth, recovery time, and recovery granularity besides resource utilization and call acceptance ratio. This article presents a survey of various methods that have been proposed for providing service differentiation in survivable WDM networks and discuss their performance. Such methods are broadly classified under various paradigms such as differentiated reliability, R-connections, quality of protection, and quality of recovery.     

WDM Ethernet passive optical networks

WDM EPONs not only allow for cautious pay-as-you-grow upgrades of single-channel TDM EPONs but also avoid linearly increasing polling cycle times for an increasing number of ONUS. In this article, we first provide a comprehensive overview of the state of the art of TDM EPONs and recently reported dynamic bandwidth allocation algorithms, including decentralized scheduling schemes. After reviewing previous work on WDM EPONs, we address the requirements of WDM upgraded EPONs and make recommendations on an evolutionary WDM upgrade at the architecture, protocol, and dynamic bandwidth allocation algorithm levels, taking backward compatibility with MPCP and future-proofness against arbitrary WDM ONU structures into account. We describe and compare online and offline scheduling paradigms for WDM EPONs. Our simulation results indicate that online scheduling can achieve lower delays, especially at high loads. We outline areas of future research on WDM EPONs.     

一种公平的多优先级WDM光网络波长分配算法

文章研究了波分复用(WDM)光网络中动态业务下的波长分配问题,在无波长转换器的条件下,提出了一种加入了公平性考虑的动态门限算法.该算法在支持多优先级的动态门限法的基础上,通过更新初始优先级减少了不同距离光路连接请求间的阻塞率差别,改善了公平性.计算机仿真结果说明了该算法的有效性.     

A management and visualization framework for reconfigurable WDM optical networks

As the phenomenal advance in optical WDM networking technologies continues, optical WDM network equipment has been deployed not only in backbone networks, but also in regional, metropolitan, and access networks. It is widely believed that a major component of the next-generation Internet will be an IP-based optical network employing WDM. WDM wavelength routing and signaling have become an active research field, and dynamic and adaptive wavelength routing and assignment algorithms have been proposed. However, there is less work on reporting network control and management system implementation efforts over testbed WDM networks. This article presents a network management and visualization framework aimed at guiding the development of management applications for reconfigurable WDM optical networks. A layered framework architecture including element and network management and visualization is provided, and an object-based information model representing the WDM network is introduced. Functional components on reconfiguration, software agent, and network visualization services are presented, and important issues related to optical lightpath generation are discussed. A network visualization service also provides WDM control and management APIs to applications and access networks such as an IP network management system. To illustrate the usage of the framework, we share our experience in implementing the MONET network control and management system, and present network visualization views obtained from the MONET WDM network to highlight the framework features.