Showing papers in "Photonic Network Communications in 2008"

A new family of 2D variable-weight optical orthogonal codes for OCDMA systems supporting multiple QoS and analysis of its performance

Abstract: A new family of two-dimensional variable-weight and constant-length optical orthogonal codes (2D VWOOCs) is proposed, and the code cardinality and BER performance for the corresponding OCDMA system are analyzed in this article. It is shown that the cardinality of 2D VWOOC is larger than that of constant-weight 2D OOC and close to the upper bound in theory. In an OCDMA network, the users employing 2D VWOOC codewords with larger Hamming weight outperform the users using 2D VWOOC codewords with smaller Hamming weight in bit-error-rate performance. Therefore, the OCDMA network employing 2D VWOOC can support diverse quality-of-services (QoS) classes and multimedia services, and make the better use of bandwidth resources in optical networks.

Performance evaluation of p-cycle based protection methods for provisioning of dynamic multicast sessions in mesh WDM networks

Abstract: Network survivability is crucial to both unicast and multicast traffic. Up to now, extensive research has been done on unicast traffic protection. Recently, due to the rapid growth of multicast applications, such as video-conferencing, high definition television (HDTV), distance learning, and multi-player on-line gaming, the problem of multicast traffic protection has started to draw more research interests. The preconfigured protection cycle (p-cycle) method proposed by Grover offers fast speed in restoration (because p-cycles are pre-cross-connected) and high efficiency in resource utilization (because p-cycles protect both on-cycle and straddling links). So far p-cycles based protection approaches have been intensively studied for unicast traffic protection, but have been rarely investigated for multicast traffic. We propose to apply p-cycles to dynamic protection provisioning of multicast traffic, and evaluate the blocking performance in comparison to other existing multicast protection schemes. We consider three different p-cycle based multicasting protection methods, namely dynamic p-cycle (DpC) design, p-cycle based protected working capacity envelope (PWCE) design, and hybrid DpC and PWCE design. We show that p-cycle-based multicast protection approaches offer much better blocking performance, as compared with other existing multicast protection schemes. The main reasons for the much better blocking performance are attributed to the facts that (i) the selection of p-cycles is independent of the routing of the multicast light trees, (ii) there are no path/segment disjoint constraints between the selected p-cycles and the multicast light trees to be protected, (iii) the selected p-cycles are the most efficient p-cycles.

New traffic grooming approaches in optical networks under restricted shared protection

Abstract: In this paper, two traffic grooming approaches based on alternate path routing are proposed to accommodate a greater number of connections in optical networks. In the first approach (called as Source_SWG), the connections of same source and different destinations along a path are groomed in a wavelength channel, whereas in the second approach (called as Des_SWG), the connections of the same destination and different sources along a path are groomed in a wavelength channel. These approaches are compared with existing heuristic traffic grooming algorithms based on fixed routing. It is found that both the approaches provide less wavelengths than the existing heuristic traffic grooming algorithms for establishment of all the connections present in the network. The comparative studies of these approaches are also made under restricted shared protection. It is seen that in case of Source_SWG, the number of wavelengths required for establishment of all the connections present in the network is less than that for Des_SWG.

Genetic evolutionary algorithm for optimal allocation of wavelength converters in WDM optical networks

Abstract: In this article, a genetic evolutionary algorithm is proposed for efficient allocation of wavelength converters in WDM optical networks. Since wavelength converters are expensive, it is desirable that each node in WDM optical networks uses a minimum number of wavelength converters to achieve a near-ideal performance. The searching capability of genetic evolutionary algorithm has been exploited for this purpose. The distinguished feature of the proposed approach lies in handling the conflicting circumstances during allocation of wavelength converters considering various practical aspects (e.g., spatial problem, connectivity of a node with other nodes) rather than arbitrarily to possibly improve the overall blocking performance of WDM optical networks. The proposed algorithm is compared with a previous approach to establish its effectiveness and the results demonstrate the ability of the proposed algorithm to efficiently solve the problem of Optimal Wavelength Converters Allocation (OWCA) in practical WDM optical networks.

Restoration in wavelength-routed optical networks by means of ant colony optimization

Abstract: Because of the distributed control of the network, the dynamic nature of the traffic and the unpredictability of a failure event, the flexibility and robustness of ant colony optimization (ACO) make it a suitable candidate for provisioning lightpaths in an optical network In this work, we propose a fault-tolerant dynamic routing and wavelength assignment (RWA) algorithm based on the ACO framework, presenting its integration into the Generalized multi-protocol label switching (GMPLS) control plane By simulating two different scenarios, we demonstrate the effectiveness of this algorithm when a single link or node failure occurs

Analysis of blocking probability in optical burst switched networks

Abstract: In this article, we study the blocking probability in a wavelength division multiplexing (WDM) based asynchronous bufferless optical burst switched (OBS) network, equipped with a bank of wavelength converters. Our analysis encloses two wavelength reservation schemes JIT (just-in-time) and JET (just-enough-time), and two-class data rate. The contribution of our work includes: (i) derivation of an accurate model for blocking probability of lower priority bursts in case of a non-preempted model; (ii) provision of the analytical model for blocking probability calculation in the OBS network, which includes these variables: two signaling schemes, partial wavelength conversion, two-class data, traffic intensity, cross-connect speed, number of wavelengths in WDM fiber, number of fibers in the node, number of wavelength converters, and number of nodes in the path; (iii) simulation results, which show that partial wavelength conversion provide quite satisfactory quality of service. We compare performance in a single OBS node, under various sets of parameter values. The OBS network shows great flexibility in terms of used multiclass data, and there is no dependence on the used higher layer protocol.

On the fairness improvement of channel scheduling in optical burst-switched networks

Abstract: In the past years, several signaling protocols were proposed for OBS networks and the most popular one is the Just-Enough-Time (JET) protocol. JET not only efficiently utilizes the network capacity, but also effectively reduces the end-to-end transmission delay. However, the most critical defect of JET is its intrinsic deficiency: Fairness. The fairness problem is a traditional problem common to various kinds of networks. It results in a phenomenon that bursts with a shorter number of hops are generally favorized and hence deteriorates the network utilization as well. In this article, we investigate this problem and propose a fair channel scheduling algorithm as a solution. Usually there is a tradeoff between fairness and blocking performance. Accordingly, the objective of our scheme is to achieve a balance between the two conflicting metrics as much as possible. In our scheme, each burst is associated with a dynamic priority which is defined by several characteristics of the burst. When contention occurs, the proposed scheme picks the preferable burst and drops the other one according to their priorities. From simulation results, we observed that the proposed scheme could improve fairness without causing significant reduction in dropping performance. Furthermore, it increases the effective link utilization as well.

Experimental assessment of some Raman fiber amplifiers solutions for coarse wavelength division multiplexing applications

Abstract: Raman amplification will, in a closer future, penetrate into the access network, bringing new challenges and difficulties to be overcome. In this article, we present the performance assessment of Raman amplification solutions suitable for Coarse Wavelength Division Multiplexing (CWDM) access networks applications. For this purpose, a pumping scheme with three lasers allows a bandwidth of 78 nm which is suitable for four CWDM channels. For this scheme, the gain and noise figure dependence with the pumping configuration was evaluated. The gain equalization was experimentally obtained based on a previously developed model using the Genetic Algorithm (GA) for pump allocation. A comparative study of Raman amplification in different types of Raman fibers (single mode fiber and dispersion shifted fiber) is also presented as well as the use of composite links. Those applications were tested in a local network and the obtained results comply with the modeling foreknowledge, showing the feasibility of Raman amplification over CWDM networks.

Predicting the performance of reconfigurable optical interconnects in distributed shared-memory systems

Abstract: New advances in reconfigurable optical interconnect technologies will allow the fabrication of low-cost, fast and run-time adaptable networks for connecting processors and memory modules in large distributed shared-memory multiprocessor machines. Since the switching times of these components are typically high compared to the memory access time, reconfiguration exploits low frequency dynamics in the network traffic patterns. These are however not easily reproduced using statistical traffic generation, a tool commonly used when doing a fast design space exploration. In this paper, we present a technique that can predict network performance, based on the traffic patterns obtained from simulating the execution of real benchmark applications, but without the need to perform these slow full-system simulations for every parameter set of interest. This again allows for a quick comparison of different network implementations with good relative accuracy, narrowing down the design space for more detailed examination.

