Presentation is loading. Please wait.

Presentation is loading. Please wait.

Study on Net Manager Selection Algorithm IEEE P1394.1 Working Group St.Petersburg, FL Meeting June 09, 1998 Masa Akahane, Hisaki Hiraiwa Sony Corporation.

Published byValentina Norrod Modified over 9 years ago

Similar presentations

Presentation on theme: "Study on Net Manager Selection Algorithm IEEE P1394.1 Working Group St.Petersburg, FL Meeting June 09, 1998 Masa Akahane, Hisaki Hiraiwa Sony Corporation."— Presentation transcript:

1 Study on Net Manager Selection Algorithm IEEE P1394.1 Working Group St.Petersburg, FL Meeting June 09, 1998 Masa Akahane, Hisaki Hiraiwa Sony Corporation akahane@wcs.sony.co.jp hira@wcs.sony.co.jp

2 Sony Corporation 2 Agenda p Review on Subnet Structure p Net Manager Selection (Revised) p Concept and assumption p Step by step transition p Open Issue p Conclusion

3 Sony Corporation 3 Review on Subnet Structure p Disadvantages of Single Plane Structure p Need to manage up to 1023 buses p Configuration (re-routing, manager selection, etc.) could be a significant load when the topology changes p p Advantages of Hierarchical Structure (Subnet) p p Net manager and subnet managers handle up to 31 subnets and buses respectively in the case of two 5 bits p p Localize the reconfiguration within a subnet when the topology changes

4 Sony Corporation 4 Single Plane Architecture Bridge Manager Reconfiguration could be a heavy load in case a critical path is torn !

5 Sony Corporation 5 Hierarchical Architecture Subnet Manager - Node_ID consists of sunbet_ID(5bit), bus_ID(5bit) and phy_ID(6bit) 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1

6 Sony Corporation 6 Today’s Contribution - Bridge Manager or Subnet Manger selection scheme has to be specified anyway - Subnet Manager selection scheme is supposed to be the same as Bridge Manager selection - Net Manager selection scheme is the extra portion if we choose Subnet structure

7 Sony Corporation 7 Net Manager Selection Overview p Assumption p Subnet managers should be selected in advance p Classified criteria should be specified for “Rank” table p Every subnet manager has the ability to be the Net Manager p Trigger of the start of selection should be specified under “Reset Notification” discussion p p Procedure p p Exploring the Net Manager by “Duel” with Rank table p p EUI-Duel is placed as tiebreaker if Rank-Duel results in Draw p p Status Register and some commands are prepared for the selection process

8 Sony Corporation 8 Duel Rules p Duel is based on Rank table p The higher rank holder wins the duel p The loser’s duel_rank is overwritten with the winner’s p In the case of draw, bit-reversed EUI is used for tiebreaker p If the tiebreaker results in draw, it tells there is a loop

9 Sony Corporation 9 Ready for Duel 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank is stored in the Config-ROM Duel_Rank is copied from Mgr_Rank Status Register is set to “No_Duel” Mgr_Rank is stored in the Config-ROM Duel_Rank is copied from Mgr_Rank Status Register is set to “No_Duel” Mgr_Rank=5 Duel_Rank=5 Mgr_Rank=3 Duel_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 Duel_Rank=6 Status No_DuelInitial status Wait_ResultWaiting for the duel result status ChildLoser to be confirmed Child_FinishConfirmed loser ParentWinner to be confirmed Parent_FinishConfirmed winner Draw_FinishTied situation (It happens when a loop exists) Status No_DuelInitial status Wait_ResultWaiting for the duel result status ChildLoser to be confirmed Child_FinishConfirmed loser ParentWinner to be confirmed Parent_FinishConfirmed winner Draw_FinishTied situation (It happens when a loop exists)

10 Sony Corporation 10 Duel in Progress - 1 Duel_Rank=3 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 Duel_Rank=5 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 Duel_Rank=6 DUEL Duel is originated by “Duel_Request” command and it is generated by every Subnet Manager independently. The result of Duel is notified by “Duel_Result” command. 3 -> 5

11 Sony Corporation 11 Duel in Progress - 2 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 Duel_Rank=5 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 Duel_Rank=6 DUEL Duel_Rank=55 -> 6

