## Abstraction and Constraint Satisfaction Techniques for Planning Bandwidth Allocation (2000)

Venue: | INFOCOM |

Citations: | 3 - 1 self |

### BibTeX

@INPROCEEDINGS{Frei00abstractionand,

author = {Christian Frei and Boi Faltings},

title = {Abstraction and Constraint Satisfaction Techniques for Planning Bandwidth Allocation},

booktitle = {INFOCOM},

year = {2000}

}

### OpenURL

### Abstract

Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficient control and management of these networks. We address the problem of quality-of-service routing, more specifically the planning of bandwidth allocation to communication demands. Shortest path routing is the traditional technique applied to this problem. However, this can lead to poor network utilization and even congestion. We show how an abstraction technique combined with systematic search algorithms and heuristics derived from Artificial Intelligence make it possible to solve this problem more efficiently and in much tighter networks, in terms of bandwidth usage.

### Citations

871 | Foundations of Constraint Satisfaction
- Tsang
- 1993
(Show Context)
Citation Context ...es a set of requests from some customers to allocate a number of demands, and must decide within a certain time decision threshold whether and how the demands can be accepted. Constraint satisfaction =-=[2]-=- is a technique which has been shown to work well for solving certain NP-hard problems, and has been applied to a variety of domains [3]. A Constraint Satisfaction Problem (CSP) is defined by a triple... |

613 | Where the really hard problems are
- Cheeseman, Kanefsky, et al.
- 1991
(Show Context)
Citation Context ...ve solving CSPs. The phenomenon of phase transitions occurring in many types of problems as a control parameter is varied has been recognized and studied extensively in recent years. Cheeseman et al. =-=[17]-=- first reported a phase transition between a region where almost all problems have many solutions and are relatively easy to solve, and a region where almost all problems have no solution and their in... |

482 | Increasing tree search efficiency for constraint satisfaction problems - Haralick, Elliott - 1980 |

369 | Hybrid algorithms for the constraint satisfaction problem
- Prosser
- 1993
(Show Context)
Citation Context ...ctly backjump to the cause of the failure, without having to explore (pruning) parts of the search space that do not contain any solution, thereby increasing search efficiency. Backjumping algorithms =-=[22]-=- are widely used in the CSP community nowadays. 2. We want to develop more sophisticated heuristics for route generation and demand selection during search, using more information that can be derived ... |

317 |
Quality-of-Service Routing for Support of Multimedia Applications
- Wang, Crowcraft
- 1996
(Show Context)
Citation Context ...With this restriction, the RAIN problem is NP-hard in the number of demands. When demands are subject to multiple additive or multiplicative quality of service (QoS) criteria, then Wang and Crowcroft =-=[1]-=- have shown that the allocation of every single demand is NP-complete by itself. This creates a new situation for the networking community, as traditional routing algorithms such as shortest paths do ... |

194 | A Theory of Abstraction
- Giunchiglia, Walsh
- 1992
(Show Context)
Citation Context ...t on a problem of realistic size. It has long been observed that the complexity of solving a problem can depend heavily on how it is formulated. Giunchiglia and Walsh define abstraction as follows in =-=[4]: &qu-=-ot;Abstraction is the mapping of a problem representation into a simpler one that satisfies some desirable properties in order to reduce the complexity of reasoning. The problem is solved in the abstr... |

109 | Practical applications of constraint programming
- Wallace
- 1996
(Show Context)
Citation Context ...er and how the demands can be accepted. Constraint satisfaction [2] is a technique which has been shown to work well for solving certain NP-hard problems, and has been applied to a variety of domains =-=[3]-=-. A Constraint Satisfaction Problem (CSP) is defined by a triple (X; D;C), where X = fx 1 ; :::; xn g is a set of variables, D = fD 1 ; :::; Dn g a set of finite domains associated with the variables ... |

