This paper appears in: Computer Communications and Networks, 2006. ICCCN 2006. Proceedings.15th International Conference on 指導教授 : 許子衡 報告者 : 黃群凱 1.

Slides:



Advertisements
Similar presentations
Computer Networking A Top-Down Approach Chapter 4.7.
Advertisements

COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
指導教授:許子衡 教授 報告學生:馬敏修 2010/8/ Introduction 2. Geocast Routing Protocols  2.1 GAMER Overview 3. GAMER Details  3.1 Building the Mesh  3.2 Adaptation.
© 2007 Cisco Systems, Inc. All rights reserved. Valašské Meziříčí Connecting to the Network.
Fastest-Vehicle Multi-hop Routing in Vehicular Ad hoc Networks 指導教授:許子衡 教授 報告學生:董藝興 學生 作者: Bilal, M. ; Chan, P.M.L. ; Pillai, P. ; 出處: Computer and Information.
Multicasting in Mobile Ad-Hoc Networks (MANET)
Multicast Routing: Problem Statement r Goal: find a tree (or trees) connecting routers having local mcast group members m tree: not all paths between routers.
A New Approach for the Construction of ALM Trees using Layered Coding Yohei Okada, Masato Oguro, Jiro Katto Sakae Okubo International Conference on Autonomic.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
Network Layer4-1 Spanning trees r Suppose you have a connected undirected graph m Connected: every node is reachable from every other node m Undirected:
Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of.
Adaptive Web Caching: Towards a New Caching Architecture Authors and Institutions: Scott Michel, Khoi Nguyen, Adam Rosenstein and Lixia Zhang UCLA Computer.
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
Kyushu University Graduate School of Information Science and Electrical Engineering Department of Advanced Information Technology Supervisor: Professor.
1 IP Multicasting. 2 IP Multicasting: Motivation Problem: Want to deliver a packet from a source to multiple receivers Applications: –Streaming of Continuous.
Adaptive Web Caching Lixia Zhang, Sally Floyd, and Van Jacob-son. In the 2nd Web Caching Workshop, Boulder, Colorado, April 25, System Laboratory,
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
Network Topologies.
Lecture 2 TCP/IP Protocol Suite Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.
Multicast Routing Protocols NETE0514 Presented by Dr.Apichan Kanjanavapastit.
AD HOC WIRELESS MUTICAST ROUTING. Multicasting in wired networks In wired networks changes in network topology is rare In wired networks changes in network.
ON DESIGING END-USER MULTICAST FOR MULTIPLE VIDEO SOURCES Y.Nakamura, H.Yamaguchi, A.Hiromori, K.Yasumoto †, T.Higashino and K.Taniguchi Osaka University.
Scalable Routing Protocols for Mobile Ad Hoc Networks Xiaoyan Hong, Kaixin Xu, and Mario Gerla at UCLA.
Overlay Network Physical LayerR : router Overlay Layer N R R R R R N.
CS 5565 Network Architecture and Protocols Godmar Back Lecture 22.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
© J. Liebeherr, All rights reserved 1 Multicast Routing.
A Survey of Geocast Routing Protocols 指導教授:許子衡 教授 報告學生:馬敏修 指導教授:許子衡 教授 報告學生:馬敏修.
2007/03/26OPLAB, NTUIM1 A Proactive Tree Recovery Mechanism for Resilient Overlay Network Networking, IEEE/ACM Transactions on Volume 15, Issue 1, Feb.
DHT-based unicast for mobile ad hoc networks Thomas Zahn, Jochen Schiller Institute of Computer Science Freie Universitat Berlin 報告 : 羅世豪.
Network Layer4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 Routing Principles 4.3 Hierarchical Routing 4.4 The Internet (IP) Protocol.
An Efficient Wireless Mesh Network A New Architecture 指導教授:許子衡 教授 學生:王志嘉.
SDN Management Layer DESIGN REQUIREMENTS AND FUTURE DIRECTION NO OF SLIDES : 26 1.
Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.
作者 :Satyajeet Ahuja and Marwan Krunz 出處 :IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 10, NO. 7, NOVEMBER 2008 報告者 : 黃群凱 1.
Ad Hoc Multicast Routing
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
4: Network Layer4-1 Chapter 4: Network Layer Last time: r Internet routing protocols m RIP m OSPF m IGRP m BGP r Router architectures r IPv6 Today: r IPv6.
Routing in the Inernet Outcomes: –What are routing protocols used for Intra-ASs Routing in the Internet? –The Working Principle of RIP and OSPF –What is.
Transport Layer3-1 Network Layer Every man dies. Not every man really lives.
Network Layer4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 Routing Principles 4.3 Hierarchical Routing 4.4 The Internet (IP) Protocol.
Architecture and algorithms for an IEEE based multi-channel wireless mesh network 指導教授:許子衡 老師 學生:王志嘉.
GEOCASTING IN MOBILE AD HOC NETWORKS LOCATION- BASED MULTICAST ALGORITHMS 指導教授:許子衡 教授 學生:翁偉傑 1 Young-Bae Ko and Nitin H. Vaidya Department of Computer.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Spring 2006CS 3321 Multicast Outline Link-state Multicast Distance-vector Multicast Protocol Independent Multicast.
Adaptive Routing Protocol for VANETs in City Environments using Real-Time Traffic Information 指導教授:許子衡 教授 報告學生:董藝興 學生 作者: Arzil, S.A. ; Aghdam,.H. ; Jamali,
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #09: SOLUTIONS Shivkumar Kalyanaraman: GOOGLE: “Shiv.
2010 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), pp , 作者: Yoh Shiraishi, Ryo Miki 指導教授:許子衡 教授.
Chapter 25 Internet Routing. Static Routing manually configured routes that do not change Used by hosts whose routing table contains one static route.
指導教授:許子衡 教授 學 生:黃群凱 2016/2/251 Proceedings of the 2008 IEEE International Conference on Vehicular Electronics and Safety Columbus, OH, USA. September 22-24,
VORONOI DIAGRAM AND CONVEX HULL BASED GEOCASTING AND ROUTING IN WIRELESS NETWORKS 指導教授:許子衡 報告學生:翁偉傑 1 Copyright # 2006 John Wiley & Sons, Ltd. Wirel. Commun.
Time-stable geocast for ad hoc networks and its application with virtual warning signs Volume 27, Issue 11, 1 July 2004, Pages Applications and.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
1 Group Communications: Host Group and IGMP Dr. Rocky K. C. Chang 19 March, 2002.
Data Communications Chapter 1 – Data Communications, Data Networks, and the Internet.
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
Zueyong Zhu† and J. William Atwood‡
Ad-hoc Networks.
Internet Networking recitation #12
Chapter 5 The Network Layer.
Other Routing Protocols
IP Multicast COSC /5/2019.
Optional Read Slides: Network Multicast
Presentation transcript:

