Comparative Analysis of Location Management Schemes in Wireless ATM Networks

Mobility is the cornerstone of wireless networks. Supporting mobility requires some form of tracking to locate mobile terminals within the network. In the wireline ATM network, the terminal is fixed and the terminal is located by identifying the terminal and following the routing information provided at each switch along the path. As terminals become mobile, the path to the mobile becomes dynamic; the terminal and the path are no longer synonymous. Signalling traffic incurred in tracking mobile users and delivering enhanced services causes an additional load in the Wireless ATM (WArM) network. Efficient database and location management schemes are needed to meet the challenges from high density and mobility of users, and various service scenarios. In this thesis the three "natural" Location Management Strategies, i.e., Timer-Based, Location Area Based and Movement Based are studied and analysed for a W ATM network. The model used for depicting user motion and call arrival is Brownian motion with drift process and Poisson arrival process, respectively. The Timer-Based location management strategy is one in which the user updates its location periodically after an "optimum" interval of time. This optimum interval of time is based upon the user's mobility and call arrival characteristics and is therefore best suited for that particular mobile. In the Adaptive Location Area Based strategy, the user updates its location on each LA boundary crossing. The size of the LA changes according to the user' s mobility characteristics. The objective is to minimise the combined average signalling cost of both paging and registration for each individual mobile user such that the overall system-wide signalling cost for location tracking can be minimised

Industry/University Collaboration at the University of Michigan-Dearborn: A Focus on Relevant Technology

https://deepblue.lib.umich.edu/bitstream/2027.42/154106/1/kampfner1998.pd

Ontwerp en evaluatie van content distributie netwerken voor multimediale streaming diensten.

Traditionele Internetgebaseerde diensten voor het verspreiden van bestanden, zoals Web browsen en het versturen van e-mails, worden aangeboden via één centrale server. Meer recente netwerkdiensten zoals interactieve digitale televisie of video-op-aanvraag vereisen echter hoge kwaliteitsgaranties (QoS), zoals een lage en constante netwerkvertraging, en verbruiken een aanzienlijke hoeveelheid bandbreedte op het netwerk. Architecturen met één centrale server kunnen deze garanties moeilijk bieden en voldoen daarom niet meer aan de hoge eisen van de volgende generatie multimediatoepassingen. In dit onderzoek worden daarom nieuwe netwerkarchitecturen bestudeerd, die een dergelijke dienstkwaliteit kunnen ondersteunen. Zowel peer-to-peer mechanismes, zoals bij het uitwisselen van muziekbestanden tussen eindgebruikers, als servergebaseerde oplossingen, zoals gedistribueerde caches en content distributie netwerken (CDN's), komen aan bod. Afhankelijk van de bestudeerde dienst en de gebruikte netwerktechnologieën en -architectuur, worden gecentraliseerde algoritmen voor netwerkontwerp voorgesteld. Deze algoritmen optimaliseren de plaatsing van de servers of netwerkcaches en bepalen de nodige capaciteit van de servers en netwerklinks. De dynamische plaatsing van de aangeboden bestanden in de verschillende netwerkelementen wordt aangepast aan de heersende staat van het netwerk en aan de variërende aanvraagpatronen van de eindgebruikers. Serverselectie, herroutering van aanvragen en het verspreiden van de belasting over het hele netwerk komen hierbij ook aan bod

Mobile agent based distributed network management : modeling, methodologies and applications

The explosive growth of the Internet and the continued dramatic increase for all wireless services are fueling the demand for increased capacity, data rates, support of multimedia services, and support for different Quality of Services (QoS) requirements for different classes of services. Furthermore future communication networks will be strongly characterized by heterogeneity. In order to meet the objectives of instant adaptability to the users\u27 requirements and of interoperability and seamless operation within the heterogeneous networking environments, flexibility in terms of network and resource management will be a key design issue. The new emerging technology of mobile agent (MA) has arisen in the distributed programming field as a potential flexible way of managing resources of a distributed system, and is a challenging opportunity for delivering more flexible services and dealing with network programmability. This dissertation mainly focuses on: a) the design of models that provide a generic framework for the evaluation and analysis of the performance and tradeoffs of the mobile agent management paradigm; b) the development of MA based resource and network management applications. First, in order to demonstrate the use and benefits of the mobile agent based management paradigm in the network and resource management process, a commercial application of a multioperator network is introduced, and the use of agents to provide the underlying framework and structure for its implementation and deployment is investigated. Then, a general analytical model and framework for the evaluation of various network management paradigms is introduced and discussed. It is also illustrated how the developed analytical framework can be used to quantitatively evaluate the performances and tradeoffs in the various computing paradigms. Furthermore, the design tradeoffs for choosing the MA based management paradigm to develop a flexible resource management scheme in wireless networks is discussed and evaluated. The integration of an advanced bandwidth reservation mechanism with a bandwidth reconfiguration based call admission control strategy is also proposed. A framework based on the technology of mobile agents, is introduced for the efficient implementation of the proposed integrated resource and QoS management, while the achievable performance of the overall proposed management scheme is evaluated via modeling and simulation. Finally the use of a distributed cooperative scheme among the mobile agents that can be applied in the future wireless networks is proposed and demonstrated, to improve the energy consumption for the routine management processes of mobile terminals, by adopting the peer-to-peer communication concept of wireless ad-hoc networks. The performance evaluation process and the corresponding numerical results demonstrate the significant system energy savings, while several design issues and tradeoffs of the proposed scheme, such as the fairness of the mobile agents involved in the management activity, are discussed and evaluated

