NDLI: Designing Least-Cost Survivable Wireless Backhaul Networks

Please wait, while we are loading the content...

Designing Least-Cost Survivable Wireless Backhaul Networks

Content Provider	Springer Nature Link
Author	Cox, Louis Anthony Sanchez, Jennifer Ryan
Copyright Year	2000
Abstract	This paper presents a new heuristic algorithm for designing least-cost telecommunications networks to carry cell site traffic to wireless switches while meeting survivability, capacity, and technical compatibility constraints. This requires solving the following combinatorial optimization problems simultaneously: (1) Select a least-cost subset of locations (network nodes) as hubs where traffic is to be aggregated and switched, and choose the type of hub (high-capacity DS3 vs. lower-capacity DS1 hub) for each location; (2) Optimally assign traffic from other nodes to these hubs, so that the traffic entering the network at these nodes is routed to the assigned hubs while respecting capacity constraints on the links and routing-diversity constraints on the hubs to assure survivability; and (3) Optimally choose the types of links to be used in interconnecting the nodes and hubs based on the capacities and costs associated with each link type. Each of these optimization problems must be solved while accounting for its impacts on the other two. This paper introduces a short term Tabu Search (STTS) meta-heuristic, with embedded knapsack and network flow sub-problems, that has proved highly effective in designing such “backhaul networks” for carrying personal communications services (PCS) traffic. It solves problems that are challenging for conventional branch-and-bound solvers in minutes instead of hours and finds lower-cost solutions. Applied to real-world network design problems, the heuristic has successfully identified designs that save over 20% compared to the best previously known designs.
Starting Page	525
Ending Page	540
Page Count	16
File Format	PDF
ISSN	13811231
Journal	Journal of Heuristics
Volume Number	6
Issue Number	4
e-ISSN	15729397
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	2000-01-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Artificial Intelligence (incl. Robotics) Calculus of Variations and Optimal Control Optimization Operations Research, Mathematical Programming Operation Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Control and Optimization Artificial Intelligence Management Science and Operations Research Computer Networks and Communications Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On Method Overfitting

Mathematical Programming Techniques in Constraint Programming: A Short Overview

Reliability Importance and Invariant Optimal Allocation

Complete Local Search with Memory

Multi Colony Ant Algorithms

Constraint Propagation in Graph Coloring

Lock-Gain Based Graph Partitioning

Heuristics for the Phylogeny Problem

Variable Neighborhood Decomposition Search

Designing Least-Cost Survivable Wireless Backhaul Networks

Similar Documents

On Method Overfitting

Mathematical Programming Techniques in Constraint Programming: A Short Overview

Reliability Importance and Invariant Optimal Allocation

Complete Local Search with Memory

Multi Colony Ant Algorithms

Constraint Propagation in Graph Coloring

Lock-Gain Based Graph Partitioning

Heuristics for the Phylogeny Problem

Variable Neighborhood Decomposition Search

Designing Least-Cost Survivable Wireless Backhaul Networks