Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Related Work
Comparative Study
Observations and Conclusion
References
All Topics
Computer Science

Buffer Management in Cellular IP Networks Using GA

Profile image of Deo VidyarthiDeo Vidyarthi

International Conference on Advanced Computer Theory and Engineering (ICACTE 2009)

https://doi.org/10.4018/JAEC.2010100101
visibility

…

description

22 pages

link

1 file

Abstract

Buffer management is very crucial to the Cellular IP networks as its proper use not only increases the throughput of the network but also results in the reduction of call drops. A model for buffer management in Cellular IP network using GA is being proposed in this work. It deals with two kinds of buffers; Gateway buffer and Base Station buffer. This is a two-tier model, where in the first tier a prioritization algorithm is applied for prioritizing real-time packets and to serve them in the buffer of the Gateway within a specified threshold. Remaining packets which couldn't be served after the threshold will be given to the nearest cells of the network to be dealt with in the second part. A GA based procedure is applied here in order to store these packets in the buffer of the base stations. Experiments have been conducted with different numbers of returned packets in order to study the effect of available buffer space on the number of dropped packets and to check the efficiency...

Related papers

Steady State Analysis of Base Station Buffer Occupancy in a Cellular Mobile System
Fayza Nada

Journal of Computer Networks and Communications

The 3rd generation partnership project (3GPP) standards organizations makes great efforts in order to reduce the latency of 5G mobile networks to the least possible extent. Recently, these networks are associated with big buffers to maximize the network utilization and minimize the wasted wireless resources. However, in existence of the TCP congestions, having bottlenecks are still expected on radio access networks (RANs) data paths. Consequently, this influences the network performance and reduces its quality of services (QoSs). Apparently, studying and improving the behavior of buffers deployed at 5G mobile networks devices can contribute to solving these problems (at least by reducing the queuing time at these buffers). In this paper, we study the buffer behavior of base stations in a 5G mobile network at steady state. We consider a cellular mobile network consisting of finite number of users (stations, terminals, and mobiles). At any time-slot, a station may be using the channel...

View PDFchevron_right
Design and Implementation of G/G/1 Queuing Model Algorithm w.r.t. its Applicability for Internet Gateway Server
Dr Riktesh Srivastava

The International Arab Journal of Information Technology, 2008

How to competently apportion system resource to process the client request by gateway servers is a tricky predicament. In this paper, we propose an enhanced proposal for autonomous recital of gateway servers under highly dynamic traffic loads. We have developed G/G/1 queuing model algorithm and premeditated its intricacy, so that there is lossless information repossession at each node of gateway server. This facilitates to reduce response time variance in existence of bursty traffic. The most widespread contemplation is performance, because gateway servers must offer costeffective and high-availability services in the elongated period, thus they have to be scaled to meet the expected load. performance measurements can be the base for performance modeling and prediction. With the help of performance models, the performance metrics (like buffer estimation, waiting time) can be determined at the development process, so that there is lossless information retrieval of data at every node of internet gateway servers. The paper portrays the assessment of buffer size using G/G/1 queuing model to estimate the final value of the memory size and then examine its implementation at the gateway servers. The obtained output is based on the simulation and experimental studies using synthesized workloads and analysis of real-world gateway servers demonstrate the effectiveness of the proposed system.

View PDFchevron_right
Using Priority, Buffering, Threshold Control, and Reservation Techniques to Improve Channel-Allocation Schemes for the GPRS System
Huei-Wen Ferng

IEEE Transactions on Vehicular Technology, 2005

Taking a comprehensive approach, we investigate effects on the channel allocation for the general packet radio service (GPRS) system caused by priority strategy, buffering, threshold control on the buffer, and channel reservation. Moreover, four new dynamic channel-allocation schemes based on various combinations of these techniques are proposed and analyzed using the Markov chain approach. Analytical results obtained include blocking/forced-termination/dropping probabilities, cost-function definition based on the above metrics, and (mean) delay times. Through numerical examples, we demonstrate that: 1) priority and threshold control are efficient strategies to differentiate the quality of service (QoS) between a new voice call and a handoff voice call; 2) buffering allows more admitted rates of voice calls or data packets, but increases the delay time; and 3) channel reservation may directly improve a specific service, but it degrades performance of other services much. At last, better schemes suitable for the GPRS system are suggested after a thorough comparison of system performance.

View PDFchevron_right
Design and Implementation of G / G / 1 Queuing Model Algorithm for its Applicability in Internet Gateway Server
Dr Riktesh Srivastava

2007

