公开(公告)号：US20080225864A1

公开(公告)日：2008-09-18

申请号：US11687214

申请日：2007-03-16

申请人： Mustapha Aissaoui ,  Andrew Dolganow ,  Matthew Bocci ,  Alexey Zinin ,  Dimitri Papadimitriou

发明人： Mustapha Aissaoui ,  Andrew Dolganow ,  Matthew Bocci ,  Alexey Zinin ,  Dimitri Papadimitriou

IPC分类号： H04L12/46

CPC分类号： H04L45/04 ,  H04L12/4633 ,  H04L41/12 ,  H04L45/02 ,  H04L45/50

摘要： Communication network routing apparatus and techniques using logical communication links are disclosed. A routing apparatus identifies a logical communication link that it is capable of being used to establish a virtual connection with another routing apparatus within a virtual connection operational domain, which includes multiple sub-domains, of an underlying communication system. A destination that is associated with the routing apparatus and is reachable through the virtual connection is also identified. Information that is indicative of the identified logical communication link and of the identified destination is provided for distribution from a sub-domain of the routing apparatus in the virtual connection operational domain to another sub-domain within the virtual connection operational domain. This distribution of information enables a routing apparatus in one sub-domain to dynamically route a virtual connection toward a destination in a different sub-domain. Data structures for distributing the information are also disclosed.

摘要翻译： 公开了使用逻辑通信链路的通信网络路由设备和技术。 路由装置识别逻辑通信链路，其能够用于与底层通信系统的虚拟连接操作域（包括多个子域）内的另一路由装置建立虚拟连接。 还识别与路由设备相关联并且可通过虚拟连接到达的目的地。 指示所识别的逻辑通信链路和所识别的目的地的信息被提供用于从虚拟连接操作域中的路由设备的子域分发到虚拟连接操作域内的另一个子域。 这种信息分布使得一个子域中的路由设备能够将虚拟连接动态地路由到不同子域中的目的地。 还公开了用于分发信息的数据结构。

公开(公告)号：US20050265260A1

公开(公告)日：2005-12-01

申请号：US10962842

申请日：2004-10-12

申请人： Alexey Zinin ,  Ian Shand

发明人： Alexey Zinin ,  Ian Shand

IPC分类号： H04L12/56 ,  H04L1/00

CPC分类号： H04L45/02 ,  H04L45/04 ,  H04L45/32

摘要： A router executes a flooding algorithm. The router maintains a list of neighbors within an area data structure. When a new neighbor arises on an interface belonging to an area served by the router, the router updates the neighbor data structure describing that adjacency by linking it to a corresponding entry in the list of neighbors. Utilizing information contained in the list of neighbors, as well as information describing the types of interfaces used by the neighbors in the list, the router marks each interface data structure within the area as either flooding-active or flooding-passive. Marking of the interface is performed in connection with an interface election process that selects a flooding-active interface on the basis of, e.g., interface cost, giving preference to faster interfaces. Thereafter, link state protocol data units (PDUs) are sent to the neighbors over those interfaces marked as flooding-active.

摘要翻译： 路由器执行泛洪算法。 路由器维护区域数据结构内的邻居列表。 当新的邻居出现在属于路由器服务区域的接口上时，路由器通过将相邻邻居数据结构链接到邻居列表中的相应条目来更新描述该邻接的邻居数据结构。 使用包含在邻居列表中的信息以及描述列表中邻居使用的接口类型的信息，路由器将该区域内的每个接口数据结构标记为泛洪活动或泛洪 - 被动。 接口的标记是在接口选择过程的基础上进行的，该接口选择过程基于例如接口成本来选择洪泛活动接口，给出更快的接口优先权。 此后，链路状态协议数据单元（PDU）通过标记为泛洪激活的接口发送给邻居。