Patent classifications
H04L12/913
DiffServ Traffic Engineering compliant backup paths for Fast Reroute protection in MPLS
Systems and methods, in a Label Edge Router (LER) which includes one or more ports and a switching fabric therebetween, include, responsive to a request for a Label Switched Path (LSP) tunnel with a specified DiffServ Traffic Engineering (DSTE) Class Type, signaling a PATH message via a port for the LSP tunnel in a Multiprotocol Label Switching (MPLS) network; incorporating a FAST_REROUTE object in the PATH message which indicates Facility Bypass is desired; and incorporating the DSTE Class Type in the FAST_REROUTE object of the PATH message for a Point of Local Repair (PLR) node in the MPLS network to ensure a Facility Bypass tunnel used for the LSP tunnel supports the specified DSTE Class Type.
MULTI-LEVEL RESOURCE RESERVATION
The present disclosure is directed to a multi-level resource reservation system that obviates one or more of the problems due to limitations and disadvantages of the related art. The multi-level resource reservation system creates, or modifies existing, peer-to-peer protocol(s) to complete a continuous chain of configured ports to support QoS feature(s), e.g., bound latency and guaranteed jitter, for a data flow that traverses an arbitrary sequence of bridges, routers, and virtual links.
Resource allocation device and resource allocation method
A resource allocation device is provided that, responsive to a use request for resources of a network, the use request having a pair of nodes as terminal points designated among a plurality of nodes constituting the network, searches for one or more candidate paths between the terminal points, with which amounts of the resources related to the use request can be allocated, in a state where the resources that have been allocated to one or more other use requests are set aside from the network. The device calculates, for each of the one or more searched-for-candidate paths, in a state where the resources are allocated to the candidate path, a maximum number of paths that can be allocated between the terminal points of a virtual path related to the service, and selects the candidate path with which a sum total of the maximum numbers of paths becomes greatest.
Ultra-low transmission latency for sporadic network traffic
The invention is related to a method for transmitting sporadic data stream (SStream) over a packet switched network carrying out further a transmission of priority data transmission within scheduled successive priority time windows. More particularly, the transmission of the sporadic data stream is preceded by a transmission of a reservation frame (RSVFrame) including information related at least to a timing for transmitting the sporadic data stream outside from said scheduled priority time windows.
PATH DATA DELETION METHOD, MESSAGE FORWARDING METHOD, AND APPARATUS
Embodiments of this application disclose a path data deletion method, a message forwarding method, and related apparatus. A controller disclosed in this application may obtain an identifier of an invalid path from a network node located on the invalid path, and determine, based on the identifier of the invalid path and a first network node providing the identifier of the invalid path, at least a second network node located on the invalid path. The controller is configured to send a path deletion message to the second network node to assist in cleaning invalid path data remaining in a network node, so that it is possible to disable periodic path data synchronization of a network node in a RSVP-TE mechanism. In addition, because path data of an invalid path is cleaned, abnormal data forwarding can be avoided and system stability can be improved.
Server-initiated bandwidth conservation policies
In one embodiment, a social networking system maintains a moving average of the number of connection problems, including socket timeouts and failed uploads, per client in a geographic area to determine whether the wireless data network serving the geographic area is overloaded. In response to detecting a network overload, the social networking system may transmit an instruction to the clients in the particular geographic area to enter one of a plurality of traffic throttling modes. In particular embodiments, the social networking system maintains a historical log of network overload conditions, and uses the historical log to generate an estimate of the wireless network capacity serving a geographic area. Thus, the social networking system may preemptively transmit instructions to clients to enter a bandwidth-conservation mode when the estimated traffic demand exceeds the estimated capacity for a particular geographic region.
PARAMETERIZED QUALITY OF SERVICE IN A NETWORK
A method for managing data transmission comprising making a bandwidth on a network resource available to at least one requestor for transmitting or receiving data according to a first request of a first type, the first type have a prescribed quality of service guarantee; transmitting first data in accordance with the first type to or from the at least one requestor on the network resource using a first portion of the bandwidth, if the first data are available to be transferred to or from the at least one requestor; transmitting second data according to a second request of a second type on the network resource to or from the at least one requestor or a second requestor, the second data transmitted without a quality of service guarantee using a second portion of the bandwidth, if the first portion of the prescribed bandwidth is less than the entire bandwidth.
METHOD AND APPARATUS FOR PROVIDING RESILIENCY FOR DELAY SENSITIVE SERVICES
Various embodiments relate to a method and apparatus for guaranteeing symmetrical delay in both directions for a Time-Division Multiplexing Pseudowire (TDM-PW) service on a packet switching network (PSN), the method including the steps of using a transport method to specify a first path including a corresponding pair of unidirectional service tunnels for the TDM PW service between a master router and a slave router, detecting a failure on either of the corresponding pair of unidirectional service tunnels of the first path between the master router and the slave router, switching the master router and the slave router to a second path including a corresponding pair of unidirectional service tunnels, resetting a jitter buffer on the master router and the slave router and adjusting the jitter buffer to a halfway point, and transmitting and receiving data using the second path including the corresponding pair of unidirectional service tunnels.
Method and apparatus for providing resiliency for delay sensitive services
Various embodiments relate to a method and apparatus for guaranteeing symmetrical delay in both directions for a Time-Division Multiplexing Pseudowire (TDM-PW) service on a packet switching network (PSN), the method including the steps of using a transport method to specify a first path including a corresponding pair of unidirectional service tunnels for the TDM PW service between a master router and a slave router, detecting a failure on either of the corresponding pair of unidirectional service tunnels of the first path between the master router and the slave router, switching the master router and the slave router to a second path including a corresponding pair of unidirectional service tunnels, resetting a jitter buffer on the master router and the slave router and adjusting the jitter buffer to a halfway point, and transmitting and receiving data using the second path including the corresponding pair of unidirectional service tunnels.
TUNNEL PROVISIONING WITH LINK AGGREGATION
A method for processing data packets in a communication network includes establishing a path for a flow of the data packets through the communication network. At a node along the path having a plurality of aggregated ports, a port is selected from among the plurality to serve as part of the path. A label is chosen responsively to the selected port. The label is attached to the data packets in the flow at a point on the path upstream from the node. Upon receiving the data packets at the node, the data packets are switched through the selected port responsively to the label.