Abstract
An important issue in the realization of optical packetswitched (OPS) networks is the resolution of packet contention caused by the lack of RAM-like optical buffering. Although an optical buffer using fiber delay lines (FDLs) has been proposed, its capacity is extremely limited. There have been several studies of this problem. One approach is deflection routing, which is widely used in electronic packet-switched networks or optical burst-switched (OBS) networks. However, in OPS networks, packet lengths are short, so that the speed requirement for route lookup is very stringent. If the network topology is geometric, such as a Manhattan Street Network (MSN), hop-by-hop routing can be implemented by simple optical logic devices without an electronic routing table. However, if the topology is not geometric, it is hard to implement deflection routing electronically or optically. Another approach is reflection routing, which is easy to implement but has a higher probability of packet loss than does deflection routing. In this paper, we propose a packet contention resolution scheme, reflection-based deflection routing, which is based on reflection routing and enables switching the reflected packet to an alternate path if its primary path remains congested. Our method alleviates the time limitation on setting an alternate path by making use of the packet reflection latency and also reduces the probability of packet loss. We evaluate the performance of the proposed method by simulation experiments and show its effectiveness.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.