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

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 all-optical 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.

[1]  Cédric Westphal,et al.  Scalable Routing Via Greedy Embedding , 2009, IEEE INFOCOM 2009.

[2]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[3]  J. Marti,et al.  160-Gb/s All-Optical Packet Switching Over a 110-km Field Installed Optical Fiber Link , 2008, Journal of Lightwave Technology.

[4]  Cédric Westphal,et al.  Scalable routing easy as PIE: A practical isometric embedding protocol , 2011, 2011 19th IEEE International Conference on Network Protocols.

[5]  Roger Wattenhofer,et al.  Greedy Routing with Bounded Stretch , 2009, IEEE INFOCOM 2009.

[6]  Christos H. Papadimitriou,et al.  On a Conjecture Related to Geometric Routing , 2004, ALGOSENSORS.

[7]  Didier Colle,et al.  All-optical tree-based greedy router , 2014, OFC 2014.

[8]  Didier Colle,et al.  Scalable and energy-efficient optical tree-based greedy router , 2013, 2013 15th International Conference on Transparent Optical Networks (ICTON).

[9]  Antonella Bogoni,et al.  All-Optical counter based on optical flip-flop and optical AND gate , 2009, 2009 35th European Conference on Optical Communication.

[10]  Mark Crovella,et al.  Hyperbolic Embedding and Routing for Dynamic Graphs , 2009, IEEE INFOCOM 2009.

[11]  Didier Colle,et al.  Power consumption modeling in optical multilayer networks , 2012, Photonic Network Communications.

[12]  L.R. Chen,et al.  All-Optical Swapping of Spectral Amplitude Code Labels for Packet Switching , 2007, 2007 Photonics in Switching.

[13]  J.E. Bowers,et al.  Payload-envelope detection and label-detection integrated photonic circuit for asynchronous variable-length optical-packet switching with 40-gb/s RZ payloads and 10-gb/s NRZ labels , 2006, Journal of Lightwave Technology.

[14]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

[15]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[16]  J. Marti,et al.  IST-LASAGNE: towards all-optical label swapping employing optical logic gates and optical flip-flops , 2005, Journal of Lightwave Technology.

[17]  Mingdong Tang,et al.  Tree Cover Based Geographic Routing with Guaranteed Delivery , 2010, 2010 IEEE International Conference on Communications.

[18]  Wouter Tavernier,et al.  Experimental validation of resilient tree-based greedy geometric routing , 2015, Comput. Networks.

[19]  S.J.B. Yoo,et al.  Optical Packet and Burst Switching Technologies for the Future Photonic Internet , 2006, Journal of Lightwave Technology.

[20]  Didier Colle,et al.  Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node Design , 2016, IEICE Trans. Commun..

[21]  Didier Colle,et al.  Robust geometric forest routing with tunable load balancing , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[22]  Ashwin Gumaste,et al.  OBiS: Optical bit switcing - a switch architecture for optical Omnipresent Ethernet , 2010, 2010 Conference on Optical Fiber Communication (OFC/NFOEC), collocated National Fiber Optic Engineers Conference.

[23]  Didier Colle,et al.  Fault-tolerant Greedy Forest Routing for complex networks , 2014, 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM).