Abstract: Methods, apparatus, and networks configured to manage network congestion using packet recirculation. The networks employ network elements (e.g., Rbridges in Layer 2 networks and switches/routers in Layer 3 networks) that are configured to support multi-path forwarding under which packets addressed to the same destination may be routed via multiple paths to the destination. In response to network congestion conditions, such as lack of availability of a non-congested port via which a shortest path to the destination may be accessed, a packet may be routed backward toward a source node or forwarded toward a destination along a non-shortest path. The network elements may employ loopback buffers for looping packets back toward a source via the same link the packet is received on.

Abstract: Embodiments describe mechanisms for an eNB, possibly assisted by a UE, to detect and possibly alleviate user plane congestion. In some embodiments, the eNB implements UE assisted packet dropping, where the UE requests the eNB drop packets in a sub-QCI that meet designated criteria, such as exceeding a sub-QCI delay threshold. Other embodiments, detect periods of congestion and send congestion indication to the core network when the congestion period exceeds a threshold or when the user experience is degraded. Some embodiments implement both sets of functionality.

Abstract: A method determines an efficient route between a source node and a destination node in a mobile ad-hoc network. The source node and the destination node communicate over a control channel until a link event occurs, such as congestion or a link failure in the control channel. In response to the link event, the method begins probing the network for at least one alternative route between the source node and the destination node. The probing of the network, however, is limited based on a route metric, which includes information regarding the number of network nodes between the source node and the destination node and information regarding a required bandwidth necessary for the efficient route.

Abstract: A transmission control apparatus includes: a communication unit communicating with each of communication apparatuses, which are included in a communication system in which communication is executed via one relay apparatus, via the relay apparatus; a determination unit determining, as a transmission apparatus transmitting content data indicating a content to be transmitted, the apparatus with higher transmission quality between the apparatus and the relay apparatus in the communication system based on quality information of each communication apparatus, which is received by the communication unit and includes information regarding the transmission quality between the relay apparatus and the communication apparatus; and a transmission control unit allowing the transmission apparatus determined by the determination unit to concurrently transmit the content data indicating the content to the respective apparatuses of the communication system excluding the transmission apparatus.

Abstract: A packet is received at a packet processing element, among a plurality of like packet processing elements, of a network device, and request specifying a processing operation to be performed with respect to the packet by an accelerator engine functionally different from the plurality of like packet processing elements is generated by the packet processing element. The request is transmitted to an interconnect network that includes a plurality of interconnect units arranged in stages. A path through the interconnect network is selected among a plurality of candidate paths, wherein no path of the candidate paths includes multiple interconnect units within a same stage of the interconnect network. The request is then transmitted via the determined path to a particular accelerator engine among multiple candidate accelerator engines configured to perform the processing operation. The processing operation is then performed by the particular accelerator engine.

Abstract: The reduction of multicast traffic collisions is facilitated. A device that is associated with a multicast group receives a multicast message requesting re-transmission of an acknowledgment message from the device. The multicast message includes information identifying the device within the multicast group of devices. In response to the device being determined to be identified by the information, the acknowledgement message can be re-transmitted after a defined transmit delay period after receipt of the multicast message. The defined transmit delay period can be based on the number of devices in the multicast group, based on the number of previous re-transmissions by the device and/or based on the number of devices for which re-transmission is requested.

Abstract: A TCP node stores a congestion window size before congestion is detected, the congestion window size limiting the amount of data to be transmitted. If congestion is detected, the TCP node reduces a current congestion window size to a predetermined size. If path switching subsequently occurs after congestion is detected, the TCP node uses a round-trip time or bandwidth information of a path after switching to correct the congestion window size before congestion detection. The TCP node then changes the reduced congestion window size to the corrected size.

Abstract: This invention provides a system, method and apparatus for managing congestion on heterogeneous network communication links, the first communication link and second communication link being heterogeneous with respect to each other. The system, method and apparatus including a routing decision module, the routing decision module evaluating a queue of information packets scheduled for transmission across the first communication link to determine whether to generate a command signal to route a portion of information packets over the second communication link. The system, method and apparatus may further include a communication link threshold module, the communication link threshold module storing threshold limit values corresponding to a first communication link technology of the first communication link.

Abstract: A method and a transmitting node for redirecting of a flow of data packets to a path of alternative paths, and a method and a receiving node for enabling redirection of a flow of data packets to a path of alternative paths, where data packets are marked with a value indicating the importance of the data packets. The method for directing directs one or more flows of data packets for the alternative paths, wherein data packets marked with a higher value are prioritized over data packets marked with a lower value. Based on feedback information, the transmitting node redirects a flow of data packets to a second path of the alternative paths, if the metric of congestion indicates a higher congestion on the first path than on the second path.

Abstract: This application discloses determining a worst-case latency in a controller area network (CAN) for messages experiencing priority inversion within individual controllers. A system to determine the worst-case latency can include a memory system to store computer-executable instructions and a computing system, in response to execution of the computer-executable instructions, can identify that a controller area network (CAN) design includes a controller configured to sequence messages for transmission over a shared bus with at least one of the messages experiencing priority inversion. The computing system also can determine a delay for the controller to present a first message to the shared bus for transmission when the first message is ordered behind a second message having a lower priority than the first message. The delay may be a portion of the worst-case latency corresponding to the priority inversion.

Abstract: Provided is an information processing method including an extraction procedure of extracting another communication service provider other than a first communication service provider based on a result of a comparison of a congestion degree of a base station related to the first communication service provider with a congestion degree of each of base stations related to one or a plurality of communication service providers other than the first communication service provider, and an exchange control procedure of performing control to transfer the first access right from the first wireless terminal device to a second wireless terminal device having a second access right to access a base station related to the other extracted communication service provider, and to transfer the second access right from the second wireless terminal device to the first wireless terminal device.

Abstract: In an example embodiment, a method is provided that receives a broadcast of available bandwidth from a first routing device. A congestion of traffic is detected along a downstream path to a second routing device. This second routing device is an immediate downstream neighbor. As such, an alternate path is established to the second routing device by way of the first routing device based on the available bandwidth in the network and a portion of the traffic is transmitted along the alternate path.

Abstract: Method for use in updating a routing information base of a node of a network, said routing information base comprising for each destination node of a number of destination nodes in said network a number of paths; wherein an update message with routing information is sent in said network from a first node to a peer of the first node, said first node having a first routing information base; wherein the update message comprises: a selected path for a first destination node of said number of destination nodes, said selected path comprising a next hop node adjacent the first node; at least one routing topology variable derived from the number of paths available for said first destination; said at least one routing topology variable being a measure for the risk on bottlenecks in the selected path.

Abstract: The present invention provides a method and device for data shunting and relates to the technical field of communications. The present invention solves the problem that the requirements for the Service Quality can not be satisfied, because the shunted data can't be transmitted in the shunting network based on appointed Service Quality; and the reliability of data transmission and the system resource utilization are decreased. The method concretely comprises the following steps: the first network device of the first network determines the second Quality of Service parameter of the second network according to the first Quality of Service parameter of data to be transmitted in the first network; the first network device transmits some or all of data to be transmitted to the second network device of the second network according to the second Quality of Service parameter. The method can be applied to data shunting.

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and load balancing the network traffic along the routing arcs based on traffic metrics obtained at the first and second ends of the routing arcs, including selectively sending a backpressure command to a first one of the routing arcs supplying at least a portion of the network traffic to a congested one of the routing arcs.

Abstract: A method and apparatus for characterizing an infrastructure of a wireless network are disclosed. For example, the method obtains a first data set from a server log, and obtains a second data set from a plurality of wireless endpoint device. The method characterizes a parameter of the infrastructure of the wireless network using the first data set and the second data set and optimizes a network resource of the wireless network based on the parameter.

Abstract: A system, method and apparatus for policy-driven load balancing of MMEs and MME pools by migrating eNodeBs service responsibilities among MMEs and/or MME processing components or modules.

Abstract: A computer-implemented system is disclosed for managing bandwidth usage rates in a packet switched network. The system includes one or more servers configured to execute computer program steps. The computer program steps comprises monitoring bandwidth usage rate at a first provider interface, determining if bandwidth usage rate at the provider interface exceeds a bandwidth usage rate limit; and rerouting Internet traffic from the provider interface having bandwidth that exceeds the bandwidth usage rate limit to a second provider interface having available bandwidth capacity.

Abstract: Messages are sent from a first network device to a second network device across a network. The network includes a network portion with an expected random packet loss rate. The actual packet loss rate for packets sent across the network is compared to the expected random packet loss rate. A determination is made that the actual packet loss rate is greater than the expected random packet loss rate. Compensation for network congestion is performed in response to the determination that the actual packet loss rate exceeds the expected random packet loss rate.

Abstract: In one embodiment, a best exit from an autonomous system (AS) for a controlled prefix is determined. A network device of the AS influences a route for the controlled prefix to be over the best exit. Traffic statistics for the controlled prefix are selected. The network device verifies, based on the traffic statistics, whether the influence has caused at least a configured amount of traffic for the controlled prefix to be over the best exit. When at least the configured amount of the traffic is not directed over the best exit, the network device further influences the route for the controlled prefix to be over the best exit.

Abstract: A method for processing traffic destined for a BS received from one or more terminals in an intermediate access point supporting two or more communication schemes is disclosed. The method includes receiving traffic from the one or more terminals according to a first communication scheme, measuring a congestion level of the received traffic, transmitting a first traffic being part of the received traffic to a second intermediate access point according to a second communication scheme, if the congestion level is a predetermined threshold or higher, and transmitting a second traffic being remaining traffic of the received traffic except the first traffic to the BS.

Abstract: A method and apparatus for packet classification and prioritization using a user datagram protocol (UDP) header in a mobile wireless device. The mobile wireless device includes an application processor and a transceiver. The application processor sets a value of a field embedded in a higher layer packet and transfers the higher layer packet to the transceiver. The transceiver receives the higher layer packet from the application processor and reads the set value of the embedded field. The transceiver clears the value in the embedded field and creates at least one lower layer protocol data unit from the higher layer packet. The transceiver maps the lower layer protocol data unit to a wireless access channel having a transmission property based on the read value of the embedded field. In representative embodiments, the embedded field is an optional checksum in a UDP header.

Abstract: In one embodiment, a period between periodic transmissions of protocol data units (PDUs) used to form or maintain a link aggregation group is initially set to a fixed value. When a stress condition is detected, the period between periodic transmissions of PDUs is increased from the initial value. When the stress condition is determined to have eased, the period between periodic transmissions of PDUs is reduced back toward the fixed value.

Abstract: A communication routing arrangement includes two or more wireless routers coupled to a communication network, and a user device adapted to couple with the communication network through a communication path including at least one of the two or more wireless routers. The communication path between the user device and the communication network is selected based on available resources of the two or more wireless routers.

Abstract: The present invention is a system and method for failing over from a current network access medium to an alternative network access medium. A customer premises equipment (CPE) box has ports for connections to a network through several network access media, such as high speed cable connections, DSL connections and dial-up connections. QoS parameters for each of the connections are monitored from a bandwidth manager remote from the CPE box. When it is determined that a fail-over would be beneficial, a message is sent from the bandwidth manager to the CPE box containing a command to fail-over and an identity of the alternate network access media.

Abstract: Communicating among cores in a computing system comprising a plurality of cores, each core comprising a processor and a switch, includes: routing a packet from a core or from a device coupled to at least one core to a destination over a route including one or more cores, with an order of dimensions associated with the route being selected dynamically upon construction of the packet; routing the packet to a first core in the route over the first selected dimension; and routing the packet from the first core to the destination over the second dimension.

