OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: K. Bergman and V. Chan
  • Vol. 3, Iss. 4 — Apr. 1, 2011
  • pp: 300–311

Dynamic Preemption Call Admission Control Scheme Based on Markov Decision Process in Traffic Groomed Optical Networks

Chuan-Ching Sue, Yuan-Bin Hsu, and Pey-Jiuan Ho  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 3, Issue 4, pp. 300-311 (2011)
http://dx.doi.org/10.1364/JOCN.3.000300


View Full Text Article

Enhanced HTML    Acrobat PDF (764 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

In optical grooming networks, the capacity fairness issue can be resolved by utilizing a call admission control (CAC) mechanism. Existing CAC schemes are generally based on one of four different techniques, namely, static bandwidth reservation, static threshold setting, mathematical statistics, and Markov decision processing without buffer implementation (NB). However, irrespective of the technique used, a trade-off exists between the network fairness and the network throughput. In our previous work, a conditional-preemption CAC (CP-CAC) mechanism was proposed to increase the network throughput while simultaneously maintaining the fairness. However, a CP-CAC mechanism considers only the blocking probability at particular instants of preemption. This paper proposes the use of a dynamic-preemption call admission control scheme (DP-CAC) to decide whether or not to preempt existing requests based on the optimal policy derived from a Markov decision process. Similar to CP-CAC, the DP-CAC method is also based on a dynamic threshold setting concept and is implemented using a single connection buffer and an associated set of virtual indicators. The simulation results show that compared to the CP-CAC mechanism, the proposed DP-CAC further improves the network throughput without sacrificing the fairness. Additionally, the average waiting time induced by the buffer implementation for DP-CAC is just 0.23 time units shorter compared to 0.25 for CP-CAC. Finally, it is shown that the proposed method also ensures fairness in a variety of common network topologies including 6 × 6mesh-torus, NSF, and Cost239.

© 2011 OSA

OCIS Codes
(060.0060) Fiber optics and optical communications : Fiber optics and optical communications
(060.4250) Fiber optics and optical communications : Networks
(060.4510) Fiber optics and optical communications : Optical communications

ToC Category:
Research Papers

History
Original Manuscript: September 29, 2010
Revised Manuscript: January 27, 2011
Manuscript Accepted: January 28, 2011
Published: March 24, 2011

Citation
Chuan-Ching Sue, Yuan-Bin Hsu, and Pey-Jiuan Ho, "Dynamic Preemption Call Admission Control Scheme Based on Markov Decision Process in Traffic Groomed Optical Networks," J. Opt. Commun. Netw. 3, 300-311 (2011)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-3-4-300


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. B. Mukherjee, C. Ou, H. Zhu, K. Zhu, N. Singhal, and S. Yao, "Traffic grooming in mesh optical networks," Optical Fiber Communication Conf., 2004, pp. 23‒27.
  2. M. Sivakumar, K. M. Sivalingam, and S. Subramaniam, "On factors affecting the performance of dynamically groomed optical WDM mesh networks," Workshop on High Performance Switching and Routing, 2005, pp. 411‒415.
  3. K. Zhu, H. Zang, and B. Mukherjee, "A comprehensive study on next-generation optical grooming switches," IEEE J. Sel. Areas Commun. 21, (7), 1173‒1186 (2003). [CrossRef]
  4. K. Zhu and B. Mukherjee, "A review of traffic grooming in WDM optical networks: architectures and challenges," Opt. Networks Mag. 4, (2), 55‒64 (2003).
  5. A. K. Somani, Survivability and Traffic Grooming in WDM Optical Networks, Cambridge U. Press, 2006.
  6. K. Zhu, H. Zhu, and B. Mukherjee, "Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming," IEEE Network 17, (2), 8‒15 (2003).
  7. S. Thiagarajan and A. K. Somani, "Performance analysis of WDM optical networks with grooming capabilities," Proc. SPIE 4213, 253‒262 (2000).
  8. K. W. Ross and D. H. K. Tsang, "The stochastic knapsack problem," IEEE Trans. Commun. 37, (7), 740‒747 (1989). [CrossRef]
  9. P. Tran-Gia and F. Hubner, "An analysis of trunk reservation and grade of service balancing mechanisms in multiservice broadband network," IFIP Workshop TC6, Modeling and Perfomance Evaluation of ATM Technology, Vol. c-15, 1993, pp. 83‒97.
  10. S. Thiagarajan and A. K. Somani, "Capacity fairness of WDM networks with grooming capabilities," Opt. Networks Mag. 2, (3), 24‒32 (2001).
  11. J. Choi, T. Kwon, Y. Choi, and M. Naghshineh, "Call admission control for multimedia services in mobile cellular networks: a Markov decision approach," IEEE Symp. on Computers and Communications, 2000, pp. 594‒599.
  12. K. Mosharaf, J. Talim, and I. Lambadaris, "A call admission control for service differentiation and fairness management in WDM grooming networks," Int. Conf. on Broadband Networks, BroadNets, 2004, pp. 162‒169.
  13. K. Mosharaf, J. Talim, and I. Lambadaris, "A call admission control for service differentiation and fairness management in WDM grooming networks," Opt. Switching Networking 2, (2), 113‒126 (2005). [CrossRef]
  14. C. C. Sue, Y. B. Hsu, and P. J. Ho, "Fair admission control scheme based on conditional preemption in traffic groomed optical networks," Photonic Network Commun. 20, (3), 257‒267 (2010). [CrossRef]
  15. K. Mosharaf, J. Talim, and I. Lambadaris, "Optimal resource allocation and fairness control in all-optical WDM networks," IEEE J. Sel. Areas Commun. 23, (8), 1496‒1507 (2005). [CrossRef]
  16. M. L. Puterman, Markov Decision Processes, Wiley Inter-Science, 1994.
  17. R. A. Howard, Dynamic Programming and Markov Process, MIT Press, 1960.

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited