EconPapers    
Economics at your fingertips  
 

Long-Distance Access Network Design

Rosemary T. Berger () and S. Raghavan ()
Additional contact information
Rosemary T. Berger: Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015
S. Raghavan: Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742

Management Science, 2004, vol. 50, issue 3, 309-325

Abstract: Long-distance telephone companies in the United States pay access fees to local telephone companies to transport calls that originate and terminate on their networks. These charges form the largest portion of the cost of providing long-distance service. Recent changes in the structure of access rates, which were mandated by the Federal Communications Commission (FCC), have created opportunities for long-distance companies to better manage access costs. In this paper, we develop an optimization-based approach to the economic design of access networks. Our novel solution approach combines stochastic aspects of the problem with a challenging discrete facility location problem in a three-phase algorithm. Computational results indicate a potential cost savings of hundreds of millions of dollars annually for long-distance companies.

Keywords: integer programming; hub location; queueing; network flows; telecommunications (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.1030.0161 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:50:y:2004:i:3:p:309-325

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:ormnsc:v:50:y:2004:i:3:p:309-325