The week's pick
Reseach Article
Two Node Communication Network Model with Weibull Inter arrival Times and Dynamic Bandwidth Allocation
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 128 - Number 5 |
| Year of Publication: 2015 |
| Authors: G. Sita Ratnam, K. Srinivasa Rao, P. Srinivasa Rao |
10.5120/ijca2015906542
|
G. Sita Ratnam, K. Srinivasa Rao, P. Srinivasa Rao . Two Node Communication Network Model with Weibull Inter arrival Times and Dynamic Bandwidth Allocation. International Journal of Computer Applications. 128, 5 ( October 2015), 19-29. DOI=10.5120/ijca2015906542
Abstract
In modeling the network traffic Poisson process is extensively used for packet and connection arrivals. Bit in internet traffic an arrival process is bursty due to self-similarity and time dependent nature. Rakesh Singhai et al(2007) have observed that Weibull distribution gives good fit for inter arrival times of packets in network traffic such as LAN, MAN, Wan and Web applications, which oneself similarity. In this paper for the first time we design a two node communication network with Weibull inter arrival times having Dynamic Band Width Allocation. Here, it is assumed that two transmitters are connected in tandem and packets arrive at the source are stored in buffers for forward transmission. The transmission strategy is dynamic band width allocation. The network performance measures such as average number of packets in each buffer, the mean delays in transmission, the throughput, the utilization of transmitters are derived explicitly. It is observed that the time dependent nature of mean arrival rate has significant influence on the performance measures. The dynamic band width allocation can reduce the congestion in buffers and mean delays in transmission. This model also include two node communication network model and exponential inter arrival times as a particular case.
References
- V. Frost and B.Melarned, (1994) “Traffic modeling for telecommunication networks,” IEEE commun. Magazine., vol.33, pp. 70-80.
- P.Abry, R. Baraniuk, P.Flandrin, R. Riedi, D. Veitch, (2002) “Multi-scale Nature of Network Traffic,” IEEE Signal Processing Magazine, pp. 28-27.
- Cappe O, E. Moulines, J. C. Pesquet, A.Petropulu, X. Yang (2002), “Long-Range Dependence and Heavy-Tail Modeling for Teletraffic Data,” IEEE signal Processing Magazine, pp.14-27.
- P. Danzig, S.Jamin, R. Caceres, D.Mitzel, and D. Estrin, (1992) ”An empirical workload model for driving wide-area TCP/IP network simulations,” Internetworking: Res., Experience, vol. 3, no. 1, pp. 1-26.
- H. Fowler and W. Leland, (1991), “Local area network traffic characteristics, with implications for broadband network congestion management,” IEEE J. Select areas commun, vol.9. pp. 1139-1149.
- R. Gusella (1990), “A measurement study of diskless workstation traffic on an Ethernet ,”IEEE Trans. Commun., vol. 38, pp. 1557-1568.
- R.Jain and S.Routhier, (1986), “Packet trains-Measurements and a new model for computer
- network traffic, “IEEE J. Select. Areas Commun., Vol. 4, pp. 986-995.
- W.Leland, M. Taqqu, W. Willinger, and D. Wilson,(1994) “On the self-similar nature of Ethernet traffic(extended version),” IEEE/ACM Trans. Networking, vol. 2, pp. 1-15.
- V. Paxson and S. Floyd, (1995), “Wide area traffic: the failure of Poisson modeling,” IEEE/ACM Trans. Netw., vol.3, no.3, pp. 226-244.
- M. V. Rama Sundari, K. Srinivasa Rao, P. Srinivasa Rao, P. Suresh Varma, (2011), On Tandem Communication Network Model with DBA having NHP Arrivals for First Node and Poisson process arrivals for Second Node in International Journal of Computer Science (136 – 144) Volume 8 , No. 2.
- M. V. Rama Sundari, K. Srinivasa Rao, P. Srinivasa Rao, P. Suresh Varma, (2011), Three Node Tandem Communication Network Model with Dynamic Bandwidth Allocation and Non Homogeneous Poisson Arrivals in International Journal of Computer Applications (0975 – 8887) Volume 31, No. 1.
- Trinatha Rao, P., K.Srinivasa Rao, (2012) ,Performance of non-homogeneous communication with Poisson arrivals and dynamic bandwidth allocation, International Journals of Systems, control and communication, Vol. 4 No. 3, pp 164-182.
- Suhasini, A.V.S, P.srnivasa Rao, P.R.S.Reddy (2013a), Transient analysis of tandem queuing model with non-homogeneous Poisson bulk arrivals having state dependent service rates, International Journal of Advanced Computer and mathematical Sciences, Vol. 3,No. 3, pp 272-284.
- Suhasini, A.V.S, P.srnivasa Rao, P.R.S.Reddy (2013), Transient analysis of parallel and series queuing model with non-homogeneous Poisson binomial arrivals having independent service rates, Normal parallel and scientific computations, Vol.21,No.2, pp 235-262.
- Suhasini, A.V.S., K.Srnvasa Rao, P.R.S.Reddy (2013b), on parallel and series non-homogeneous bulk arrival queuing model, OPSEARCH, Vol. 50, No. 4, pp 521-547.
- Rakesh Singhai, Shiva Dutt Joshi and Rajendra K. P. Bhatt, (2007), “A Novel Discrete Distribution and Process to Model Self-Similar Traffic, “9th IEEE international conference on telecommunications – Con TEL 2007, Zagreb, Croatia, pp 167-171.
- Earlang, A.K.(1909). Probablity and Telephone calls, Nyt.Tidsskr Krarup Mat. Ser. B. vol.20,pp 33-39.
- A. Feldmann, (2000), “characteristics of TCP connection Arrivals” chapter 15, Self-Similar Network traffic and Performance evolution, edited by K.Park, W. Willinger,jhon wiley & Sons Inc.
- M. J. Fisher, D. Gross, D. Masi and J. F. Shortle, (2001), “Analyzing the Waiting Time Process in Internet Queuing Systems With the Transform Approximation Method,” The Telecommunications Review,12, pp 21-32.
Index Terms
Keywords