Introduction to algorithms
Optical networks: a practical perspective
Optical networks: a practical perspective
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Traffic grooming in static wavelength division multiplexing networks
IEEE Communications Magazine
Optical networking technologies: what worked and what didn't
IEEE Communications Magazine
On the efficiency of a game theoretic approach to sparse regenerator placement in WDM networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On the dimensioning of WDM optical networks with impairment-aware regeneration
IEEE/ACM Transactions on Networking (TON)
Energy efficient Traffic-Aware design of on-off Multi-Layer translucent optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
The problem of minimizing the number of optical nodes with signal regeneration capability can be constrained to guarantee a desired degree of end-to-end connectivity in the all-optical transport network. The problem can be formulated using a k-connected, k-dominating node set, which is a known approach in mobile ad hoc wireless networks. This paper presents a preliminary study aimed at establishing whether efficient centralized solutions to this problem in optical networking ought to be investigated to improve the decentralized solutions already available for wireless networks.