1 / 37

Routing in Large-Scale Self-organized Networks

Routing in Large-Scale Self-organized Networks. Serge Fdida LIP6-CNRS / Université Paris 6 http://www.lip6.fr/rp/~sf. Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST -IST (EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN N ETWORKING. Fdida.

elie
Download Presentation

Routing in Large-Scale Self-organized Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Routing in Large-Scale Self-organized Networks Serge Fdida LIP6-CNRS / Université Paris 6 http://www.lip6.fr/rp/~sf NeXtworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Fdida

  2. Future Networking Issues • Routing is hard! • BGP • Multicast • Mobile • Ad-Hoc • P2P NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  3. New routing paradigms • Very Large Scale • Human Users & Machines • Ambiant networking, BGP scaling, • Complexity in the routing table states • Mobile • Same reasons plus PDAs, Phones, embedded devices • Convolution of transfert functions • Overlays • Simpler to deploy, Content access • Dedicated NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  4. Routing formalization? • ? We need to re-assess the relationship between • Address • Location (physical) • Route computation • State complexity • ? Decouple • Physical network topology • « Logical » network topology NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  5. Routing semantics and operation LOCATION L LIP6 f(@)=L ROUTING Transfert Function f Sender’s @ Chania 195.167.42.37 IP Network Receiver’s @ Paris 132.227.74.253 NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  6. ROUTING = Transfer Function What if Dynamicity in Time, Space? NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  7. Mobile, Multicast, QoS, Content Access, … NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  8. Examples: Node X, Network adress @_X, Location L • IP routing • AS_x = f(IP@_X), f={RIP, OSPF, IS-IS} • If X Moves! f does not return « L » • Mobile IP • Location L = f(g(IP@_X), g=HA, f=FA • Two transfert functions are required (convolution) • Geographic routing • Location L = f(GPS_X), GPS_X =(Lat,Long) • GPS required, but Stateless NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  9. Exemples:Node X, Network adress @_X, Location L • Route Server • @_X = get(Serv), @Serv is known • L = f(@_X ), Two-phase • MPOA/NHRP • Content access • Data = f(key), f=Distributed Hash Table • f : See Chord, Pastry, Can, … NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  10. Underlay / Overlay Topology A D B F E C NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  11. Overlay Topologies TAPESTRY CHORD CAN NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  12. Problem formalization • Does it exist : • An addressing structure • An associated mathematical space • that ease routing content to mobile nodes • in a self-organized network NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  13. Main problems • Addressing structure • How many addresses per node • Of what type, use? • Impact on the topological space • Routing in a mathematical space • Mapping a multi-dimensional data to a one-dimensional value • Robust to mobility NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  14. Region continuity • How can you enforce region continuity when a node leaves/moves? • Need a multi-dimension space • Should be robust to mobility • Should scale : balance responsabilities NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  15. Requirements • Consecutively ordered points should be adjacent in space • Can represent a space of multi-dimensions in one dimension • The space should be partitioned in a recursive way, • A node leaving the network don’t cause a inconsistency of the routing procedure • Many paths can be used NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  16. 1 2 0 3 63 15 The Underlay Dimension Adressing space Adressing space Topology NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  17. Illustration with an example:Indirect routing using distributed location information Aline Viana1,2, Marcelo Amorim1, Serge Fdida1, and José Rezende2 LIP6 Laboratory University of Paris VI www.lip6.fr GTA/COPPE Fed. Univ. Rio de Janeiro www.gta.ufrj.br

  18. H 1 network 2 3 B A Indirect routing • Separation between node identifier and node address ANCHOR Node Sender Receiver NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  19. Node’s roles • Identification • Universal identifier U • Uniquely identifies a node in the real system • Virtual identifier V • Uniquely identifies a node in the virtual topology • Relative (topology-dependent) address E • Mapping of U in a value belonging to the relative addressing space • Utilization of a DHT, known by all nodes of the topology NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  20. The relative address E: identifies the relative location of the node ( ) For the first node at t=0: Topology creation • The nodes are identified by their relative addresses, which are based on their neighborhood (mobile nodes) • When a node joins the network, it receives a control region from one of its neighbors • The addressing space is a segment [0, 2n[ NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  21. Topology creation • Node n first identifies its neighbors when it joins the network • Among these neighbors, the one which has the largest region will become the n's parent neighbor • The parent neighbor then gives to n a part of its own control region NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  22. a0 a1 = p a 1 Topology creation (example) NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  23. a0 a1 a2 Topology creation (example) NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  24. a0 a3 a1 a2 Topology creation (example) NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  25. a0 a3 a1 a2 a4 Topology creation (example) NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  26. a0 a3 a1 a2 an a4 Topology creation (example) NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  27. a0 a3 a1 a2 an a4 Topology creation (example) NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  28. Types of address • The universal identifier U • The virtual identifier V • Used for identifying a node's anchor • The Anchor node behaves as a Home Agent for a set of nodes in its controlled region • The relative address E • Identifies a unique node in the logical network • Changes when node moves • Used for routing NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  29. Locating nodes • The n's anchoris node hwhose control region contains the virtual address Vn • Node h is identified by its relative address Eh • Node a wants to contact node b • a knows Vb=f(Ub) • a sends a search message to the neighbor whose control region gets the message as close as possible to Vb • The message is routed hop by hop until it reaches the node that contains Vb • The anchor node responds to a with a message containing the current b's relative address • Node b had already informed h about its current position NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  30. a0 a3 a1 a2 an a4 Tribe register procedure register register NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  31. a0 a3 a1 a2 an a4 Tribe location procedure search search NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  32. a0 a3 a1 a2 an a4 Tribe location procedure located located NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  33. a0 a3 a1 a2 an a4 Tribe location procedure data data data data NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  34. Region continuity • Guarantee that an abandoned control region is taken over by a remaining node • The parent neighbor is responsible for managing this region • If the abandoned region can be merged with the parent node’s region • OK! • If not • A region reassignement must be executed in order to guarantee the region continuity NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  35. an Misrouting NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  36. Misrouting NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

  37. Reference • Indirect Routing Using Distributed Location InformationViana Aline c., Dias de amorim Marcelo, Fdida Sergeand Rezende José F.IEEE International Conference on Pervasive Computing and Communications (PerCom) Dallas-Fort Worth, Texas - March, 2003 • http://www-rp.lip6.fr • publications NeXtworking’03June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING

More Related