Home About us Contact
|
Home About us Contact | ||
|
|
||
Admission Control Mechanism (admission + control_mechanism)
Selected AbstractsAn integrated routing and admission control mechanism for real-time multicast connection establishmentINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 3 2001Xiaohua Jia Abstract There are two major difficulties in real-time multicast connection setup. One is the design of an efficient distributed routing algorithm which optimizes the network cost of routing trees under the real-time constraints. The other is the integration of routing with admission control into one single phase of operations. This paper presents a real-time multicast connection setup mechanism, which integrates multicast routing with real-time admission control. The proposed mechanism performs the real-time admission tests on a cost optimal tree (COT) and a shortest path tree (SPT) in parallel, aiming at optimizing network cost of the routing tree under real-time constraints. It has the following important features: (1) it is fully distributed; (2) it achieves sub-optimal network cost of routing trees; (3) it takes less time and less network messages for a connection setup. Copyright © 2001 John Wiley & Sons, Ltd. [source] A game-theoretic model for capacity-constrained fair bandwidth allocationINTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 6 2008Yonghe Yan Data stream providers face a hard decision to satisfy the requirements of their subscribers. Each user has a minimum and a maximum required bandwidth. The server should be able to decide which requests can be satisfied and how much bandwidth will be allocated to each. We present a theoretical framework in a distributed mechanism for fair bandwidth allocation on a network with various bottleneck links. In our model, a user is guaranteed a minimum bandwidth and charged a price for the bandwidth allocated. A utility function is defined over the allocated bandwidth for a specific maximum requested bandwidth. We then present a non-cooperative game with social welfare function to resolve users' conflicting bandwidth capacity requests at bottleneck links. We also show that our proposed game-theoretic solution guarantees fair bandwidth allocation as defined in our residual capacity fairness. In order to guarantee the minimum bandwidth requirement, we integrate an admission control mechanism in our solution. However, global optimal admission conditions are not easy to implement for large networks. Therefore, we propose a distributed admission scheme. As a result, the paper presents fair and practical distributed algorithms for bandwidth allocation and admission control in enterprise networks. Our simulation and evaluation study shows that the distributed approach is sufficiently close to the global optimal solution. Copyright © 2008 John Wiley & Sons, Ltd. [source] Virtual base stations for wireless mobile ad hoc communications: an infrastructure for the infrastructure-lessINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 8 2001Hossam Hassanein Abstract In this paper, we propose a new protocol for wireless mobile ad hoc networks, which establishes a dynamic wireless mobile infrastructure. The proposed protocol, namely, the virtual base stations (VBS) protocol, mimics and maintains the operation of the conventional fixed infrastructure in cellular networks. In the VBS protocol, a mobile node is elected from a set of nominees to act as a temporary base station within its zone. We provide proofs for the correctness of the VBS protocol, and show lower and upper bounds for its global convergence time. Likewise, we study the characteristics and performance of VBS by means of simulation. It is shown that VBS scales well to large networks of mobile stations, and that it outperforms other infrastructure-formation protocols in terms of stability. The VBS protocol would facilitate the development of a comprehensive and promising framework for quality of service (QoS) management in wireless mobile ad hoc networks once the proper integration of the MAC protocol with the routing and call admission control mechanisms is established. The VBS architecture lays the groundwork for assigning bandwidth, and/or implementing priorities, and hence for QoS-based routing by conveying the quality of a path prior to call setup. Copyright © 2001 John Wiley & Sons, Ltd. [source] Cross-layer design for call admission control of a high-capacity GEO satellite network with on-board cross-connectINTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING, Issue 6 2006Rose Qingyang Hu Abstract This paper addresses cross-layer design of end-to-end call admission control and beam-to-beam connectivity provisioning for a high-capacity multi-beam GEO satellite network with on-board cross-connectivity. On-board satellite switching is a technology designed to offer heterogeneous services, especially in demographically dispersed areas. Nevertheless, full on-board switching techniques are far from maturity. Their implementations have been proven expensive and difficult. There are also high risks involved in launching satellites for the stationary orbit surrounding the Earth. As a substitute, a satellite network with on-board cross-connect is devised in this paper. Connectivity provisioning and call admission control mechanisms associated with such a network are also presented. Simulation studies are conducted to show the effectiveness of the proposed mechanisms. Copyright © 2006 John Wiley & Sons, Ltd. [source] | ||||||||||