Satellite Networks: Architectures, Applications, and Technologies

Since global satellite networks are moving to the forefront in enhancing the national and global information infrastructures due to communication satellites' unique networking characteristics, a workshop was organized to assess the progress made to date and chart the future. This workshop provided the forum to assess the current state-of-the-art, identify key issues, and highlight the emerging trends in the next-generation architectures, data protocol development, communication interoperability, and applications. Presentations on overview, state-of-the-art in research, development, deployment and applications and future trends on satellite networks are assembled

Quality-of-service management in IP networks

Quality of Service (QoS) in Internet Protocol (IF) Networks has been the subject of active research over the past two decades. Integrated Services (IntServ) and Differentiated Services (DiffServ) QoS architectures have emerged as proposed standards for resource allocation in IF Networks. These two QoS architectures support the need for multiple traffic queuing systems to allow for resource partitioning for heterogeneous applications making use of the networks. There have been a number of specifications or proposals for the number of traffic queuing classes (Class of Service (CoS)) that will support integrated services in IF Networks, but none has provided verification in the form of analytical or empirical investigation to prove that its specification or proposal will be optimum. Despite the existence of the two standard QoS architectures and the large volume of research work that has been carried out on IF QoS, its deployment still remains elusive in the Internet. This is not unconnected with the complexities associated with some aspects of the standard QoS architectures. [Continues.

Application of learning algorithms to traffic management in integrated services networks.

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN027131 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Location prediction based on a sector snapshot for location-based services

In location-based services (LBSs), the service is provided based on the users' locations through location determination and mobility realization. Most of the current location prediction research is focused on generalized location models, where the geographic extent is divided into regular-shaped cells. These models are not suitable for certain LBSs where the objectives are to compute and present on-road services. Such techniques are the new Markov-based mobility prediction (NMMP) and prediction location model (PLM) that deal with inner cell structure and different levels of prediction, respectively. The NMMP and PLM techniques suffer from complex computation, accuracy rate regression, and insufficient accuracy. In this paper, a novel cell splitting algorithm is proposed. Also, a new prediction technique is introduced. The cell splitting is universal so it can be applied to all types of cells. Meanwhile, this algorithm is implemented to the Micro cell in parallel with the new prediction technique. The prediction technique, compared with two classic prediction techniques and the experimental results, show the effectiveness and robustness of the new splitting algorithm and prediction technique

Dynamic bandwidth allocation in multi-class IP networks using utility functions.

PhDAbstact not availableFujitsu Telecommunications Europe Lt

A framework for traffic flow survivability in wireless networks prone to multiple failures and attacks

Transmitting packets over a wireless network has always been challenging due to failures that have always occurred as a result of many types of wireless connectivity issues. These failures have caused significant outages, and the delayed discovery and diagnostic testing of these failures have exacerbated their impact on servicing, economic damage, and social elements such as technological trust. There has been research on wireless network failures, but little on multiple failures such as node-node, node-link, and link–link failures. The problem of capacity efficiency and fast recovery from multiple failures has also not received attention. This research develops a capacity efficient evolutionary swarm survivability framework, which encompasses enhanced genetic algorithm (EGA) and ant colony system (ACS) survivability models to swiftly resolve node-node, node-link, and link-link failures for improved service quality. The capacity efficient models were tested on such failures at different locations on both small and large wireless networks. The proposed models were able to generate optimal alternative paths, the bandwidth required for fast rerouting, minimized transmission delay, and ensured the rerouting path fitness and good transmission time for rerouting voice, video and multimedia messages. Increasing multiple link failures reveal that as failure increases, the bandwidth used for rerouting and transmission time also increases. This implies that, failure increases bandwidth usage which leads to transmission delay, which in turn slows down message rerouting. The suggested framework performs better than the popular Dijkstra algorithm, proactive, adaptive and reactive models, in terms of throughput, packet delivery ratio (PDR), speed of transmission, transmission delay and running time. According to the simulation results, the capacity efficient ACS has a PDR of 0.89, the Dijkstra model has a PDR of 0.86, the reactive model has a PDR of 0.83, the proactive model has a PDR of 0.83, and the adaptive model has a PDR of 0.81. Another performance evaluation was performed to compare the proposed model's running time to that of other evaluated routing models. The capacity efficient ACS model has a running time of 169.89ms on average, while the adaptive model has a running time of 1837ms and Dijkstra has a running time of 280.62ms. With these results, capacity efficient ACS outperforms other evaluated routing algorithms in terms of PDR and running time. According to the mean throughput determined to evaluate the performance of the following routing algorithms: capacity efficient EGA has a mean throughput of 621.6, Dijkstra has a mean throughput of 619.3, proactive (DSDV) has a mean throughput of 555.9, and reactive (AODV) has a mean throughput of 501.0. Since Dijkstra is more similar to proposed models in terms of performance, capacity efficient EGA was compared to Dijkstra as follows: Dijkstra has a running time of 3.8908ms and EGA has a running time of 3.6968ms. In terms of running time and mean throughput, the capacity efficient EGA also outperforms the other evaluated routing algorithms. The generated alternative paths from these investigations demonstrate that the proposed framework works well in preventing the problem of data loss in transit and ameliorating congestion issue resulting from multiple failures and server overload which manifests when the process hangs. The optimal solution paths will in turn improve business activities through quality data communications for wireless service providers.School of ComputingPh. D. (Computer Science