JP2009141425A5 - - Google Patents
Download PDFInfo
- Publication number
- JP2009141425A5 JP2009141425A5 JP2007312648A JP2007312648A JP2009141425A5 JP 2009141425 A5 JP2009141425 A5 JP 2009141425A5 JP 2007312648 A JP2007312648 A JP 2007312648A JP 2007312648 A JP2007312648 A JP 2007312648A JP 2009141425 A5 JP2009141425 A5 JP 2009141425A5
- Authority
- JP
- Japan
- Prior art keywords
- virtual
- node
- search packet
- links
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000000875 corresponding Effects 0.000 claims 9
- 239000011159 matrix material Substances 0.000 claims 6
- 230000005540 biological transmission Effects 0.000 claims 1
Claims (11)
1または複数のルーティングプロトコルにより収集された前記ネットワークの情報に基づき、前記ネットワークに含まれる前記複数のノードにそれぞれ対応する複数の仮想ノードブロックと、前記複数のリンクにそれぞれ対応する複数の仮想リンクとを含む仮想ネットワークをプロセッサにより実現させる仮想ネットワーク構成ユニットを有し、
仮想ネットワーク構成ユニットは、前記複数の仮想ノードブロックのうち、前記ソースノードに対応する仮想ソースノードブロックを、前記仮想ソースノードブロックに繋がった全ての仮想リンクに探索パケットを送信するように構成し、さらに、
前記複数の仮想ノードブロックのそれぞれを、受信した前記探索パケットに、前記受信した探索パケットの通過した仮想リンクおよび/または仮想ノードブロックの情報を含む経過情報を追加し、前記受信した探索パケットを複製した探索パケットを、前記受信した探索パケットの到来した仮想リンクを除き、前記それぞれの仮想ノードブロックに繋がった全ての仮想リンクに送信するように構成し、
さらに、当該システムは、
前記複数の仮想ノードブロックのうち、前記宛先ノードに対応する仮想宛先ノードブロックに到着した複数の前記探索パケットの前記経過情報により、前記ソースノードから前記宛先ノードに至る複数の経路から所定の条件に合致する経路を選択する経路選択ユニットを有する、システム。 A system for searching for a route from a source node to one or more destination nodes in a network including a plurality of nodes and a plurality of links connecting them,
A plurality of virtual node blocks respectively corresponding to the plurality of nodes included in the network , and a plurality of virtual links respectively corresponding to the plurality of links, based on the network information collected by one or a plurality of routing protocols ; Including a virtual network configuration unit that realizes a virtual network including:
The virtual network configuration unit configures a virtual source node block corresponding to the source node among the plurality of virtual node blocks so as to transmit a search packet to all virtual links connected to the virtual source node block, further,
Each of the plurality of virtual node blocks is added to the received search packet with progress information including information on the virtual link and / or virtual node block through which the received search packet has passed, and the received search packet is duplicated. Configured to transmit the search packet to all the virtual links connected to the respective virtual node blocks, excluding the virtual link from which the received search packet has arrived,
Furthermore, the system
Among the plurality of virtual node blocks, the progress information of the plurality of search packets that have arrived at the virtual destination node block corresponding to the destination node is set to a predetermined condition from a plurality of routes from the source node to the destination node. A system having a route selection unit for selecting a matching route.
前記経路選択ユニットは、複数の前記経過情報の前記ビットマップデータのビット単位の論理積を演算することにより、前記ソースノードから前記宛先ノードに至る複数の経路から、ディスジョイントな経路を選択する、システム。 The progress information according to claim 1, wherein the progress information includes bitmap data that can identify the passed virtual link and / or virtual node block by a bit position,
The path selection unit selects a disjoint path from a plurality of paths from the source node to the destination node by calculating a bitwise logical product of the bitmap data of the plurality of pieces of progress information. system.
前記仮想ネットワーク構成ユニットは、前記複数のプロセッシングエレメントにより前記複数の仮想ノードブロックを構成し、前記接続マトリクスにより前記複数の仮想リンクを構成する、システム。The system in which the virtual network configuration unit configures the plurality of virtual node blocks by the plurality of processing elements and configures the plurality of virtual links by the connection matrix.
前記仮想ネットワークを構成するユニットは、前記接続マトリクスと、前記複数の遅延エレメントとにより、前記複数の仮想リンクを構成し、それぞれの仮想リンクに含まれる遅延エレメントには、対応するリンクのコストに対応する遅延量を設定する、システム。 In Claim 3 , the plurality of processing elements include a plurality of delay elements that can dynamically set the delay amount,
The units constituting the virtual network configure the plurality of virtual links by the connection matrix and the plurality of delay elements, and the delay elements included in the respective virtual links correspond to the cost of the corresponding links. Set the amount of delay to be performed.
1または複数のルーティングプロトコルにより収集された前記ネットワークの情報に基づき、前記ネットワークに含まれる前記複数のノードにそれぞれ対応する複数の仮想ノードブロックと、前記複数のリンクにそれぞれ対応する複数の仮想リンクとを含む仮想ネットワークであって、前記プロセッサにより実現された仮想ネットワークの、前記複数の仮想ノードブロックのうち、前記ソースノードに対応する仮想ソースノードブロックが、前記仮想ソースノードブロックに繋がった全ての仮想リンクに探索パケットを送信することと、
前記複数の仮想ノードブロックのそれぞれが、受信した前記探索パケットに、前記受信した探索パケットの通過した仮想リンクおよび/または仮想ノードブロックの情報を含む経過情報を追加し、前記受信した探索パケットを複製した探索パケットを、前記受信した探索パケットの到来した仮想リンクを除き、前記それぞれの仮想ノードブロックに繋がった全ての仮想リンクに送信することと、
前記複数の仮想ノードブロックのうち、前記宛先ノードに対応する仮想宛先ノードブロックに到着した複数の前記探索パケットの前記経過情報により、前記ソースノードから前記宛先ノードに至る複数の経路から所定の条件に合致する経路を選択することとを含む方法。 A method for searching a path from a source node to one or more destination nodes using a processor in a network including a plurality of nodes and a plurality of links connecting the nodes,
A plurality of virtual node blocks respectively corresponding to the plurality of nodes included in the network , and a plurality of virtual links respectively corresponding to the plurality of links, based on the network information collected by one or a plurality of routing protocols ; All virtual nodes in which a virtual source node block corresponding to the source node among the plurality of virtual node blocks of the virtual network realized by the processor is connected to the virtual source node block. Sending a search packet on the link;
Each of the plurality of virtual node blocks adds, to the received search packet, progress information including information on the virtual link and / or virtual node block through which the received search packet has passed, and replicates the received search packet. Sending the search packet to all virtual links connected to the respective virtual node blocks, excluding the virtual link from which the received search packet has arrived;
Among the plurality of virtual node blocks, the progress information of the plurality of search packets that have arrived at the virtual destination node block corresponding to the destination node is set to a predetermined condition from a plurality of routes from the source node to the destination node. Selecting a matching route.
当該方法は、前記送信することの前に、Before the transmission, the method
前記複数のプロセッシングエレメントにより前記複数の仮想ノードブロックを構成し、前記接続マトリクスにより前記複数の仮想リンクを構成し、前記再構成ユニットに前記仮想ネットワークを構成することを含む方法。Configuring the plurality of virtual node blocks by the plurality of processing elements, configuring the plurality of virtual links by the connection matrix, and configuring the virtual network in the reconfiguration unit.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2007312648A JP4894013B2 (en) | 2007-12-03 | 2007-12-03 | System and method for searching a path between nodes included in a network |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2007312648A JP4894013B2 (en) | 2007-12-03 | 2007-12-03 | System and method for searching a path between nodes included in a network |
Publications (3)
Publication Number | Publication Date |
---|---|
JP2009141425A JP2009141425A (en) | 2009-06-25 |
JP2009141425A5 true JP2009141425A5 (en) | 2011-01-27 |
JP4894013B2 JP4894013B2 (en) | 2012-03-07 |
Family
ID=40871645
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP2007312648A Expired - Fee Related JP4894013B2 (en) | 2007-12-03 | 2007-12-03 | System and method for searching a path between nodes included in a network |
Country Status (1)
Country | Link |
---|---|
JP (1) | JP4894013B2 (en) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP5307902B2 (en) | 2009-12-25 | 2013-10-02 | パナソニック株式会社 | Network position recognition system and terminal position recognition apparatus |
JP5633281B2 (en) | 2010-09-29 | 2014-12-03 | 富士通株式会社 | Optical communication system, optical network management apparatus, and optical network management method |
JP5582590B2 (en) * | 2010-11-19 | 2014-09-03 | 日本電気株式会社 | Route selection apparatus, program, and method |
CN103283191B (en) | 2010-12-28 | 2016-02-03 | 日本电气株式会社 | Information system, control device, communication means |
JP6113443B2 (en) * | 2012-09-14 | 2017-04-12 | 株式会社日立国際電気 | Communication system and communication method thereof |
US11301514B2 (en) | 2013-03-02 | 2022-04-12 | Leon Guzenda | System and method to identify islands of nodes within a graph database |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3132996B2 (en) * | 1995-03-02 | 2001-02-05 | 三菱電機株式会社 | Network route setting method and network route setting device |
JP2005006235A (en) * | 2003-06-16 | 2005-01-06 | Hitachi Ltd | Network monitoring system and monitoring method, and program |
JP2005229567A (en) * | 2004-01-13 | 2005-08-25 | Jiyuuro Takase | System for packet communication in neighboring network |
JP4654731B2 (en) * | 2005-03-31 | 2011-03-23 | 富士ゼロックス株式会社 | Integrated circuit device and signal processing device |
EP1773003B1 (en) * | 2005-10-04 | 2014-01-15 | NTT DoCoMo, Inc. | Method and apparatus for discovering disjoint routes to multiple service nodes |
JP4734539B2 (en) * | 2006-05-15 | 2011-07-27 | 学校法人慶應義塾 | System and method for searching for the shortest path between nodes in a network |
-
2007
- 2007-12-03 JP JP2007312648A patent/JP4894013B2/en not_active Expired - Fee Related
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10924352B2 (en) | Data center network topology discovery | |
CN107360092B (en) | System and method for balancing load in data network | |
Liu et al. | Data center networks: Topologies, architectures and fault-tolerance characteristics | |
CN103020009B (en) | Expansible network-on-chip | |
KR101809396B1 (en) | Method to route packets in a distributed direct interconnect network | |
CN104335537B (en) | For the system and method for the multicast multipath of layer 2 transmission | |
CN101888333B (en) | Method and apparatus for maintaining port state tables in a forwarding plane of a network element | |
CN102724098B (en) | Avionic device full duplex exchanges the compatible communication switchboard of Ethernet phase | |
JP2009141425A5 (en) | ||
US10834484B2 (en) | Flat, highly connected optical network for data center switch connectivity | |
CN104246700A (en) | System and method for routing traffic between distinct infiniband subnets based on fat-tree routing | |
CN103119901A (en) | Communication system, control apparatus, configuration method for processing rules, and program | |
US10291551B2 (en) | Switching fabric topology based on traversing asymmetric routes | |
CN104579951B (en) | Novel failure and the fault-tolerance approach under congestion model in network-on-chip | |
CN108471383A (en) | Message forwarding method, device and system | |
TW201412071A (en) | Statistics and failure detection in a network on a chip (NoC) network | |
Sem-Jacobsen et al. | Dynamic fault tolerance in fat trees | |
CN104796281B (en) | Network element and controller for managing network element | |
CN103685041B (en) | Programmable router and routing method based on bit granularity | |
JP4894013B2 (en) | System and method for searching a path between nodes included in a network | |
Bogdanski | Optimized routing for fat-tree topologies | |
JP5950019B2 (en) | Communication system, integrated controller, packet transfer method and program | |
Dong et al. | Accl: Architecting highly scalable distributed training systems with highly efficient collective communication library | |
Bogdanski et al. | Discovery and routing of degraded fat-trees | |
Reinemo et al. | Multi-homed fat-tree routing with InfiniBand |