How to competently apportion system resource to process the client request by gateway servers is a tricky predicament. In this paper, we propose an enhanced proposal for autonomous recital of gateway servers under highly dynamic traffic loads. We have developed G/G/1 queuing model algorithm and premeditated its intricacy, so that there is lossless information repossession at each node of gateway server. This facilitates to reduce response time variance in existence of bursty traffic. The most widespread contemplation is performance, because gateway servers must offer costeffective and high-availability services in the elongated period, thus they have to be scaled to meet the expected load. performance measurements can be the base for performance modeling and prediction. With the help of performance models, the performance metrics (like buffer estimation, waiting time) can be determined at the development process, so that there is lossless information retrieval of data at every node ...

View PDFchevron_right
Performance Analysis of Call-Handling Processes in Buffered Cellular Wireless Networks
chesoong kim

Performance Analysis and Optimization of Multi-Traffic on Communication Networks, 2010

View PDFchevron_right
Understanding bufferbloat in cellular networks
Injong Rhee

Proceedings of the 2012 ACM SIGCOMM workshop on Cellular networks: operations, challenges, and future design, 2012

Bufferbloat is a prevalent problem in the Internet where excessive buffers incur long latency, substantial jitter and sub-optimal throughput. This work provides the first elaborative understanding of bufferbloat in cellular networks. We carry out extensive measurements in the 3G/4G networks of the four major U.S. carriers to gauge the impact of bufferbloat in the field. Due to the bufferbloat problem, several pitfalls of current TCP protocols have been proposed in this paper. We also discover a trick employed by smart phone vendors to mitigate the issue and point out the limitations of such ad-hoc solutions. Our measurement study is coupled with theoretical analysis using queuing models. Finally, we comprehensively discuss candidate solutions to this problem and argue for a TCP-based end-to-end solution.

View PDFchevron_right
Review on buffer management schemes for packet queues in wired & wireless network
pinky patel

Mobile AdHoc Network (MANET) is a wireless network with a set of mobile nodes that can communicate with each other with no access point and without any fixed infrastructure. But mobile devices usually have limited resources (battery power, memory, CPU) which limit their transmission range. Hence, in order to conserve the limited resource, it is highly desirable that transmission should be as efficient as possible. MANET can be implemented in any environment because of its dynamic nature. For routing of information packets queuing is done at the buffer and transferred through intermediate nodes to the destination on priority basis which help to improve the overall network performance. This paper provides a review of various buffer management schemes for packet queues in wired & wireless networks (specialy MANET).

View PDFchevron_right
Performance analysis of double buffer technique (DBT) model for mobility support in wireless IP networks
Matthew O. Adigun

Journal of Network and Computer Applications, 2006

Existing mobility support models in cellular communications misinterpret mobility loss in cellular networks as congestion loss, thus it degrades the performance by invoking unnecessary congestion control action. In this paper, we investigated the performance of Double Buffer Technique (DBT) model for mobility support in wireless IP networks. The DBT model uses the END message and the TQRS timer to maintain the packet sequence and decrease the load on the new foreign agent when the timer expires, respectively. Also, the protocol showed improved performance degradation caused by the handover of the mobile terminal. In order to demonstrate the superiority of our scheme over the existing ones, we used the following performance metrics: packet out-of-sequence, cell loss ratio, bandwidth overhead, and suitability for real-time services. The numerical results obtained revealed that the buffer size, the waiting time, and the packet loss probabilities in the model were suitable to the wireless IP environment.

View PDFchevron_right
Admission control and buffer management of wireless communication systems with mobile stations and integrated voice and data services
Orhan GEMIKONAKLI

Telecommunication Systems, 2016

This study presents models for management of voice and data traffic and new algorithms, which use call admission control as well as buffer management to optimise the performance of single channel systems such as wireless local area networks in the presence of mobile stations. Unlike existing studies, the new approach queues incoming voice packets as well as data packets, and uses a new preemption algorithm in order to keep the response time of voice requests at certain levels while the blocking of data requests is minimised. A new performance metric is introduced to provide uncorrelated handling of integrated services. Queueing related issues such as overall queue capacity, individual capacities for voice and data requests, the probability of blocking, and effects of waiting time on overall quality of service are considered in detail. Analytical models are presented and the results obtained from the analytical models were validated using discrete event simulations.

View PDFchevron_right
Analysis of a traffic model for GSM/GPRS
Hugo Alfredo

2001