This paper appears in: Computer Communications and Networks, ICCCN Proceedings.15th International Conference on 指導教授 : 許子衡 報告者 : 黃群凱 1

 With geocast, messages can be sent to all mobile and stationary hosts currently located in a geographic target area.  Geocast messages can be addressed either by geometric figures, or by symbolic names. 2

 Symbolic addressing is an important alternative to geometric addressing.  We need a complex location model including geometric descriptions of every symbolically addressable location. 3

 Forwarding decisions are made based on comparisons of symbolic or geometric target and service areas.  we propose a heuristics to improve hierarchical routing by adding shortcuts to the routing hierarchy. 4

 Since multiple a priori unknown senders may send messages to a given location, either a source-based tree or shared tree protocol can be applied, which both have their limitations.  In the worst case, each message may cause a new tree to be established in the network. 5

 we will propose an optimization of our approach which sends the first messages of a sender over the overlay and then switches to a Source-Specific Multicast (SSM [8]) protocol.  The combination of our overlay network and SSM reduces the overhead to set up source- based trees. 6

 The three components of our architecture are hosts, message servers, and routers 7

 Geocast Routers (GR) are responsible for forwarding geocast messages from the sender to the GMSs whose service areas overlap with the target area of the message.  GRs are arranged in an overlay network and exchange messages using the UDP service offered by the underlying IP-based Internet infrastructure. 8

 For two locations 1 1 and 1 2 it holds 1 1 < 1 2, if 1 2 spatially contains 1 1.  1 1 is called a descendant of location 1 2, and 1 2 is an ancestor of 1 1.  A direct descendant of location I is called a child location and a direct ancestor a parent location. 9

 Ancestors(l), children(l) and parent(l) denote the set of ancestor locations, child locations, and the parent location, respectively.  Locations of the location model are used to define host positions, and service areas of GRs and GMSs.  A benefit of using an overlay network is that our location address space is not restricted by the length limitation of IP addresses. 10

 Overlay Network Nodes ◦ GRs constitute the nodes of the overlay network. Each location I is associated with one designated Geocast Router, say r.  Overlay Network Links 11

 This reduces the load of by-passed GRs and leads to shorter message paths. 12

 Consider for instance the New York City GR (r new) that wants to join the overlay network. The following steps are executed to integrate r new into the overlay network: 13

 Our approach uses three phases to forward messages from the sending host to all hosts in the target area, t, of the message. ◦ The message is forwarded to the designated GR, rt, of the target area. ◦ The message is distributed among all routers in the target area by forwarding it down the router hierarchy starting at rt. ◦ These GMSs finally forward the message to the hosts in their access networks that are located in the target area. 14

 Forwarding to Access Networks in Target Area 15

 Optimized Message Forwarding ◦ The basic idea is to start delivering messages to GMSs via the overlay network and then switch to layer 3 multicast. ◦ Such an optimization is especially useful if several messages are sent frequently to the same target area rather than only single messages that are sent sporadically. ◦ The class of source-specific multicast (SSM [15]) protocols is well suited for our requirements. 16

17

 The whole topology consists of the backbones of 8 major Internet service providers in the USA. 18

19

 We presented a geocast protocol for the efficient distribution of symbolically addressed geocast messages.  Our approach leads to short message paths and low overlay network router load and thus high scalability.  In future work, we are going to investigate how to further improve routing in the overlay network. 20