55 |
Dynamic routing in telecommunications network
- Ash
- 1997
(Show Context)
Citation Context ... to the RAIN problem. Most often, a fixed number of shortest paths for each demand are pre-computed, and the problem is solved using linear programming with very large constraint systems of equations =-=[6]-=-, [7], [8], [9]. However, because only a given number of routes are considered, these techniques are not guaranteed to find a solution if one exists. Moreover, OR techniques are not as flexible as CSP... |

55 |
Fiber Network Service Survivability (Artech House
- Wu
- 1992
(Show Context)
Citation Context ...oblem. Most often, a fixed number of shortest paths for each demand are pre-computed, and the problem is solved using linear programming with very large constraint systems of equations [6], [7], [8], =-=[9]-=-. However, because only a given number of routes are considered, these techniques are not guaranteed to find a solution if one exists. Moreover, OR techniques are not as flexible as CSP-based methods ... |

32 |
An optimization problem related to balancing loads
- Cosares, Saniee
- 1994
(Show Context)
Citation Context ...he RAIN problem. Most often, a fixed number of shortest paths for each demand are pre-computed, and the problem is solved using linear programming with very large constraint systems of equations [6], =-=[7]-=-, [8], [9]. However, because only a given number of routes are considered, these techniques are not guaranteed to find a solution if one exists. Moreover, OR techniques are not as flexible as CSP-base... |

31 | Interchangeability supports abstraction and reformulation for multi-dimensional constraint satisfaction
- Freuder, Sabin
- 1997
(Show Context)
Citation Context ...gs [15] cluster variables to build abstraction hierarchies for configuration problems viewed as CSPs, and then use interchangeability to merge values on each level of the hierarchy. Freuder and Sabin =-=[16]-=- present abstraction and reformulation techniques based on interchangeability to improve solving CSPs. The phenomenon of phase transitions occurring in many types of problems as a control parameter is... |

27 | Scaling effects in the CSP phase transition
- Gent, MacIntyre, et al.
- 1995
(Show Context)
Citation Context ... range) of the order parameter is where phase transition occurs. The value of the order parameter for a problem instance is often called the tightness of the problem instance. Noteworthy, Gent et al. =-=[18]-=- observed that the relative behavior of algorithms on large and FREI AND FALTINGS: ABSTRACTION AND CONSTRAINT SATISFACTION TECHNIQUES FOR PLANNING BANDWIDTH ALLOCATION 3 (d) Network (c) 64K-BIG (b) 56... |

20 |
An optimization problem related to balancing loads on sonet rings
- Cosares, Saniee
- 1994
(Show Context)
Citation Context ...he RAIN problem. Most often, a fixed number of shortest paths for each demand are pre-computed, and the problem is solved using linear programming with very large constraint systems of equations [6], =-=[7]-=-, [8], [9]. However, because only a given number of routes are considered, these techniques are not guaranteed to find a solution if one exists. Moreover, OR techniques are not as flexible as CSP-base... |

19 |
An Automated Auction in ATM Network Bandwidth
- Miller, Krieger, et al.
- 1996
(Show Context)
Citation Context ...here are more incoming calls than available bandwidth, they also propose the use of Genetic Algorithms for maximizing the revenue. Bandwidth auctionning through a multi-agent system is being explored =-=[12]-=-; however, this work is still at an early stage. To our knowledge, the closest published work to ours is the CANPC framework [13]. It is based on the successive allocations of shortest routes to the d... |

19 | A dynamic hierarchy of intelligent agents for network management,” Intelligent Agents for Telecommunication Applications
- Frei, Faltings
- 1998
(Show Context)
Citation Context ...ults can be expected to scale to larger problems. Phase transition behavior has been reported in an increasing number of NP-complete problems [19]. III. THE BLOCKING ISLAND PARADIGM Frei and Faltings =-=[20]-=- introduce a clustering scheme based on Blocking Islands (BI), which can be used to represent bandwidth availability at different levels of abstraction, as a basis for distributed problem solving. A f... |

