Resource management policies in GPRS systems

In this paper we consider the problem of resource management in GSM/GPRS cellular networks offering not only mobile telephony services, but also data services for the wireless access to the Internet. In particular, we investigate channel allocation policies that can provide a good tradeoff between the QoS guaranteed to voice and data services end users, considering three different alternatives, and developing analytical techniques for the assessment of their relative merits. The first channel allocation policy, voice priority, gives priority to voice in the access to radio channels; we show that this policy cannot provide acceptable performance to data services, since when all the channels are busy with voice connections, data services perceive long intervals of service interruption. The second channel allocation policy is called R-reservation; it statically reserves a fixed number of channels to data services, thus drastically improving their performance, but subtracting resources from voice users, even when these are not needed for data, thus inducing an unnecessary performance degradation for voice services. The third channel allocation policy is called dynamic reservation; as the name implies, it dynamically allocates channels to data when necessary, using the information about the queue length of GPRS data units within the base station. A threshold on the queue length is used in order to decide when channels must be allocated to data. Numerical results show that the dynamic reservation channel allocation policy can provide effective performance tradeoffs for data and voice services, with the additional advantage of being easily managed through the setting of the threshold value.     

Resource management policies for real-time Java remote invocations

A way to deal with the increasing cost of next generation real-time applications is to extend middleware and high-level general-purpose programming languages, e.g. Java, with real-time support that reduces development, deployment, and maintenance costs. In the particular path towards a distributed real-time Java technology, some important steps have been given into centralized systems to produce real-time Java virtual machines. However, the integration with traditional remote invocation communication paradigms is far from producing an operative solution that may be used to develop final products. In this context, the paper studies how The Real-Time Specification for Java (RTSJ), the leading effort in real-time Java, may be integrated with Java’s Remote Method Invocation (RMI) in order to support real-time remote invocations. The article details a specific approach towards the problem of producing a predictable mechanism for the remote invocation–the core communication mechanism of RMI–via having control on the policies used in the remote invocation. Results obtained in a software prototype help understand how the key entities defined to control the performance of the remote invocation influence in the end-to-end response time of a distributed real-time Java application.     

基于随机几何的大规模MIMO中继异构网络性能分析

采用随机几何理论,对大规模多输入多输出MIMO中继异构蜂窝网络HetNets的频谱效率进行了研究。其中基站采用最大比结合/最大比传输以及迫零预处理方案和放大转发AF协议,宏小区被稠密的小小区所覆盖。为了得到目标小区总的频谱效率SE,首先计算了用户对的信干比SINR和功率放大因子表达式;其次获得了目标小区总的频谱效率的闭式解。研究发现,只有当小小区半径小于宏小区保护半径时,系统才能达到最优(或次优)的性能。而对于宏小区的保护半径则存在上界,即仅当满足此条件时,增大宏小区的保护半径才有助于提高系统的SE。此外,宏小区半径存在最优的下限,且仅当宏小区半径小于最优下限时,系统所实现的总的SE随着宏小区半径的增大而增大。     

Mobility management for m-commerce requests in wireless cellular networks

Increasing number of sophisticated services provided by the current wireless communication systems have caused a significant transition from E-commerce to M-commerce. Enterprises have provided considerable new opportunities to promote their businesses accessible from small mobile devices such as personal digital assistant (PDA) or mobiles phones. These facilities are envisioned as the most convenient way of using M-commerce. Using such services from mobile phones or PDAs equipped with GSM/GPRS involve effective mobility management mechanisms in cellular networks—a popular architecture for wireless networks. Success of such systems will largely depend on the reliable connection for the roaming users. Consequently, Quality of Service (QoS) provision is one of the most challenging issues in the heterogeneous wireless network-based m-commerce systems. Such m-commerce systems enable users to roam between different wireless networks operators and geographical areas while providing interactive broadband services and seamless connectivity. This paper presents an analytical framework to model scarce channels in any cell for maximizing channel utilization and efficient handling of handover requests. Typical numerical experiments are presented to validate the analytical solution against simulation to study the effect of bursty traffic upon the performance of the cell in any cellular networks.     

Call admission control policies in cellular wireless networks with spectrum renting

