OGF March 2009 Catania, Italy NSI-WG Chain vs. Tree model

Slides:



Advertisements
Similar presentations
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Advertisements

Teknik Routing Pertemuan 20 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Application Presented by Tony Sung On Loy, MC Lab, CUHK IE 1 A Distributed Search.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Routing Information Protocol (RIP). Intra-and Interdomain Routing An internet is divided into autonomous systems. An autonomous system (AS) is a group.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking BGP, Flooding, Multicast routing.
Mobile Routing protocols MANET
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
A Survey of Geocast Routing Protocols 指導教授:許子衡 教授 報告學生:馬敏修 指導教授:許子衡 教授 報告學生:馬敏修.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
Doc.: IEEE /0174r1 Submission Hang Liu, et al. March 2005 Slide 1 A Routing Protocol for WLAN Mesh Hang Liu, Jun Li, Saurabh Mathur {hang.liu,
ROUTING ON THE INTERNET COSC Jun-16. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
© 2006 Open Grid Forum Network Services Interface Policy-based routing enforcement John MacAuley, ESnet 4 th February 2015.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Muhammad Waseem Iqbal Lecture # 20 Data Communication.
1 Computer Networks Chapter 5. Network layer The network layer is concerned with getting packets from the source all the way to the destination. Getting.
William Stallings Data and Computer Communications
The network layer: routing
A Location-Based Routing Method for Mobile Ad Hoc Networks
Dynamic Routing Protocols part2
Introduction to Wireless Sensor Networks
Computer Network Topologies
Packet Switching Datagram Approach Virtual Circuit Approach
Routing Information Protocol (RIP)
What Are Routers? Routers are an intermediate system at the network layer that is used to connect networks together based on a common network layer protocol.
Network Configurations
Rip Routing Protocol.
Chapter 20 Unicast Routing
Internet Networking recitation #4
Introduction to Networks
Net 323 D: Networks Protocols
Client-Server Interaction
THE NETWORK LAYER.
Routing: Distance Vector Algorithm
Net 323 D: Networks Protocols
Net 323 D: Networks Protocols
Mobile and Wireless Networking
by Saltanat Mashirova & Afshin Mahini
CS 3700 Networks and Distributed Systems
Communication operations
Intradomain Routing Outline Introduction to Routing
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
ECE 544 Project3 Team member: BIAO LI, BO QU, XIAO ZHANG 1 1.
Dynamic Routing and OSPF
Packet Switching Around 1970, research began on a new form of architecture for long distance communications: Packet Switching.
NSIS Operation Over IP Tunnels draft-shen-nsis-tunnel-01.txt
Physical Network Topology
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
CS 3700 Networks and Distributed Systems
NSIS Operation Over IP Tunnels draft-ietf-nsis-tunnel-04.txt
Communication Networks
Data-Centric Networking
Distributed Systems CS
EE 122: Intra-domain routing: Distance Vector
Communication Networks
Vinay Singh Graduate school of Software Dongseo University
A Routing Protocol for WLAN Mesh
Distributed Systems CS
Presentation transcript:

OGF 25 2-6 March 2009 Catania, Italy NSI-WG Chain vs. Tree model Radek Krzywania radek.krzywania@man.poznan.pl

Chain model Chain model assumes that nodes/domains are allowed to communicate only one-by-one, passing message from one to another

Tree model Tree communication model does not introduce „reachability” limitations, thus any node/domain can contact directly any other (despite if they are adjacent), also in simultaneous way

Comparison – nodes order Chain Tree Visited nodes has exactly defined order There is no predefined order of reaching nodes

Comparison – AAI Chain Tree AAI consideration may base on neighbor trusts AAI infrastructure needs to allow any-to-any communication

Comparison – failure Chain Tree Less flexibility in case of failure (chain break needed if intermediate node is down) Flexibility in case of failure (can simply avoid not responding node)

Comparison – request update Chain Tree Next nodes along path may have access to previous nodes information (as request may be updated by them) Nodes receives only request message; all information exchange between nodes needs to go through central point (request sender) or be independent messaging process between adjacent nodes

Comparison – flooding and loops Chain Tree Ordered messaging process allows to control messages loops and flooding Flooding possible in one-to-many communication

Comparison – Delivery time Chain Tree Message delivery depends on number of hops between nodes Immediate message delivery independent from nodes distance (hops) – at least theoretically

Coexistence of methods The coexistence of chain and tree communication model is supposed to be possible in some scenarios, however a detailed investigation is needed. E.g. the chain and tree enabled nodes/domains should be grouped, otherwise tree enabled node may try to reach chain enabled nodes skipping the chain.

Examples of messages processing Chain Model Simple reservation request, where each object is expected to provide some resources

Examples of messages processing Chain Model Simple reservation request, where each object is expected to provide some resources Objects are expected to respond one by one to the Object1 before sending request to next object Messages forwarding mechanism

Examples of messages processing Chain Model Reservation request, which is forwarded through all objects, but responses are send individually to the Object1

Examples of messages processing Tree Model Request is sent to all objects (possibly at the same time) and each objects responds individually to the Object1. The order of responses is unpredictable.

Chain and tree model in NSI WG Both models can be used to achieve NSI goals, only the messaging process is different NSI should not choose only one of the method, but should be opened to both (at the same time probably) Messaging should not concern the real objectives of NSI, as this is mostly implementation issue, not architecture

Thank you Q&A, Discussions