PPT-I LINK :Search and Routing in Social Networks

Presenter ChunPing Wu 　 Authors Jeffrey Davcitz Jiye Yu Sugato Basu David Gutelius Alexandra Harris KDD 2007 國立雲林科技大學 National Yunlin University of Science and Technology. e making routing decision It should process properties like correctness simplici ty robustness stability fairness and optimality Note optimality is always with re spect to chosen criterion Optimality principle if router is on optimal path from rout Ad-hoc . On-Demand Distance Vector . Routing. &. DSR. : The Dynamic Source Routing . Protocol for. . Multi-Hop . Wireless Ad Hoc Networks. November 2011,. Giorgos . Papadakis. & Manolis. Link-State, Distance-Vector. EE122 Section 2. First off, where are we?. Application. Transport. Network. Datalink. Physical. Mostly still here. Link-State Routing. Link-State Routing. . Dest. Distance Vector and Link State. RIP. OSPF. Internet Routing. IP implements datagram forwarding. Both hosts and routers. Have an IP module. Forward datagrams. IP forwarding is table-driven. Table known as routing table. SOC. IABLE. SOCIABLE. Addison Dunbrook. Tuan Tran. Mayuran K. Justin . Caravaggio. Kenneth Lo. Where: . AP-134. When:. April 10th 2014. Time:. . 11:00 . - . 2:00pm. Ad-Hoc / WiFi Direct. Delay Tolerant Networks. SOC. IABLE. SOCIABLE. Addison Dunbrook. Tuan Tran. Mayuran K. Justin . Caravaggio. Kenneth Lo. Where: . AP-134. When:. April 10th 2014. Time:. . 11:00 . - . 2:00pm. Ad-Hoc / WiFi Direct. Delay Tolerant Networks. Protocols. Heng Sovannarith. heng_sovannarith@yahoo.com. Introduction. Routing protocols were created for routers. These protocols have been designed to allow the exchange of routing tables, or known networks, between routers. . Addressing routing scalability issues. NSF Ignite Project . 1. Routing protocol challenges . All Routing . P. rotocols face. S. calability issues – dependency on network size. Flooding on information changes. Geoff Huston. Routing. How do packets get from A to B in the Internet?. A. B. Internet. Connectionless Forwarding. Each router (switch) makes a LOCAL decision to forward the packet towards B. A. B. R1. Indirect Networks. Cost Model. Comparison of Direct and Indirect Networks. Classification. Shared medium networks. Example: backplane buses. Direct networks. Example: . k. -ary . n. -cubes, meshes, and trees. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols MOBICOM 1998 Dallas, Texas Josh Broch , David Maltz , David Johnson, Yih -Chun Hu and Jorjeta Jetcheva Computer Routing Distance Vector (DV) Routing Sets up minimum distance routes to all nodes in a network Routing tables created at each node with following fields: The core algorithm is based on ‘ Bellman Ford shortest path algorithm http://www.cs.princeton.edu/courses/archive/spr14/cos461/. Outline. What are Ad Hoc Networks?. Assumptions and Challenges for Routing. Four Routing Protocols: DSDV, TORA, AODV, and DSR. How well do these protocols perform?. Redes. y . Servicios. . Ubicuos. y . Seguros. Unit 4: Network Technologies. Ana Belén García Hernando. abgarcia@diatel.upm.es. , . anabelen.garcia@upm.es. Networking challenges in WSN. Low energy consumption [vs. .