Radio spectrum is scarce and precious resource in wireless networks. To efficiently utilize radio spectrum, a wireless network can rent radio channels from another wireless network and returns back the rented channels when the rented channels are required to be withdrawn. The rental and withdrawal of radio channels result in two phenomena: (i) variable number of radio channels in a wireless network and (ii) call dropping due to the channel withdrawal. Call admission control aims to provide good quality-of-services for mobile users while efficiently utilize radio channels. Many call admission control policies in the previous literatures were studied without the two phenomena. In this paper, we study three call admission control policies, namely, fixed-reservation policy, single-threshold policy and multiple-threshold policy in a wireless network which rents channels from another wireless network. We develop numerical analyses to analyze and compare the performances of the three call admission control policies. Numerical results show that the multiple-threshold policy produces higher throughput than the single-threshold and fixed-reservation policies under the same constraint of quality-of-services.     

Evolving cellular automata for location management in mobile computing networks

Location management is a very important and complex problem in mobile computing. There is a need to develop algorithms that could capture this complexity yet can be easily implemented and used to solve a wide range of location management scenarios. The paper investigates the use of cellular automata (CA) combined with genetic algorithms to create an evolving parallel reporting cells planning algorithm. In the reporting cell location management scheme, some cells in the network are designated as reporting cells; mobile terminals update their positions (location update) upon entering one of these reporting cells. To create such an evolving CA system, cells in the network are mapped to cellular units of the CA and neighborhoods for the CA is selected. GA is then used to discover efficient CA transition rules. The effectiveness of the GA and of the discovered CA rules is shown for a number of test problems.     

Design and analysis of location management for 3G cellular networks

Location management is a key issue in personal communication service networks to guarantee the mobile terminals to continuously receive services when moving from one place to another. We study two location management schemes, a dynamic movement-based scheme (DYNAMIC-3G) and a static scheme (STATIC-3G), for 3G cellular networks where home location registers, gateway location registers (GLRs), and visitor location registers form a three-level hierarchical mobility database structure. For both schemes, the cost functions are formulated analytically. We prove that there is an optimal movement threshold that minimizes the total cost function of DYNAMIC-3G and propose a binary search algorithm to find the optimal threshold. Furthermore, we present performance evaluation and comparison of the proposed schemes with the previous schemes in 2G cellular networks where the GLR is not present. Our studies validate the optimality of the DYNAMIC-3G scheme and show that the proposed schemes outperform the previous schemes, especially when the remote-local-cost ratio is high. The comparison results between DYNAMIC-3G and STATIC-3G indicate that DYNAMIC-3G should be adopted when the mobility rate is low, and STATIC-3G should be adopted otherwise. Furthermore, DYNAMIC-3G tends to perform better than STATIC-3G when the paging cost is high or the number of cells in a location area is large.     

Resource management for multimedia applications,distributed in open and heterogeneous home networks

The home network is an open, heterogeneous and distributed environment with quality of service requirement. Existing resource reservation strategies modify devices and applications and do not consider heterogeneity.This paper presents a non-intrusive and adaptable resource management framework, developed upon an architecture customized for the actual devices. It uses global components, delegating to local components the management of local resources. These components rely on the resource reservation mechanisms provided by Linux.The framework has been implemented on real devices. The evaluations show that reservations are guaranteed even with noise on the resources, which also guarantees the expected quality of service.     

基于协作中继的高吞吐量机会网络路由算法

基于Barter机制的机会网络路由算法在数据分组交易过程中存在的僵局问题,导致网络吞吐量降低,为此,提出一种基于协作中继的路由算法(Routing Algorithm based on Cooperative Relays,RACR),在Barter机制中采用协作中继机制,引入多方交易激活数据分组的单向传递,同时优化分组删除的判定条件,对分组交易僵局问题加以有效解决,从而提高网络吞吐量,降低数据分组端到端时延。仿真结果表明,与现有的Barter路由算法和DT(Direct Transmission)路由算法相比,RACR路由算法的网络吞吐量提高了7.9%以上,分组平均端到端时延则至少降低了8.5%。     

Resource management in radio access and IP-based core networks for IMT Advanced and Beyond