12 Sony Corporation 12 Duel in Progress - 3 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 Duel_Rank=5 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 Duel_Rank=6 DUEL 6 -> 9

13 Sony Corporation 13 Duel in Progress - 4 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 Duel_Rank=6 9 DUEL Duel_Rank=95 -> 9

14 Sony Corporation 14 Duel in Progress - 5 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 9 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 9 DUEL Duel_Rank=66 -> 9

15 Sony Corporation 15 Duel in Progress - 6 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 9 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 9 9 DUEL

16 Sony Corporation 16 Duel in Progress - 7 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 9 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 9 9 Finish Those Subnet Managers whose Status : - doesn’t contain “No_Duel” nor “Child” and - contains “Parent” can initiate “Finish” command.

17 Sony Corporation 17 Duel in Progress - 8 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 9 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 9 9 Finish

18 Sony Corporation 18 Duel in Progress - 9 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 9 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 9 9 Finish

19 Sony Corporation 19 Duel in Progress - 10 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 9 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 9 9 Selection_End Winner ! The Subnet Manager whose Status only contains either “Child_Finish” or “Draw_Finish” becomes the Net Manager and the Net Manager initiates “Selection_End” command to all of neighbors. Selection_End

20 Sony Corporation 20 Duel in Progress - 11 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Mgr_Rank=5 9 Mgr_Rank=3 Mgr_Rank=9 Duel_Rank=9 Mgr_Rank=6 9 9 Winner ! Upon receiving “Selection_End”, it propagates “Selection_End” to the subnet manager whose status is “Child_Finish”, if any. Selection_End

21 Sony Corporation 21 Duel Result 1) The winner A is the Net Manager 2) The net is logically broken down as a tree structure 3) Status information could be used for Net Configuration A B D C A B C D DRAWDRAW Child

22 Sony Corporation 22 Command and Status Summary p Commands p duel_request_up / _down Duel origination p duel_result_up / _down Response with duel result p finish_up / _down Finish notification from the winner p selection_end_up / _down Finish notification from a loser to the other losers 0 2 0 1 3 42 03 2 0 0 1 3 2 1

23 Sony Corporation 23 Command List - 1 duel_request_up destination_portal_id command_code Reserved request_counter duel_EUI_hi duel_EUI_lo duel_rank destination_portal_id command_code Reserved request_counter duel_EUI_hi duel_EUI_lo duel_rank source_portal_id command_code Reserved request_counter duel_EUI_hi duel_EUI_lo duel_rank duel_request_down duel_result_up source_portal_id command_code Reserved request_counter duel_EUI_hi duel_EUI_lo duel_rank duel_result_down Result 01- I win 10- You win 11- Draw Result 01- I win 10- You win 11- Draw

24 Sony Corporation 24 Command List - 2 finish_up destination_portal_id command_code Reserved destination_portal_id command_code Reserved source_portal_id command_code Reserved finish_down selection_end_up source_portal_id selection_end_down Reserved command_code Reserved

25 Sony Corporation 25 Open Issue p What makes the boundary between subnets? p “Loose Coupled Bridge” for wireless was implicit boundary but... p The boundary should exist before the Subnet Manager selection starts p Ideas p Boundary between subnets should be specified either : p Two different products: 1) Inter-Bus Bridge or 2) Inter-Subnet Bridge p Users has to decide which one has to be fit for the use p Putting dip-switch with user configurable p Sounds against “Plug and Play”, however, such a large network needs some level of user configuration anyway p Automatic configuration to build subnets p Very difficult !

26 Sony Corporation 26 Subnet Architecture Subnet Manager 0 1 2 1 1 0 0 1 3 0 1 3 4 2 2 1 3 4 0 5 4 0 2 3 4 2 1 0 3 5 5 3 2 1 1 03 2 44 2 10 2 3 3 1 0 4 6 0 3 4 1 Who specifies those boundaries ?

27 Sony Corporation 27 Conclusion p Introduced the advantages of subnet structure p Simplicity in terms of its hardware and software structure p Specified detail algorithm of Net Manager Selection p Further Study p Subnet Manager Selection Scheme p Trigger of the start of the selection p Subnet boundary issue

Download ppt "Study on Net Manager Selection Algorithm IEEE P1394.1 Working Group St.Petersburg, FL Meeting June 09, 1998 Masa Akahane, Hisaki Hiraiwa Sony Corporation."

