Programming routers in a network is accomplished using a global network manager and a plurality of local network managers. The global network manager analyzes an entire network and demand matrix in order to provide restrictions and recommendations that are communicated to a set of the local network managers. The local network managers can use the restrictions and recommendations to make local routing decisions defining a percentage of traffic routed to each neighboring node. The local network manager collects traffic metrics, such as local topology and traffic information by measuring the capacity available to reach any neighboring node. The local network manager uses the metrics in combination with the restrictions and recommendations from the global manager to make decisions on how to route network traffic.

Programming routers in a network is accomplished using a global network manager and a plurality of local network managers. The global network manager analyzes an entire network and demand matrix in order to provide restrictions and recommendations that are communicated to a set of the local network managers. The local network managers can use the restrictions and recommendations to make local routing decisions defining a percentage of traffic routed to each neighboring node. The local network manager collects traffic metrics, such as local topology and traffic information by measuring the capacity available to reach any neighboring node. The local network manager uses the metrics in combination with the restrictions and recommendations from the global manager to make decisions on how to route network traffic.

A load distribution apparatus connected, via a network, to a plurality of relay apparatuses that relay communication performed by a terminal, and to the terminal, including: storage means configured to store relay apparatus identifiers that identify each of the plurality of relay apparatuses, installation site information that indicates installation sites of each of the plurality of relay apparatuses, and load information that indicates loads of each of the plurality of relay apparatuses; load management means configured to collect the load information from each of the plurality of relay apparatuses to store the load information in the storage means; selection means configured, when receiving a request from the terminal, to select a relay apparatus for relaying communication performed by the terminal from among the plurality of relay apparatuses based on the installation site information or the load information; and transmission means configured to transmit, to the terminal that transmits the request, a relay apparatus identifier of the relay apparatus selected by the selection means.

The present disclosure relates to a load balancing for a control in a wireless communication system. According to a various embodiments of the present disclosure, a method for operating a base station in a wireless communication system comprises determining a mobility of a terminal, and responsive to the mobility exceeding a threshold, transmitting, to the terminal, a message for requesting the terminal to process a control plane of the terminal with at least one other base station.

Methods for balancing storage data traffic in a system in which at least one computing device (server) coupled to a converged network accesses at least one storage device coupled (by at least one adapter) to the network, systems configured to perform such methods, and devices configured to implement such methods or for use in such systems. Typically, the system includes servers and adapters, and server agents implemented on the servers and adapter agents implemented on the adapters are configured to detect and respond to imbalances in storage and data traffic in the network, and to redirect the storage data traffic to reduce the imbalances and, thereby to improve the overall network performance (for both data communications and storage traffic). Typically, each agent operates autonomously (except in that an adapter agent may respond to a request or notification from a server agent), and no central computer or manager directs operation of the agents.

Techniques are described for automatic discovery of two or more virtual service instances configured to apply a given service to a packet in a software-defined networking (SDN)/network functions virtualization (NFV) environment. Virtual service instances may be deployed as virtual entities hosted on one or more physical devices to offer individual services or chains of services from a service provider. The use of virtual service instances enables automatic scaling of the services on-demand. The techniques of this disclosure enable automatic discovery by a gateway network device of virtual service instances for a given service as load balancing entities. According to the techniques, the gateway network device automatically updates a load balancing group for the given service to include the discovered virtual service instances on which to load balance traffic for the service. In this way, the disclosed techniques provide auto-scaling and auto-discovery of services in an SDN/NFV environment.

In general, techniques described are for bandwidth sharing between resource reservation protocol label switched paths (LSPs) and non-resource reservation protocol LSPs. For example, in networks where resource reservation protocol LSPs and non-resource reservation protocol LSPs co-exist within the same domain, resource reservation protocol LSPs and non-resource reservation protocol LSPs may share link bandwidth. However, when non-resource reservation protocol LSPs are provisioned, resource reservation protocol path computation elements computing resource reservation protocol paths may not account for non-resource reservation protocol LSP bandwidth utilization. The techniques described herein provide a mechanism for automatically updating traffic engineering database (TED) information about resource reservation protocol LSPs in a way that accounts for non-resource reservation protocol LSP traffic flow statistics, such as bandwidth utilization. Path computation elements may thus rely on an accurate TED for LSP path computation.

An apparatus, system, and method for balancing traffic loads on beam outroutes that contain both multicast and unicast traffic. An outroute is designated for supplying at least multicast traffic within a beam of a satellite communication system. Terminals interested in receiving the multicast traffic are moved to the designated outroute. Traffic loads on all outroutes within the beam, including the designated outroute, are compared to determine if variations in the traffic loads exceed a predetermined threshold. A load balancing routine is performed to redistribute the traffic loads on all outroutes, while excluding any terminal that is actively receiving the multicast traffic from the load balancing routine.

An apparatus, system, and method for balancing traffic loads on beam outroutes that contain both multicast and unicast traffic. An outroute is designated for supplying at least multicast traffic within a beam of a satellite communication system. Terminals interested in receiving the multicast traffic are moved to the designated outroute. Traffic loads on all outroutes within the beam, including the designated outroute, are compared to determine if variations in the traffic loads exceed a predetermined threshold. A load balancing routine is performed to redistribute the traffic loads on all outroutes, while excluding any terminal that is actively receiving the multicast traffic from the load balancing routine.

A method of calculating a new route for a media data traffic flow on a computer network when a device is connected to the network, the network comprising a first and a second network switch connected by a link, the method comprising: determining whether media data traffic already flows between the first and second network switch over the link; applying a weighting to the link whose value is based on whether media data traffic already flows over the link; and determining the new route for media data traffic by using a least cost path generation algorithm using the weighting.