Abstract: A communication routing arrangement includes two or more wireless routers coupled to a communication network, and a user device adapted to couple with the communication network through a communication path including at least one of the two or more wireless routers. The communication path between the user device and the communication network is selected based on available resources of the two or more wireless routers.

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: An application switch system includes a switch configured to control a connection between a plurality of client terminals and a plurality of servers which exist on a network, a relay unit configured to perform a protocol relay, and a controller that includes a section configured to perform a centralized control on a route table used to determine a destination in the switch, a section configured to control relay processing of the relay unit, a section configured to select one server as a connection destination from the plurality of servers, a section configured to select a route which links between one client terminal of the plurality of client terminals and the selected connection destination server, and which contains the relay unit, and set the selected route to the route table in the switch, and a section configured to set relay information used when the relay unit performs the protocol relay.

Abstract: The disclosure is related to a method of adaptive call admission control in a base station. When a call access request is received from a user equipment determination may be made as to whether an available call admission capacity of the base station reaches a first limit. When the available call admission capacity of the base station reaches the first limit determination may be made as to whether the received call access request is for a preferred call. Then, determination may be made as to whether a reserved call admission capacity reaches a second limit when the received call access request is for the preferred call. When the reserved call admission capacity has not reached a second limit, access of the user equipment associated with the received call access request may be allowed.

Abstract: A radio communication system includes at least one user equipment, base stations, and a control station. After expiration of the timer started after establishment of the data bearer, the base station selects the access point base station for the user equipment on the basis of the voice congestion levels and indicates the access point base station to the user equipment if the voice bearer has been established, and selects the access point base station for the user equipment on the basis of the data congestion levels and indicates the access point base station to the user equipment if the voice bearer has not been established.

Abstract: A method and apparatus may be configured to receive, by a user equipment, offloading assistance information from a network element of a first network. The method may also comprise receiving, by the user equipment, at least one offloading related policy for offloading traffic to at least one second network. The offloading related policy may comprise a policy validity criterion that takes the offloading assistance information into account. The method may also comprise applying the offloading related policy in the user equipment if the policy validity criterion is met.

Abstract: A multihop network and nodes are described herein that implement a reactive routing protocol that enables resources of the multihop network to be continuously adapted in a distributed/opportunistic manner in response to a topology change within the multihop network so as to optimize the performance of a connection between a source node and a destination node. The types of resources that can be adapted include for example: (1) a route; (2) a channel; and/or (3) physical layer parameters. The different types of topology changes that can occur include: (1) movement of a node; (2) quality variations in a channel between the source node and the destination node; (3) changes in traffic patterns in the multihop network; (4) changes in transmit patterns (e.g., power, beamforming direction) in the multihop network; and (5) changes in resource allocations in the multihop network.

Abstract: A system that supports multiple contact centers includes a communications network that is coupled between a private network (e.g. MPLS network) and a remote computing environment (e.g. cloud environment). A server system in the remote computing environment monitors health of different network segments (e.g. bandwidth of the connection between the communications network and the remote computing environment, bandwidth of a link used by a tenant to access the private network, etc.). When it is determined that quality of service for voice conversations for one or more contact centers is at risk due to a health status parameter of a network segment reaching a threshold, an appropriate system reaction is triggered. The system reaction may be to offload future calls to a peer remote computing environment to service future calls. The system reaction may also be to cancel outbound campaigns, provide pre-determined “sorry” messages, and the like.

Abstract: An exemplary method includes monitoring a performance of at least one of a plurality of layer-2 network paths connecting a layer-2 network switch device to another layer-2 network switch device and selecting an optimal one of the plurality of layer-2 network paths over which to forward data traffic based on a path selection heuristic and the monitored performance of the at least one of the plurality of layer-2 network paths. At least a portion of the exemplary method may be performed by a layer-2 network switching system. In certain embodiments, the selecting of the optimal one of the plurality of layer-2 network paths over which to forward the data traffic is based on at least one of a latency parameter, a congestion parameter, and a cost parameter associated with the at least one of the plurality of layer-2 network paths. Corresponding systems and methods are also disclosed.

Abstract: Systems and techniques for traffic splitting based on latency between cells are herein described. At an eNodeB, a transmission path latency for a portion of a transmission path between the eNodeB and a user equipment (UE) may be measured via a secondary eNodeB when the UE is dually connected to both the eNodeB and the secondary eNodeB. The transmission path latency may be compared to a threshold. A layer in a transmission stack to split traffic to the UE may be determined based on the comparison of the transmission path latency to the threshold, the traffic being split between the eNodeB and the secondary eNodeB.

Abstract: Multipath load-balancing algorithms, which can be used for data center networks (DCNs), are provided. A multipath load-balancing algorithm can be, for example, a distributed multipath load-balancing algorithm or a centralized multipath load-balancing algorithm. Algorithms of the subject invention can be used for, e.g., hierarchical DCNs and/or fat-tree DCNs. Algorithms of the subject invention are effective and scalable and significantly outperform existing solutions.

Abstract: The present invention relates to a method of managing congestion in a multi-path network, the network having a plurality of network elements arranged in a plurality of switch stages and a plurality of network links interconnecting the network elements, the method comprising the steps of detecting congestion on a network link, the congested network link interconnecting the output port of a first network element with a first input port of a second network element in a subsequent switch stage; identifying an uncongested network link connected to a second input port of said second network element; and directing future data packets on a route across the multi-path network which includes the identified uncongested network link. Also provided is a multi-path network and an Ethernet bridge or router incorporating such a multi-path network.

Abstract: A method provided in one example embodiment includes detecting a first current bandwidth of a first link in a network ring, where the first current bandwidth indicates a signal degradation on the first link. The method also includes determining whether the first current bandwidth has degraded more than a second current bandwidth of a second link in the network ring, where the second current bandwidth indicates a signal degradation on the second link. The method further includes routing one or more network flows away from the first link if the first current bandwidth has degraded more than the second current bandwidth.

Abstract: A virtual extensible local area network (“VXLAN”) system includes servers having VXLAN tunnel end points (“VTEP”) and virtual machines (“VMs”), multiple routers to transmit network data using bidirectional groups (“BIDIRs”) and rendezvous points (“RPs”), and an associated management and provisioning entity (“MPE”) adapted to arrange BIDIRs dynamically based upon network traffic such that traffic is more evenly distributed across the VXLAN. Some of the routers can be preconfigured as potential RPs, and the MPE can activate and deactivate these routers to and from RP status as needed. The MPE creates and rearranges BIDIRs based upon volume thresholds of traffic being reached in BIDIRs, such as by splitting overloaded BIDIRs. Network traffic can be monitored by VTEPs and RPs.

Abstract: Various embodiments provide improved mesh networks with properties that address various shortcomings of current mesh network implementations. At least some embodiments are directed to improving operations of mesh networks in connection with battery powered devices and address concerns associated with latency issues due to power save nodes as well as load balancing. Yet other embodiments address route cache timeouts, reduce route discovery overhead, perform proactive route maintenance based on a node's battery, and provide a straightforward battery-aware process based sleep protocol.

Abstract: A network, network devices, and methods are described for packet processing indication. A method includes tunneling a packet from a first network device to a second network device associated with a first checking functionality. The second network device has an address different than an original destination address of the packet. The method also includes return-tunneling the packet from the second network device to the first network device with an indication of whether the packet was processed by the first checking functionality. The method includes tunneling the packet from the first network device to a third network device associated with a second checking functionality in response to the indication being that the packet was not processed by the first checking functionality. The third network device has an address different from the original destination address of the packet.

Abstract: Methods and apparatus for mitigating congestion by using advanced traffic engineering services in a multiprotocol label switching (MPLS) network and/or a generalized multiprotocol label switching (GMPLS) network are provided. In an example, provided is a method for mitigating congestion in an MPLS network. The method includes monitoring, at a network element, a traffic drop count due to traffic queue overflow on at least one of a traffic queue coupled to a link and a network interface coupled to the link. Then the traffic drop count is converted to a normalized congestion indicator for the at least one of the traffic queue and the network interface. Further, based on the normalized congestion indicator, optimize a route of a label switched path in the MPLS network so the route avoids the link. The provided methods and apparatus advantageously improve throughput, reliability, and availability of traffic engineered MPLS and GMPLS transport services.

