Abstract: A method and apparatus for configuring a communication network based on a distance metric. Information indicative of current status of communication network nodes, links between the nodes, or a combination thereof is obtained and processed to determine a network configuration. The network configuration is implementable in the communication network by adjusting one or more nodes or links. The processing includes evaluating network configurations based on a distance metric, which is indicative of lengths of shortest paths which interconnect nodes of the network. Instructions directing underlying resources to implement the network configuration can be provided. An apparatus can be a supervisory device including a network interface and a computer processor.

Abstract: A method and apparatus for configuring a communication network based on a distance metric. Information indicative of current status of communication network nodes, links between the nodes, or a combination thereof is obtained and processed to determine a network configuration. The network configuration is implementable in the communication network by adjusting one or more nodes or links. The processing includes evaluating network configurations based on a distance metric, which is indicative of lengths of shortest paths which interconnect nodes of the network. Instructions directing underlying resources to implement the network configuration can be provided. An apparatus can be a supervisory device including a network interface and a computer processor.

Abstract: A system and method for fair resource allocation includes a method. The method includes determining demand for a plurality of communications features of a network. The method further includes determining resource allocations for virtual computing instances hosted by a plurality of servers. The virtual computing instances serve the communications features. The method further includes adjusting the resource allocations for the virtual computing instances according to the demand for the communications features and a fairness algorithm.

Abstract: Embodiments are provided for path flow scheduling of multicast traffic through a network. The paths for traffic flow are determined to optimize link utilization in terms of bandwidth and link capacity, and limit link cost. In an embodiment, a method is implemented for network flow scheduling. The method includes establishing, by a controller of a network, a multicast tree which includes a plurality of links for sending multicast traffic from a source to multiple destinations. The tree is established based on minimizing a number of links in the multicast tree. The tree is then adjusted by replacing one or more of the plurality of links to reduce the link utilization. The tree adjustment is repeated by further replacing one or more links in the multicast tree to further reduce the link utilization.

Abstract: A system and method for fair resource allocation includes a method. The method includes determining demand for a plurality of communications features of a network. The method further includes determining resource allocations for virtual computing instances hosted by a plurality of servers. The virtual computing instances serve the communications features. The method further includes adjusting the resource allocations for the virtual computing instances according to the demand for the communications features and a fairness algorithm.

Abstract: A time domain multiplexed (TDM) routing schedule for a wireless mesh network can be generated using a Markov chain process. In particular, synchronized paths between access nodes and gateways in the mesh network can be added to, and removed from, the TDM routing schedule in an iterative fashion according to each individual state in a state progression of a Markov chain, with each state of the Markov chain mapping a different combination of synchronized paths to the TDM routing schedule. In some embodiments, transitioning between states of a Markov chain is performed according to a proportionally fair transition rate.

Abstract: A time domain multiplexed (TDM) routing schedule for a wireless mesh network can be generated using a Markov chain process. In particular, synchronized paths between access nodes and gateways in the mesh network can be added to, and removed from, the TDM routing schedule in an iterative fashion according to each individual state in a state progression of a Markov chain, with each state of the Markov chain mapping a different combination of synchronized paths to the TDM routing schedule. In some embodiments, transitioning between states of a Markov chain is performed according to a proportionally fair transition rate.

Abstract: Embodiments are provided for path flow scheduling of multicast traffic through a network. The paths for traffic flow are determined to optimize link utilization in terms of bandwidth and link capacity, and limit link cost. In an embodiment, a method is implemented for network flow scheduling. The method includes establishing, by a controller of a network, a multicast tree which includes a plurality of links for sending multicast traffic from a source to multiple destinations. The tree is established based on minimizing a number of links in the multicast tree. The tree is then adjusted by replacing one or more of the plurality of links to reduce the link utilization. The tree adjustment is repeated by further replacing one or more links in the multicast tree to further reduce the link utilization.

Abstract: The invention relates to methods and processes of congestion control for a communication network which may be designed to be compatible with a wide variety of buffer sizing regimes, particularly small buffers, for routers in the network. Each router may include a processor configured to store an internal feedback variable indicative of an aggregate flow rate of all data flows at the router; detect a new data flow to the router; determine any required adjustment to the internal feedback variable and to the flow rates of existing data flows at the router to accommodate the new flow at a defined flow rate; adjust the internal feedback variable, responsive to the determining step; and communicate the defined flow rate to the source of the new flow and the adjusted flow rates to sources of existing data flows.

Abstract: A communication network includes a number of network nodes linked together by transmission paths. A network manager controls acceptance of calls onto transmission paths by classifying an incoming call and selecting from the database an appropriate mean to peak bit rate distribution. This selected distribution is then used with the monitored transmission path load to determine a posterior distribution which reflects the load. The decision to accept or reject the call is made on the basis of the posterior distribution by a call acceptance algorithm considering the effective bandwidth for example.