A unified study of contention-resolution schemes in optical packet-switched networks

Yao, Shun; Mukherjee, Biswanath; Yoo, S. J. B.; Dixit, Sudhir

doi:10.1109/jlt.2003.809573

Cited by 247 publications

(11 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Once packet contention occurs at electrical switch node, the packets lost the contention in current time slot would still get chance (retransmit) in the following time slots. Since no practical optical buffers exist, the conflicted optical packets at the optical switch would be dropped, thereby resulting in high packet loss [22]. Thus, to prevent the packet contention caused packet loss, an OFC technique is developed in the proposed reconfigurable network.…”

Section: Optical Flow Control (Ofc) Techniquementioning

confidence: 99%

Automatically reconfigurable optical data center network with dynamic bandwidth allocation

Xue

Prifti

Pan

et al. 2021

J. Opt.

View full text Add to dashboard Cite

The rapid increasing traffic in data centers (DCs) puts tremendous pressure to the present multi-tier network architectures and electrical switching techniques. Switching traffic in the optical domain featuring ultra-high bandwidth, therefore, has been intensively investigated to build the high capacity data center networks (DCNs). To handle the variable traffic pattern in DCs, the network reconfigurability with adaptable optical bandwidth allocation is of key importance to flexibly assign the optical bandwidth. To this end, we propose and experimentally evaluate a software-defined networking enabled reconfigurable optical DCN with dynamic bandwidth allocation in this work, based on novel optical top of racks exploiting a wavelength selective switch. Experimental assessments show that the proposed solution can automatically reallocate the optical bandwidth in real-time to adapt the dynamic traffic pattern. Compared with the conventional optical DCN with static bandwidth provision, the end-to-end latency performance of the reconfigurable scheme with adaptable bandwidth allocation improves of 58.3% and the average packet loss decreases one order of magnitude. Moreover, the reconfigurable optical DCN features deterministic latency performance, with much lower time variations of packets delivery completion. Based on the experimental parameters, the simulation platform is also built to validate the good scalability of the proposed reconfigurable DCN. Numerical results illustrate the negligible performance degradation (11%) as the network scales from 2560 to 40 960 servers.

show abstract

Section: Optical Flow Control (Ofc) Techniquementioning

confidence: 99%

Automatically reconfigurable optical data center network with dynamic bandwidth allocation

Xue

Prifti

Pan

et al. 2021

J. Opt.

View full text Add to dashboard Cite

show abstract

“…Since the advent of OBS, also the counterpart with variable-length packets/bursts is studied, and often contrasted with the fixed-length case [1, 3-6, 8, 10, 11, 15, 20-22, 24, 28, 30]. The most common description of contention resolution, as discussed in [30], is done along three different dimensions, namely (i) wavelength (wavelength conversion), (ii) time (optical buffering) and (iii) space (deflection or alternate routing).…”

Section: 1mentioning

confidence: 99%

“…Secondly, optical buffering consists in delaying packets/bursts that find a resource unavailable by sending it through a piece of fiber of sufficient length, so that the resource is available again when the packet/burst leaves the delay line [1,2,9,10,20,21,24]. Thirdly, in a multi-fiber setting, deflection or alternate routing consists in routing packets/bursts that find a resource unavailable to another node through an different, available output fiber [5,12]; this is done preferably topology-and congestion-aware [30]. The interplay of these dimensions is discussed extensively also in [5].…”

Section: 1mentioning

confidence: 99%

On the optimality of packet-oriented scheduling in photonic switches with delay lines

Rogiest¹,

Turck²,

Laevens³

et al. 2011

Numerical Algebra, Control &Amp; Optimization

View full text Add to dashboard Cite

Abstract. Addressing the bandwidth inefficiency problem of current IP over DWDM backbone switching, Optical Packet/Burst Switching (OPS/OBS) provide viable solutions, capitalizing on statistical multiplexing gain, through packet-oriented scheduling. To resolve packet/burst contention, the involved photonic switches contain wavelength converters and fiber delay lines, controlled through a channel and delay selection (CDS) algorithm. Recently proposed CDS algorithms all rely on heuristics, of which the optimality is unexamined to date.This paper presents an in-depth analysis of the optimality of CDS algorithms. Methodologically, we rely on Markov chain analysis for performance evaluation, combined with a discrete Markov Decision Process formulation of the optimization problem, optimized for fast calculation, allowing to determine the exact optimum of a specific given setting of the switch, through numerical algebra solution techniques. Results point out that, for the basic switch setting assumed, of all known CDS algorithms, an algorithm called MING (MINimal Gap) is close to optimal, but never strictly optimal. Various graphs support this, showing that an algorithm optimal for any traffic load cannot (in general) be devised. Results for several other switch settings further confirm this, showing how known CDS algorithms might be modified, to attain improved control robustness.

show abstract

“…The increasing number of mission-critical services such as e-banking, e-voting and emergency services put a high demand on the Quality of Service (QoS) of the future Internet, including OPS/OBS networks. Specifically, the OPS/OBS network has to provide low packet loss rate (performance) [18], [19], [26], [27], protection against node and link failures (survivability) [5], [20], as well as being able to withstand targeted eavesdropping attacks from individuals and organizations (secrecy) [11].…”

Section: Introductionmentioning

confidence: 99%

Coded Packet Transport for Optical Packet/Burst Switched Networks

Kralevska

Øverby

Gligoroski

2015

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

This paper presents the Coded Packet Transport (CPT) scheme, a novel transport mechanism for Optical Packet/Burst Switched (OPS/OBS) networks. The CPT scheme exploits the combined benefits of source coding by erasure codes and path diversity to provide efficient means for recovering from packet loss due to contentions and path failures, and to provide non-cryptographic secrecy. In the CPT scheme, erasure coding is employed at the OPS/OBS ingress node to form coded packets, which are transmitted on disjoint paths from the ingress node to an egress node in the network. The CPT scheme allows for a unified view of Quality of Service (QoS) in OPS/OBS networks by linking the interactions between survivability, performance and secrecy. We provide analytical models that illustrate how QoS aspects of CPT are affected by the number of disjoint paths, packet overhead and processing delay.

show abstract

A unified study of contention-resolution schemes in optical packet-switched networks

Cited by 247 publications

References 34 publications

Automatically reconfigurable optical data center network with dynamic bandwidth allocation

Automatically reconfigurable optical data center network with dynamic bandwidth allocation

On the optimality of packet-oriented scheduling in photonic switches with delay lines

Coded Packet Transport for Optical Packet/Burst Switched Networks

Contact Info

Product

Resources

About