Abstract: The path management controller 1 refers to resource information 131 including reservation statuses of working paths and advance reserved paths that are set in every link, so as to calculate a route for setting a new path and set this path in this calculated route. If the route for setting this new path cannot be obtained (1) because of a shortage of residual bandwidth of a link of interest, the path management controller 1 refers to the resource reservation information 131 of working paths and advance reserved paths and calculates an alternative route for another existing path used in the link of interest, and moves this path to the calculated alternative route.

Abstract: Aspects of the disclosure can provide a network switch having reduced power consumption. The network switch can include a plurality of ports that are configured to receive and transmit network traffic. The plurality of ports can be configured in a power-on mode and a power-off mode. Further, at least a first port among the plurality of ports can be configured to remain in the power-on mode and to receive power control instructions. In addition, the network switch can include a power controller. The power controller can change the power modes of selected ports among the plurality of ports in response to the power control instructions received through the first port.

Abstract: A technique for controlling network routing in a network (100) is provided. The network (100) includes a first end node (102) and a second end note (104). The end nodes are connectable along a first routing path (106) by at least one link (113). The network (100) further provides a second routing path (108) including the first end node (102) and the second end nodes (104). As to a method aspect of the technique, one or more queues (402) are provided. Each of the queues (402) serves at least one tunnel (Tunnel—1; Tunnel—2) along the first routing path (106). A switching of the tunnel (Tunnel—1) to the second routing path (108) is triggered based on a combination of two pieces of information. A piece of information includes information as to a queue build-up at the queue (504) serving the tunnel (Tunnel—1). Another piece of information includes information as to a capacity of the link (113) of the first routing path (106).

Abstract: Traffic flow between each pair of nodes in a network may be modeled based on loads measured at each link and based on gravity measures associated with each node. Gravity measures correspond to a relative likelihood of the node being a source or a sink of traffic. Gravity objectives are assigned to nodes to serve as an objective for a node's performance. These gravity objectives may be based on qualitative characteristics associated with each node. Because the assigned gravity objectives may be subjective, the gravity measures are used to generate a quantitative function for determining whether a network can achieve these gravity objectives. In one embodiment, link loads are allocated to traffic flows between nodes and current gravity measures are determined. Changes to link loads and traffic flows may then be modeled to minimize a difference between the assigned gravity measures and the gravity measures.

Abstract: Back pressure is mapped within a network, and primary bottlenecks are distinguished from dependent bottlenecks. Further, the presently disclosed technology is capable of performing network healing operations designed to reduce the data load on primary bottlenecks while ignoring dependent bottlenecks. Still further, the presently disclosed technology teaches identifying and/or suggesting a switch port for adding a node to the network. More specifically, various implementations analyze traffic load and back pressure in a network, identify primary and dependent bottlenecks, resolve the primary bottlenecks, collect new node parameters, and/or select a switch port for the new node. Further, a command can be sent to a selected switch to activate an indicator on the selected port. New node parameters may include new node type, maximum load, minimum load, time of maximum load, time of minimum load and type of data associated with the new node.

Abstract: According to one embodiment, a method may include receiving a frame via an ingress port of a network element. The method may also include assigning a virtual destination address to the frame of the traffic. The method may further include internally switching the frame within the network element based on the virtual destination address. The method may additionally include modifying the virtual destination address one or more times such that the virtual destination address is translated to an actual destination address identifying an actual egress port of the network element. Moreover, the method may include routing the frame to an egress port of the network element based on the actual destination address.

Abstract: A path control method for controlling paths among edge nodes on a network wherein a plurality of nodes, including relay nodes and multiple edge nodes, are connected via links, the method including determining paths in a specified plurality of edge nodes, path information indicating the paths determined by an edge node that determines paths earlier is transmitted to an edge node that determines paths subsequently, each edge node that determines paths subsequently determines additional paths by prioritizing the use of paths indicated by the path information, and conducting path control on the network by using the path information obtained as a result of paths being determined by the last edge node from among the specified plurality of edge nodes.