Back to results
US 9,432,907 B2Granted
Microwave backhaul arrangements
AssigneeT-Mobile USA, Inc.
InventorsChunming Liu, Christopher Lawrence
Life of this patent
Estimating the term…
Abstract
Described herein are techniques related to wireless communication systems that may implement microwave backhaul for connectivity between network elements deployed by the wireless communication systems. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.
Claims14
A method comprising:
- identifying a plurality of unique traffic paths each comprising a plurality of carrier networks selected from the plurality of carrier networks;
- and
- selecting one of the plurality of unique traffic paths based on a cost function associated with the one of the plurality of unique traffic paths, and
- routing traffic via the selected one of the plurality of unique traffic paths;
- wherein the cost function is:
- C
- p
-
- (
- i
- )
- =
- ∑
- j
- ∈
- R
-
- C
- p
- ,
- j
-
- (
- i
- )
- =
- [
- K
- M
- -
- E
- i
- -
- l
- i
- -
- H
- ]
- *
- ∑
- j
- ∈
- R
-
- (
- α
- *
- ρ
- i
- ,
- j
- +
- β
- *
- σ
- i
- ,
- j
- )
- wherein j represents router j, R is all routers set in transport link, ρi,j is the average packet processing cost of a transmission frame at router j using scheme i, while σi,j is the average cost for table look-up for frame at router j using algorithm i, and α and β are weights for packet processing and table look-up;
- and
- wherein α and β are pre-set values and satisfy α+β=1.
59 more elements
A system comprising:
- at least one carrier network;
- and
- a device associated with the system, the device including at least a processor and a memory coupled to the processor, the memory including instructions executable by the processor to:
- select, from a plurality of traffic paths within the at least one carrier network, a traffic path based on a quality of service function;
- wherein the quality of service function is calculated based at least in part on a cost function, and the cost function is
- C
- p
-
- (
- i
- )
- =
- ∑
- j
- ∈
- R
-
- C
- p
- ,
- j
-
- (
- i
- )
- =
- [
- K
- M
- -
- E
- i
- -
- l
- i
- -
- H
- ]
- *
- ∑
- j
- ∈
- R
-
- (
- α
- *
- ρ
- i
- ,
- j
- +
- β
- *
- σ
- i
- ,
- j
- )
- wherein j represents router j, R is all routers set in transport link, ρi,j is the average packet processing cost of a transmission frame at router j using scheme i, while σi,j, is the average cost for table look-up for frame at router j using algorithm i, and α and β are weights for packet processing and table look-up;
- and
- wherein α and β are pre-set values and satisfy α+β=1.
59 more elements
Dependencies are inferred from the claim text.