Advertisement

Abstract

We describe an analytic approach for the calculation of the departure process from a burst ggregation algorithm that uses both a timer and maximum/minimum burst size. The arrival process of packets is assumed to be Poisson or bursty modelled by an Interrupted Poisson Process (IPP). The analytic results are approximate and validation against simulation data showed that they have good accuracy.

Keywords

Moment Generate Function Burst Size Optical Burst Switching Aggregation Algorithm Edge Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Xu, L., Perros, H.: Performance analysis of an ingress optical burst switching node (Submitted), http://www.csc.ncsu.edu/faculty/perros/Xu5.pdf
  2. 2.
    Yu, X., Li, J., Cao, X., Chen, Y., Qiao, C.: Traffic statistics and performance evaluation in optical burst switched networks. Journal of lightwave technology 22(12), 2722–2738 (2004)CrossRefGoogle Scholar
  3. 3.
    de Vega Rodrigo, M., Gotz, J.: An analytical study of optical burst switching aggregation strategies. In: Broadnets 2004. IEEE, Los Alamitos (2004)Google Scholar
  4. 4.
    Hu, G., Dolzer, K., Gauger, C.M.: Does burst assembly really reduce the self-similarity. In: Proc. of the Optical Fiber Communication Conference, OFC (2003)Google Scholar
  5. 5.
    Xiong, Y., Vandenhoute, M., Cankaya, H.: Control architecture in optical burst switched wdm networks. IEEE jsac 18, 1838–1851 (2000)Google Scholar
  6. 6.
    Xue, F., Yoo, S.J.B.: Self-similar traffic shaping at the edge router in optical packet-switched networks. In: Proc. of IEEE International Conference on Communications (2002)Google Scholar
  7. 7.
    Viniotis, Y.: Probability and Random Processes for Electrical Engineers. McGraw-Hill, New York (1997)Google Scholar
  8. 8.
    Yates, R.D., Goodman, D.J.: Probability and Stochastic Processes. John Wiley and Sons, Chichester (1999)MATHGoogle Scholar
  9. 9.
    Kleinrock, L.: Queueing Systems, Theory, vol. I. John Wiley and Sons, Chichester (1975)MATHGoogle Scholar
  10. 10.
    Perros, H.G.: Queueing Networks with Blocking, Exact and Approximate Solutions. Oxford University Press, Oxford (1994)MATHGoogle Scholar
  11. 11.
    Fischer, W., Meier-Hellstern, K.: The Markov-Modulated Poisson Process (MMPP) cookbook. Performance Evaluation 18, 149–171 (1992)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Xenia Mountrouidou
    • 1
  • Harry G. Perros
    • 1
  1. 1.Computer Science DepartmentNorth Carolina State UniversityRaleighUSA

Personalised recommendations