Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Performance analysis of a new random access protocol for OCDMA networks

  • Original Article
  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

A New random access protocol for OC-DMA networks is proposed in this paper. Employing a new mathematical model, namely the processor-sharing system, steady-state throughput ratio and average delay of OCDMA networks are calculated. The results reveal that our protocol outperforms other existing protocols. Meanwhile, we investigate the performance of OCDMA networks by altering the code parameters, i.e., length and weight, and the maximum number of active users in the system, corresponding results are indeed consistent with the practical situation. In addition, the analysis is simplified compared with the conventional Markov chain model. Thus the processor-sharing system is truly applicable to model OCDMA networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chung H., Kumar P. V. (1990) Optical orthogonal codes— new bounds and an optimal construction. IEEE Transaction on Information Theory, 36(4):866–872

    Article  MATH  MathSciNet  Google Scholar 

  2. Chung F. R. K., Salehi J. A., Wei V. K. (1989). Optical orthogonal codes: Design, analysis, and applications. IEEE Transaction on Information Theory, 35(3):595–604

    Article  MATH  MathSciNet  Google Scholar 

  3. Gallager R. G. (1996) Discrete Stochastic Processes, Kluwer.

  4. Gordon J. (1995) Pareto process as a model of self-similar packet traffic, Proceedings Of IEEE Globecom Conference, Singapore, Nov. 1995, 232–2236

  5. Johnson S. M. A new upper bound for error-correcting codes. IEEE Transactions on Information Theory, IT-8, 203–207.

  6. Kamath, P., Touch, J. D., Bannister, J. A. (2004) The Need for Media Access Control in Optical CDMA Networks. IEEE INFOCOM’2004, Hong Kong, March 2004, 2208–2219.

  7. Kelly, F. P. (1979) Reversibility and Stochastic Networks. Wiley Series in Probability and Mathematical Statistics.

  8. Leland W. E., Taqqu M. S., Willinger W., Wilson D. V. On the self-similar nature of Ethernet traffic, IEEE/ACM Trans. on Networking, 2(1):1–15.

  9. Lu B., Wang X., Zhang J. (2004) Throughput of CDMA data networks with multiuser detection, ARQ, and packet combining. IEEE Transaction on Wireless Communication, 3(5):1576–1589

    Article  Google Scholar 

  10. Parekh A. K., Gallager R. G. (1993) A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transaction Networking, 1(3):344–357

    Article  Google Scholar 

  11. Raychaudhuri D. (1981) Performance analysis of random access packet-switched code division multiple access systems. IEEE Transaction on Communication, COM-29(6): 895–901

    Article  MathSciNet  Google Scholar 

  12. Salehi, J. A. (1989) Code division multiple-access techniques in optical fiber networks—part I: fundamental principles. IEEE Transactions on Communication, 37, no. 8, (Aug. 1989), pp. 824–833.

  13. Shalaby, H. M. H. (2003a) Optical CDMA random access protocols. Proceedings of IEEE OSCC’2003, Antalya, Turkey, June. 2003, 2, 907–912.

  14. Shalaby H. M. H. (2003b) Optical CDMA random access protocols with and without pretransmission coordination. IEEE/OSA Journal of Lightwave Technology, 21(11):2455–2462

    Article  Google Scholar 

  15. Shalaby H.M.H. (2004a) Performance analysis of an optical CDMA random access protocol. IEEE/OSA Journal of Lightwave Technology, 22(5): 1233–1241

    Article  Google Scholar 

  16. Shalaby H.M.H. (2004b) A proposal of an optical CDMA random access protocol, Proceedings of IEEE ICC’ 2004, Paris, France, June 2004, 3, 1709–1713.

  17. Shurong, S., Hongxi, Y., Anshi, X. (2005) A New Family of 2-D Optical Orthogonal Codes for Optical CDMA Access Networks. IEEE The 11th Asia-Pacific Conference on Communications, Perth, Western Australia, Oct. 2005, 1A3.

  18. Shurong S., Hongxi Y., Ziyu W., Anshi X. (2006) A New Family of 2-D Optical Orthogonal Codes and Analysis of its Performance in Optical CDMA Access Networks. IEEE/OSA Journal of Lightwave Technolgy, 24(4): 1646–1653

    Article  Google Scholar 

  19. Stok A., Sargent E.H. (2003) Comparison of diverse optical CDMA codes using a normalize throughput metric. IEEE Commun Letters, 7(5):242–244

    Article  Google Scholar 

  20. Tanceversuski, L., Andonovic, I. (1996) Hybrid wavelength hopping/time spreading schemes for use in massive optical networks with increased security. IEEE/OSA Journal of Lightwave technology, 14(12): 2636–2646

    Article  Google Scholar 

  21. Telatar I.E., Gallager R.G. (1995) Combining queuing theory with information theory for multi-access. IEEE Journal on Selected Areas Communication, 13(6):963–969

    Article  Google Scholar 

  22. Wenhua, M. (1996) The theory of code construction for frequency-hopping communications, National Defense Industry Press/New Times Press.

  23. Yang G.C., Fuja T. (1996) Optical orthogonal codes with unequal auto-and cross-correlation constraints. IEEE Transaction on Information Theory, 41(1):96–106

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongxi Yin.

Additional information

Supported by National Natural Science Foundation of China (NSFC), No. 60472035.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, S., Yin, H., Wang, Z. et al. Performance analysis of a new random access protocol for OCDMA networks. Photon Netw Commun 14, 89–95 (2007). https://doi.org/10.1007/s11107-006-0053-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-006-0053-y

Keywords

Navigation