Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Howard (1960)
Dynamic Programming and Markov Processes
Jean-François Labourdette, A. Acampora (1993)
Logical clustering for the optimization and analysis of a rearrangeable distributed ATM switchIEEE INFOCOM '93 The Conference on Computer Communications, Proceedings
B. Mukherjee (1992)
WDM-based local lightwave networks. II. Multihop systemsIEEE Network, 6
(1987)
A multichannel multihop multihop local lightwave network
J. Bannister, L. Fratta, M. Gerla (1990)
Topological design of the wavelength-division optical networkProceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration
C. Brackett (1990)
Dense Wavelength Division Multiplexing Networks: Principles and ApplicationsIEEE J. Sel. Areas Commun., 8
Jean-François Labourdette, A. Acampora, G. Hart (1992)
Reconfiguration algorithms for rearrangeable lightwave networks[Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications
Jean-François Labourdette, A. Acampora (1991)
Logically rearrangeable multihop lightwave networksIEEE Trans. Commun., 39
(1991)
On the design of dynamic con guration policies for multihop lightwave networks
Y. Lam, V. Li (1986)
An Improved Algorithm for Performance Analysis of Networks with Unreliable ComponentsIEEE Trans. Commun., 34
(1991)
Use of delegated tuning and forwarding in WDMA networks
We consider multichannel multihop lightwave networks with stations equipped with a small number of transmitters and receivers. By assigning wavelengths to the receivers and transmitters at each station, one can define the logical connectivity of the network independently of the underlying physical topology. The advent of fast tunable optical transmitters and receivers makes it feasible to dynamically update the network connectivity to accommodate traffic demands that vary over time. Of major concern in such design is how the connectivity should react to changes in traffic patterns. The problem is formulated as a Markovian Decision Process and the properties of the optimal configuration policy are identified. These properties are then used to develop an algorithm for obtaining policies that make decisions similar to the decisions of the optimal policy. A procedure is also proposed to manage the large state space for systems with a large number of stations.
Journal of High Speed Networks – IOS Press
Published: Jan 1, 1995
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.