Multiservice QoS-Enabled MAC for Optical Burst Switching

The emergence of a broad range of network-driven applications (e.g., multimedia, online gaming) brings in the need for a network environment able to provide multiservice capabilities with diverse quality-of-service (QoS) guarantees. In this paper, a medium access control protocol is proposed to support multiple services and QoS levels in optical burst-switched mesh networks without wavelength conversion. The protocol provides two different access mechanisms, queue-arbitrated and prearbitrated for connectionless and connection-oriented burst transport, respectively. It has been evaluated through extensive simulations and its simplistic form makes it very promising for implementation and deployment. Results indicate that the protocol can clearly provide a relative quality differentiation for connectionless traffic and guarantee null (or negligible, and thus acceptable) burst loss probability for a wide range of network (or offered) load while ensuring low access delay for the higher-priority traffic. Furthermore, in the multiservice scenario mixing connectionless and connection-oriented burst transmissions, three different prearbitrated slot scheduling algorithms are evaluated, each one providing a different performance in terms of connection blocking probability. The overall results demonstrate the suitability of this architecture for future integrated multiservice optical networks

A Performance Comparison According to Number of Wavelengths and Topologies on PCSA Reservation Mechanism for OBS

Abstract A performance comparison according to different number of wavelengths and topologies on OBS has been studied in this paper. Preemptive Channel Scheduling Algorithm (PCSA) has been used as reservation mechanism in OBS. In terms of performance criteria, loss rate in bytes, access delay and end-to-end delay are considered. A 2-state MMPP (Markov Modulated Poisson Process) traffic generator is used. Four different types of Mesh and Ring topologies are used. NS2 Network Simulation tool is used for our tests. In OBS algorithms, bursts are created using a hybrid model that takes into account both timeout and maximum length threshold mechanisms. In nodes, in order to satisfy QoS requirements, priority based queuing and Regulative Wavelength Grouping (RWG) are used. In priority based queuing, packets (bursts) are sent according to their priority order. In this study, the effects of generated traffic according to the topologies and the effects of increased number of wavelengths are shown by access delays. According to the simulation studies, the success of byte drop rate increases while the number of wavelengths increases. The results that obtained on mesh topologies are better than the results of ring topologies according to our simulation results

Impatient Queuing for Intelligent Task Offloading in Multi-Access Edge Computing

Multi-access edge computing (MEC) emerges as an essential part of the upcoming Fifth Generation (5G) and future beyond-5G mobile communication systems. It adds computational power towards the edge of cellular networks, much closer to energy-constrained user devices, and therewith allows the users to offload tasks to the edge computing nodes for low-latency applications with very-limited battery consumption. However, due to the high dynamics of user demand and server load, task congestion may occur at the edge nodes resulting in long queuing delay. Such delays can significantly degrade the quality of experience (QoE) of some latency-sensitive applications, raise the risk of service outage, and cannot be efficiently resolved by conventional queue management solutions. In this article, we study a latency-outage critical scenario, where users intend to limit the risk of latency outage. We propose an impatience-based queuing strategy for such users to intelligently choose between MEC offloading and local computation, allowing them to rationally renege from the task queue. The proposed approach is demonstrated by numerical simulations to be efficient for generic service model, when a perfect queue status information is available. For the practical case where the users obtain only imperfect queue status information, we design an optimal online learning strategy to enable its application in Poisson service scenarios.Comment: To appear in IEEE Transactions on Wireless Communication

Throughput-Delay Trade-Offs in Slotted WDM Ring Networks

International audienceWe analyse the throughput-delay trade-offs that arise in an optical burst-switched slotted WDM ring, where each node can transmit and receive on a subset of the available wavelengths. Specifically, we compare SWING, an access control scheme that combines opportunistic transmission and dynamic reservations, with a purely opportunistic access scheme. By means of analysis, we highlight the shortcomings of the opportunistic scheme in terms of load balancing and fairness. We then evaluate the performance of both schemes by simulation under several traffic scenarios and show that SWING yields a good throughput-delay trade-off

Research on optical core networks in the e-Photon/ONe network of excellence

This papers reports the advances in Optical Core networks research coordinated in the framework of the e-Photon/ONe and e-Photon/ONe+ networks of excellence

Improving Routing Efficiency, Fairness, Differentiated Servises And Throughput In Optical Networks

Wavelength division multiplexed (WDM) optical networks are rapidly becoming the technology of choice in next-generation Internet architectures. This dissertation addresses the important issues of improving four aspects of optical networks, namely, routing efficiency, fairness, differentiated quality of service (QoS) and throughput. A new approach for implementing efficient routing and wavelength assignment in WDM networks is proposed and evaluated. In this approach, the state of a multiple-fiber link is represented by a compact bitmap computed as the logical union of the bitmaps of the free wavelengths in the fibers of this link. A modified Dijkstra\u27s shortest path algorithm and a wavelength assignment algorithm are developed using fast logical operations on the bitmap representation. In optical burst switched (OBS) networks, the burst dropping probability increases as the number of hops in the lightpath of the burst increases. Two schemes are proposed and evaluated to alleviate this unfairness. The two schemes have simple logic, and alleviate the beat-down unfairness problem without negatively impacting the overall throughput of the system. Two similar schemes to provide differentiated services in OBS networks are introduced. A new scheme to improve the fairness of OBS networks based on burst preemption is presented. The scheme uses carefully designed constraints to avoid excessive wasted channel reservations, reduce cascaded useless preemptions, and maintain healthy throughput levels. A new scheme to improve the throughput of OBS networks based on burst preemption is presented. An analytical model is developed to compute the throughput of the network for the special case when the network has a ring topology and the preemption weight is based solely on burst size. The analytical model is quite accurate and gives results close to those obtained by simulation. Finally, a preemption-based scheme for the concurrent improvement of throughput and burst fairness in OBS networks is proposed and evaluated. The scheme uses a preemption weight consisting of two terms: the first term is a function of the size of the burst and the second term is the product of the hop count times the length of the lightpath of the burst