Tree Configuration in Bridged IEEE1394 Bus Network PHILIPS Research Subrata Banerjee PHILIPS Research Briarcliff P1394.1 WG Meeting March 19-20, 1998.

Slides:

Advertisements

Similar presentations

Chapter 5: Tree Constructions

Advertisements

Communication Networks Recitation 3 Bridges & Spanning trees.

4/12/2015© 2009 Raymond P. Jefferis IIILect Internet Protocol - Continued.

Introduction to Computer Networks Spanning Tree 1.

Topic 7 Local Area Networks (LAN)

Part 2: Preventing Loops in the Network

Packet Switching COM1337/3501 Textbook: Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann Chapter 3.

Joining LANs - Bridges. Connecting LANs 4 Repeater –Operates at the Physical layer no decision making, processing signal boosting only 4 Bridges –operates.

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 19 Introduction to Computer Networks.

Chapter 9 Local Area Network Technology

Bridging. Bridge Functions To extend size of LANs either geographically or in terms number of users. − Protocols that include collisions can be performed.

Minimum Spanning Trees

Spanning Tree Protocol STP STP A broadcast storm occurs when there are so many broadcast frames caught in a Layer 2 loop that all available.

1 Switching and Forwarding Bridges and Extended LANs.

Dec 6, 2007CS573: Network Protocols and Standards1 Transparent Bridging Network Protocols and Standards Winter

LSRP: Local Stabilization in Shortest Path Routing Anish Arora Hongwei Zhang.

CSE331: Introduction to Networks and Security Lecture 7 Fall 2002.

Chapter 7 Network Flow Models.

Making bigger LANs out of small ones What technology is available to us for connecting small LANs together into larger ones?

1 A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm Quan Sun and Horst Langendorfer Telecommunication Systems Journal, vol.11, p.47~58,

1 Structures and Strategies for State Space Search 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.

1 Switching and Forwarding Bridges and Extended LANs.

Sept 14, 2004CS573: Network Protocols and Standards1 Spanning Tree Algorithm Network Protocols and Standards Autumn

Introduction to Computer Networks 09/23 Presenter: Fatemah Panahi.

1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.

Distributed Algorithms 2014 Igor Zarivach A Distributed Algorithm for Minimum Weight Spanning Trees By Gallager, Humblet,Spira (GHS)

TRansparent Interconnection of Lots of Links (TRILL) March 11 th 2010 David Bond University of New Hampshire: InterOperability.

CSC 336 Data Communications and Networking Lecture 7d: Interconnecting LAN Dr. Cheer-Sun Yang Spring 2001.

Protocols for Self-Organization of a Wireless Sensor Network K. Sohrabi, J. Gao, V. Ailawadhi, and G. J. Pottie IEEE Personal Comm., Oct Presented.

1 Spanning Tree Algorithm Advanced Computer Networks.

Minimum Spanning Tree Given a weighted graph G = (V, E), generate a spanning tree T = (V, E’) such that the sum of the weights of all the edges is minimum.

1 Transparent Bridging Advanced Computer Networks.

1 Setting Up Routing Vectors in a Network of Bridged 1394 buses PHILIPS Research Subrata Banerjee PHILIPS Research Briarcliff, New York P WG Meeting,

De-Nian Young Ming-Syan Chen IEEE Transactions on Mobile Computing Slide content thanks in part to Yu-Hsun Chen, University of Taiwan.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

TCP Traffic and Congestion Control in ATM Networks

1 Kyung Hee University Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs.

Computer Networks 15-1 Chapter 15. Connecting LANs, Backbone Networks, and Virtual LANs 15.1 Connecting devices 15.2 Backbone networks 15.3 Virtual LANs.

InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.

Contents p Opportunity for Wireless in 1394 p Proposals p Loose Coupled Bridge p Subnet Architecture p Addressing Scheme p Routing Scheme p Net Management.

1 Data Link Layer Lecture 23 Imran Ahmed University of Management & Technology.

M. Veeraraghavan (originals by J. Liebeherr) 1 Need for Routing in Ethernet switched networks What do bridges do if some LANs are reachable only in multiple.

Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.

Chapter 16 Connecting LANs, Backbone Networks, and Virtual LANs

2/14/2016  A. Orda, A. Segall, 1 Queueing Networks M nodes external arrival rate (Poisson) service rate in each node (exponential) upon service completion.

