A fast scheduling algorithm for all-optical shared-buffer packet switches

An all-optical packet switching using bistable photonic crystal nanocavity memories was demonstrated for the first time. Nanocavity-waveguide coupling systems were configured for 1 × 1, 1 × 2, and 1 × 3 switches for 10-Gb/s optical packet, and they were all operated with an optical bias power of only a few μW. The power is several magnitudes lower than that of previously reported all-optical packet switches incorporating all-optical memories. A theoretical investigation indicated the optimum design for reducing the power consumption even further, and for realizing a higher data-rate capability and higher extinction. A small footprint and integrability are also features of our switches, which make them attractive for constructing an all-optical packet switching subsystem with a view to realizing optical routing on a chip.

All-optical packet switching (AOPS) technology is essential to fully utilize the tremendous bandwidth provided by advanced optical communication techniques through forwarding packets in optical domain for the next generation network. However, long packet headers and other complex operations such as table lookup and packet header re-writing still have to be processed electronically for lack of cost-effective optical processing techniques. This not only increases system complexity but also limits packet forwarding speed due to optical-electronic-optical conversion. Lots of work of improving optical processing techniques to realize AOPS is reported in the literature. Differently, this paper proposes a new networking structure to facilitate AOPS realization and support various existing networks through simplifying networking operations. This structure only requires an AOPS node to process a short packet header to forward packets across it with neither table lookup nor header re-writing. Furthermore, it moves high layer addressing issues from packet forwarding mechanisms of routers. Consequently, any changes in addressing schemes such as address space extension do not require changes in the AOPS nodes. It can also support both connection-oriented and connectionless services to carry various types of traffic such as ATM and IP traffic. This structure is mainly based on the hierarchical source routing approach. The analytical results show that average packet header sizes are still acceptable even for long paths consisting of many nodes each of which has a large number of output ports.

An evaluation of fair packet schedulers using a novel measure of instantaneous fairness

The large growth of telecommunication traffic demand generated by multiple new applications and expected to last at least for the next decade will force telecom operators to consider offering more flexible transport services. All-optical packet switching is a powerful technique to provide this flexibility and to support in a cost-efficient way a wide range of bandwidth consuming applications. After a very brief introduction about the packet-switched network architecture studied in the framework of the ACTS KEOPS project, we describe the structure of the packet-switching node we have defined. We then move into physical and logical analysis of the network including more than 40 network sections based on 160 Gb/s throughput optical packet switching nodes could operate error free. In addition, logical simulations have proved that such networks could provide a quality of service (packet loss rate and packet transfer delay per node) compatible with a large variety of service classes. Both results validate the feasibility of the network concept and pace the way toward a flexible network based on all-optical switching techniques.

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> Photonic integration of an all-optical packet switch (AOPS) is a crucial issue since it leads to a great reduction of volume, power consumption, and costs. Recently, a 1<formula formulatype="inline"><tex Notation="TeX">$\, \times \,$</tex></formula>4 AOPS was successfully demonstrated by using an all-optical label extractor/eraser. The label extractor/eraser was implemented by means of fiber Bragg gratings and optical circulators that prevent the photonic integration of the AOPS. Here, we demonstrate a passive and asynchronous photonic integrated all-optical label extractor/eraser by using narrowband silicon–nitride add–drop ring-resonators. By exploiting the narrow bandwidth of the drop port and pass-through port error-free simultaneous separation/erasing of the in-band labels from the 160-Gb/s packet payload was demonstrated without noticeable pulse-shape distortions. </para>

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more.

