Calculating the Long-run Incremental Cost of Interconnection Using a Network Cost Simulation Model
W. W. Sharkey D. Mark Kennet
Authors registered in the RePEc Author Service: David Mark Kennet () and
William W. Sharkey
No 9, Computing in Economics and Finance 2001 from Society for Computational Economics
Abstract:
As the world's telecommunication providers privatize, governments turn toward regulatory mechanisms to resolve interconnection disputes. Following provisions of the World Trade Organization agreement, these decisions are supposed to be decided on the basis of "cost;" however, the language employed requiring this standard is rather poorly defined. We develop an engineering-economic model of an interoffice telephone network suitable for calculating interconnection cost. The model utilizes the method of simulated annealing described by Metropolis et al. to determine an "optimal" SONET ring. Using actual switch location data for Maryland we calculate such a network and demonstrate its incremental cost for interconnection. The results may be applied in a variety of tariff formats; we argue for a multipart tariff as most closely representing the cost structure of modern networks and offering flexibility in creating incentives for network buildout in a developing country context.
Keywords: engineering-economic (search for similar items in EconPapers)
JEL-codes: C6 L5 L9 (search for similar items in EconPapers)
Date: 2001-04-01
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
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:sce:scecf1:9
Access Statistics for this paper
More papers in Computing in Economics and Finance 2001 from Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F. Baum ().