# grr9

### Summary

Sahhaf, S., Dixit, A, Tavernier, W., Colle, D., Pickavet, M. and Demeester, P. (2013) Scalable and energy-efficient optical tree-based greedy router. In Transparent Optical Networks (ICTON), 2013 15th International Conference on. June, pages 1-4.

### Abstract

The IP prefix lookup as a core function of today's Internet routers is becoming a bottleneck due to ever increasing throughput demands. The increase in the size of the routing tables limits the scalability of current routing architecture. Greedy routing as an alternative to IP routing does not require lookups in order to find the next hop, and neither requires storing a forwarding table in every node. In this routing, network nodes are assigned coordinates' and the incoming packets are forwarded to the neighbours which are closer to the packets destinations. In this paper, a novel all-optical greedy router has been designed. In order to perform the greedy routing, each node is assigned an ID which determines the location of the node in the spanning tree of the network. The router is constructed through the interconnection of SOAs and directional couplers. The circuit provides high data rate and is more scalable and more energy-efficient than conventional IP routers.

### Bibtex entry

@INPROCEEDINGS { grr9,    AUTHOR = { Sahhaf, S. and Dixit, A and Tavernier, W. and Colle, D. and Pickavet, M. and Demeester, P. },    BOOKTITLE = { Transparent Optical Networks (ICTON), 2013 15th International Conference on },    TITLE = { Scalable and energy-efficient optical tree-based greedy router },    YEAR = { 2013 },    MONTH = { June },    PAGES = { 1-4 },    ABSTRACT = { The IP prefix lookup as a core function of today's Internet routers is becoming a bottleneck due to ever increasing throughput demands. The increase in the size of the routing tables limits the scalability of current routing architecture. Greedy routing as an alternative to IP routing does not require lookups in order to find the next hop, and neither requires storing a forwarding table in every node. In this routing, network nodes are assigned coordinates' and the incoming packets are forwarded to the neighbours which are closer to the packets destinations. In this paper, a novel all-optical greedy router has been designed. In order to perform the greedy routing, each node is assigned an ID which determines the location of the node in the spanning tree of the network. The router is constructed through the interconnection of SOAs and directional couplers. The circuit provides high data rate and is more scalable and more energy-efficient than conventional IP routers. },    DOI = { 10.1109/ICTON.2013.6603037 },    ISSN = { 2161-2056 },}