Keeping the packet sequence in optical packet-switched networks

This paper deals with optical packet switches with limited buffer capabilities, subject to asynchronous, variable-length packets and connection-oriented operation. The focus is put on buffer scheduling policies and queuing performance evaluation. In particular a combined use of the wavelength and time domain is exploited in order to obtain contention resolution algorithms that guarantee the sequence preservation of packets belonging to the same connection. Four simple algorithms for strict and loose packet sequence preservation are proposed. Their performance is studied and compared with previously proposed algorithms. Simulation results suggest that by accepting some additional processing effort it is possible to guarantee very low packet loss probabilities while avoiding the out-of-sequence delivery.     

Multiclass scheduling algorithms for the DAVID metro network

The data and voice integration over dense wavelength-division-multiplexing (DAVID) project proposes a metro network architecture based on several wavelength-division-multiplexing (WDM) rings interconnected via a bufferless optical switch called Hub. The Hub provides a programmable interconnection among rings on the basis of the outcome of a scheduling algorithm. Nodes connected to rings groom traffic from Internet protocol routers and Ethernet switches and share ring resources. In this paper, we address the problem of designing efficient centralized scheduling algorithms for supporting multiclass traffic services in the DAVID metro network. Two traffic classes are considered: a best-effort class, and a high-priority class with bandwidth guarantees. We define the multiclass scheduling problem at the Hub considering two different node architectures: a simpler one that relies on a complete separation between transmission and reception resources (i.e., WDM channels) and a more complex one in which nodes fully share transmission and reception channels using an erasure stage to drop received packets, thereby allowing wavelength reuse. We propose both optimum and heuristic solutions, and evaluate their performance by simulation, showing that heuristic solutions exhibit a behavior very close to the optimum solution.     

Positioning of the RPR standard in contemporary operator environments

This article deals with the fundamentals and current standardization efforts for IEEE 802.17 resilient packet ring. Its special resilience features make this technology robust against outages of the network infrastructure. The goals of this article are threefold. First, the fundamentals of RPR and the standardization process carried out under the auspices of IEEE and ITU are overviewed. Second, potentially hazardous situations involving traffic assignments are defined and illustrated. Finally, possible situations where the simplicity, enhanced throughput, and automatic resilience features of RPR may be advantageous for network operators are identified.     

Eco-sustainable routing in optical networks

It is quite easy to foresee that in the next years, the future generation ultra-high speed network infrastructures and equipments will be no longer constrained only by their pure transport capacity, but also by their energy consumption costs and environmental effects. In particular, large network infrastructures are now widely recognized to play a fundamental role in the emission of greenhouse gases in the atmosphere, significantly affecting the environmental sustainability of new evolutions in network architectures as well as technological developments in communication devices. In this paper, a novel eco-sustainable routing and wavelength assignment algorithm, based on shortest path routing with an adaptive link weighting function relying on an extension of the OSPF-TE protocol to convey carbon footprint information, has been proposed to decrease the network ecological impact while balancing the traffic load and maintaining acceptable connection-blocking rate. The trade-off between load balancing and carbon footprint is also analyzed to evaluate the effectiveness of the proposed strategy within the context of a real world network.     

Value optimization of survivable multilayer IP/MPLS-over-WSON networks

Network operators are willing to provide a range of services in the hope of maximizing their profits: from the highly available connectivity services for key business customers to the unprotected or even best effort services for residential customers. These services are being provided through IP/multiprotocol label switching (MPLS) over wavelength-switched optical networks (WSON) networks. Such multilayer network enables the application of optimal load balancing between the packet and the optical layer, optimizing both the cost of the packet layer and the utilization of the WSON. To provide highly available services, redundant network resources need to be added to the network providing survivability against failures; generally speaking, the higher the survivability degree, the higher both the capital and the operational expenditures (CAPEX and OPEX, respectively) of the network. In this work, we design networks to meet specific availability objectives considering single failures in optical links, IP/MPLS nodes, and optoelectronic ports. The benefits of the designed networks are evaluated from an economic perspective defining costs and revenues models and using Net Present Value as a metric to evaluate future cash flows after an investment. To this end, CAPEX and OPEX, including power consumption and maintenance, and penalties as a consequence of service level agreement breaches are considered. Exhaustive numerical results on several reference network scenarios demonstrate how the value of the network can be maximized by tuning availability objectives.     

Benchmarking and viability assessment of optical packet switching for metro networks

Optical packet switching (OPS) has been proposed as a strong candidate for future metro networks. This paper assesses the viability of an OPS-based ring architecture as proposed within the research project DAVID (Data And Voice Integration on DWDM), funded by the European Commission through the Information Society Technologies (IST) framework. Its feasibility is discussed from a physical-layer point of view, and its limitations in size are explored. Through dimensioning studies, we show that the proposed OPS architecture is competitive with respect to alternative metropolitan area network (MAN) approaches, including synchronous digital hierarchy, resilient packet rings (RPR), and star-based Ethernet. Finally, the proposed OPS architectures are discussed from a logical performance point of view, and a high-quality scheduling algorithm to control the packet-switching operations in the rings is explained.     

Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks

Physical layer impairments severely limit the reach and capacity of optical systems, thereby hampering the deployment of transparent optical networks (i.e., no electrical signal regenerators are required). Besides, the high cost and power-consumption of regeneration devices makes it unaffordable for network operators to consider the opaque architecture (i.e., regeneration is available at every network node). In this context, translucent architectures (i.e., regeneration is only available at selected nodes) have emerged as the most promising short term solution to decrease costs and energy consumption in optical backbone networks. Concurrently, the coarse granularity and inflexibility of legacy optical technologies have re-fostered great interest in sub-wavelength switching optical networks, which introduce optical switching in the time domain so as to further improve resources utilization. In these networks, the complex regenerator placement and dimensioning problem emerges. In short, this problem aims at minimizing the number of electrical regenerators deployed in the network. To tackle it, in this paper both a greedy randomized adaptive search procedure and a biased random-key genetic algorithm are developed. Further, we enhance their performance by introducing both path-relinking and variable neighborhood descent as effective intensification procedures. The resulting hybridizations are compared among each other as well as against results from optimal and heuristic mixed integer linear programming formulations. Illustrative results over a broad range of network scenarios show that the biased random-key genetic algorithm working in conjunction with these two intensification mechanisms represents a compelling network planning algorithm for the design of future sub-wavelength optical networks.     

End-user traffic policing for QoS assurance in polyservice RINA networks

Telecommunication Systems - Looking at the ever-increasing amount of heterogeneous distributed applications supported on current data transport networks, it seems evident that best-effort packet...