The increased capacity needs, primarily driven by content distribution, and the vision of Internet-of-Things with billions of connected devices pose radically new demands on future wireless and mobile systems. In general the increased diversity and scale result in complex resource management and optimization problems in both radio access networks and the wired core network infrastructure. We summarize results in this area from a collaborative Sino-Swedish project within IMT Advanced and Beyond, covering adaptive radio resource management, energy-aware routing, OpenFlow-based network virtualization, data center networking, and access network caching for TV on demand.     

An efficient metric-based (EM-B) location management scheme for wireless cellular networks

In the current era, the wireless cellular network is gaining much attention in the network mobility for qualitative service. Towards enhancing the QoS and narrowing the dilemma of network management (location management) an efficient metric-based location management technique is introduced in this paper to capture the current location of mobile subscribers. The attributes of this technique are based on metrics calculation and location management message routing path determination. First, the current mobile switching center will calculate the shortest metric-based path between current and master (previous) location of mobile terminals (user), thereafter it performs the location management procedure through the optimal suggested path by the mobile switching center. This proposed technique will reduce the signaling cost, registration delay, call setup delay, network overheads and total location management cost. The proposed analytical model checks the scalability and effectiveness of proposed system over certain attributes and a comparison is made with the existing available techniques.     

Impact of CC-NUMA memory management policies on the applicationperformance of multistage switching networks

In this paper, the impact of memory management policies and switch design alternatives on the application performance of cache-coherent nonuniform memory access (CC-NUMA) multiprocessors is studied in detail. Memory management plays an important role in determining the performance of NUMA multiprocessors by dictating the placement of data among the distributed memory modules. We analyze memory traces of several scientific applications for three different memory management techniques, namely buddy, round-robin, and first-touch policies, and compare their memory system performance. Interconnection network switch designs that consider virtual channels and varying number of input buffers per switch are presented. Our performance evaluation is based on execution-driven simulation methodology to capture the dynamic changes in the network traffic during execution of the applications. It is shown that the use of cut-through switching with buffers and virtual channels can Improve the average message latency tremendously. However, the choice of memory management policy affects the amount of network traffic and the network access pattern. Thus, we vary the memory management policy and confirm the performance benefits of improved switch designs. Results of sensitivity studies by varying switch design parameters, cache block size, and memory page size are also presented. We find that a combination of first-touch memory management policy and a switch design with virtual channels and increased buffer space can reduce the average message latency by as high as 70 percent     

An interactive QoS framework for fixed WiMAX networks

The IEEE 802.16 standard defines several scheduling classes at MAC layer for preferential treatment of service flows depending on QoS requirements specific to a service flow. In this paper, a new framework has been proposed to solve and address QoS issues for fixed point to multipoint (PMP) 802.16 systems. The proposed framework consists of a uplink scheduler and Call Admission Control (CAC) module. The proposed CAC module interact with the uplink scheduler status and makes its decision based on the scheduler’s queues status. Extensive OPNET simulation demonstrates the effectiveness of the proposed framework.     

Resource allocation for multi-class services in multipath networks

In multipath networks, multiple paths are available for each pair of source and destination and can be used to carry data packets parallelly. It has been recognized that using multipath could promote the transmission reliability and fault tolerance, and improve the performance of increasingly bandwidth-hungry multi-media applications. In this paper we propose the resource allocation model for multi-class services in multipath networks with the objective of utility maximization, which is an intrinsically difficult problem of nonconvex optimization. We firstly analyze the model for only elastic services and obtain the optimal rate allocation for them. Then we also discuss the model for inelastic services with nonconcave (sigmoidal or discontinuous) utilities which share common links with elastic ones, and obtain some sufficient conditions under which the global optimum for both elastic and inelastic services can be obtained. For the nonconvex optimization problem, we present a heuristic algorithm using Particle Swarm Optimization (PSO), which can lead to improved solutions over existing approaches. Finally, some numerical examples are given to verify the results obtained.     

Packet transmission policies for battery operated wireless sensor networks

