Colle, Didier

Pickavet, Mario

Sahhaf, Seyedeh Sahel

English

Ghent University Academic Bibliography

Greedy Routing in Future InternetSeyedeh Sahel SahhafInformation Technology, Ghent UniversitySupervisor(s): Didier Colle, Mario PickavetNowadays, a message can leave one computer and travel halfway across the world throughseveral different networks and arrive at another computer in less than a second. Routers are re-sponsible to determine where to send information from one computer to another. They use a tableincluding the routes to particular network destinations. In Internet, messages are sent in the formof packets containing the source and the destination addresses of that packet. Once a packet ar-rives at a router, the router checks the destination address of it and based on the information in itsrouting table, it determines the next hop of the packet towards the destination. In this process, therouting table is similar to the road signs (arrows) which give directions to certain destinations.Internet traffic keeps growing, the routing table sizes are increasing and higher speed links are de-manded. The number of entries in the routers are expected to increase to 2 million in near future.Also the address lookup is becoming a bottleneck due to ever increasing throughput demands.Going back to our comparison of routing tables and road signs, with more destinations, the num-ber of road signs increases and also finding the correct direction to the intended destination willbe more difficult.As a solution, greedy routing is proposed to replace address lookups with computation. In thisscheme, each network node is assigned a coordinate. This coordinate can be the physical loca-tion of a node or a virtual one. Network nodes knowing the coordinates of their neighbors couldroute greedy, by forwarding incoming packets to the neighbors which are closer to the packet’sdestination such that the distance towards the packets destination decreases. This scheme only re-quires nodes to store the coordinates of their neighbors in order to make routing decisions whichmakes it more memory efficient than current routing schemes.The scheme also shows interestingcharacteristics in terms of routing quality.

Greedy routing in future internet

https://biblio.ugent.be/publication/3260572/file/3260574.pdf

Greedy routing in future internet

Abstract

Similar works

Full text

Available Versions

Ghent University Academic Bibliography