Call for Paper - November 2018 Edition
IJCA solicits original research papers for the November 2018 Edition. Last date of manuscript submission is October 22, 2018. Read More

Steady State Analysis of a Three Node Tandem Communication Network Model with DBA having Homogeneous Compound Poisson Direct Bulk Arrivals at Node 1 And Node 2

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2015
Authors:
G. Rajendra Kumar, Kuda Nageswara Rao, K. Srinivas Rao
10.5120/ijca2015906799

Rajendra G Kumar, Kuda Nageswara Rao and Srinivas K Rao. Article: Steady State Analysis of a Three Node Tandem Communication Network Model with DBA having Homogeneous Compound Poisson Direct Bulk Arrivals at Node 1 And Node 2. International Journal of Computer Applications 129(4):8-16, November 2015. Published by Foundation of Computer Science (FCS), NY, USA. BibTeX

@article{key:article,
	author = {G. Rajendra Kumar and Kuda Nageswara Rao and K. Srinivas Rao},
	title = {Article: Steady State Analysis of a Three Node Tandem Communication Network Model with DBA having Homogeneous Compound Poisson Direct Bulk Arrivals at Node 1 And Node 2},
	journal = {International Journal of Computer Applications},
	year = {2015},
	volume = {129},
	number = {4},
	pages = {8-16},
	month = {November},
	note = {Published by Foundation of Computer Science (FCS), NY, USA}
}

Abstract

In this paper, a three stage communication network model with two stage homogeneous bulk arrivals and dynamic bandwidth allocation under equilibrium condition is developed and analyzed. Consider a Communication network in which three nodes are in tandem and the messages arrive to the first node are converted into number of packets and stored in first buffer connected to the first node. After transmitting from the first node, the messages arrive to the second node from first node and the messages which are directly arriving to the second node are converted into number of packets and stored in second buffer connected to the second node. After transmitting from the second node, the messages arrive to the third node are converted into number of packets and stored in third buffer connected to the third node. Dynamic Bandwidth Allocation (DBA) is the strategy that the transmission rate at each node is adjusted depending upon the content of the buffer at every packet transmission. It is assumed that the arrival of packets follow compound Poisson processes and the transmission completions at each node follow Poisson processes. The steady state analysis of this model is carried by assuming that the system is stable under equilibrium. This model is more accurately fit into the realistic situation of the communication network having a predecessor and successor nodes for the middle node. Using the difference-differential equations, the joint probability generating function of the number of packets in each buffer is derived. The performance measures like, the probability of emptiness of the three buffers, the mean content in each buffer, mean delays in buffers, throughput etc. are derived explicitly under equilibrium or steady state conditions. This network model is much useful in communication systems.

References

  1. Kleinrock,L.(1976),Queuing Systems, Vol-II: Computer Applications, Wiley publications, New York.
  2. YukuoHayashida(1993), Throughput analysis of tandem typego-backNARQ scheme for satellite communications, IEEE Transactions on Communications,Vol.41, pp 1517-1524.
  3. Paul Dupis, Kevin Leder and Hui Wang (2007), Large deviations and importance sampling for a tandem network with slow – down, Queuing Systems, Vol.57, pp 71-83.
  4. Paul Beekhuizen, Dee Denteneer and Ivo Adan (2008), Analysis of tandem network model of a single-router network-on-chip, Annul of operations research, Vol.162, pp 19-34.
  5. Stanislav Angelov, Sanjeev Khanna, Keshav Kunal (2009), The network as a storage device: dynamic routing with bounded buffers, Algorithmica Vol.55, pp 71-94.
  6. Adan Ivo, Michel Mandjes, Werner Scheinhardt and Elena Tzenova, (2009), On a generic class of two-node queuing systems, Queuing Syst, Vol.61, pp 37-63.
  7. Sriram,K.(1993),Methodologies for bandwidth allocation, Transmission scheduling and congestion avoidance in broadband ATM networks, Computer Network, ISDN System, J.26, pp 43-59.
  8. Kin K. Leung (2002),Load dependent service queues with application to congestion control in broadband networks, Performance Evaluation, Vol.50, Issue 1-4, pp 27-40.
  9. Kuda. Nageswara Rao, K. Srinivasa Rao, P.Srinivasa Rao (2011). Performance Evaluation of a Communication Network with Dynamic Bandwidth Allocation and Batch Arrivals, International Journal of Computer Applications (0975– 8887) Volume 16– No.8, February 2011.
  10. Nakka Thirupathi Rao, K.Srinivasa Rao, Kuda Nageswara Rao and P.Srinivasa Rao (2014)-Transient Analysis of a Two Node Tandem Communication Network with Two Stage Compound Poisson Binomial Bulk Arrivals and DBA, International Journal of Computer Applications, Vol.96, No.25, pp 19-31.

Keywords

Three stage communication networks, Dynamic bandwidth allocation, Batch arrivals and Steady state.