All-optical packet switching can overcome limitations of electronic switches in terms of power consumption, speed, cost, and footprint. Switch architectures combining wavelength converters and fiber delay lines provide tunable routing and contention resolution when used with an N×N arrayed waveguide grating (AWG), a key passive optical component to bypass electronic processing limitations. An AWG passively routes either single or multiple input port wavelengths to output ports. A single wavelength per port strategy reduces crosstalk within the AWG, but drastically increases the dimensionality of the device. AWG design constraints due to bandwidth limitations and fabrication processes limit the port number for the foreseeable future to under 100. In order to scale optical switches to emerging network requirements, we must use multiple wavelengths per port. In this paper, we examine several optical router architectures for data center applications using multiple wavelengths per port, and quantify the physical layer impairments. We consider not only the AWG crosstalk, but also Q-factor degradation caused by the multiple wavelength conversions occurring when a packet is buffered for contention resolution. We present the results as a function of the number of recirculations for on–off-keying (OOK) signal formats. While previous work has addressed this issue in terms of accumulated loss, we focus on accumulated intensity noise due to crosstalk and amplified spontaneous emission (ASE). We compare the routing performance of each architecture, and we point out that the AWG crosstalk and accumulated ASE noise during packet recirculation are both critical to the routing performance.

Packet-switched routers need buffers during times of congestion. We show that a combined input-output queued router needs no more buffering than an output queued router. Using simulations, we show that 10-20 packet buffers are enough.

We present a 1 × 2 all-optical packet switch. All the processing of the header information is carried out in the optical domain. The optical headers are recognized by employing the two-pulse correlation principle in a semiconductor laser amplifier in loop optical mirror (SLALOM) configuration. The processed header information is stored in an optical flip-flop memory that is based on a symmetric configuration of two coupled lasers. The optical flip-flop memory drives a wavelength routing switch that is based on cross-gain modulation in a semiconductor optical amplifier. We also present an alternative optical packet routing concept that can be used for all-optical buffering of data packets. In this case, an optical threshold function that is based on a asymmetric configuration of two coupled lasers is used to drive a wavelength routing switch. Experimental results are presented for both the 1 × 2 optical packet switch and the optical buffer switch.

Packet switching remains one of the bottlenecks in building fast Internet routers. Load balancing and switch scheduling are two important algorithms in the effort to maximize the throughput and minimize the latency of these packet switches. A load balancing algorithm regulates the traffic to conform to the service rates while a switch scheduling algorithm allocates the service rates adaptive to the arrival patterns. Many existing load balancing and switch scheduling algorithms are very similar. We show that load balancing and switch scheduling systems are dual systems based on the linear queue dynamics approximation. This allows us to cast a load balancing problem as a scheduling problem, and vice versa. We further show an example of designing a new algorithm for load balancing using an existing scheduling algorithm based on the duality. The duality perspective also allows us to solve unknown problems. We find the entropy rate of the randomized bandwidth allocation system with linear queue dynamics based on the knowledge of the entropy rate of the randomized load balancing system. For the general case, we find both an upper and a lower bound on the entropy rate. The joint use of dual load balancing and switch scheduling algorithms leads to performance gains as we show using mean field analysis.

Current developments in optical components technologies enable wavelengths to be very narrowly spaced, transforming the optical fiber into a multi-terabit capacity medium. A new generation of cross-connects started to appear in the market leading to a number of advantages such as increased switching capacity, decreased overall network costs, scalability and transparency resulting in the capability to support any protocol. An additional advantage is the ability to configure the switching fabric and the wavelength converters in real-time. All-optical switches are made possible by a number of technologies that allow the managing and switching photonic signals without converting them into electronic signals. Only a couple of technologies appear ready to make the transition form the laboratory to the network, where they must support the basic feature set of a carrier-grade, scalable optical switches. Arguably, the leading technology for developing an economically viable, scalable all-optical , OOO switch is the 3D micro-electromechanical system (MEMS). 3D MEMS uses control mechanisms to tilt mirrors in multiple directions (3 dimensional). For the control of optical cross-connects, the MP Lambdas approach was proposed by IETF, according to which the MPLS traffic engineering control plane is used in optical cross connects. In this paper, evolution of architectures for optical cross-connects all optical switch are discussed with different switch fabrics such as micro-electro-mechanical all optical switch fabric and arrayed-wavelength-grating routers (AWGRs). The paper includes also an illustration of the major function of the multi protocol label switching MPLS optical router and the use of MP lambda switch to control the all optical switch.

