S. Ramesh, G. N. Rouskas, and H. G. Perros, "Computing Blocking Probabilities in Multiclass WavelengthRouting Networks with Multicast Calls," IEEE J. Select. Areas Commun., vol. 20, no. 1, pp. 89-96, Jan. 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Routing and Wavelength Assignment for Reconfigurable .. - Chen, Modiano (2003) (1 citation) (Correct)
....for call arrival rates and holding times and design algorithms to minimize the call blocking probability. Numerous papers have focused on blocking probability analysis under various approximations for simple wavelength assignment algorithms such as the random algorithm [7] 8] 9] 10] 11] [12] and first fit [13] However, due to the large state space size of the problem, the blocking probability of a WDM network for more sophisticated algorithms is extremely difficult to analyze. As a result, most statistical algorithms rely on simplifying approximations and heuristics [14] An ....
S. Ramesh, G. N. Rouskas, and H. G. Perros, "Computing blocking probabilities in multiclass wavelength-routing networks with multicast calls," IEEE J. Select. Areas Commun., vol. 20, pp. 89--96, January 2002.
Minimizing Request Blocking in All-Optical Rings - Nomikos, Pagourtzis, Zachos (2003) (Correct)
....algorithm. Other related work includes multiple fiber models [14] 15] 16] 17] 18] and models that allow wavelength conversion [19] 20] 21] Another interesting approach is to consider a random distribution of requests and estimate blocking probabilities (e.g. see [22] 23] [24]) C. Notation and Preliminaries Here n will denote the number of vertices and m the number of requests (m = R ) note that the number of edges is also n, whereas the number of arcs in the directed version is2 n. Let # be any of our maximization problems. We say that an algorithm for # ....
S. Ramesh, G. N. Rouskas, and H. G. Perros, "Computing blocking probabilities in multi-class wavelength routing networks with multicast calls," IEEE Journal on Selected Areas in Communications, vol. 20(1), pp. 89--96, 2002.
QoS-Guaranteed Wavelength Allocation for WDM Networks with.. - Tachibana, Kasahara (Correct)
No context found.
S. Ramesh, G. N. Rouskas, and H. G. Perros, "Computing Blocking Probabilities in Multiclass WavelengthRouting Networks with Multicast Calls," IEEE J. Select. Areas Commun., vol. 20, no. 1, pp. 89-96, Jan. 2002.
QoS Provisioning with Shared Wavelength Allocation for.. - Tachibana, Kasahara (Correct)
No context found.
S. Ramesh, G. N. Rouskas, and H. G. Perros, "Computing Blocking Probabilities in Multiclass WavelengthRouting Networks with Multicast Calls," IEEE J. Select. Areas Commun., vol. 20, no. 1, pp. 89-96, Jan. 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC