Delaunay Triangulation Overlays
|
|
- Albert Kennedy
- 6 years ago
- Views:
Transcription
1 HighPerf or mance Swi tchi ng and Routi ng Tele com Cent erw orksh op: Sept 4, Delaunay Triangulation Overlays Jörg Liebeherr HyperCast Project HyperCast is a set of protocols for large-scale overlay multicasting and peer-to-peer networking Motivating Research Problems: How to organize thousands of applications in a virtual overlay network? How to do multicasting in very large overlay networks? Jörg Liebeherr
2 Overlay Multicasting Logical overlay resides on top of the Layer-3 network Data is transmitted between neighbors in the overlay No network support needed Overlay topology should match the Layer-3 infrastructure Jörg Liebeherr HyperCast Approach Build overlay network as a graph with known properties N-dimensional (incomplete) hypercube Delaunay triangulation Advantages: Achieve good load-balancing Exploit symmetry Next-hop routing in the overlay is free Claim: Can improve scalability of multicast and peer-topeer networks by orders of magnitude over existing solutions Jörg Liebeherr
3 Hypercast Software Applications organize themselves to form a logical overlay network with a given topology No central control Dynamic membership hypercube Delaunay triangulation Jörg Liebeherr Data Transfer Data is distributed neighborto-neighbor in the overlay network Jörg Liebeherr
4 Delaunay Triangulation Overlays Jörg Liebeherr Nodes in a Plane Nodes are are assigned x-y x-y coordinates (e.g., based on on geographic location) 0,3 0,2 0,1 0,0 1,0 2,0 3,0 Jörg Liebeherr
5 Voronoi Regions The The Voronoi region of of a node is is the the region of of the the plane that that is is closer to to this this node than than to to any any other node. Jörg Liebeherr Delaunay Triangulation The The Delaunay triangulation has has edges between nodes in in neighboring Voronoi regions. Jörg Liebeherr
6 Delaunay Triangulation An An equivalent definition: A triangulation such that that each circumscribing circle of of a triangle formed by by three vertices, no no vertex of of is is in in the the interior of of the the circle. Jörg Liebeherr Locally Equiangular Property Sibson 1977: Maximize the minimum angle C For every convex quadrilateral formed by triangles ACB and ABD that share a common edge AB, the minimum internal angle of triangles ACB and ABD is at least as large as the minimum internal angle of triangles ACD and CBD. A α D β B Jörg Liebeherr
7 Next-hop routing with Compass Routing A node s parent in a spanning tree is its neighbor which forms the smallest angle with the root. A node need only know information on its neighbors no routing protocol is needed for the overlay. A Root B is the Node s Parent B Node Jörg Liebeherr Spanning tree tree when node () () is is root. root. The The tree tree can can be be calculated by by both both parents and and children. Jörg Liebeherr
8 Evaluation of Delaunay Triangulation overlays Delaunay triangulation can consider location of nodes in an (x,y) plane, but is not aware of the network topology Question: How does Delaunay triangulation compare with other overlay topologies? Jörg Liebeherr Hierarchical Delaunay Triangulation 2-level hierarchy of Delaunay triangulations The node with the lowest x-coordinate in a domain DT is a member in 2 triangulations Jörg Liebeherr
9 Multipoint Delaunay Triangulation Different ( implicit ) hierarchical organization Virtual nodes are positioned to form a bounding box around a cluster of nodes. All traffic to nodes in a cluster goes through one of the virtual nodes Jörg Liebeherr Overlay Topologies Delaunay Triangulation and variants DT Hierarchical DT Multipoint DT Hypercube overlays used by HyperCast Degree-6 Graph Similar to graphs generated in Narada Degree-3 Tree Similar to graphs generated in Yoid Logical MST Minimum Spanning Tree overlays that assume knowledge of network topology Jörg Liebeherr
10 Transit-Stub Network Transit-Stub GeorgiaTech topology generator 4 transit domains 4 16 stub domains 1024 total routers 128 hosts on stub domain Jörg Liebeherr Evaluation of Overlays Simulation: Network with 1024 routers ( Transit-Stub topology) hosts Performance measures for trees embedded in an overlay network: Degree of a node in an embedded tree Relative Delay Penalty : Ratio of delay in overlay to shortest path delay Stress : Number of duplicate transmissions over a physical link Jörg Liebeherr
11 Illustration of Stress and Relative Delay Penalty AA Stress = BB Stress = 2 Unicast delay A B : 4 Delay A B in overlay: 6 Relative delay penalty for A B: 1.5 Jörg Liebeherr Average Relative Delay Penalty Jörg Liebeherr
12 90 th Percentile of Relative Delay Penalty Delaunay triangulation Jörg Liebeherr Average Stress Delaunay triangulation Jörg Liebeherr
13 90 th Percentile of Stress Delaunay triangulation Jörg Liebeherr The DT Protocol Protocol which organizes members of a network in a Delaunay Triangulation Each member only knows its neighbors soft-state protocol Topics: Nodes and Neighbors Example: A node joins State Diagram Rendezvous Measurement Experiments Jörg Liebeherr
14 Each node sends messages to to its its neighbors periodically Jörg Liebeherr Each contains the the clockwise (CW) and and counterclockwise (CCW) neighbors Receiver of of a runs runs a Neighbor test test ( ( locally equiangular prop.) CW CW and and CCW are are used to to detect new new neighbors Neighborhood Table of CW = CCW = Neighbor CW CCW Jörg Liebeherr
15 A node that that wants to to join join the the triangulation contacts a node that that is is close New node Jörg Liebeherr Node () () updates its its Voronoi region, and and the the triangulation Jörg Liebeherr
16 () () sends a which contains info info for for contacting its its clockwise and and counterclockwise neighbors Jörg Liebeherr () () contacts these neighbors Jörg Liebeherr
17 which update their their respective Voronoi regions. Jörg Liebeherr () () and and () send s and and provide info info for for contacting their their respective clockwise and and counterclockwise neighbors. Jörg Liebeherr
18 () () contacts the the new new neighbor () Jörg Liebeherr which updates its its Voronoi region... Jörg Liebeherr
19 and responds with with a Jörg Liebeherr This This completes the the update of of the the Voronoi regions and and the the Delaunay Triangulation Jörg Liebeherr
20 Rendezvous Methods Rendezvous Problems: How does a new node detect a member of the overlay? How does the overlay repair a partition? Three solutions: 1. Announcement via broadcast 2. Use of a rendezvous server 3. Use `likely members ( Buddy List ) Jörg Liebeherr Rendezvous Method 1: 1: Announcement via via broadcast (e.g., using IP IP Multicast) New node Jörg Liebeherr
21 Leader Rendezvous Method 1: 1: A Leader is is a node with with a Y-coordinate higher than than any any of of its its neighbors. Jörg Liebeherr Rendezvous Method 2: 2: New New node and and leader contact a rendezvous server. Server keeps a cache of of some other nodes Server Request New node Server Server Reply () NewNode NewNode Jörg Liebeherr
22 Rendezvous Method 3: 3: Each node has has a list list of of likely members of of the the overlay network NewNode New node with Buddy List: () () NewNode Jörg Liebeherr State Diagram of a Node Stopped Application starts Leader without Neighbor Neighbor added (with smaller coordinates) All neighbors leave or timeout Neighbor added (with larger coordinates) All neighbors leave or timeout Application exits Leader with Neighbor A new neighbor with greater coordinates is added After removing some neighbor, this node has largest coordinates Not Leader Send Goodbye Send Goodbye Send Goodbye Leaving Jörg Liebeherr
23 Sub-states of a Node Stable Without Candidate Neighbor Node contained in NewNode passes neighbor test After handling the candidate neighbor, node remains stable After neighborhood updating, node becomes not stable After neighborhood updating, node becomes stable. Stable With Candidate Neighbor After neighborhood updating, node becomes not stable Not Stable A node is is stable when all all nodes that that appear in in the the CW CW and and CCW neighbor columns of of the the neighborhood table also also appear in in the the neighbor column Jörg Liebeherr Measurement Experiments Experimental Platform: Centurion cluster at UVA (cluster of 300 Linux PCs) 2 to 10,000 overlay members members per PC Random coordinate assignments Internet Switch 3 Gigabit Ethernet centurion183 centurion Switch 4 Switch 8 centurion centurion246 centurion250 centurion251 Switch 5 Switch 9 centurion centurion centurion249 centurion252 Switch 6 Switch 11 centurion centurion centurion Switch 7 Switch 10 Jörg Liebeherr
24 Experiment: Adding Members How long does it take to add M members to an overlay network of N members? Time to Complete (sec) M+N members Jörg Liebeherr Experiment: Throughput of Multicasting 100 MB bulk transfer for N=2-100 members (1 node per PC) 10 MB bulk transfer for N= members (10 nodes per PC) Average throughput (Mbps) Measured values Bandwidth bounds (due to stress) Number of Members N Jörg Liebeherr
25 Experiment: Delay 100 MB bulk transfer for N=2-100 members (1 node per PC) 10 MB bulk transfer for N= members (10 nodes per PC) Delay of a packet (msec) Number of Nodes N Jörg Liebeherr
Many-to-Many Communications in HyperCast
Many-to-Many Communications in HyperCast Jorg Liebeherr University of Virginia Jörg Liebeherr, 2001 HyperCast Project HyperCast is a set of protocols for large-scale overlay multicasting and peer-to-peer
More informationApplication-Layer Multicasting with Delaunay Triangulation Overlays
Application-Layer Multicasting with Delaunay Triangulation Overlays Jörg Liebeherr Michael Nahas Weisheng Si Department of Computer Science University of Virginia Charlottesville, VA 22904 Abstract Application-layer
More informationApplication-Layer Multicasting With Delaunay Triangulation Overlays
1472 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 20, NO. 8, OCTOBER 2002 Application-Layer Multicasting With Delaunay Triangulation Overlays Jörg Liebeherr, Member, IEEE, Michael Nahas, Member,
More informationApplication-layer Multicast with Delaunay Triangulations
Application-layer Multicast with Delaunay Triangulations Jörg Liebeherr, Michael Nahas, Department of Computer Science, University of Virginia, Charlottesville, VA 9 Abstract Recently, application-layer
More informationLarge-scale Application-Layer Multicast with Delaunay Triangulations
Large-scale pplication-layer Multicast with elaunay Triangulations Jörg Liebeherr Michael ahas epartment of omputer Science University of Virginia harlottesville, V 2294 bstract pplication-layer multicast
More informationTwo challenges for building large self-organizing overlay networks
Two challenges for building large selforganizing overlay networks Jorg Liebeherr University of Virginia Two issues in multicast overlay networks 1. Why do we keep on proposing overlay networks for multicast?
More informationScalable Application Layer Multicast
Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy http://www.cs.umd.edu/projects/nice Group Communication A C A C 1 2 1 2 B D B D Network-layer Multicast Replication
More informationSimulations of the quadrilateral-based localization
Simulations of the quadrilateral-based localization Cluster success rate v.s. node degree. Each plot represents a simulation run. 9/15/05 Jie Gao CSE590-fall05 1 Random deployment Poisson distribution
More informationAdaptive Routing of QoS-Constrained Media Streams over Scalable Overlay Topologies
Adaptive Routing of QoS-Constrained Media Streams over Scalable Overlay Topologies Gerald Fry and Richard West Boston University Boston, MA 02215 {gfry,richwest}@cs.bu.edu Introduction Internet growth
More informationAd hoc and Sensor Networks Topology control
Ad hoc and Sensor Networks Topology control Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity This chapter looks at methods to deal with such networks by Reducing/controlling
More informationA Contemporary Study of Application Layer Multicast Protocols in aid of Effective Communication
A Contemporary Study of Application Layer Multicast Protocols in aid of Effective Communication M. Anitha #1, P. Yogesh *2 # Department of Computer Science and Engineering, * Department of Information
More informationAd hoc and Sensor Networks Chapter 10: Topology control
Ad hoc and Sensor Networks Chapter 10: Topology control Holger Karl Computer Networks Group Universität Paderborn Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity
More informationComputational Geometry
Computational Geometry 600.658 Convexity A set S is convex if for any two points p, q S the line segment pq S. S p S q Not convex Convex? Convexity A set S is convex if it is the intersection of (possibly
More informationViewing IP and MPLS Multicast Configurations
CHAPTER 19 These topics provide an overview of the IP Multicast technology and describe how to view IP and multicast configurations in Prime Network Vision: IP and MPLS Multicast Configuration: Overview,
More informationThe Spanning Tree Protocol
The Spanning Tree Protocol Guangyu Dong, Jorg Liebeherr, MNG Group Wednesday, March 30, 2005 This is a draft and not a final version. 2005-8. All rights reserved. All material is copyrighted by the authors.
More informationMidpoint Routing algorithms for Delaunay Triangulations
Midpoint Routing algorithms for Delaunay Triangulations Weisheng Si and Albert Y. Zomaya Centre for Distributed and High Performance Computing School of Information Technologies Prologue The practical
More informationMulticast Communications
Multicast Communications Multicast communications refers to one-to-many or many-tomany communications. Unicast Broadcast Multicast Dragkedja IP Multicasting refers to the implementation of multicast communication
More informationContent. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.
Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationData Communication. Guaranteed Delivery Based on Memorization
Data Communication Guaranteed Delivery Based on Memorization Motivation Many greedy routing schemes perform well in dense networks Greedy routing has a small communication overhead Desirable to run Greedy
More informationNetworking Acronym Smorgasbord: , DVMRP, CBT, WFQ
Networking Acronym Smorgasbord: 802.11, DVMRP, CBT, WFQ EE122 Fall 2011 Scott Shenker http://inst.eecs.berkeley.edu/~ee122/ Materials with thanks to Jennifer Rexford, Ion Stoica, Vern Paxson and other
More informationOverlay Socket Tutorial
Tutorial Overview 1. Terminology: socket, overlay network 2. User perspective: The API: Writing programs with an overlay socket Managing Properties of an overlay network a) Attributes b) Property file
More informationBayeux: An Architecture for Scalable and Fault Tolerant Wide area Data Dissemination
Bayeux: An Architecture for Scalable and Fault Tolerant Wide area Data Dissemination By Shelley Zhuang,Ben Zhao,Anthony Joseph, Randy Katz,John Kubiatowicz Introduction Multimedia Streaming typically involves
More informationConfiguring PIM. Information About PIM. Send document comments to CHAPTER
CHAPTER 3 This chapter describes how to configure the Protocol Independent Multicast (PIM) features on Cisco NX-OS switches in your IPv4 networks. This chapter includes the following sections: Information
More informationBroadcast and Multicast Routing
Broadcast and Multicast Routing Daniel Zappala CS 460 Computer Networking Brigham Young University Group Communication 2/34 How can the Internet provide efficient group communication? send the same copy
More informationTop-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Switching 2 Page 1 Objectives MAC address table Describe the features
More informationWITH the penetration of broadband Internet access,
216 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 21, NO. 2, FEBRUARY 2010 A Distributed Protocol to Serve Dynamic Groups for Peer-to-Peer Streaming Xing Jin, S.-H. Gary Chan, Senior Member,
More information! Naive n-way unicast does not scale. ! IP multicast to the rescue. ! Extends IP architecture for efficient multi-point delivery. !
Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination ACM NOSSDAV 001 Shelley Q. Zhuang, Ben Y. Zhao, Anthony D. Joseph, Randy H. Katz, John D. Kubiatowicz {shelleyz, ravenben,
More informationArvind Krishnamurthy Fall 2003
Overlay Networks Arvind Krishnamurthy Fall 003 Internet Routing Internet routing is inefficient: Does not always pick the lowest latency paths Does not always pick paths with low drop rates Experimental
More informationContents. Overview Multicast = Send to a group of hosts. Overview. Overview. Implementation Issues. Motivation: ISPs charge by bandwidth
EECS Contents Motivation Overview Implementation Issues Ethernet Multicast IGMP Routing Approaches Reliability Application Layer Multicast Summary Motivation: ISPs charge by bandwidth Broadcast Center
More informationWhat is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals
What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting
More informationHigh-Dimensional Computational Geometry. Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018
High-Dimensional Computational Geometry Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018 Outline 3-D vector geometry High-D hyperplane intersections Convex hull & its extension to 3
More informationVoronoi Diagrams and Delaunay Triangulations. O Rourke, Chapter 5
Voronoi Diagrams and Delaunay Triangulations O Rourke, Chapter 5 Outline Preliminaries Properties and Applications Computing the Delaunay Triangulation Preliminaries Given a function f: R 2 R, the tangent
More informationReliable End System Multicasting with a Heterogeneous Overlay Network
Reliable End System Multicasting with a Heterogeneous Overlay Network Jianjun Zhang, Ling Liu, Calton Pu and Mostafa Ammar College of Computing Georgia Institute of Technology Atlanta, GA 333, U.S.A. {zhangjj,
More informationNetwork-on-chip (NOC) Topologies
Network-on-chip (NOC) Topologies 1 Network Topology Static arrangement of channels and nodes in an interconnection network The roads over which packets travel Topology chosen based on cost and performance
More informationMulticast EECS 122: Lecture 16
Multicast EECS 1: Lecture 16 Department of Electrical Engineering and Computer Sciences University of California Berkeley Broadcasting to Groups Many applications are not one-one Broadcast Group collaboration
More informationThe Cluster Protocol Wittawat Tantisiriroj, Jorg Liebeherr, MNG Group
The Cluster Protocol Wittawat Tantisiriroj, Jorg Liebeherr, MNG Group (updated: January 2008) This is a draft and not a final version. 2008. All rights reserved. All material is copyrighted by the authors.
More information3. INTERCONNECTING NETWORKS WITH SWITCHES. THE SPANNING TREE PROTOCOL (STP)
3. INTERCONNECTING NETWORKS WITH SWITCHES. THE SPANNING TREE PROTOCOL (STP) 3.1. STP Operation In an extended Ethernet network (a large network, including many switches) multipath propagation may exist
More informationPrianka.P 1, Thenral 2
An Efficient Routing Protocol design and Optimizing Sensor Coverage Area in Wireless Sensor Networks Prianka.P 1, Thenral 2 Department of Electronics Communication and Engineering, Ganadipathy Tulsi s
More informationChapter 7 TOPOLOGY CONTROL
Chapter 7 TOPOLOGY CONTROL Distributed Computing Group Mobile Computing Winter 2005 / 2006 Overview Topology Control Gabriel Graph et al. XTC Interference SINR & Scheduling Complexity Distributed Computing
More informationEfficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks
Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,
More informationOverview. Overview. OTV Fundamentals. OTV Terms. This chapter provides an overview for Overlay Transport Virtualization (OTV) on Cisco NX-OS devices.
This chapter provides an overview for Overlay Transport Virtualization (OTV) on Cisco NX-OS devices., page 1 Sample Topologies, page 6 OTV is a MAC-in-IP method that extends Layer 2 connectivity across
More informationSurvey on Multicast Routing Protocols in MANETs
Survey on Multicast Routing Protocols in MANETs A Viswanath, Dept of CSE, Sree Vidyanikethan Engineering College, Tirupati, AP, India. N Papanna, M.Tech, Assistant Professor, Sree Vidyanikethan Engineering
More informationConfiguring Multicast Routing
CHAPTER 24 This chapter describes how to configure the ASA to use the multicast routing protocol and includes the following sections: Information About Multicast Routing, page 24-17 Licensing Requirements
More informationGRE and DM VPNs. Understanding the GRE Modes Page CHAPTER
CHAPTER 23 You can configure Generic Routing Encapsulation (GRE) and Dynamic Multipoint (DM) VPNs that include GRE mode configurations. You can configure IPsec GRE VPNs for hub-and-spoke, point-to-point,
More informationThis chapter describes how to configure the Cisco ASA to use the multicast routing protocol.
This chapter describes how to configure the Cisco ASA to use the multicast routing protocol. About, page 1 Guidelines for, page 4 Enable, page 4 Customize, page 5 Monitoring for PIM, page 16 Example for,
More informationComputer Networks. Routing
Computer Networks Routing Topics Link State Routing (Continued) Hierarchical Routing Broadcast Routing Sending distinct packets Flooding Multi-destination routing Using spanning tree Reverse path forwarding
More informationChapter 3 Part 2 Switching and Bridging. Networking CS 3470, Section 1
Chapter 3 Part 2 Switching and Bridging Networking CS 3470, Section 1 Refresher We can use switching technologies to interconnect links to form a large network What is a hub? What is a switch? What is
More informationMulticast Technology White Paper
Multicast Technology White Paper Keywords: Multicast, IGMP, IGMP Snooping, PIM, MBGP, MSDP, and SSM Mapping Abstract: The multicast technology implements high-efficiency point-to-multipoint data transmission
More informationMaster s Thesis. A Construction Method of an Overlay Network for Scalable P2P Video Conferencing Systems
Master s Thesis Title A Construction Method of an Overlay Network for Scalable P2P Video Conferencing Systems Supervisor Professor Masayuki Murata Author Hideto Horiuchi February 14th, 2007 Department
More informationSUPPORTING EFFICIENT AND SCALABLE MULTICASTING OVER MOBILE AD HOC NETWORKS. X.Xiang X.Wang Y.Yang
SUPPORTING EFFICIENT AND SCALABLE MULTICASTING OVER MOBILE AD HOC NETWORKS X.Xiang X.Wang Y.Yang Introduction Multicasting: an efficient way to realize group communications(one to many or many to many).
More informationThe Backbone-Cluster Protocol Wittawat Tantisiriroj, Jorg Liebeherr, MNG Group Thursday, February 07, 2008
The Backbone-Cluster Protocol Wittawat Tantisiriroj, Jorg Liebeherr, MNG Group Thursday, February 07, 2008 Table of Contents 1. Introduction...1 2. Operations...3 3. 4. States and State Transitions...4
More informationAnnouncements. EECS 122: Introduction to Computer Networks Multicast and Overlay Networks. Motivational Example: Streaming Media
Announcements EEC : Introduction to Computer Networks Multicast and Overlay Networks Ion toica (and Brighten Godfrey) TAs: Lucian Popa, David Zats and Ganesh Ananthanarayanan http://inst.eecs.berkeley.edu/~ee/
More informationHow Routing Algorithms Work
How Routing Algorithms Work A router is used to manage network traffic and find the best route for sending packets. But have you ever thought about how routers do this? Routers need to have some information
More informationLesson 7.1. Angles of Polygons
Lesson 7.1 Angles of Polygons Essential Question: How can I find the sum of the measures of the interior angles of a polygon? Polygon A plane figure made of three or more segments (sides). Each side intersects
More information6. Node Disjoint Split Multipath Protocol for Unified. Multicasting through Announcements (NDSM-PUMA)
103 6. Node Disjoint Split Multipath Protocol for Unified Multicasting through Announcements (NDSM-PUMA) 6.1 Introduction It has been demonstrated in chapter 3 that the performance evaluation of the PUMA
More informationConvex Polygon Generation
Convex Polygon Generation critterai.org /projects/nmgen_study/polygen.html This page describes the forth stage in building a navigation mesh, the generation of convex polygons from the simple polygons
More informationAn overview of how packets are routed in the Internet
An overview of how packets are routed in the Internet 1 Dijkstra s shortest path first algorithm (example of a Link State Algorithm ) 1. Exchange link state: A router floods to every other router the state
More informationApplication Layer Multicast For Efficient Peer-to-Peer Applications
Application Layer Multicast For Efficient Peer-to-Peer Applications Adam Wierzbicki 1 e-mail: adamw@icm.edu.pl Robert Szczepaniak 1 Marcin Buszka 1 1 Polish-Japanese Institute of Information Technology
More informationCS514: Intermediate Course in Computer Systems
Distributed Hash Tables (DHT) Overview and Issues Paul Francis CS514: Intermediate Course in Computer Systems Lecture 26: Nov 19, 2003 Distributed Hash Tables (DHT): Overview and Issues What is a Distributed
More informationVoronoi Diagrams. A Voronoi diagram records everything one would ever want to know about proximity to a set of points
Voronoi Diagrams Voronoi Diagrams A Voronoi diagram records everything one would ever want to know about proximity to a set of points Who is closest to whom? Who is furthest? We will start with a series
More informationIntroduction to Communication Networks Spring Unit 13 Network extensions Bridges.
Introduction to Communication Networks Spring 2007 Unit 13 Network extensions Bridges. Acknowledgements slides coming from: The book by Peterson/Davie The book by Wiliam Stallings Slides from lectures
More informationModule 7 Implementing Multicast
Module 7 Implementing Multicast Lesson 1 Explaining Multicast Why Multicast? Used when sending same data to multiple receivers Better bandwidth utilization Less host/router processing Used when addresses
More informationVoronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text
Voronoi Diagrams in the Plane Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams As important as convex hulls Captures the neighborhood (proximity) information of geometric objects
More informationTag Switching. Background. Tag-Switching Architecture. Forwarding Component CHAPTER
CHAPTER 23 Tag Switching Background Rapid changes in the type (and quantity) of traffic handled by the Internet and the explosion in the number of Internet users is putting an unprecedented strain on the
More informationPerformance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s
Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations
More informationConfiguring Rapid PVST+ Using NX-OS
Configuring Rapid PVST+ Using NX-OS This chapter describes how to configure the Rapid per VLAN Spanning Tree (Rapid PVST+) protocol on Cisco NX-OS devices. This chapter includes the following sections:
More informationCS 268: IP Multicast Routing
Motivation CS 268: IP Multicast Routing Ion Stoica April 8, 2003 Many applications requires one-to-many communication - E.g., video/audio conferencing, news dissemination, file updates, etc. Using unicast
More informationOutline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting
Outline Routing Fundamentals of Computer Networks Guevara Noubir Introduction Broadcasting and Multicasting Shortest Path Unicast Routing Link Weights and Stability F2003, CSG150 Fundamentals of Computer
More informationMedium Access Protocols
Medium Access Protocols Summary of MAC protocols What do you do with a shared media? Channel Partitioning, by time, frequency or code Time Division,Code Division, Frequency Division Random partitioning
More informationShortcut Switching Enhancements for NHRP in DMVPN Networks
Shortcut Switching Enhancements for NHRP in DMVPN Networks Routers in a Dynamic Multipoint VPN (DMVPN) Phase 3 network use Next Hop Resolution Protocol (NHRP) Shortcut Switching to discover shorter paths
More informationITEC310 Computer Networks II
ITEC310 Computer Networks II Chapter 22 Network Layer:, and Routing Department of Information Technology Eastern Mediterranean University Objectives 2/131 After completing this chapter you should be able
More informationWe noticed that the trouble is due to face routing. Can we ignore the real coordinates and use virtual coordinates for routing?
Geographical routing in practice We noticed that the trouble is due to face routing. Is greedy routing robust to localization noise? Can we ignore the real coordinates and use virtual coordinates for routing?
More informationA Survey and Comparison of. Application-level Multicast Protocols
A Survey and omparison of Application-level Multicast Protocols Xing Jin Wan-hing Wong S.-. Gary han oi-lun Ngan epartment of omputer Science The ong Kong University of Science and Technology lear Water
More informationKapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types
Kapitel 5: Mobile Ad Hoc Networks Mobilkommunikation 2 WS 08/09 Wireless Communication Wireless communication networks types Infrastructure-based networks Infrastructureless networks Ad hoc networks Prof.
More informationSemantic Multicast for Content-based Stream Dissemination
Semantic Multicast for Content-based Stream Dissemination Olga Papaemmanouil Brown University Uğur Çetintemel Brown University Stream Dissemination Applications Clients Data Providers Push-based applications
More informationScalable multicasting with network-aware geometric overlay
Available online at www.sciencedirect.com Computer Communications 3 (28) 464 488 www.elsevier.com/locate/comcom Scalable multicasting with network-aware geometric overlay Eng Keong Lua a,b, *, Xiaoming
More informationIPv6 and Multicast. Outline. IPv6 Multicast. S Computer Networks - Spring 2005
IPv6 and Multicast 188lecture5.ppt Pasi Lassila 1 Outline IPv6 Multicast 2 IPv6 overview Motivation Internet growth (address space depletion and routing information eplosion) CIDR has helped but eventually
More informationConfiguring Virtual Private LAN Services
Virtual Private LAN Services (VPLS) enables enterprises to link together their Ethernet-based LANs from multiple sites via the infrastructure provided by their service provider. This module explains VPLS
More informationEIGRP Stub Routing. Finding Feature Information. Information About EIGRP Stub Routing. EIGRP Stub Routing
The EIGRP stub routing feature improves network stability, reduces resource utilization, and simplifies the stub device configuration. Stub routing is commonly used in hub-and-spoke network topologies.
More informationInterdomain Routing Design for MobilityFirst
Interdomain Routing Design for MobilityFirst October 6, 2011 Z. Morley Mao, University of Michigan In collaboration with Mike Reiter s group 1 Interdomain routing design requirements Mobility support Network
More informationLocation Awareness in Ad Hoc Wireless Mobile Neworks
Location Awareness in Ad Hoc Wireless Mobile Neworks Lijuan Ai Wenyu Wang Yi Zhou 11/14/2001 Mobile Computing, Fall 2001 1 PART I INTRODUCTION TO MANET & LOCATION-AWARE COMPONENTS 11/14/2001 Mobile Computing,
More informationQoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks
QoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks Satyabrata Pradhan, Yi Li, and Muthucumaru Maheswaran Advanced Networking Research Laboratory Department of Computer Science University
More informationMulticast Communications. Slide Set were original prepared by Dr. Tatsuya Susa
Multicast Communications Slide Set were original prepared by Dr. Tatsuya Susa Outline 1. Advantages of multicast 2. Multicast addressing 3. Multicast Routing Protocols 4. Multicast in the Internet 5. IGMP
More informationETSF10 Internet Protocols Routing on the Internet
ETSF10 Internet Protocols Routing on the Internet 2013, Part 2, Lecture 1.2 Jens Andersson (Kaan Bür) Routing on the Internet Unicast routing protocols (part 2) [ed.5 ch.20.3] Multicast routing, IGMP [ed.5
More informationData gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks
Mobile Information Systems 9 (23) 295 34 295 DOI.3233/MIS-364 IOS Press Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks Keisuke Goto, Yuya Sasaki, Takahiro
More informationHow does a router know where to send a packet next?
How does a router know where to send a packet next? The Problem Which path should packets take from A to B? A B R2 R R4 R3 C D 2 The Internet forwards packets hop-by-hop Data IP Address Next-hop A R B
More information1/25 Warm Up Find the value of the indicated measure
1/25 Warm Up Find the value of the indicated measure. 1. 2. 3. 4. Lesson 7.1(2 Days) Angles of Polygons Essential Question: What is the sum of the measures of the interior angles of a polygon? What you
More informationConfiguring a Rendezvous Point
Version History Version Number Date Notes 1 03/15/2002 This document was created. The purpose of this document is to outline four recommended methods for configuring a rendezvous point (RP) in a Protocol
More informationDelaunay Triangulation
Delaunay Triangulation Steve Oudot slides courtesy of O. Devillers MST MST MST use Kruskal s algorithm with Del as input O(n log n) Last: lower bound for Delaunay Let x 1, x 2,..., x n R, to be sorted
More informationUnit 3: Dynamic Routing
Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about
More informationThe Interconnection Structure of. The Internet. EECC694 - Shaaban
The Internet Evolved from the ARPANET (the Advanced Research Projects Agency Network), a project funded by The U.S. Department of Defense (DOD) in 1969. ARPANET's purpose was to provide the U.S. Defense
More informationReferences. Forwarding. Introduction...
References Routing Protocols H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, 005. (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor
More informationLesson 1. Unit 2 Practice Problems. Problem 2. Problem 1. Solution 1, 4, 5. Solution. Problem 3
Unit 2 Practice Problems Lesson 1 Problem 1 Rectangle measures 12 cm by 3 cm. Rectangle is a scaled copy of Rectangle. Select all of the measurement pairs that could be the dimensions of Rectangle. 1.
More informationA Scalable and Resilient Layer-2 Network with Ethernet Compatibility
1 A Scalable and Resilient Layer-2 Network with Ethernet Compatibility Chen Qian, Member, IEEE, and Simon S. Lam, Fellow, IEEE Abstract We present the architecture and protocols of ROME, a layer-2 network
More informationChapter 11 Chapter 6
Routing Protocols References H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, 2005. (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor
More informationThe Overlay Socket API
1/10/2002 Overlay Socket API 1 The Overlay Socket API 1. OVERVIEW The HyperCast software provides an Application Programming Interface (API) for building applications that use overlay sockets. The overlay
More informationIP Multicast Optimization: Optimizing PIM Sparse Mode in a Large IP Multicast Deployment
IP Multicast Optimization: Optimizing PIM Sparse Mode in a Large IP Multicast Deployment Finding Feature Information, page 1 Prerequisites for Optimizing PIM Sparse Mode in a Large IP Multicast Deployment,
More informationEIGRP. About EIGRP. CLI Book 1: Cisco ASA Series General Operations CLI Configuration Guide, 9.7 1
This chapter describes how to configure the Cisco ASA to route data, perform authentication, and redistribute routing information using the Enhanced Interior Gateway Routing Protocol (). About, page 1
More informationBridge-Node Selection and Loss Recovery in Island Multicast
Bridge-Node Selection and Loss Recovery in Island Multicast W.-P. Ken Yiu K.-F. Simon Wong S.-H. Gary Chan Department of Computer Science The Hong Kong University of Science and Technology Clear Water
More information