We address the problem of congestion resolution in optical packet switching (OPS). We consider a fairly generic all-optical packet switch architecture with a feedback optical buffer constituted of fiber delay lines (FDL). Two alternatives of switching granularity are addressed for a switch operating in a slotted transfer mode: switching at the slot level (i.e., fixed length packets of a single slot) or at the burst level (variable length packets that are integer multiples of the slot length). For both cases, we show that in spite of the limited queuing resources, acceptable performance in terms of packet loss can be achieved for reasonable hardware resources with an appropriate design of the time/wavelength scheduling algorithms. Depending on the switching units (slots or bursts), an adapted scheduling algorithm needs to be deployed to exploit the bandwidth and buffer resources most efficiently.

The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling algorithms has mainly focused on maximum weight matching scheduling algorithms. It is known that maximum weight matching algorithms guarantee the stability of input-queued switches, but are impractical due to their high computational complexity. Later research showed that the less complex maximal matching algorithms can stabilize input-queued switches when they are deployed with a speed-up of two. For practical purposes, neither a high computational complexity nor a speed-up of two is desirable.In this paper, we investigate the application of matching algorithms that approximate maximum weight matching algorithms to scheduling problems. We show that while having a low computational complexity, they guarantee the stability of input queued switches when they are deployed with a moderate speed-up.In particular, we show that the improve_matching algorithm stabilizes input-queued switches when it is deployed with a speed-up of 3&lt;over&gt;2+ε.In a second step, we further improve on these results by proposing a class of maximal weight matching algorithms that stabilize an input-queued switch without any speed-up.Whereas initial research has only focused on scheduling algorithms that guarantee the stability of a single switch, recent work has shown how scheduling algorithms for single switches can be modified in order to design distributed scheduling algorithms that stabilize networks of input-queued switches. Using those results, we show that the switching algorithms proposed in this paper do not only stabilize a single switch, but also networks of input-queued switches.

This paper proposes a new class of online policies for scheduling in input-buffered crossbar switches. Given an initial configuration of packets at the input buffers, these policies drain all packets in the system in the minimal amount of time provided that there are no further arrivals. These policies are also throughput optimal for a large class of arrival processes which satisfy strong-law of large numbers. We show that it is possible for policies in our class to be throughput optimal even if they are not constrained to be maximal in every time slot.Most algorithms for switch scheduling take an edge based approach; in contrast, we focus on scheduling (a large enough set of) the most congested ports. This alternate approach allows for lower-complexity algorithms, and also requires a non-standard technique to prove throughput-optimality. One algorithm in our class, Maximum Vertex-weighted Matching (MVM) has worst-case complexity similar to Max-size Matching, and in simulations shows slightly better delay performance than Max-(edge)weighted-Matching (MWM).

This paper proposes a new class of online policies for scheduling in input-buffered crossbar switches. Given an initial configuration of packets at the input buffers, these policies drain all packets in the system in the minimal amount of time provided that there are no further arrivals. These policies are also throughput optimal for a large class of arrival processes which satisfy strong-law of large numbers. We show that it is possible for policies in our class to be throughput optimal even if they are not constrained to be maximal in every time slot. Most algorithms for switch scheduling take an edge based approach; in contrast, we focus on scheduling (a large enough set of) the most congested ports. This alternate approach allows for lower-complexity algorithms, and also requires a non-standard technique to prove throughput-optimality. One algorithm in our class, Maximum Vertex-weighted Matching (MVM) has worst-case complexity similar to Max-size Matching, and in simulations shows slightly better delay performance than Max-(edge)weighted-Matching (MWM).