Similar presentations

Submission Page 1 August 2002 doc.: IEEE 802.11-02/503r0 Daryl Kaiser, Cisco Systems Radio Measurement: A Candidate Approach Daryl Kaiser (Cisco Systems)

Submission Page 1 August 2002 doc.: IEEE /503r0 Daryl Kaiser, Cisco Systems Radio Measurement: A Candidate Approach Daryl Kaiser (Cisco Systems)
Ver 1,12/09/2012Kode :CIJ 340,Jaringan Komputer Lanjut FASILKOM Routing Protocols and Concepts – Chapter 3 Introduction to Dynamic Routing Protocol CCNA.

Ver 1,12/09/2012Kode :CIJ 340,Jaringan Komputer Lanjut FASILKOM Routing Protocols and Concepts – Chapter 3 Introduction to Dynamic Routing Protocol CCNA.
IEEE 802.1D: Spanning Tree Algorithm and the Filtering Database Ben Schultz Bridge Functions Consortium UNH InterOperability Lab July, 2000.

IEEE 802.1D: Spanning Tree Algorithm and the Filtering Database Ben Schultz Bridge Functions Consortium UNH InterOperability Lab July, 2000.
Calculating Subnet Masks

Calculating Subnet Masks
Chapter 9 Local Area Network Technology

Chapter 9 Local Area Network Technology
Lecture 8 Active Directory Structure. Domains Domains group network objects and OUs into a unit with a security boundary. By default, security policies.

Lecture 8 Active Directory Structure. Domains Domains group network objects and OUs into a unit with a security boundary. By default, security policies.
Transaction.

Transaction.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
Brent Dingle Marco A. Morales Texas A&M University, Spring 2002

Brent Dingle Marco A. Morales Texas A&M University, Spring 2002
COS 420 Day 18. Agenda Group Project Discussion Program Requirements Rejected Resubmit by Friday Noon Protocol Definition Due April 12 Assignment 3 Due.

COS 420 Day 18. Agenda Group Project Discussion Program Requirements Rejected Resubmit by Friday Noon Protocol Definition Due April 12 Assignment 3 Due.
Minesweeper is a game of logic. It originated from “Relentless Logic,” which was written by Conway, Hong, and Smith around 1985. In Relentless Logic, the.

Minesweeper is a game of logic. It originated from “Relentless Logic,” which was written by Conway, Hong, and Smith around In Relentless Logic, the.
Software Project Transition Planning

Software Project Transition Planning
Data Management I DBMS Relational Systems. Overview u Introduction u DBMS –components –types u Relational Model –characteristics –implementation u Physical.

Data Management I DBMS Relational Systems. Overview u Introduction u DBMS –components –types u Relational Model –characteristics –implementation u Physical.
Ken Bayer, Josh Snyder, and Berthe Y. Choueiry Constraint Systems Laboratory University of Nebraska-Lincoln A Constraint-Based Approach to Solving Minesweeper.

Ken Bayer, Josh Snyder, and Berthe Y. Choueiry Constraint Systems Laboratory University of Nebraska-Lincoln A Constraint-Based Approach to Solving Minesweeper.
Caching And Prefetching For Web Content Distribution Presented By:- Harpreet Singh Sidong Zeng ECE -7995 Fall 2007.

Caching And Prefetching For Web Content Distribution Presented By:- Harpreet Singh Sidong Zeng ECE Fall 2007.
Memory Consistency Models Some material borrowed from Sarita Adve’s (UIUC) tutorial on memory consistency models.

Memory Consistency Models Some material borrowed from Sarita Adve’s (UIUC) tutorial on memory consistency models.
1 Internet Protocol: Forwarding IP Datagrams Chapter 7.

1 Internet Protocol: Forwarding IP Datagrams Chapter 7.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. PROJECT.

NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. PROJECT.
GENERAL CONCEPTS OF OOPS INTRODUCTION With rapidly changing world and highly competitive and versatile nature of industry, the operations are becoming.

GENERAL CONCEPTS OF OOPS INTRODUCTION With rapidly changing world and highly competitive and versatile nature of industry, the operations are becoming.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.

Similar presentations

Ads by Google