摘要:
A method in a network utilizing a distributed connection-oriented control plane includes signaling a first path for a first connection from a first source node; storing call information for the first connection at any intermediate nodes in the first path; signaling a second path for a second connection from a second source node; checking at any intermediate nodes in the second path if there is absolute route diversity between the first connection and the second connection responsive to a requirement therein; and responsive to detecting a diversity violation at an intermediate node of the any intermediate nodes in the second path, signaling a crankback to the second source node with the call information for the first connection included therein; and recomputing the second path exclusive of the first path based on the call information responsive to receiving the crankback. A network and node are also described.
摘要:
A method in a network utilizing a distributed connection-oriented control plane includes signaling a first path for a first connection from a first source node; storing call information for the first connection at any intermediate nodes in the first path; signaling a second path for a second connection from a second source node; checking at any intermediate nodes in the second path if there is absolute route diversity between the first connection and the second connection responsive to a requirement therein; and responsive to detecting a diversity violation at an intermediate node of the any intermediate nodes in the second path, signaling a crankback to the second source node with the call information for the first connection included therein; and recomputing the second path exclusive of the first path based on the call information responsive to receiving the crankback. A network and node are also described.
摘要:
Virtual routers that abstract photonic sub-domains are provided for GMPLS networks. A virtual router uses a link viability matrix to keep track of the set of viable connections between inputs and outputs of a photonic sub-domain. A virtual router may receive RSVP-TE signaling messages and either allocate a working input to output link pair or, if explicitly signaled, verify that the requested link is currently viable. A virtual router also advertises, in its link state updates, the current set of possible outputs for any input link. Shortest path computations can be implemented utilizing virtual routers by modifying a topology graph in accordance with the link viability matrix of the virtual router.
摘要:
Virtual routers that abstract photonic sub-domains are provided for GMPLS networks. A virtual router uses a link viability matrix to keep track of the set of viable connections between inputs and outputs of a photonic sub-domains. A virtual router may receive RSVP-TE signaling messages and either allocate a working input to output link pair or, if explicitly signaled, verify that the requested link is currently viable. A virtual router also advertises, in its link state updates, the current set of possible outputs for any input link. Shortest path computations can be implemented utilizing virtual routers by modifying a topology graph in accordance with the link viability matrix of the virtual router.
摘要:
Virtual routers that abstract photonic sub-domains are provided for GMPLS networks. A virtual router uses a link viability matrix to keep track of the set of viable connections between inputs and outputs of a photonic sub-domain. A virtual router may receive RSVP-TE signaling messages and either allocate a working input to output link pair or, if explicitly signaled, verify that the requested link is currently viable. A virtual router also advertises, in its link state updates, the current set of possible outputs for any input link. Shortest path computations can be implemented utilizing virtual routers by modifying a topology graph in accordance with the link viability matrix of the virtual router.
摘要:
A method of managing a network comprising a plurality of nodes. Each node maintains a respective topology database containing topology information of the network within a local region of the node, the local region encompassing a subset of the plurality of nodes of the network. The nodes of the network implementing a Recursive Path Computation algorithm to compute end-to-end routes through the network.
摘要:
A method of reconfiguring a network having a transport plane for carrying subscriber traffic flows within end-to-end connections, a control plane for managing at least a portion of resources of the transport plane allocated to each connection, and a management plane for implementing management functions in the control plane and any resources of the transport plane that are not managed by the control plane. The method comprises installing an updated version of a control plane name space for a target node of the network. For each connection traversing the target node: a control plane to management plane migration is performed for removing connection state in the control plane associated with the connection, so as to transfer ownership of the connection from the control plane to the management plane; followed by a management plane to control plane migration for installing new connection state in the control plane associated with the connection, so as to transfer ownership of the connection from the management plant to the control plane, the new connection state being defined using the updated version of the control plane name space.
摘要:
Methods of computing a path through a network between a source node and a destination node. At the source node, an explore message is launched into at least one link hosted by the source node. The explore message includes a path vector containing a node identifier of the source node. At a node intermediate the source node and the destination node, the explore message is received, and each link hosted by the node that can be operably added to the path is identified. A respective node identifier of the node is added to the path vector of the explore message, which is then forwarded through each identified link. At the destination node, the respective path vector is extracted from at least one received explore message.
摘要:
A method and system for routing a connection on a communication network. A first bandwidth pool is classified as a long lived bandwidth pool and a second bandwidth pool is classified as a short lived bandwidth pool. The long lived bandwidth pool is used to route connections having a duration that are expected to equal or exceed a predetermined time. The short lived bandwidth pool is used to route connections having a duration that are not expected to exceed the predetermined time. A request to route a connection on the communication network is received. At least one characteristic of the connection is determined and is used to determine whether to route the connection on the long lived bandwidth pool or short lived bandwidth pool.
摘要:
Multiple RSVP messages are used to separately signal components of co-routed VCAT to enable the separate components to be implemented on different physical fibers of a link bundle. To enable the PATH messages to be handled as a group, the multiple PATH messages are grouped together and sent out in a RSVP bundle message. When a RSVP bundle message containing multiple PATH messages is received at a network element, such as an ENNI, where the route for the PATH messages needs to be expanded, the route is expanded collectively rather than individually. Specifically, the route will first be expanded and this expanded route will be inserted into each individual PATH message. The modified PATH messages with the expanded route will then be passed through the RSVP finite state machine one at a time to enable resources to be reserved for the connections of the VCAT. Thus, a single LSP may be created for each channel, and the channels may be co-routed even where route expansion is required.