Case studies of network designs with technology considerations
Computer Communications
Algorithms for IP network design with end-to-end QoS constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Research: Routing in packet-switched communication networks
Computer Communications
A system for the design of packet-switched communication networks with economic tradeoffs
Computer Communications
Automated design of hierarchical intranets
Computer Communications
Designing data center network by analytic hierarchy process
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.07 |
The authors describe a data network design model based on a mixed integer/linear programming (MILP) formulation that does not, as do most other approaches, separate link capacity and facility selection from routing and topological design; it fully integrates these processes to capture the important couplings that exist between them. The performance constraints are incorporated into the model in such a way that they are linear, but lead to the same grade of service for a balanced network as nonlinear average network delay constraints. It is shown that this formulation leads to a natural decomposition of the optimal design problem into two subproblems solvable sequentially. In the absence of capacity allocation constraints, the capacity and flow assignment problem is solved optimally and efficiently as part of the overall design process. Moreover, the model leads directly to the solution of multifacility design problems. A fast link reduction algorithm that efficiently designs single or multifacility networks and yields robust local extrema is presented. This algorithm is based on a special-purpose monotonic greedy drop heuristic procedure. An important application of this model is the design of multifacility networks