With the concept of “Cognitive Sense of China” and “Smart Planet” proposed, wireless sensor networking is considered to be one of the most important technologies of the new century. In wireless sensor networks, how to extend battery lifetime is a core problem. In this paper, we address the problem of designing battery-friendly packet transmission policies for wireless sensor networks. Our objective is to maximize the lifetime of batteries for wireless sensor nodes subject to certain delay constraints. We present three packet transmission schemes and evaluate them with respect to battery performance. The first scheme, based on combining multiple packets, utilizes battery charge recovery effect, which allows some charge to be recovered during long idle periods. The second scheme, based on a modified version of lazy packet scheduling, draws smoother and lower current and is battery efficient. The final scheme, based on a combination of the two previous schemes has superior battery performance at the expense of larger average packet delay. All three schemes are simulated for a wireless network framework with internet traffic, and the results were validated.     

Target-pursuing scheduling and routing policies for multiclass queueing networks

We propose a parametric class of myopic scheduling and routing policies for open and closed multiclass queueing networks. In open networks, they steer the state of the system toward a predetermined and fixed target, while, in closed networks they steer instantaneous throughputs toward a fixed target. In both cases, the proposed policies measure distance from the target using a weighted norm. In open networks, we establish that for an L2 norm the corresponding policies are stable. In closed networks, we establish that with proper target selection the corresponding policy is efficient, that is, attains bottleneck throughput in the infinite population limit. In both open and closed networks, the proposed policies are amenable to distributed implementation using local state information. We exploit the work in a previous paper to select appropriate parameter values and outline how optimal parameter values can be computed. We report numerical results indicating that we obtain near-optimal policies (when the optimal can be computed) and significantly outperform heuristic alternatives. This work has applications in a number of areas including optimizing the processing of information in sensor networks.     

Packet transmission policies for battery operated wireless sensor networks

With the concept of “Cognitive Sense of China” and “Smart Planet” proposed, wireless sensor networking is considered to be one of the most important technologies of the new century. In wireless sensor networks, how to extend battery lifetime is a core problem. In this paper, we address the problem of designing battery-friendly packet transmission policies for wireless sensor networks. Our objective is to maximize the lifetime of batteries for wireless sensor nodes subject to certain delay constraints. We present three packet transmission schemes and evaluate them with respect to battery performance. The first scheme, based on combining multiple packets, utilizes battery charge recovery effect, which allows some charge to be recovered during long idle periods. The second scheme, based on a modified version of lazy packet scheduling, draws smoother and lower current and is battery efficient. The final scheme, based on a combination of the two previous schemes has superior battery performance at the expense of larger average packet delay. All three schemes are simulated for a wireless network framework with internet traffic, and the results were validated.     

Resource finding in store-and-forward networks

We present a model of searching for a resource in a distributed system whose nodes are connected through a store-and-forward network. Based on this model, we show a lower bound on the number of messages needed to find a resource when nothing is known about the nodes that have the current location of the resource. The model also helps us to establish results about the time complexity of determining a message optimal resource finding algorithm when the probability distribution for the location of the resource in the network is known. We show that the optimization problem is NP-hard for general networks. Finally we show that optimal resource finding algorithms can be determined in polynomial time for a class of tree networks and bidirectional rings. The polynomial algorithms can be used as a basis of heuristic algorithms for general networks.This work was supported in part by NSF grants CCR-8806358 and NCR-8604850     

Resource allocation in peer-to-peer networks

Resource allocation in peer-to-peer networks — An excess-based economic model This paper describes economic aspects of GNUnet, a peer-to-peer framework for anonymous distributed file-sharing. GNUnet is decentralized; all nodes are equal peers. In particular, there are no trusted entities in the network. This paper describes an economic model to perform resource allocation and defend against malicious participants in this context. The approach presented does not use credentials or payments; rather, it is based on trust. The design is much like that of a cooperative game in which peers take the role of players. Nodes must cooperate to achieve individual goals. In such a scenario, it is important to be able to distinguish between nodes exhibiting friendly behavior and those exhibiting malicious behavior. GNUnet aims to provide anonymity for its users. Its design makes it hard to link a transaction to the node where it originated from. While anonymity requirements make a global view of the end-points of a transaction infeasible, the local link-to-link messages can be fully authenticated. Our economic model is based entirely on this local view of the network and takes only local decisions.