A traffic model for GSM/GPRS, the hybrid radio resource allocation (HRRA) algorithm is evaluated. A dedicated number of GPRS channels plus idle periods between voice calls are used for GPRS data packet transfers. A simulator was developed in order to evaluate the HRRA algorithm, which provides a reasonable forecast on the voice blocking probability and on packet delay for a single cell system. Since the major issue is the correct resource allocation, results are shown for the influence of some choices and assumptions on the overall system performance.

View PDFchevron_right

References (29)

  1. Abdelhalim, M. B., Salama, A. E., & Habib, S. E. D. (2006). Hardware Software Partitioning using Particle Swarm Optimization Technique. In Proceed- ings of the 6th International Workshop on System on Chip for Real Time Applications, Cairo, Egypt (pp. 189-194). Washington, DC: IEEE Press.
  2. Abduljalil, F. M. A., & Bodhe, S. K. (2007).
  3. Forward-Based Handoff Mechanism In Cellular IP Access Networks. In Proceedings of the Austra- lian Conference on Wireless Broadband and Ultra Wideband Communications, AUSWireless. Retrieved from http://epress.lib.uts.edu.au/dspace/bitstream/ handle/2100/93/13_Abduljalil.pdf?sequence=1
  4. Anbar, M., & Vidyarthi, D. P. (2009). Buffer Manage- ment in Cellular IP Network using PSO. [IJMCMC].
  5. International Journal of Mobile Computing and Multimedia Communications, 1(3), 78-93.
  6. Anbar, M., & Vidyarthi, D. P. (2009). On Demand Bandwidth Reservation for Real-Time Traffic in Cellular IP Network using Particle Swarm Optimiza- tion. [IJBDCN]. International Journal of Business Data Communications and Networking, 5(3), 53-65.
  7. Chen, Y., & Lemin, L. (2005). A random early expira- tion detection based buffer management algorithm for real-time traffic over wireless networks. In Proceedings of the IEEE International Conference on Computer and Information Technology (CIT 2005), Shanghai, China (pp. 507-511). Washington, DC: IEEE Press.
  8. Hou, Y. T., Dapeng, W., Yao, J., & Takafumi, C. (2000). A core-stateless buffer management mechanism for differentiated services Internet. In Proceedings of the 25th Annual IEEE Conference on Local Computer Networks (LCN 2000), Tampa, FL (pp.168-176). Washington, DC: IEEE Press.
  9. Jain, L. C., Palade, V., & Srinivasan, D. (2007). Advances in Evolutionary Computing for System Design. Berlin: Springer Verlag.
  10. James, S., Hou, F., & Ho, P. H. (2007). An Applica- tion-Driven MAC-layer Buffer Management with Active Dropping for Real-time Video Streaming in 802.16 Networks. In Proceedings of the IEEE International Conference on Advanced Information Networking and Applications (AINA '07), Niagara Falls, ON (pp. 451-458). Washington, DC: IEEE Press. Jardosh, S., Zunnun, N., Ranjan, P., & Srivastava, S. (2008). Effect of network coding on buffer manage- ment in wireless sensor network. In Proceedings of the International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISS- NIP 2008), Sydney, NSW, Australia (pp. 157-162). Washington, DC: IEEE Press.
  11. Khanbary, L. M. O., & Vidyarthi, D. P. (2008). A GA-based effective fault-tolerant model for channel allocation in mobile computing. IEEE Transac- tions on Vehicular Technology, 57(3), 1823-1833. doi:10.1109/TVT.2007.907311
  12. Krachodnok, P., & Bemjapolakul, W. (2001). Buffer management for TCP over GFR service in an ATM network. In Proceedings of the Ninth IEEE Inter- national Conference on Networks (pp. 302 -307). Washington, DC: IEEE Press.
  13. Krifa, A., Baraka, C., & Spyropoulos, T. (2008). Optimal Buffer Management Policies for Delay Tolerant Networks. In Proceedings of the 5th An- nual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON '08), San Francisco (pp. 260-268). Washington, DC: IEEE Press.
  14. Lim, H. H., & Qiu, B. (2001). Predictive fuzzy logic buffer management for TCP/IP over ATM-UBR and ATM-ABR. In Proceedings of the IEEE Interna- tional Conference on Global Telecommunications (GLOBECOM '01), San Antonio, TX (Vol. 4, pp. 2326-2330). Washington, DC: IEEE Press.
  15. Markaki, M., & Venieris, I. S. (2000). A Novel Buffer Management Scheme for CBQ-based IP Routers in a Combined IntServ and DiffServ Architecture. In Proceedings of the 5 th IEEE Symposium on Computers and Communications, Antibes-Juan les Pins, France (pp. 347-352). Washington, DC: IEEE Press.
  16. Nedjah, N., & Mourelle, L. D. M. (2006). Swarm Intelligent Systems. Berlin: Springer Verlag. doi:10.1007/978-3-540-33869-7
  17. Noh, K. J., & Bae, C. S. (2007). A QoS RED Buf- fer Management Scheme of Intelligent Gateway Gadget based on a Wireless LAN. In Proceedings of the IEEE International Conference on Advanced Communication Technology (ICACT '07), Gangwon- Do, South Korea (Vol. 1, pp. 286-291). Washington, DC: IEEE Press.
  18. Pan, D., & Yang, Y. (2006). Buffer Management for Lossless Service in Network Processors. In Proceedings of the 14th IEEE Symposium on High- Performance interconnects, Stanford, CA (pp. 81- 86). Washington, DC: IEEE Press.
  19. Pant, M., Thangaraj, R., & Abraham, A. (2007). A New PSO Algorithm with Crossover Operator for Global Optimization Problems. Innovations in Hy- brid Intelligent Systems Advances in Soft Computing, 44, 215-222. doi:10.1007/978-3-540-74972-1_29
  20. Ryu, Y. S., & Koh, K. (1996). A dynamic buffer management technique for minimizing the neces- sary buffer space in a continuous media server. In Proceedings of the third IEEE International Confer- ence on Multimedia Computing and Systems (MMCS 1996), Hiroshima, Japan (pp. 181-185). Washington, DC: IEEE Press.
  21. Seo, J. H., Im, C. H., Heo, C. G., Kim, J. K., Jung, H. K., & Lee, C. G. (2006). Multimodal function optimization based on particle swarm optimization. IEEE Transactions on Magnetics, 42(4), 1095-1098. doi:10.1109/TMAG.2006.871568
  22. Shimonishi, H. Sanadidi, & Gerla, M. (2005). Im- proving Efficiency-Friendliness Tradeoffs of TCP: Robustness to Router Buffer Capacity Variations. In Proceedings of IEEE Global Telecommunications Conference, St. Louis, MO (pp. 5-10).
  23. Soudan, B., & Saad, M. (2008). An Evolutionary Dynamic Population Size PSO Implementation. In Proceedings of the 3rd International Conference on Information & Communication Technologies: from Theory to Applications (ICTTA'08), Damascus, Syria (pp. 1-5). Washington, DC: IEEE Press.
  24. Valkó, A. G., Gomez, J., Kim, S., & Compabell, A. T. (1999). On the Analysis of Cellular IP Access Net- works. In Proceedings of the IFIP Sixth International Workshop on Protocols for High Speed Networks VI, Salem, MA (pp. 205-224).
  25. Yerima, S. Y., & Al-Begain, K. (2007). Buffer Man- agement for Multimedia QoS Control over HSDPA Downlink. In Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW '07), Niagara Falls, ON (Vol. 1, pp. 912-917). Washington, DC: IEEE Press.
  26. Ying, T., Ya-Ping, Y., & Jian-Chao, Z. (2006). An Enhanced Hybrid Quadratic Particle Swarm Opti- mization. In Proceedings of the Sixth International Conference on Intelligent Systems Design and Ap- plications (ISDA'06), Jinan, China (Vol. 2, pp. 980- 985). Washington, DC: IEEE Press.
  27. Yousefi'zadeh, H., & Jonckheere, E. A. (2005). Dynamic neural-based buffer management for queu- ing systems with self-similar characteristics. IEEE Transactions on Neural Networks, 16(5), 1163-1173. doi:10.1109/TNN.2005.853417
  28. Mohammad Anbar received his B.Tech in Electronics Engineering from Tishreen University, Lattakia, Syria, in the year 2003, and M.Tech in Computer Science from Jawaharlal Nehru University, New Delhi, India in the year 2007. Currently, Mohammad Anbar is Ph.D student at the school of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India. His research interest includes Wireless Communication, Mobile Computing, Particle Swarm Optimization, and Genetic Algorithms.
  29. Deo Prakash Vidyarthi received master's degree in computer application from MMM Engineering College and Ph.D in Computer Science from Jabalpur University ( work done at Banaras Hindu University, Varanasi). Taught UG and PG students in the Department of Computer Science of Banaras Hindu University, Varanasi for more than 12 years. Joined JNU in 2004 and currently working as associate professor in the school of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi. Dr. Vidyarthi is member of IEEE, International Society of Research in Science and Technology (ISRST), USA and senior member of the International Association of Computer Science and Information Technology (IACSIT), Singapore. His research interest includes Parallel and Distributed Systems, Grid Computing, Mobile Computing.

Related papers

Buffer Management in Cellular IP Networks using Evolutionary Algorithms
Mohammad Anbar

International Journal of Applied Evolutionary Computation, 2010

Real-time traffic in Cellular IP network is considered to be important and therefore given priority over non-real-time. Buffer is an important but scarce resource and to optimize Quality of Service by managing buffers of the network is an important and complex problem. Evolutionary Algorithms are quite useful in solving such complex optimization problems, and in this regard, a two-tier model for buffer, Gateway and Base Station, management in Cellular IP network has been proposed. The first tier applies a prioritization algorithm for prioritizing real-time packets in the buffer of the gateway with a specified threshold. Packets which couldn't be served, after the threshold, is given to the nearest cells of the network to be dealt with in the second tier, while Evolutionary Algorithm (EA) based procedures are applied in order to optimally store these packets in the buffer of the base stations. Experiments have been conducted to observe the performance of the proposed models and a comparative study of the models, GA based and PSO based, has been carried out to depict the advantage and disadvantage of the proposed models.

View PDFchevron_right
A unified approach to analyzing models of cellular communication networks with data call buffering
Agassi Melikov

Automation and Remote Control, 2014

A unified approach to the analysis of models of cellular communication networks with queues of data calls was developed. Consideration was given to the models with two types of strategies for admission to the cell channels and the buffer. In one strategy, admission to the voice call channels is based on reservation of channels for handover of calls of the given type, and in the other strategy, on the scheme of truncating the calls of the given type. In both models, the strategy of buffer admission by the data calls relies on the scheme of place reservation for handover of the calls of the given type. The models with finite and infinite data call queues were studied. For different admission strategies, algorithms to calculate the servicing performance indices were given, and the results of their comparative analysis were presented.

View PDFchevron_right
Buffer Management in Cellular IP Network using PSO
Mohammad Anbar

International Journal of Mobile Computing and Multimedia Communications, 2009

Cellular IP networks deal with the concepts of micro-mobility. Buffer management in Cellular IP networks is very crucial as its proper usage not only increases the throughput of the network but also results in the reduction of the call drops. This article proposes a model for buffer management in Cellular IP network using Particle Swarm Optimization (PSO), an evolutionary computational method often used to solve hard problems. The model considers two kinds of buffers; Gateway buffer and Base Station buffer. In the proposed two-tier model, the first tier applies a prioritization algorithm for prioritizing real-time packets in the buffer. In the second tier PSO algorithm is used on a swarm of cells in the network. PSO is applied for a given time slot, called window. In each window period the swarm can store number of packets depending on the window size and the total number of packets. The effect of various parameters e.g. number of packets, size of packets, window size, and a thresho...

View PDFchevron_right
Impact of TCP congestion control on bufferbloat in cellular networks
G. Del Giudice, Stefan Alfredsson, Anna Brunstrom

2013 IEEE 14th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM), 2013

The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. One important network scenario where bufferbloat may occur is cellular networks. This paper investigates the interaction between TCP congestion control and buffering in cellular networks. Extensive measurements have been performed in commercial 3G, 3.5G and 4G cellular networks, with a mix of long and short TCP flows using the CUBIC, NewReno and Westwood+ congestion control algorithms. The results show that the completion times of short flows increase significantly when concurrent long flow traffic is introduced. This is caused by increased buffer occupancy from the long flows. In addition, for 3G and 3.5G the completion times are shown to depend significantly on the congestion control algorithms used for the background flows, with CUBIC leading to significantly larger completion times.

View PDFchevron_right
Router CPU Time Management in Cellular IP Networks using GA
Mohammad Anbar

International Journal of Computer Applications, 2010

Providing good QoS in Cellular IP networks is one of the important issues in order to improve the performance of the Cellular IP network. Resource reservation is one of the methods used in achieving this goal and is proven to be effective. Resources of Cellular IP network that can be reserved are bandwidth, buffer and CPU cycles. Router CPU cycle is the time taken to process a packet before forwarding it to the next router (hop). This paper is proposing a model for CPU cycle optimization of routers for real-time flows in Cellular IP network. The model applies Genetic Algorithm as a soft computing tool to optimize the CPU cycles and reduces the flow processing time at each router in the route taken by a flow. Simulation experiments show the efficacy of the model.

View PDFchevron_right

Related topics

  • Computer Science
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved