Cost allocation in networks: The bulk supplier problem
โ Scribed by A. Claus; D. J. Kleitman
- Publisher
- John Wiley and Sons
- Year
- 1974
- Tongue
- English
- Weight
- 994 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
We consider the cost allocation problem faced by a large scale supplier (the telephone company) who rents telephone circuits to its customers. A number of possible allocation rate structures are analyzed, as are some of the criteria that they may be measured by. Finally, we draw conclusions and make recommendations for cost allocation in these circumstances.
๐ SIMILAR VOLUMES
We consider the single allocation problem in the interacting three-hub network with fixed hub locations. In the single allocation hub network, the hubs are fully interconnected and each nonhub node has to be connected to exactly one of the hubs. The flows between each pair of nodes are sent using th
Localization is a fundamental problem in wireless sensor networks. Current localization algorithms mainly focus on checking the localizability of a network and/or how to localize as many nodes as possible given a static set of anchor nodes and distance measurements. In this paper, we study a new opt
## Abstract The developing competition in the electric utility industry is likely to see a substantial change in the way the industry operates. It is certainly agreed that the decades of regulatory transmission tariffs will give way in the near future to a new deregulated marketplace where the fast