Security performance analysis of an M-code keying OCDMA system

Abstract: In this article, an M-code keying OCDMA system with parallel encoders/decoders is presented and its security performance is quantitatively analyzed. Under brute-force searching techniques, the formula about the average searching time is derived. The bit-correct-interception possibilities for tapping individual and multiple users’ signals are calculated, respectively. By analysis, it is shown that the security performance of an OCDMA system can be enhanced by employing M-code keying.

Design and performance comparison of multiple-token based MAC protocols for optical burst switched ring networks

Abstract: Optical burst switching (OBS) has been proposed as a new optical switching paradigm for the next generation Internet due to its flexibility and feasibility compared to OCS and OPS. Moreover, serving as a backbone that interconnects a number of access networks, OBS ring topologies have been a good choice for solving the current metro gap problem between core network and access network owning to its simplicity and scalability. In this paper, we provide an insight into the OBS ring network that consists of nodes using TT–TR (Tunable Transmitter–Tunable Receiver). The node architectures with TT–TR may make efficient use of network resources even though traffic pattern, such as IP traffic with self-similarity dynamically change, and can support good expandability. However, all nodes share the limited network resources. This may result in contention such as wavelength contention and transceiver contention leading to burst loss. In order to use the shared network resources fairly and efficiently as well as reducing the resource contention, we focus on the design of medium access control (MAC) protocols based on multiple tokens. Each token is allocated to one wavelength to denote the accessibility of that wavelength, i.e., once the token is captured, the corresponding wavelength can be used to transmit a burst. As tokens hold the key for using wavelengths to transmit bursts, token management including the token release time is crucial in the proposed MAC protocols. Thus, two kinds of multiple-token based MAC protocols with different token release times are proposed: token release after transmitting burst (TRTB) and token release after transmitting control header (TRTC). Each of them is classified into two schemes called TRTB/TRR and TRTB/RCA and correspondingly TRTC/TRR and TRTC/ RCA. RCA stands for receive collision avoidance. The target is to increase the performance while reducing the processing overhead at each node. The performance of the TRTB and TRTC protocols are evaluated and compared in terms of queuing delay, burst loss rate, and channel utilization by OPNET simulation. The effects of various design parameters are also investigated through simulation in order to evaluate their scalability. In all the proposed schemes, tokens are just used to denote the accessibility of each wavelength. Finally, as an alternative, we also propose a new scheme based on the TRTC protocol called TRTC/CAT (collision avoidance by tokens) to avoid contention by using tokens.

A tabu search heuristic for the routing and wavelength assignment problem in multigranular optical networks

Abstract: This paper proposes a tabu search heuristic for solving the routing and wavelength assignment problem in multigranular optical networks, considering the wavelength-continuity constraint and a set of connections to satisfy. For a number of fibers per link, a number of wavebands per fiber, and a number of wavelengths per waveband, this algorithm attempts to minimize the total number of ports used in the network by efficiently grouping lightpaths into bands and fibers, and switching the whole bands and fibers. The algorithm has been implemented and tested on the NSFNET network, and comparisons have been made with the Balanced Path Routing and Heavy Traffic First (BPHT) algorithm in terms of number of ports. Generally, the results obtained with our tabu search heuristic are better than those provided by this algorithm.

Study of multicast wavelength arrangement for maximizing network capacity in WDM networks with sparse wavelength converters

