Performance evaluation forconnection oriented service in the next generation Internet

Shunfu Jin; Wuyi Yue; Zhanqiang Huo

doi:10.3934/naco.2011.1.749

Article Contents

2011, Volume 1, Issue 4: 749-761. Doi: 10.3934/naco.2011.1.749

This issue Previous Article On the optimality of packet-oriented scheduling in photonic switches with delay lines Next Article Markovian characterization of node lifetime in a time-driven wireless sensor network

Performance evaluation for connection oriented service in the next generation Internet

1.
College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004
2.
Department of Intelligence and Informatics, Konan University, 8-9-1 Okamoto, Kobe 658-8501
3.
School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003

Received: June 2011

Revised: August 2011

Published: November 2011

Abstract / Introduction Related Papers Cited by

Abstract

In this paper, the principle of connection oriented service in the next generation Internet is analyzed. Considering the finite capacity, a Geom/ G/1/K queueing model with Setup, Close Delay and Close Down is built based on the operating mechanism of the connection oriented service. By using the approach of embedded Markov chain and supplementary variable, this queueing model is analyzed. The probability distribution of the queue length and the Probability Generating Function (P.G.F.) of waiting time are derived under the steady state. Correspondingly, the performance measures in terms of average response time, blocking probability and system throughput of this connection oriented Internet service are given to describe the dependency relationships between these measures and the time length $T$ of the Close Delay timer mathematically. Both of the analytical results and the simulation results are provided to investigate and validate the influence of the system parameters on the system performance. The research work in this paper can provide theoretic bases for network design, network maintenance, network management and capacity design of the next generation network systems.

Keywords:

Mathematics Subject Classification: Primary: 68M10, 68M20; Secondary: 60K25.

Citation:

Related Papers

Cited by

References

[1]	F. Baroncelli, B. Martini, V. Martini and P. Castoldi, Extending next generation network (NGN) architecture for connection-oriented transport, Computer Communications, 34 (2011), 1100-1111.doi: 10.1016/j.comcom.2010.01.025.
[2]	M. Hassan and M. Atiquzzaman, A delayed vacation model of an M/G/1 queue with setup time and its application to SVCC-based ATM networks, IEEE Trans. on Communications, 80 (1997), 317-323.
[3]	S. Jin and W. Yue, Performance analysis for a system of connection oriented Internet service with a release delay, IEICE Transactions on Communications, E90-B (2007), 3083-3094.
[4]	S. Jin, W. Yue and M. Liu, Queue model and performance analysis for discrete time switch virtual channels systems, Lecture Notes in Operations Research, Operations Research and its Applications, 5 (2005), 26-36.
[5]	Z. Niu and Y. Takahasi, A finite capacity queue with exhaustive vacation/close-down/setup times and Markovian arrival processes, Queueing Systems Theory Appl., 31 (1999), 1-23.
[6]	S. Paul, J. Pan and R. Jain, Architectures for the future networks and the next generation Internet: A survey, Computer Communications, 34 (2011), 2-42.doi: 10.1016/j.comcom.2010.08.001.
[7]	H. Takagi,, ''Queueing Analysis, (1993).
[8]	S. Secci, J. Rougier and A. Pattavin, AS-level source routing for multi-provider connection-oriented services, Computer Networks, 54 (2011), 2453-2467.doi: 10.1016/j.comnet.2010.04.002.
[9]	M. Schwartz, "Broadband Integrated Networks," New York Prentice Hall, 1996.
[10]	N. Tian and G. Zhang, The discrete time GI/Geo/1 queue with multiple vacations, Queueing Systems, 40 (2002), 283-294.doi: 10.1023/A:1014711529740.
[11]	G. Zhang and N. Tian, Discrete time GI/Geo/1 queue with multiple adaptive vacations, Queueing Systems, 38 (2001), 419-429.doi: 10.1023/A:1010947911863.