1 Properties and Features of Virtual 1394 bus PHILIPS Research Subrata Banerjee PHILIPS Research Briarcliff, New York P WG Meeting, Huntington Beach,

Ch. 15 Connecting LANs.

7/11/0666th IETF1 QoS Enhancements to BGP in Support of Multiple Classes of Service Andreas Terzis Computer Science Department Johns Hopkins University.

1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),

Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Multicast with Network Coding in Application-Layer Overlay Networks Y. Zhu, B. Li, and J. Guo University of Toronto Present by Cheng Huang

Spanning Tree Method for Link State Aggregation in Large Communication Networks Whay Choiu Lee.

Single Area OSPF Module 2, Review How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against.

Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.

15.1 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or.

Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.

Instructor Materials Chapter 3: STP

Dijkstra’s shortest path Algorithm

Lab 2 – Hub/Switch Data Link Layer

Spanning Tree Algorithm

Switching and Forwarding Bridges and Extended LANs

Lab 2 – Hub/Switch Data Link Layer

© 2002, Cisco Systems, Inc. All rights reserved.

Graph theory and routing: Background for Network Design

Chapter 16 Connecting LANs, Backbone Networks, and Virtual LANs

Spanning Tree Algorithms

Chapter 15. Connecting Devices

and 6.855J Dijkstra’s Algorithm

Prim’s algorithm for minimum spanning trees

Presentation transcript:

Tree Configuration in Bridged IEEE1394 Bus Network PHILIPS Research Subrata Banerjee PHILIPS Research Briarcliff P WG Meeting March 19-20, 1998

Subrata Banerjee PHILIPS Problem Statement Bridges of different capabilities  Bandwidth  Iso Delay Bridges may introduce unacceptable loops Path between any two bridges  “Minimum bottleneck” route Typically bridge capacity lower than bus capacity N1 C1C2N2

Subrata Banerjee PHILIPS Graph Theory Result Maximum Spanning Tree guarantees Minimum Bottleneck Route Between every pair of nodes Distributed maximum spanning tree algorithm C2 C1

Subrata Banerjee PHILIPS How to Choose Between Two Bridges? Bridge Capability Parameters  Bridge Bandwidth  Bridge Iso_Delay  Bridge Vendor ID = max. of 2 portal vendor IDs  Bridge Node ID = max. of 2 portal vendor IDs Proposed Organization Bridge BW (13) Resv (3) Iso_delay (8)Resv (8) Chip ID (40) Vendor ID (24) (scrambled)

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (1)

Subrata Banerjee PHILIPS BP62 An Example of Tree Conf. Algorithm (2) BP Broadcasts BP31 BP40BP52 BP65 BP27 BP36BP38 BP48 BP21 BP57BP55 BP58 BP34

Subrata Banerjee PHILIPS BP Count=2 An Example of Tree Conf. Algorithm (3) Fragment Roots BP Count=3 BP Count=2 BP Count=4 62, L1 58, L1 57, L1 48, L1 65, L1

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (4) Find Best Neighbor 62, L1 58, L1 57, L1 48, L1 65, L1 Submit

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (5) Join 1 62, L1 58, L1 57, L1 48, L1 65, L1

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (6) Join 1 58, L1 57, L1 48, L1 65, L2

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (7) Find new best neighbor 58, L1 57, L1 48, L1 65, L2

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (8) Join 2 58, L1 57, L1 48, L1 65, L2

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (9) Join 2 58, L2 48, L1 65, L2

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (10) Join 3 48, L1 65, L2 58, L2

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (11) Join 3 58, L2 65, L3

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (12) Join 3 58, L2 65, L3

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (13) Join 4 58, L2

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (14) Join 4

Subrata Banerjee PHILIPS An Example of Tree Conf. Algorithm (15) Join 4

Subrata Banerjee PHILIPS Rules of the Game Fragment A can submit to Fragment B iff Level A  Level B Bridge Capability values are unique. No loops possible LxLy Lz Lx > Lz > Ly > Lx Lx C3 C2 C1 C1 > C2 > C3 > C1

Subrata Banerjee PHILIPS Example of Selected Commands “I am a BP”  data = Unique Bridge Capabilities (UBC) “Report UBC”  data = best UBC from all children “Connect”  data = Fragment Level “Update”  data = Fragment UID, Fragment Level

Subrata Banerjee PHILIPS Once the Tree Topology is Identified... Assign  Bus Ids  Routing Bounds  Portal_Control.rte fields Select Net Cycle Timer Assign Portal_Control.clk fields Details?