C. Frei and B. Faltings, "Abstraction and Constraint Satisfaction Techniques for Planning Bandwidth Allocation " , INFOCOM 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Flow Splitting Approach for Path Provisioning and Path.. - Izmailov, Niculescu (Correct)
....the results obtained from simulation. The paper ends with a few concluding remarks in Section 5. 2 Problem formulation The provisioning problem of routing integral flows through a given network (also known as the integer multi commodity flow problem) is NP complete [6] Several heuristics [7], 8] and approximations were proposed for it. If arbitrary (fractional) splitting were practical, linear programming could provide an optimal solution in polynomial time. Solutions to the provisioning problem depend on whether flows can be split or not, or whether the sub flows may be fractional ....
C. Frei and B. Faltings, "Abstraction and Constraint Satisfaction Techniques for Planning Bandwidth Allocation" , INFOCOM 2000.
Bandwidth Allocation Planning in Communication Networks - Frei, Faltings (1999) (1 citation) Self-citation (Frei Faltings) (Correct)
....constraints as is . CSPs have in this case a major advantage over Operations Research techniques, that do not allow the integration of new constraints in such a straightforward manner. One first result was the development of a generalization of the BI paradigm to several concave metrics [7]. A resource metric is said to be concave if for any path p, p) min l2p (l) where (l) is the metric for link l. Bandwidth is typically a concave resource, however there are others: for instance, the number of connections routed over a link may be limited, due to various factors, such as the ....
....possibly cooperating with agents below it in the hierarchy. In this case, the demands are not known in advance and allocated one after the other. Demand ordering heuristics as well as backtracking algorithms are then not applicable. We presented some first considerations in [6] and some results in [7]. Acknowledgments This work is partly a result of the IMMuNe (Integrated Management for Multimedia Networks) Project, supported by the Swiss National Science Foundation (FNRS) under grant 5003 045311. The authors are grateful to Dean Allemang, Beat Liver, Steven Willmott, and Monique Calisti for ....
C. Frei and B. Faltings, Abstraction and Constraint Satisfaction Techniques for Planning Bandwidth Allocation, IEEE INFOCOM'2000, March 2000. In print.
Flow Splitting Approach for Path Provisioning and Path Protection.. - Nec (Correct)
No context found.
C. Frei and B. Faltings, "Abstraction and Constraint Satisfaction Techniques for Planning Bandwidth Allocation " , INFOCOM 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC