OBS Ring Networks Research Articles

Distributed queue optical burst switched ring—A MAC protocol with zero blocking for OBS ring networks

Optical burst switching is a switching technology that is able to provide viable switching for optical internet with the present day technology. This paper presents a new medium access protocol for wavelength division multiplexing based optical burst switched metro ring network namely distributed queue optical burst switched ring (DQOBSR). It is a slotted, distributed queue access protocol with fixed bus structure and simple wavelength assignment. The topology consists of two unidirectional, counter rotating rings and the medium access protocol is based on distributed queuing. The protocol provides zero blocking with acceptable access delays. A mathematical model is also presented to determine the mean access delay which is the important performance parameter for the protocol. The simulation and model based results are compared and found to be in good agreement.

QoS Provisioning for TT-TR Based OBS Ring Networks

Abstract Optical burst switching (OBS) is one of the most promising switching technologies. This paper studies the efficient OBS ring network using the TT-TR based node architecture. The TT-TR based OBS ring network can use the network resources very efficiently, but the network performance is restricted due to the limited network resources. Moreover, different network demands have different network resource requirements. It is very important to satisfy their different requirements while using the limited network resources efficiently. In this paper, Quality of Service (QoS) provisioning mechanisms are studied to solve the above mentioned problems. Two kinds of network services, namely the real-time traffic and the best-effort traffic, are considered in this paper. The real-time service is delay-sensitive that should be transmitted in a real-time manner and cannot tolerate high transmission delay; while the best-effort traffic has no strict limitation in transmission delay or loss, but the best effort are made to improve their transmission reliability. According to their different servicing requirements, different QoS provisioning mechanisms are proposed to serve them in the OBS unidirectional and bidirectional ring networks, respectively. The proposed mechanisms are evaluated and analyzed through simulation. The simulation results show that even though the proposed mechanisms cannot get absolute zero-delay or zero-loss for real-time traffic or best-effort traffic, their different requirements for delay or loss are satisfied to some significant degree.

A novel collision free WDM optical switching network

To avoid burst collision in OBS-WDM ring network, a novel scheme called Estimated Traffic based Longest Queue First (ETLQF) has been proposed. In it, the scheduler considers both the queue length and the incoming traffic. The scheduler can adjust the queue lengths in advance to cater to the incoming traffic, targeting to reduce cell loss ratio (CLR) and improve the buffer utilization. The simulation results show that the ETLQF in OBS ring networks not only reduces CLR by 10–60%, but also achieves high throughput while saving 65% of wavelengths, when compared to conventional schemes with only destination delay.

Random scheduling based on transmission delay and buffer size for hop-based burst-cluster transmission in OBS networks

Hop-based burst-cluster transmission improves fairness significantly in OBS ring networks. However, in mesh networks, the overall burst loss probability increases using the method because the transmission of a burst-cluster from an ingress node is often synchronized with a burst-cluster from another ingress node. In order to resolve the synchronization issue, we propose in this article the utilization of random scheduling for hop-based burst-cluster transmission. In random scheduling, the maximum waiting time is determined in advance from the maximum acceptable delay of an IP packet and the buffer size of the ingress node. Every time a burst-cluster is generated, a scheduler derives the actual waiting time at random based on the obtained maximum waiting time. When a timer becomes the actual waiting time, the burst cluster is transmitted from the scheduler. By simulation, we evaluate the effectiveness of random scheduling for NSFNET. Numerical examples show that the random scheduling can resolve the synchronization issue and can decrease the overall burst loss probability. In addition, it is shown that random scheduling can also improve the fairness significantly.

A novel and simple beforehand bandwidth reservation (BBR) MAC protocol for OBS metro ring networks

This paper proposes a novel and simple MAC protocol called beforehand bandwidth reservation (BBR) to reserve the empty slots in the next big-slot cycle for OBS ring networks by control channel. The node architecture uses one tunable transmitter and one fixed receiver to add or drop data channels and a fixed transmitter/receiver pair to transmit and receive on the control channel. Each node possesses a dedicated channel to receive data, so it inherently occupies a priority position. Fortunately, a well-known packet scheduling approach, time-division multiplexing (TDM), can overcome this problem. In addition, the length of the big-slot cycle is studied with a view to investigating performance divergence. Finally, a multi-token protocol using the (FT W-FR W) node architecture is compared with the BBR protocol. According to simulation results, the BBR scheme using the TDM approach achieves the best bandwidth utilization (more than 95%), while the multi-token protocol achieves the worst performance based on packet distribution in the MCI backbone.