Abstract: A de-jitter function for holding-and-forwarding packets such that the packets are delivered with an agreed fixed latency. The de-jitter function can be placed at the edge of a virtual 5G TSN switch (e.g. the de-jitter function can be deployed as part of a UPF for uplink (UL) packets and/or it can be deployed as part of a user equipment (UE) for downlink (DL) packets). By using the de-jitter function, the TSN can consider the wireless network as having a consistent, deterministic latency with no jitter.

Abstract: A method for propagating data packets in a network of nodes is disclosed.

Abstract: A system for closed loop prefix management for white boxes includes a network device, a route reflector coupled to the network device, a software defined network controller coupled to the route reflector and the network device, and a prefix usage analyzer in the software defined network controller. The prefix usage analyzer determines usage attributes of prefixes and identifies the prefixes with a predetermined usage attribute. The software defined network controller instructs a network controller in the network device to store the prefixes with the predetermined usage attributes in a table in the network device.

Abstract: Disclosed herein includes a system, a method, and a device for providing persistence across applications using a content switching server. A device can receive a first request from a client for a version of an application having different versions provided by one or more servers. The device can provide access to each version of the application via different load balancing virtual servers. A content switching virtual server of the device can select a load balancing virtual server to handle the first request for the version of the application. The content switching virtual server can generate a session identifier for a session between the client and the version of the application to persist the session with the selected load balancing virtual server for subsequent requests from the client for the version of the application.

Abstract: Certain aspects of the present disclosure provide a method that comprises receiving, from a first node, a neighbor solicitation (NS) message via a virtual link, wherein the NS message is configured to provide an indication of a request to communicate with a second node, and request one or more communication parameters corresponding to the second node. The method can also include storing the indication of the request in a report list, and transmitting, via the virtual link, a neighbor advertisement (NA) message to the first node in response to the NS message, wherein the NA message comprises the one or more communication parameters corresponding to the second node.

Abstract: Systems and methods of routing are provided. In the system, one or more processors determine that a packet is to be transmitted to a destination. In one or more aspects of the system, the one or more processors select a next port to be used for transmitting the packet by selecting a set of ports among a plurality of ports based on a static weight configuration associated with each port. The next port may be selected from the set of ports based on a number of hops required to reach the destination from each port and based on an estimated latency from each port to the destination. The one or more processors may then route the packet through the selected next port.

Abstract: A device for computing a routing path from a source node to a destination node across a 6TISCH mesh network comprising a plurality of nodes, the device comprising: an interface for communicating with one or more nodes in the network; a memory configured to store data regarding the stability and availability of individual nodes in said network to receive packet data; a controller configured to: employ said data regarding the stability and availability of individual nodes in said network to receive packet data to calculate a path stability metric for each of a plurality of potential routing paths between said source node and said destination node, employ said path stability metric to select one of said plurality of potential routing paths for data transmission between said source node and said destination node, and cause said interface to transmit a signal configured to cause said plurality of nodes to transmit data from said source node to said destination node via said selected route.

Abstract: An enhanced, flooding-based routing protocol is described that provides label switched path session information. In one example, a transit router is intermediately positioned between at least two label edge routers. The transit router is configured to determine a maximum number of LSPs concurrently supported by the transit router and determine a number of LSPs concurrently established by the transit router and for which the transit router is responsible for switching packets to one or more of the two label edge routers. The transit router generates, in accordance with a link state routing protocol, a link state routing protocol message that specifies the LSP session information as the maximum number of LSP and the number of LSPs concurrently established. The transit router further transmits, to the label edge routers, the link state routing protocol message.

Abstract: A method for suppressing broadcast messages includes receiving a broadcast message from a client that requests configuration information from a configuration server. The method includes queueing the broadcast message in a request queue and then identifying an oldest message in a request queue. When no configuration server information is available, the method includes broadcasting the oldest message to a broadcast domain. The method includes intercepting one or more additional broadcast messages from one or more other clients and storing the additional broadcast messages in the request queue. The method includes receiving a reply to the oldest message and storing configuration server information extracted from the reply. The method includes converting the additional broadcast messages to unicast messages, and unicasting the unicast messages to the configuration server using the stored configuration server information.

Abstract: A telecommunications device, operable in a system comprising one or more servers, the device being a client device in the system. The device is constructed and adapted to: provide a client configuration state for the client device to the one or more servers; and obtain from the one or more servers a first sub-network configuration, comprising at least one path from the one or more servers to the client device, and being based on the client configuration state and on at least one other client configuration state of at least one other client device. The device can use a path specified in the first sub-network configuration to obtain at least one resource via the one or more servers.

Abstract: A networking device includes a Network Interface Device (NID) and a host. Packets are received onto the networking device via the NID. Some of the packets pass along paths from the NID to the host, whereas others do not pass to the host and are processed by the NID. A bypass packet count for each path that passes from the NID to the host is maintained on the NID. It is determined, using a match table, that one of the packets received on the NID is to be sent to the host. The packet, however, is instead sent along a bypass path without going through the host (as it should have according to the host's match tables). The path that the packet would have traversed had the packet not been sent along the bypass path is determined and the bypass packet count associated with the determined path is incremented.

Abstract: A networking device includes a match table maintained on a first processor. The match table includes an entry that in turn includes an entry packet count. Packets of multiple flows result in matches to the entry. A set of bypass packet counts is maintained on a second processor of the networking device. There is one bypass packet count for each of the multiple paths through the first processor. A request for a “system entry packet count” of an entry located in a match table on the first processor is received onto the networking device. All paths of all flows that could have resulted in matches of that entry are determined. The “system entry packet count” is then determined by summing the entry packet count and the bypass packet counts for all those paths. A response is output from the networking device, where the response includes the “system entry packet count”.

Abstract: A capability for sparsifying a representation of pairwise cost information is presented herein. The capability for sparsifying a representation of pairwise cost information may be used to sparsify a representation of pairwise cost information for a set of nodes. The sparsification of a representation of pairwise cost information for a set of nodes may provide thereby a sparsified representation of the pairwise cost information for the set of nodes. The sparsification of the representation of pairwise cost information for the set of nodes may be based on clustering of the nodes of the set of nodes into clusters. The sparsification of the representation of pairwise cost information for the set of nodes may be based on calculation of intra-cluster costs and inter-cluster costs, where the intra-cluster costs and inter-cluster costs are calculated based on the pairwise cost information of the representation of the pairwise cost information for the set of nodes.

Abstract: A Path Computation Client (24) of a node in a network sends a request message (52) to a Path Computation Element (28) of the network for computation of a path, and the Path Computation Element sends a response message (54) comprising information identifying a calculated path. The Path Computation Element also sends a request for feedback on a result of the attempt to set up the connection. The Path Computation Element attempts to set up a connection based on the calculated path, and reports (64) to the Path Computation Element the result of the attempt to set up the connection.

Abstract: Implementations described and claimed herein provide a system and methods for dynamic re-localization and manifest chunking in a content delivery network. In one implementation, one or more stimuli corresponding to a connection to deliver content from a content source over a network to a user device along a network path are detected. The one or more stimuli indicate a connection issue. An optimized network path through which to deliver the content to the user device is determined based on current network conditions. The optimized network path responds to the connection issue. The user device is dynamically rerouted to the optimized path while providing a substantially continuous delivery of content to the user device.

Abstract: A multi-domain network comprises domains of different network technology types. A network domain comprises a plurality of network nodes connected by links and comprising border nodes which connect with other network domains. In a first domain (AS A) of a first technology type, a method comprises determining an intra-domain topology of the nodes and links of the domain by collecting values of at least one network topology parameter of the first technology type. The method determines a summarized intra-domain topology of paths between border nodes of the domain which is described using values of at least one summarized network topology parameter. Values of the summarized network topology parameter are derived from the values of the network topology parameter of the intra-domain topology of the first technology type. The summarized network topology parameter is part of a common set of network topology parameters for advertising between domains comprising apparatus of different technology types.

Abstract: In particular embodiments, providing wavelength connectivity information to a network includes establishing wavelength connectivity information for a network node of the network. The network node comprises link pairs, where a link pair has an input link and an output link. The wavelength connectivity information describes a set of available wavelengths between an input link and an output link. The wavelength connectivity information is inserted into an advertisement, and the advertisement is sent to at least a subset of the network nodes of the network in real time.

Abstract: A distributed parameter update procedure is provided for updating parameters that do not have discrete values. When a parameter value is changed, a search is conducted of a parameter space to find a new parameter value minimizes some cost function. The cost function is derived based on the current parameter settings in neighboring nodes. The distributed parameter update procedure may simplify the search process by localizing the search of the parameter space for a new parameter value to the vicinity of the current parameter setting. In some embodiments, the search is conducted along a line of steepest descent emanating from the current parameter setting.

Abstract: In general, techniques are described for simplifying admission control signaling between subscriber devices, access nodes, and service edge routers to facilitate subscriber-specific admission control for multicast streams. In one example, a service edge router receives a service request and accesses a subscriber profile to determine whether the requesting subscriber is authorized to receive the service. Upon authorization, the service edge router returns the service request to the access node in a substantially similar form in which the service request was received. The access node receives the service request on a service edge router-facing interface, indicating the service edge router has granted authorization for the subscriber device to receive multicast traffic associated with the multicast group identified within the service request.

Abstract: Embodiments of a system with a first network device and at least first and second links connecting the first network device and one or more other network devices are disclosed. The first network device determines the costs of the first and the second links using the latencies of the first and the second links and factors that correspond to the bandwidths of the first and the second links.

Abstract: A method of assigning a server to a client system includes determining an ingress point of the client system and identifying possible egress points for the client system. The method further includes selecting the server from a plurality of servers to reduce network cost and delivery time.

Abstract: A method of assigning a priority to a document in a content-routed network including a plurality of routers interconnected by links, involves matching rules against the content of a received document to assign a priority, mapping the priority onto an egress link, and mapping the egress links onto the interconnect network between content routers to achieve end-to-end quality of service.

Abstract: Route optimization is based on a network enforced, and mobile implemented, policy. A communication session between a mobile device and an access router is established. First and second IP addresses to be assigned to the mobile device are received by the mobile device via the established communication session, as is a set of rules. The mobile device evaluates at least one parameter of the communication session against the set of rules to determine which of the IP addresses to use to communicate with an external device, and proceeds to communicate with the external device using the selected IP address based upon the evaluation result.

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract: Method and apparatus for tracking, recording and distributing link state characteristics over communications networks. The invention allows network operators to efficiently define, track, store and disseminate link state characteristics using a bit-field-encoded resource record that is capable of representing many more link state characteristics than the bit-mask-encoded records used in existing systems. As a result, the present invention, when used in conjunction with standard routing and network maintenance algorithms, provides a much more efficient method than existing systems provide, for performing sophisticated networking tasks, such as handling complicated information transmission requests, setting up and tearing down network paths, and making dynamic routing decisions.

Abstract: A network unit for use in a switching fabric includes multiple units collectively constituting a single network entity, each having ports for the reception and forwarding of data packets. The network unit has at least one fabric port for connection to a partner port on another one of the units by at least one link. The network unit is organized to send and receive via the at least one fabric port protocol packets which contain information on the path costs between said units in the fabric and to perform an algorithm to determine, on the basis of said information, routes for data packets within the fabric to other units of the fabric.

Abstract: In an ATM network having ATM endpoints connected to a central server over respective virtual circuits, ATM endpoints are configured for Internet Protocol (IP) over ATM communications by transmitting an unsolicited message from the server to the selected ATM endpoint at a first transmission interval over the associated virtual circuit, the unsolicited message including a server IP address and an ATM endpoint IP address; and receiving the unsolicited message at the selected ATM endpoint, including extracting the server IP address and the ATM endpoint IP address from the unsolicited message and transmitting an SNMP TRAP message to the server.

Abstract: System and method for correlating multiple frames of data associated with a single call into a call record. One embodiment comprises correlating data in a radio access network by capturing data passing to and from a radio network controller, identifying ATM Adaptation Layer type 5 (AAL5) frames within the data, assigning a first call identifier to the AAL5 frames, identifying ATM Adaptation Layer type 2 (AAL2) frames within the data, assigning a second call identifier to the AAL2 frames, and combining AAL2 frames and AAL5 frames having a same first call identifier and a same second call identifier into a call record. The data passing to and from the first radio network controller may be data passing over an Iub interface between a Node B and the radio network controller or data passing over an Iur interface between two radio network controllers.

Abstract: Systems and techniques are disclosed relating to wireless communications. The systems and techniques involve wireless communications wherein a module or communications device is configured to select first and second terminal pairs, the first terminal pair having a first transmitting terminal and a first receiving terminal, and the second terminal pair having a second transmitting terminal and a second receiving terminal, schedule a first signal transmission from the first transmitting terminal to an intermediate terminal, the first signal transmission being destined for the first receiving terminal, schedule, simultaneously with the first signal transmission, a second signal transmission from the second transmitting terminal to the second receiving terminal, and schedule a power level for each of the first and second signal transmissions that satisfies a target quality parameter for each of the intermediate terminal and the second receiving terminal.

Abstract: A frame multiplexer includes a plurality of counters each of which is provided for each of the lines. A flow monitoring unit monitors frame flow of each line by referring to the counter of the line, and adds length of a passed frame to a value of the counter. A bandwidth managing unit cyclically selects one of the lines through which a frame is input, and subtracts a predetermined token value from a value of the counter of the selected line. An output control unit stores a frame passed through the flow monitoring unit in a queue buffer, and outputs the frame at an output rate of the frame multiplexer.

Abstract: Embodiments of a system with a first network device and at least first and second links connecting the first network device and one or more other network devices are disclosed. The first network device determines the costs of the first and the second links using the latencies of the first and the second links and factors that correspond to the bandwidths of the first and the second links.

Abstract: This invention provides the ability to load balance calls in a communications network using a certain criterion, such as a user-specified call priority, or the call service category. The method is applied when selecting a route for a new call or for re-balancing the calls across a network. When the user-specified call priority is used, the aggregated number of calls with the same priority or service category is calculated for all possible routes the new call may use. The aggregated number of calls is then divided by the number of hops in the respective routes; the route with the smallest ratio is selected for the new call. Re-balancing is performed by re-routing the calls in such a way as to obtain a similar number of calls of the same priority, or service category along all possible routes.

Abstract: Narrowband signaling from a transfer node for a call originating at an end office is received at a centralized control and signaling interworking function device in an asynchronous transfer mode switching network. The received narrowband signaling is converted to broadband signaling. The broadband signaling is provided to a plurality of trunk interworking function devices via the asynchronous transfer mode switching network, to establish a connection across the asynchronous transfer mode switching network, when the centralized control and signaling interworking function device and the plurality of trunk interworking function devices are determined to be members of a closed user group.

Abstract: Virtual Private Networks (VPNs) are supported in which customers may use popular internet gateway protocol (IGPs) without the need to convert such IGPs, running on customer devices to a single protocol, such as the border gateway protocol (BGP). Scaling problems, which might otherwise occur when multiple instances of an IGP flood link state information, are avoided by using a flooding topology which is smaller than a forwarding topology. The flooding topology may be a fully connected sub-set of the forwarding topology.

Abstract: A node (200) includes a processor (201) for determining neighbor nodes in a routing path to a destination based on a routing table associated with the node (200). The node (200) includes a memory for storing a first authenticated tokens. The node includes a transmitter (203) for transmitting a first request-to-route (RTR) message including an indication specifying information units (IUs) from the first node to the neighbor nodes in a routing path from the first node to the destination. The node (200) includes a receiver (205) for receiving a neighbor reply message from one of the neighbor nodes to the first node which indicates that the neighbor node will route the information units (IUs). The transmitter (203) transmits a second authenticated tokens from the first node to one of the neighbor nodes. The second authenticated tokens are converted into a tradable entity and provide compensation to the neighbor node selected.

Abstract: According to the invention, a content delivery network (CDN) for delivering content objects over the Internet is disclosed. The CDN includes a point of presence (POP), a content object request interface, and a routing function. At least one POP is coupled to a plurality of full-route networks. The content object request interface receives requests for content objects for delivery to a number of end users using a plurality of terminal networks. The routing function that routes content objects in at least two modes, where a first mode routes content objects based upon a first route path chosen based upon delivery efficiency, and a second mode routes at least some content objects using a second route path when at least of a portion of the first route path reaches a level of use. The first and second route paths egress to different full-route networks.

Abstract: A method and apparatus to route information over a network is described.

Abstract: A multicast communication path calculation method is disclosed which includes the steps of: obtaining minimum delay paths from a source node to each destination node; selecting, as candidate nodes of a rendezvous point node, nodes on one of the obtained minimum delay paths; for each candidate node, calculating minimum delay paths from the candidate node to each destination node, and obtaining a difference between the maximum value and the minimum value among delays of the calculated minimum delay paths; selecting, as the rendezvous point node, a candidate node by which the difference is smallest; and outputting a minimum delay path from the source node to the rendezvous point node and minimum delay paths from the rendezvous point node to each destination node.

Abstract: Method and apparatus for analyzing a proposed service feature in a communication network is described. In one example, a call flow for supporting the service feature in the communication network is created, where at least one network component supports the call flow. First cost data for internally developing the at least one network component is determined. Second cost data for procuring the at least one network component from third party entity is determined. The first cost data and the second cost data are processed to generate a recommendation for either internally developing or externally procuring the at least one network element.

Abstract: A shaping apparatus comprising a plurality of buffer memories allocated for different flows, bandwidth control units associated with the buffer memories, and a read control unit, wherein each of the bandwidth control units issues a first frame output request based on a maximum allowed bandwidth and a second frame output request based on a minimum guaranteed bandwidth, and the read control unit selects a bandwidth control unit to be permitted for frame output execution out of bandwidth control units that are issuing the first or second frame output request, giving priority to the second frame output request.

Abstract: A method of distributing data across a network having a plurality of equal-cost paths. Also, a device for distributing data over a network according to the method. The data, which is typically contained in data packets, may be distributed based on at least one attribute of each of the packets. The data may also be distributed according to a weighted distribution function that allows for unequal amounts of traffic to be distributed to each of the equal-cost paths.

Abstract: The present invention discloses a method for providing a packet loss detection and down speeding mechanism for maintaining acceptable quality during a video call. Different scenarios of packet loss requiring different down speeding degrees are accommodated by a two-parted method combined by a low-part and a high-part decision and down speeding mechanisms. The method has a consecutively measured packet loss as input, and uses weighted packet loss parameter of recently measured packet loss to decide whether to down speed, and if so, whether the low-part or high-part down speeding mechanism should be used.

Abstract: A technique efficiently routes Internet Protocol (IP) traffic on paths between customer edge devices (CEs) across a provider network (“CE-CE paths”) in a computer network. According to the novel technique, a path computation element (PCE), e.g., a provider edge device (PE), may learn dynamic link attribute information of remote links from the provider network to one or more remote CEs (e.g., “PE-CE links” or “CE-PE links”). A multi-homed requesting CE requests from the PCE a set of CE-CE path metrics (e.g., costs) to one or more remote destination address prefixes, e.g., via each multi-homed CE-PE link from the requesting CE. In response to the request, the PCE computes the set of available CE-CE paths and current metrics to the remote destination address prefixes and returns the corresponding CE-CE path metrics to the requesting CE. The requesting CE modifies its IP forwarding entries accordingly in order to perform IP traffic routing corresponding to the CE-CE path metrics (e.g.

Abstract: The specification describes techniques for evaluating important network performance parameters, for example, call set-up time, for private network-to-network (PNNI) interfaces. These performance parameters are used to determine the optimum size of the peer groups in the PNNI network. Both flat and multi-level networks may be designed using the methods described.

Abstract: An improved system for allocating bandwidth allows a network customer to dynamically modify bandwidth settings for their private networks. Applicable modified bandwidth settings may include port speed, committed access rate, and Ethernet flow. Port speed determines how much total data may pass through a node in a private network at one time, while committed access rate determines how much bandwidth the node will commit to a particular class of service. Ethernet flow governs the bandwidth allowed over a private line between two nodes. A bandwidth modification request is received by an input interface, which provides it to a processing server that schedules the modification request for committal. The processing server also changes customer billing information accordingly. Additionally, the user may specify a future time when the bandwidth modification request should be committed.

Abstract: The number of nodes in a private network-to-network interface may be very large. These nodes can be organized in two or more hierarchical levels. Network performance parameters, for example, call set-up time, may be used to determine the optimum number of hierarchical levels for a given PNNI network. A multi-step algorithm is presented for calculating the optimum number of levels in the network for a given number of nodes.

Abstract: A network unit for use in a switching fabric stores for each network unit in the switching fabric a respective change identification number. In each unit this number is incremented on each change of state. The unit broadcasts protocol packets which indicates incremented change identification numbers; receives corresponding packets from the other units; and determines when the last change identification numbers in the table are the same for all the units. This allows a control based on whether all the units know that all the other units have been updated in response to all the changes of state in the fabric. The network unit can also participate in a routing algorithm, and particularly a shortest path algorithm, within a fabric that constitutes a single network entity.

Abstract: The present invention comprises methods for increasing the rank of the routing matrix of an IP network by systematically altering link weights in the IP network. A full rank routing matrix may be used with further methods in accordance with the present invention to estimate the mean traffic of the IP network based upon the full rank routing matrix and measured link utilization values. The mean traffic and the covariance of the traffic may be iteratively estimated until the estimates coverage. Example methods in accordance with the present invention for estimating mean traffic and covariance of traffic are described for both stationary and non-stationary link utilization data.

Abstract: The present invention provides a method of determining or selecting a path for transmitting data in packets in an Internet Protocol communication network and a communication network using the method. The method comprises predetermining a limited number of paths by repeatedly applying a single criterion selection method to all of the paths in the network concerned, using different first criteria, and then determining one or more given paths from said limited number of predetermined paths by comparing them with each other on the basis of two or more conditional criteria and then classifying them.

Abstract: Systems and methods are described for bonding asynchronous transfer mode permanent virtual circuits using a multi-link segmentation and reassembly sublayer. A method includes: transforming a plurality of streams of asynchronous transfer mode cells into a stream of bonded asynchronous transfer mode cells, the plurality of streams of asynchronous transfer mode cells provided by a first plurality of permanent virtual circuits; demultiplexing the stream of bonded asynchronous transfer mode cells into a plurality of streams of inverse multiplexed bonded asynchronous transfer mode cells; and transmitting the plurality of streams of inverse multiplexed bonded asynchronous transfer mode cells to a remote location via a second plurality of permanent virtual circuits. The transmitted plurality of streams of inverse multiplexed bonded asynchronous transfer mode cells can be multiplexed and transformed into a plurality of multiplexed streams of asynchronous transfer mode cells after transmitting.