Abstract: The issue of wavelength assignment is one of the most important factors that affect the capacity for the deployment of optical networks. This issue becomes more critical for multicast connections, especially when the network nodes have no wavelength conversion capability. Although the wavelength assignment can be more flexible if each node can perform wavelength conversion, the deployment cost increases accordingly. A compromise is to support a limited portion of conversion nodes in the WDM network. We propose a systematic approach for the wavelength assignment of multicast connections in WDM networks with sparse wavelength conversion nodes. The efficiency of the arrangement of wavelength is measured by its influences on the available capacity of the network and the consumption of wavelengths. By using the proposed approach, the Static Cost Greedy (SCG) algorithm [8] can be easily extended to be applicable in a Sparse Wavelength Conversion Network (SWCN). In addition, instead of SCG, the Minimum-Effect-First (MEF) algorithm is proposed to maximize the network capacity during wavelength assignment. We compare the performance of the proposed MEF methods with the extended SCG scheme through exhaustive simulations. The experimental results indicate that the proposed MEF schemes demonstrate much better performance than the SCG scheme. We also found that the performance is not always improved proportionally to the increment of the wavelength conversion nodes. The improvement reaches saturation when the number of conversion nodes is above 35% of the total number of nodes.

An AWG-based WDM-PON architecture employing WDM/TDMA transmission for upstream traffic with dynamic bandwidth allocation

Abstract: In this article, we examine a candidate architecture for wavelength-division multiplexed passive optical networks (WDM-PONs) employing multiple stages of arrayed-waveguide gratings (AWGs). The network architecture provides efficient bandwidth utilization by using WDM for downstream transmission and by combining WDM with time-division multiple access (TDMA) for upstream transmission. In such WDM-PONs, collisions may occur among upstream data packets transmitted simultaneously from different optical networking units (ONUs) sharing the same wavelength. The proposed MAC protocol avoids such collisions using a request/permit-based multipoint control protocol, and employs a dynamic TDMA-based bandwidth allocation scheme for upstream traffic, called minimum-guaranteed maximum request first (MG-MRF), ensuring a reasonable fairness among the ONUs. The entire MAC protocol is simulated using OPNET and its performance is evaluated in terms of queuing delay and bandwidth utilization under uniform as well as non-uniform traffic distributions. The simulation results demonstrate that the proposed bandwidth allocation scheme (MG-MRF) is able to provide high bandwidth utilization with a moderately low delay in presence of non-uniform traffic demands from ONUs.

Cross-virtual concatenation for Ethernet-over-SONET/SDH networks

