Sliding Window Algorithm for Mobile Communication Networks

Addresses a range of issues related to personal mobility in mobile communication networks

Explores how the sliding window algorithm can be used to improve the throughput of mobile switching centers in Global System for Mobile Communications (GSM) networks

Presents end-to-end network optimization aspects in GSM networks

Also discusses optimization in order to determine an optimal sliding window size and optimal number of channels

Autorentext

NUKA MALLIKHARJUNA RAOreceived his BSc degree in Computer Science from Andhra University, Visakhapatnam, Andhra Pradesh, India, and his MCA degree in Computer Applications and PhD in Computer Science and Engineering from Acharya Nagarjuna University, Guntur in 2005, 2008 and 2015, respectively. He is a life member of the Indian Society for Technical Education (ISTE) and a member of the IEEE, IACSIT and CSTA. He is presently working as a Professor of Computer Applications and Director of the Internal Quality Assurance Cell (IQAC) at the Annamacharya Institute of Technology and Sciences, Rajampet. He has more than 18 years of teaching experience and his current research interests include mobile computing, mobile networks, distributed networks and queuing theory.

MANNVA MUNIRATNAM NAIDU received his BE in Mechanical Engineering from Sri Venkateswara (SV) University, Tirupati and his Master's in Engineering and PhD from the Indian Institute of Technology Delhi (IIT Delhi), Delhi, India. He served as a convener and member of many committees on behalf of the All India Council for Technical Education (AICTE). He is a life member of the ISTE, ORSI, ISME, CSI, IEEE and ACM. He served as a Professor, Dean and as a Principal at the SV University College of Engineering, Tirupati. He also worked as a Professor at the Department of Computer Science and Engineering, Vignan University, Guntur, Andhra Pradesh. Currently he is working as the Dean of Computing at Vel Tech University, Avadi, Chennai, India. His research interests include data mining, computer networks, soft computing techniques and performance evaluation for algorithms.

Inhalt

Chapter 1. Introduction.- Chapter 2. Sliding Window Algorithm.- Chapter 3. Performance Measurement of Sliding Window Algorithm.- Chapter 4. Method for Determining Optimal Sliding Window Size.- Chapter 5. Integrating Sliding Window Algorithm with a Single Server Finite Queuing Model.- Chapter 6. Integrating Sliding Window Algorithm with a Multiple Server Finite Queuing Model.- Chapter 7. Method for Determining Optimal Number of Channels.