NDLI: Protecting local access telecommunications networks: Toward a minimum-cost solution

Content Provider	Springer Nature Link
Author	O’Sullivan, M. J. Walker, C. G. O’Sullivan, M. L. Thompson, T. D. Philpott, A. B.
Copyright Year	2006
Abstract	The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems. In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective) covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined (less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions grow, DP gives significantly better solution times than IP.
Starting Page	353
Ending Page	376
Page Count	24
File Format	PDF
ISSN	10184864
Journal	Telecommunication Systems
Volume Number	33
Issue Number	4
e-ISSN	15729451
Language	English
Publisher	Kluwer Academic Publishers-Plenum Publishers
Publisher Date	2006-12-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Telecommunications network Network design Dynamic programming Integer programming Probability Theory and Stochastic Processes Artificial Intelligence (incl. Robotics) Computer Communication Networks Business Information Systems
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering

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

A depth‐first dynamic programming procedure for the extended tree knapsack problem in local access network design

Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming

Telecommunications network design with multiple technologies

Minimum concave cost multicommodity network design

Network restoration under dual failures using path-protecting preconfigured cycles

Cooperative optimal pricing for stochastic access control in overlaid radio access networks

Dual Ascent for Uncapacitated Telecommunications Network Design with Access, Backbone, and Switch Costs

Deployment of Mobile Switching Centers in a Telecommunications Network: A Stochastic Programming Approach

Toward network steganography detection

Protecting local access telecommunications networks: Toward a minimum-cost solution

Similar Documents

A depth‐first dynamic programming procedure for the extended tree knapsack problem in local access network design

Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming

Telecommunications network design with multiple technologies

Minimum concave cost multicommodity network design

Network restoration under dual failures using path-protecting preconfigured cycles

Cooperative optimal pricing for stochastic access control in overlaid radio access networks

Dual Ascent for Uncapacitated Telecommunications Network Design with Access, Backbone, and Switch Costs

Deployment of Mobile Switching Centers in a Telecommunications Network: A Stochastic Programming Approach

Toward network steganography detection

Protecting local access telecommunications networks: Toward a minimum-cost solution