Abstract: Ethernet-over-SONET/SDH (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET/SDH transport infrastructure. It typically uses virtual concatenation (VC) for dynamic bandwidth management. The aggregate SONET/SDH bandwidth for a given EoS connection is obtained by “concatenating” a number of equal-capacity virtual channels. Together, these virtual channels form a virtually concatenated group (VCG). In this article, we introduce a new concatenation technique, referred to as cross-virtual concatenation (CVC), which involves the concatenation of virtual channels of heterogeneous capacities. We show that CVC can be implemented through a simple upgrade at the end node, thus utilizing the existing legacy SDH infrastructure. By employing CVC for EoS systems, we show that the SDH bandwidth can be harvested more efficiently than in conventional VC. We consider two problems associated with routing CVC connections: the connection establishment problem and the connection upgrade problem. The goal of the first problem is to compute a set of paths between two EoS end systems such that a total bandwidth demand and a constraint on the differential delay between the paths are satisfied. Among all feasible sets, the one that consumes the least amount of network bandwidth is selected. For this problem, we develop an integer linear program (ILP) and an efficient algorithm based on the sliding-window approach. For the connection upgrade problem, the goal is to augment an existing set of paths so as to increase the aggregate bandwidth, while continue to meet the differential-delay constraint. We model this problem as a flow-maximization problem with a constraint on the delay of the virtual channels with positive flow. We then consider the problem of path selection under imprecise network state information. Simulations are conducted to demonstrate the advantages of employing CVC and to evaluate the performance of the proposed algorithms.

Blocking models of optical burst switches with shared wavelength converters: exact formulations and analytical approximations

Abstract: Loss modeling of asynchronous optical burst switches with shared wavelength converters is considered. An exact analysis based on continuous time Markov chains is proposed and validated by comparison with simulation for balanced and unbalanced traffic. A computationally efficient approximated analysis is also proposed and compared with the exact model to find applicability conditions. Approximate loss performance evaluation is presented for ranges of values which are not tractable either by simulation or exact analysis.

A hybrid cycle bandwidth allocation scheme with differentiated services support in Ethernet passive optical networks

Abstract: The Ethernet passive optical network (EPON) has emerged as one of the most promising solutions for next generation broadband access networks. Designing an efficient upstream bandwidth allocation scheme with differentiated services (DiffServ) support is a crucial issue for the successful deployment of EPON, carrying heterogeneous traffic with diverse quality of service (QoS) requirements. In this article, we propose a new hybrid cycle scheme (HCS) for bandwidth allocation with DiffServ support. In this scheme, the high-priority traffic is transmitted in fixed timeslots at fixed positions in a cycle while the medium- and low-priority traffic are transmitted in variable timeslots in an adaptive dynamic cycle. A suitable local buffer management scheme is also proposed to facilitate QoS implementation. We develop a novel feature providing potentially multiple transmission opportunities (M-opportunities) per-cycle for high-priority traffic. This feature is significant in improving delay and delay-variation performance. The HCS provides guaranteed services in a short-cycle scale for delay and jitter sensitive traffic while offering guaranteed throughput in a moderately long-time scale for bandwidth sensitive traffic and at the same time maximizing throughput for non-QoS demanding best-effort traffic. We develop analytical performance analysis on the deterministic delay bound for high-priority traffic and minimum throughput guarantees for both high- and medium-priority traffic. On the other hand, we also conduct detailed simulation experiments. The results show a close agreement between analytical approach and simulation. In addition, the simulation results show that the HCS scheme is able to provide excellent performance in terms of average delay, delay-variation, and throughput as compared with previous approaches.

Addressing self-similarity in optical switching networks by means of ant colony optimization

Abstract: In this work, we propose the use of an Ant Colony Optimization (ACO) algorithm to mitigate packet loss in an optical packet switching network that carries self-similar traffic, which is known to have a great impact in the buffer performance in terms of loss probability as exemplified in this work. By adaptively routing the packets and balancing the network load, we demonstrate by some simulations the effectiveness of this approach when compared with a shortest-path routing scheme, achieving a performance that is comparable to the Poisson traffic scenario in some cases. The proposed algorithm can be used as a viable alternative to traffic shaping techniques.

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

Abstract: 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.

An effective buffering architecture for optical packet switching networks

Abstract: A novel optical buffering architecture for Optical Packet Switching (OPS) networks is proposed in this article. The architecture which adopts a fiber-sharing mechanism aims at solving the problem of using a large number of fiber delay lines that are used to solve resource contention in the core node in OPS networks. The new architecture employs fewer fiber delay lines compared to other simple architectures, but can achieve the same performance. Simulation results and analysis show that the new architecture can decrease packet loss probability effectively and achieve reasonable performance in average packet delay.

New results for path-based shared protection and link-based Hamiltonian cycle protection in survivable WDM networks

Abstract: In this paper, we study the path-based shared protection (PBSP) and the link-based Hamiltonian cycle protection (LBHCP) schemes for tolerating single-link failures in survivable wavelength-division-multiplexing networks. Although previous work indicated that PBSP can perform better than link-based shared protection including the case of LBHCP, from theoretical analysis and simulation results in this paper, we can clearly see that this indication of previous work is not suitable for LBHCP since it can have a better resource utilization ratio and a faster recovery time than PBSP. Therefore, the new result of this paper is a modification for the previous inaccurate idea and it also can well guide future work of researchers.

Shared partial path protection in WDM networks with shared risk link groups

Abstract: For 100% shared risk link group (SRLG) failure protection, conventional full path protection has to satisfy SRLG-disjoint constraints, i.e., its working path and backup path cannot go though the same SRLG. With the increase of size and number of SRLGs, capacity efficiency of conventional shared full path protection becomes poorer due to SRLG-disjoint constraints and the blocking probability becomes much higher due to severe traps. To solve these problems, we present a partial path protection scheme where SRLG-disjoint backup paths may only cover part of the working path. Full path protection becomes a special case of partial path protection, in which the backup path covers the full working path. By choosing the most survivable partial backup path as backup path, we can make the impact of SRLG failures as low as possible and accept as many as possible connection requests. Assuming every SRLG has the same probability to fail, we present a heuristic algorithm to find the most survivable partial backup path by choosing full path protection first, iteratively computing partial backup paths and choosing the most survivable one. The benefit of this heuristic algorithm is that it can find the optimal results within less iteration. Analytical and simulation results show that, compared to conventional full path protection, our proposed scheme can significantly reduce blocking probability with little sacrifice on survivability. The proposed scheme is very useful particularly when the network contains a lot of SRLGs and the blocking probability of conventional full path protection becomes too high.

Performance assessment of multicast node placement for multicast routing in WDM networks with sparse light splitting

Abstract: This article examines all-optical multicast routing for wavelength-routed optical networks with sparse Multicast Capable (MC) nodes in two phases. The first phase is MC node placement and use of a simple and straightforward Maximum Path Count First (MPCF) algorithm to obtain candidates for MC nodes. The second phase is multicast routing with MC-based schemes that minimizes the number of wavelength channels with minimum transmission delay as required by a given multicast session, in that a light-tree is first constructed to connect MC nodes in a multicast group by using two algorithms, namely, the Pre-computing Minimum Cost (PMC) tree algorithm and the Pre-computing Shortest Path (PSP) tree algorithm. System performance of the proposed MPCF MC node placement algorithm is compared with that of the Normalized Cuts (NC) MC node placement algorithm for both PMC and PSP multicast routing. Furthermore, simulation results compare PMC and PSP multicast routing based on MPCF and NC node placement with Re-route-to-Source (RTS), Re-route-to-Any (RTA), Member-First (MF), and Member-Only (MO) multicast routing based on a light forest for a given multicast session in terms of average number of wavelengths needed, average blocking probability, and mean maximum transmission delay.

Coordination of wavelength and time-window assignment in WDM-based TDM hybrid-PONs

Abstract: In passive optical networks (PONs), the low effectiveness in terms of service utilization and network evolution have been important design issues. In this article, we introduce a hybrid access network architecture, so called scalable WDM-based Ethernet hybrid-PON (SWE-PON), which features a wavelength-division-multiplexed (WDM) feeder network using a combination of tunable laser device (TLD) and cyclic arrayed waveguide grating (AWG) and time-division-multiplexed (TDM) distribution network based on a reflective transmission mode. Necessary conditions needed to guarantee flawless packet transmission through normal WDM/TDM hierarchical PONs including the SWE-PON, are analyzed. We also propose a hierarchical fair time-window allocation mechanism which coordinates wavelength assignment and time-window bandwidth allocation so that high link utilization and fair bandwidth allocation are guaranteed in every multiplexing level.

Service differentiation scheme in OBS networks

Abstract: In order to achieve service differentiation, especially loss differentiation, in optical burst switching (OBS) networks, we propose a dynamic fiber delay line (FDL) partitioning algorithm, which divides FDLs into several groups over a feed-forward output buffering architecture. In the proposed scheme, a plurality of traffic classes and FDL groups can be considered, and each FDL group is assigned to traffic classes, so that the target loss probabilities of classes are guaranteed. Also, the optimal number of FDLs for each FDL group by the proposed algorithm is decided in Poisson traffic environments. The extensive simulation results validate the effectiveness of the proposed dynamic FDL partitioning algorithm for the loss differentiation in OBS networks.

Simultaneous effect of connection admission control in distance and bandwidth capacity on WDM network performance

Abstract: This article presents an algorithm for dynamic-routing and wavelength assignment (D-RWA) in an optical WDM network. The approach is based on a genetic algorithm (GA) and it includes a connection admission control (CAC), to provide a network with simultaneous fairness in distance and bandwidth capacity. The algorithm is evaluated by means of computer simulations using a mesh network with two types of node architectures capable of performing traffic grooming. Combining the two types of nodes, the performance of four network configurations is compared. Assuming that one of the two node types is more costly, two sparse node allocations are suggested to maintain the network cost-effective. The algorithm assigns wavelengths to the ligthpaths, routes the traffic streams, manages the grooming of sub-wavelength tributaries onto full wavelength channels, provides fairness, and minimizes the overall blocking probability of connection requests. Numerical results attest the usefulness of the proposed approach considering several scenarios of distance and bandwidth capacity classes of requests. Simultaneous and isolated simulations of the two fairness schemes are also compared, emphasizing the versatility of the algorithm.

Priority-based dynamic bandwidth allocation in Ethernet Passive Optical Networks

Abstract: In this article, new Dynamic Bandwidth Allocation (DBA) algorithms which give high priority to some ONUs corresponding to important agencies are studied in order to manage emergency cases causing severe network traffic. In order to deal with such cases, the network state is divided into two states, namely the normal and the emergency states. We apply the Weighted Round Robin (WRR)-based algorithm to the normal state, and three priority-based DBA algorithms are applied to the emergency state. These algorithms are different from each other according to the mode of protecting non-priority ONUs from starving. Each algorithm is analyzed in terms of utilization of the uplink bandwidth and the average packet delay. Simulation and theoretical results show that the proposed algorithms are working properly at the emergency state and can satisfy more stringent QoS requirements than WRR algorithms.

A new approach for routing and wavelength assignment for permanent and reliable wavelength paths in wide all-optical WDM networks

Abstract: This article proposes a new approach for routing and wavelength assignment (RWA) for permanent and reliable wavelength paths (WP) in wide all-optical WDM networks with wavelength continuity constraint. Given a number of available wavelengths on each optical fiber, for each simple link failure of the network, we seek to maximize the number of satisfied requests for connections. This is known as RWAP problem. In our algorithm, called RWA with Minimum Loaded Link for Permanent and Reliable wavelength paths (MLL-PR), routing is based on the search for the optimal path while trying to minimize the maximum load on the links of the network in order to minimize the maximum link capacity and then minimize the number of dropped lightpaths after any link failure. The wavelength assignment is based on a graph coloring method using tabu-search. A series of experiments using two well-known networks (ARPANET and NSFNET) have been carried out in order to evaluate the performance of our approach, in terms of the number of blocked demands, for different failure scenarios. Generally, our results are better than those provided by the current solving approaches taken as reference.

A new fault-management method using congestion-avoidance routing for optical burst-switched networks

Abstract: Optical burst switching (OBS) has been proposed as a promising technique to support high-bandwidth, bursty data traffic in the next-generation optical Internet. This study investigates a new fault-management framework for an OBS network. In an OBS network, burst-loss performance is a critical concern. In OBS, the data-burst transmission is delayed by an offset time (relative to its burst control packet (BCP), or header), and the burst follows its header without waiting for an acknowledgment for resource reservation. Thus, a burst may be lost at an intermediate node due to contention, which is generally resolved according to the local routing and bandwidth information. The routing table maintained in each OBS node is generally pre-computed and fixed to forward the data bursts. Such a static forwarding feature might have limited efficiency to resolve contentions. Moreover, a burst may be lost and the network may be congested when a network element (e.g., fiber link) fails. Therefore, for reliable burst transport, we develop dynamic routing approaches for preplanned congestion avoidance. Our goal is to proactively avoid congestion during the route-computation process, and our approach employs wavelength-channel utilization, traffic distribution, and link-distance information in the proposed objective functions for routing. Two update mechanisms for maintaining a dynamic routing table are presented to accommodate bursty data traffic. Based on our routing mechanisms, we also propose a new congestion-avoidance-and-protection (CAP) approach, which employs a primary route and a group of backup routes for each node pair against failures and congestion. The performance of the proposed protection strategy using congestion-avoidance routing is demonstrated to be promising through illustrative numerical examples.

Performance improvement of bandwidth-limited coherent OCDMA system

Abstract: The performance of an optical code division multiplexing access (OCDMA) system employing the differential phase shift keying (DPSK) data format and turbo code is investigated and simulated. A bandwidth-limited coherent time spreading (TS) OCDMA system is considered. Theoretical results show that performance degradation due to bandwidth limitation could be effectively restrained by the application of the DPSK data format in a coherent OCDMA system, and further performance improvement could be achieved by incorporating turbo coding into the OCDMA system.