All-optical tree-based greedy router using optical logic gates and optical flip-flops

Abstract

Due to ever increasing throughput demands the lookup in conventional IP routers based on longest prefix matching is becoming a bottleneck. Additionally, the scalability of current routing protocols is limited by the size of the routing tables. Geometric greedy routing is an alternative to IP routing which replaces longest prefix matching with a simple calculation employing only local information for packet forwarding. For the first time, in this paper we propose a novel and truly alloptical geometric greedy router based on optical logic gates and optical flip-flops. The circuit of the router is constructed through the interconnection of SOAs and directional couplers. The successful functionality of the proposed router is verified through simulation. The circuit enables high data rate throughput.

Design and Implementation of Nanotechnology QCA Geometric Greedy Router

“…e coordinate distribution is based on other ad hoc network protocols or sensors, such as greedy perimeter stateless routing (GPSR) [15]. In [16], the authors have proposed the use of virtual coordinates in NoGeo routing, the creation of the virtual coordinate assignment protocol (VCAP), and the use of conformal maps to find the coordinates [17]. In GR, a greedy technique is used.…”