Abstract Voice over IP (VoIP) uses the Internet Protocol (IP) to transmit voice as packets over an IP network, like the Internet, Intranets and Local Area Networks (LAN). Here the voice signal is digitized, compressed and converted to IP packets and then transmitted over the IP network. However, at the receiving end, some packets may be missed in its way due to network congestion. This packets loss degrades the quality of speech at the receiving end of a voice transmission system in the IP network. Since the voice transmission is a real time process, the receiver cannot request for retransmission of the missing packets. High speed networks provide real time variable bit rate service with packet loss requirements. The burstiness of the correlated traffic makes dynamic buffer management highly desirable to satisfy the Quality of Service (QoS) requirements. This thesis presents an algorithm to improve and optimize the Adaptive Buffer Allocation Scheme to deal with input traffic based on loss of consecutive packets in data streams and buffer occupancy levels. Buffer is designed to allow the input traffic to be partitioned into different priority classes, and based on the input traffic behavior it controls the threshold dynamically. This scheme allows input packets to enter into buffer if its occupancy level is less than the threshold value for priority of that packet. The threshold is dynamically varied in runtime based on packet loss behavior. The performance evaluation is carried out using simulation and is carried out for two and multiple priority classes of the input traffic "real time and non real time classes". The simulation results show that the Modified Adaptive Partial Buffer Sharing (ADPBS) has better performance than Adaptive Partial Buffer Sharing under the same traffic conditions.
اسماء احمد الكيش (2010)

Mobile terminals allow users to access services while on the move. This unique feature has driven the rapid growth in the mobile network industry, changing it from a new technology into a massive industry within less than two decades. In this thesis, we address admission control problems in a cellular wireless environment. The admission control is responsible for deciding whether an incoming call or connection can be accepted or not, which are based on the available codes . We provide an extensive survey of the existing admission control algorithms. The issues related to and the approaches for designing admission control in third generation(3G) cellular wireless networks are discussed. An admission control method considering the quality of service(QoS) requirements in wireless is presented along with an analytical traffic model for the Universal Mobile Telecommunication Systems(UMTS). In 3G networks we have dynamic capacity that depends on the interference levels in the covered area and the number of active users. This implies that the distance of a mobile user from the base station, which is called Node B, is also an important factor because of the signal fading. The first part of this work is an algorithm written in C++ programming language that distributes users in different zones assuming that the cell area is divided into Z virtual zones, where Z depends on the number of users. In the rest of this thesis we present a simulation model for the Universal Mobile Telecommunication Systems(UMTS). For validation purposes, we have developed a much more detailed simulation of the system written in C language. The results of the mathematical model showed that, a product form equilibrium distribution holds in the case of two cells. Theses results are used to validate a simulation, and to show that the behaviour of the system is similar to that in the mathematical model. Once the product form of Jackson’s Theorem is known to hold, then it is possible to go to a more advanced stage to analyze the 3G network, and to get the performance measures, which will help in making decisions at the design stage of a network. To be more realistic, we used traffic distributions in the simulator, where a user can generate world wide web sessions(www), file transfer sessions, and Emails. These followed recommendations in the ETSI standard and further demonstrated the feasibility of the model.
Wael Saleh Abughres(7-2008)

Abstract The number of mobile service users has been tremendously increased during the last few years, and the types of mobile services are developed from pure voice to data and multimedia services, such as audio/video streaming, e-mail, file transfer, and web browsing. These services have quite different requirements for their quality. 3G WCDMA cellular mobile networks answer this growing demand for these wireless data services. Then it needs to provide a huge capacity and wide area of coverage with acceptable quality of service. Capacity and coverage in WCDMA networks planning are the important issues because they are dependent of each other and related to the services data rate. In this thesis the capacity and coverage of mixed rate services are derived and analyzed. The uplink Capacity Coverage Product (CCP) of mixed rate services is developed by two methods, and three scenarios are assumed. The first method is the exact solution and the second method is the approximate solution. Math lap computer programs are used to get results and curves. Then some parameters affecting the mixed rate CCP are studied and a comparison between the two methods is also performed.The application of CCP in dimensioning and planning of a single service and mixed rate services WCDMA network is presented. A comparison with the conventional planning method is performed.
علي صالح منصور (2008)