Method and apparatus for providing composite link assignment in network design
AssigneeAT&T Corp.
InventorsDiogo Andrade, Luciana Buriol, Mauricio Guilherme de Carvalho Resende, Mikkel Thorup
Life of this patent
Estimating the term…
Abstract
A method and apparatus for composite link assignment are provided such that network capacity is sufficient to handle all the traffic (e.g., load) while an objective function, e.g., the total cost of the capacity is minimized. The present method receives a plurality of weights for a plurality of arcs and a load for the network. An objective function is selected for minimization, where the present method then determines the composite link assignment to handle the load while the objective function is minimized. In one embodiment, the composite link assignment comprises a plurality of different link types for the plurality of arcs.
Claims11
A method for providing a composite link assignment for a network having a plurality of arcs, comprising:
- receiving via a server a plurality of weights for said plurality of arcs and a load for said network;
- receiving via said server an objective function for minimization;
- and
- determining via said server said composite link assignment to handle said load while said objective function is minimized, where said composite link assignment comprises a plurality of different link types for at least one of said plurality of arcs, wherein said objective function comprises at least one of:
- a heuristic that favors a use of as much as possible of a biggest capacity link type from said plurality of different link types without exceeding said load,
- a heuristic that minimizes a network cost that is defined by a sum of costs of said plurality of arcs,
- a heuristic that minimizes a network cost with a constraint of a specific number of said plurality of different link types, or
- a heuristic that minimizes a number of copies of a link type from said plurality of different link types that is used to satisfy said load.
A computer-readable volatile or non-volatile storage medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to perform the steps of a method for providing a composite link assignment for a network having a plurality of arcs, comprising:
- receiving a plurality of weights for said plurality of arcs and a load for said network;
- receiving an objective function for minimization;
- and
- determining said composite link assignment to handle said load while said objective function is minimized, where said composite link assignment comprises a plurality of different link types for at least one of said plurality of arcs, wherein said objective function comprises at least one of:
- a heuristic that favors a use of as much as possible of a biggest capacity link type from said plurality of different link types without exceeding said load,
- a heuristic that minimizes a network cost that is defined by a sum of costs of said plurality of arcs,
- a heuristic that minimizes a network cost with a constraint of a specific number of said plurality of different link types, or
- a heuristic that minimizes a number of copies of a link type from said plurality of different link types that is used to satisfy said load.
An apparatus for providing a composite link assignment for a network having a plurality of arcs, comprising:
- means for receiving a plurality of weights for said plurality of arcs and a load for said network;
- means for receiving an objective function for minimization;
- and
- means for determining said composite link assignment to handle said load while said objective function is minimized, where said composite link assignment comprises a plurality of different link types for at least one of said plurality of arcs, wherein said objective function comprises at least one of:
- a heuristic that favors a use of as much as possible of a biggest capacity link type from said plurality of different link types without exceeding said load.
- a heuristic that minimizes a network cost that is defined by a sum of costs of said plurality of arcs,
- a heuristic that minimizes a network cost with a constraint of a specific number of said plurality of different link types, or
- a heuristic that minimizes a number of copies of a link type from said plurality of different link types that is used to satisfy said load.
Dependencies are inferred from the claim text.