13 |
A Comparison of Heuristics for Telecommunications Traffic Routing
- Mann, Smith
- 1996
(Show Context)
Citation Context ...ber of routes are considered, these techniques are not guaranteed to find a solution if one exists. Moreover, OR techniques are not as flexible as CSP-based methods (see Section VIII). Mann and Smith =-=[10]-=- search for routing strategies that attempt to ensure that no link is over-utilized (hard constraint) and, if possible, that all links are evenly loaded (below a fixed target utilization), for the pre... |

13 | Structuring techniques for constraint satisfaction problems
- Weigel, Faltings
- 1997
(Show Context)
Citation Context ...o permit more efficient solution of a CSP. Choueiry and Faltings [14] relate interchangeability to abstraction in the context of a decomposition heuristic for resource allocation. Weigel and Faltings =-=[15]-=- cluster variables to build abstraction hierarchies for configuration problems viewed as CSPs, and then use interchangeability to merge values on each level of the hierarchy. Freuder and Sabin [16] pr... |

11 | A Decomposition Heuristic for Resource Allocation
- Choueiry, Faltings
- 1994
(Show Context)
Citation Context ...esults show that the methods we propose clearly outperform theirs. Abstraction and reformulation techniques have already been applied to permit more efficient solution of a CSP. Choueiry and Faltings =-=[14]-=- relate interchangeability to abstraction in the context of a decomposition heuristic for resource allocation. Weigel and Faltings [15] cluster variables to build abstraction hierarchies for configura... |

6 | The bandwidth allocation problem in the ATM network model is NP-complete
- Vedantham, Iyengar
- 1998
(Show Context)
Citation Context ...load among the links, especially in highly loaded networks, since high bandwidth connectivity allows to route additional demands without having to recompute a complete solution. Vedantham and Iyengar =-=[11]-=- prove that the problem of effective bandwidth utilization in the ATM network model is NPcomplete. In the situation where there are more incoming calls than available bandwidth, they also propose the ... |

6 | A framework for the development of telecommunications network planning, design and optimization applications - Messmer - 1997 |

4 |
Computational Phase Transitions from Real ProbleMS
- Gent, Walsh
- 1995
(Show Context)
Citation Context ...thms can therefore be performed on small problems, and results can be expected to scale to larger problems. Phase transition behavior has been reported in an increasing number of NP-complete problems =-=[19]-=-. III. THE BLOCKING ISLAND PARADIGM Frei and Faltings [20] introduce a clustering scheme based on Blocking Islands (BI), which can be used to represent bandwidth availability at different levels of ab... |

4 |
A.Herschtal, “Optimal Resource Allocation for Path Restoration
- Herzberg, Wells
- 1997
(Show Context)
Citation Context ...IN problem. Most often, a fixed number of shortest paths for each demand are pre-computed, and the problem is solved using linear programming with very large constraint systems of equations [6], [7], =-=[8]-=-, [9]. However, because only a given number of routes are considered, these techniques are not guaranteed to find a solution if one exists. Moreover, OR techniques are not as flexible as CSP-based met... |

4 |
Scaling Effects
- Gent, MacIntyre, et al.
- 1995
(Show Context)
Citation Context ... range) of the order parameter is where phase transition occurs. The value of the order parameter for a problem instance is often called the tightness of the problem instance. Noteworthy, Gent et al. =-=[18]-=- observed that the relative behavior of algorithms on large and(a) 16K-BIG N 7 {N 5 , N 6 } [a,b,c,d,e,f,g,i,j,k] N 7 (b) 56K-BIG N 5 {N 1 , N 2 } [a,b,c,d,e,f,g] 28 N 6 {N 3 , N 4 } [i,j,k] β increa... |

1 |
A.Herschtal, "Optimal Resource Allocation for Path Restoration in Mesh-Type Self-Healing Networks
- Herzberg, Wells
- 1997
(Show Context)
Citation Context ...IN problem. Most often, a fixed number of shortest paths for each demand are pre-computed, and the problem is solved using linear programming with very large constraint systems of equations [6], [7], =-=[8]-=-, [9]. However, because only a given number of routes are considered, these techniques are not guaranteed to find a solution if one exists. Moreover, OR techniques are not as flexible as CSP-based met... |