Email this article 
Open Access
Subscription or Fee Access
Performance Evaluation of Parallel and Series Communication Network with Dynamic Bandwidth Allocation
Abstract
In this paper a parallel and series communication network model with dynamic bandwidth allocation is developed and analyzed. In order to reduce congestion in buffer and to improve voice quality several congestion control methods like bit dropping,selective packet discarding, flow control etc., are developed and successfully implemented. to have an efficient utilization we propose dynamic allocation of bandwidth i.e. the transmission rate of the data/voice packet dependent on the content of the buffer just before it get transmitted. The end to-end performance of the model is measured by approximating the arrival and service processes of the packets follow poisson process. The transient analysis of the communication network shows that dynamic allocation has a significant effect in reducing mean delays and improving throughput of the transmitter. Graphs illustrate performance of the network model for different parameters.
Keywords
References
E. Hahno, Round-Robin scheduling for max-min fairness in data networks, IEEE Journal on Selected Areas in Communications, 1991,Vol. 99. pp 1024-1039.
Erramilli, A. and Single R. P. A performance analysis of protocols for multicast communication in Broadband packet networks, IEEE Conference proceedings on Area Communications, EUROCON’88,1998, pp 222-226.
Gaujal, B. and Hyon, E., Optimal routing policies in deterministic queues in tandem, Proceedings of Sixth International Workshop on Discrete Event Systems, 2002, pp 251-257.
Han. Guodong, Wen Jianhua and Wu Jiangxing, Dynamic bandwidth allocation algorithm utilizing full band, Journal of Electronics (China),Jan 2006, Vol. 23, No. 1, pp 48-53.
H. Sariowan, R. Cruz, G. Polyzos, SCED: A generalized scheduling policy for guaranteeing quality-of-service, IEEE/ACMTrans.onNetworking, 1999, Vol. 75, pp 669-684.
Stoica, Hui Zhang, T. S. Eugene Ng, A hierarchical fair service curve algorithm for link sharing real-time and priority services, IEEE/ACM Trans. on Networking, 2000, Vol. 28, pp185-199.
Kin K. Leung, Load-dependent service queues with application to congestion control in broadband networks, Performance Evaluation,2002, Vol. 50, Issue1-4, pp 27-40.
Kleinrock. L., Queueing systems, Vol II: Computer Applications, 1976,Newyork, Wiley Publications.
Lieshout, P. M. D. and Mandjes, M. R. H., Tandem Browian queues, Probability, Networks and Algorithms, 2006, Report PNA-R0604.
L. Zhang, Virtual clock: A new traffic control algorithm for packet switched networks. ACM Trans. on Computer Systems, 1991, Vol. 92,pp 101-124.
Mingyan Liu and John S. Baras, Fixed Point Approximation for multirate multihop loss networks with state dependent routing, IEEE Transcations on Networking, 2004, Vol. 12, No. 2, pp361-374
Nan Ni, Laxmi narayan Bhuyan, Fair scheduling in internet routers,IEEE Trans. on Computers, 2002, Vol. 516, pp 686-701.
P. Giaccone, Queueing and scheduling algorithms for high performance routers, Ph. D. dissertation, Politechnico di Torino, Italy, Feb 2002.
Siew, C. W., Feng, G., Long, F. and Er, M. H., Congestion control based on flow state-dependent dynamic priority scheduling, IEEE proccommunications,2005, Vol. 152, No. 5, pp 548-558.
Sriram K., Methodologies for bandwidth allocation, transmission scheduling and congestion avoidance in broadband ATM networks,Computer Networks, ISDN System, 1993, J. 26, pp43-59
Sriram, K. and Lucantoni, D. M., Traffic smoothing effects of bit dropping in a packet voice multiplexer, IEEE Transcations on communications, 1989, Vol. 37, No. 7, pp 703-712.
Suresh Varma, P. and Srinivasa Rao, K., A Communication Network with Load Dependent Transmission, International Journal of Mathematical sciences 2007, Vol. 6, No. 2, pp199-210.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.