摘要:
A method of creating/terminating a connection associated with an end-to-end path defined through a communications network. According to the invention, cross-connection download/undownload processes in each intermediate node of the end-to-end path are triggered substantially in parallel. A confirmation message indicative of successful completion of respective download/undownload processes in each intermediate node is subsequently propagated to an end-node of the path.
摘要:
A method of creating/terminating a connection associated with an end-to-end path defined through a communications network. According to the invention, cross-connection download/undownload processes in each intermediate node of the end-to-end path are triggered substantially in parallel. A confirmation message indicative of successful completion of respective download/undownload processes in each intermediate node is subsequently propagated to an end-node of the path.
摘要:
A method and system for changing the extent of data plane resources controlled by a control plane for a network connection which spans a contiguous set of nodes controlled by existing network control resources is disclosed. This is done in a non-disruptive manner. This typically involves two steps: i) Creating a new set of control plane resources for said network connection such that said data plane resources are shared with said existing network control resources; and ii) then terminating the existing network control resources such that said data plane resources are fully transferred to the new set of control plane resources without disrupting said network connection. The existing network control resources can be either a control plane resource or a non control plane resource. An example of a non control plane resource is network management software (e.g., an OSS (Operation Support System)), which forms part of the Management Plane. It should be noted that this does not need to be done for a complete end-to-end connection, but rather can be executed for the portion of the end-to-end connection which is to be controlled by the control plane.
摘要:
A method and system for changing the extent of data plane resources controlled by a control plane for a network connection which spans a contiguous set of nodes controlled by existing network control resources is disclosed. This is done in a non-disruptive manner. This typically involves two steps: i) Creating a new set of control plane resources for said network connection such that said data plane resources are shared with said existing network control resources; and ii) then terminating the existing network control resources such that said data plane resources are fully transferred to the new set of control plane resources without disrupting said network connection. The existing network control resources can be either a control plane resource or a non control plane resource. An example of a non control plane resource is network management software (e.g., an OSS (Operation Support System)), which forms part of the Management Plane. It should be noted that this does not need to be done for a complete end-to-end connection, but rather can be executed for the portion of the end-to-end connection which is to be controlled by the control plane.
摘要:
A call setup and restoration schema is disclosed for providing an improved priority-based call setup and restoration schema in an optical communications system, allowing higher priority connections access to bandwidth by user-definable parameters. The call setup and restoration schema includes allowing higher priority connections to claim the resources of lower priority connections, and restoring them when bandwidth is available, or bumping another, even lower priority, connections. This aids in providing access to bandwidth by high priority services and in preventing outages or connection delays for high priority connections.
摘要:
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.
摘要:
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.
摘要:
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 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.