摘要:
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.
摘要:
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.
摘要:
The present disclosure provides systems and methods for administrative boundaries in a single domain optical network such as emulation of an External network-network interface (ENNI) using an Internal-Network to Network Interface (INNI). For example, in a single monolithic domain, a network and associated network elements may discover network elements, build topology, compute paths, establish new calls, etc. A user may identify/mark specific links as emulated “ENNI” links with the specific links actually being INNI links. As a call traverses this emulated link, a new call is initiated (much in the same way a new call segment would be created for a call). Signaling proceeds as normal. When the call set-up is fully complete, instead of a single call segment, many call segments exists. Advantageously, this allows use of INNI control plane features while allowing a network operator to future-proof their network by installing call segments at future boundary points.
摘要:
The invention is directed to optimizing setup of a VCAT connections using (largest) CCAT containers so as to minimize the number of cross-connection commands needed to enable data transfer. A system and method are provided for enhancing VCAT networks to include faster service restoration rates and faster connection setup times. One embodiment includes expanding available VCAT timeslots to include available CCAT timeslots. A routing and signaling control module alerts a source network element, internal network elements and a destination network element that the data transmission includes VCAT payloads rather than the expected CCAT payloads. By issuing this alert, the routing and signaling control module instructs an end-point monitoring function to overlook any mismatch between the expected CCAT rate and the received VCAT traffic. Otherwise, if the mismatch is not overlooked, then the end-point monitoring function will squelch the received VCAT traffic, which terminates the data communication.
摘要:
A resilient virtual Ethernet ring has nodes interconnected by working and protection paths. If a span fails, the two nodes immediately on either side of the failure are cross-connected to fold the ring. Working-path traffic is cross-connected onto the protection path at the first of the two nodes and is then cross-connected back onto the working path at the second of the two nodes so that traffic always ingresses and egresses the ring from the working path. A traffic originating node, upon determining that transmitted packets are being looped back due to a fault on a primary path, is adapted to switch transmission of data packets from the primary path to a secondary path.
摘要:
A method of extending the control plane to a network edge for a network having first set of nodes of the network are designated as core nodes, each core node being operable to route subscriber traffic between a pair of neighbour core nodes and a second set of control-plane enabled nodes of the network designated as tail nodes, each tail node connected to a core node and operating only as a source or sink of subscriber traffic. Each core node that is connected to at least one tail node is designated as a host node. The host node is controlled to advertise summary information of its connected tail nodes to other core and tail nodes in the network, thus making it possible to extend control plane function to the tail nodes which can calculate connection routes, set-up/tear-down connections and perform connection failure recovery functions.
摘要:
A method of extending the control plane to a network edge for a network having first set of nodes of the network are designated as core nodes, each core node being operable to route subscriber traffic between a pair of neighbor core nodes and a second set of control-plane enabled nodes of the network designated as tail nodes, each tail node connected to a core node and operating only as a source or sink of subscriber traffic. Each core node that is connected to at least one tad node is designated as a host node. The host node is controlled to advertise summary information of its connected tail nodes to other core and tail nodes in the network, thus making it possible to extend control plane function to the tail nodes which can calculate connection routes, set-up/tear-down connections and perform connection failure recovery functions.
摘要:
The present disclosure provides systems and methods for administrative boundaries in a single domain optical network such as emulation of an External network-network interface (ENNI) using an Internal-Network to Network Interface (INNI). For example, in a single monolithic domain, a network and associated network elements may discover network elements, build topology, compute paths, establish new calls, etc. A user may identify/mark specific links as emulated “ENNI” links with the specific links actually being INNI links. As a call traverses this emulated link, a new call is initiated (much in the same way a new call segment would be created for a call). Signaling proceeds as normal. When the call set-up is fully complete, instead of a single call segment, many call segments exists. Advantageously, this allows use of INNI control plane features while allowing a network operator to future-proof their network by installing call segments at future boundary points.
摘要:
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.