1 / 15

Tomer Tankel Dept. of Electrical Eng. – Systems

Multi-level Proximity Routing and its applications for Networking. Tomer Tankel Dept. of Electrical Eng. – Systems. Problems : Using Measurement for distance estimation Routing in fixed and Ad Hoc networks Navigation in Traffic Networks Applications : Closest mirror selection

smithkevin
Download Presentation

Tomer Tankel Dept. of Electrical Eng. – Systems

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. Multi-level Proximity Routing and its applications for Networking Tomer Tankel Dept. of Electrical Eng. – Systems

  2. Problems: Using Measurement for distance estimation Routing in fixed and Ad Hoc networks Navigation in Traffic Networks Applications: Closest mirror selection Given a set of servers, si 1≤i≤K, and a client, c, find a server sj, s.t., i1≤i≤K d(sj,c)≤ αd(si,c)+β Content Distribution in P2P networks Real-Time Vehicle Routing Server Problem and Applications

  3. Distance Estimation/Routing Issues • Scalability • Complexity (Memory, CPU) • Measurement Approximated Input • Dissemination • Need Accurate & Fast Query Algorithm!

  4. Multi-level Proximity Routing (MPR) • Limited routing scope (2-neighborhood) • Neglect a node if its neighbors selected. • Neglect longer paths between nodes.

  5. Multi-level Proximity Routing 4 3 Sibling Edge 2 1

  6. Select Stage Each cluster head i which is not selected iteratively select neighborsj1,j2 …jkwith maximum select score until Here <1 is the aggregation factor. Increasing it yields more optimal but denser MPR, with larger memory and run time complexities.

  7. Interpolate Stage • l-level parents path types where p1,2 are parents of child u1,2. • Remove edge i→j if not shorter than

  8. MPR Experiments

  9. DIMES IP Delay

  10. Euro-Road Network

  11. Conclusion • MPR is a scalable approach to • Routing • Location • Distance Estimation • Sensor and Ad Hoc networks • Multicast • Multi-level for high complexity graph problems • Qos Routing • Embedding

More Related