-
公开(公告)号：US20170353259A1
公开(公告)日：2017-12-07
申请号：US15174452
申请日：2016-06-06
Applicant: Huawei Technologies Canada Co., Ltd.
Inventor： William Carson McCormick , Francis Patrick Kelly
CPC classification number: H04J3/1694 , H04L1/002 , H04W40/16 , H04W72/1263 , H04W84/18
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.
-
公开(公告)号：US10129043B2
公开(公告)日：2018-11-13
申请号：US15187415
申请日：2016-06-20
Applicant: Huawei Technologies Canada Co., Ltd.
Inventor： William Carson McCormick , Peter Ashwood-Smith , Francis Patrick Kelly
IPC: H04L12/18 , H04L12/723 , H04L12/753
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.
-
公开(公告)号：US20170126416A1
公开(公告)日：2017-05-04
申请号：US15187415
申请日：2016-06-20
Applicant: Huawei Technologies Canada Co., Ltd.
Inventor： William Carson McCormick , Peter Ashwood-Smith , Francis Patrick Kelly
IPC: H04L12/18 , H04L12/753 , H04L12/723
CPC classification number: H04L12/189 , H04L12/185 , H04L12/1877 , H04L45/125 , H04L45/48 , H04L45/50
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.
-
公开(公告)号：US09967045B2
公开(公告)日：2018-05-08
申请号：US15174452
申请日：2016-06-06
Applicant: Huawei Technologies Canada Co., Ltd.
Inventor： William Carson McCormick , Francis Patrick Kelly
CPC classification number: H04J3/1694 , H04L1/002 , H04W40/16 , H04W72/1263 , H04W84/18
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.
-
-
-
Search Results
4
records
(took 0.013 seconds)
