Distributed bandwidth reservation by probing for available bandwidth

2004 ◽  
Author(s):  
S. Krasser ◽  
H.L. Owen ◽  
J. Grimminger ◽  
H. Huth ◽  
J. Sokol
Keyword(s):  
Bandwidth Reservation ◽  
Available Bandwidth

On Demand Bandwidth Reservation for Real-Time Traffic in Cellular IP Network using Particle Swarm Optimization

2011 ◽  
pp. 215-228 ◽  
Author(s):  
Mohammad Anbar ◽  
D.P. Vidyarthi
Keyword(s):  
Particle Swarm Optimization ◽  
Real Time ◽  
Particle Swarm ◽  
Bandwidth Reservation ◽  
Swarm Optimization ◽  
Available Bandwidth ◽  
On Demand ◽  
Real Time Traffic ◽  
Ip Network ◽  
Cellular Ip

Cellular IP network deals with micro mobility of the mobile devices. An important challenge in wireless communication, especially in cellular IP based network, is to provide good Quality of Service (QoS) to the users in general and to the real-time users (users involved in the exchange of real-time packets) in particular. Reserving bandwidth for real time traffic to minimize the connection drop (an important parameter) is an activity often used in Cellular IP network. Particle Swarm Optimization (PSO) algorithm simulates the social behavior of a swarm or flock to optimize some characteristic parameter. PSO is effectively used to solve many hard optimization problems. The work, in this paper, proposes an on demand bandwidth reservation scheme to improve Connection Dropping Probability (CDP) in cellular IP network by employing PSO. The swarm, in the model, consists of the available bandwidth in the seven cells of the cellular IP network. The anytime bandwidth demand for real-time users is satisfied by the available bandwidth of the swarm. The algorithm, used in the model, searches for the availability of the bandwidth and reserves it in the central cell of the swarm. Eventually, it will allocate it on demand to the cell that requires it. Simulation experiments reveal the efficacy of the model.

scholarly journals Call Blocking Probabilities under a Probabilistic Bandwidth Reservation Policy in Mobile Hotspots

Telecom ◽  
2021 ◽  
Vol 2 (4) ◽  
pp. 554-573
Author(s):  
Irene P. Keramidi ◽  
Ioannis D. Moscholios ◽  
Panagiotis G. Sarigiannidis
Keyword(s):  
Iterative Algorithms ◽  
Access Point ◽  
Arrival Process ◽  
It Services ◽  
Bandwidth Reservation ◽  
Call Blocking ◽  
Loss Model ◽  
Available Bandwidth ◽  
Blocking Probabilities ◽  
Call Blocking Probabilities

In this paper we study a mobility-aware call admission control algorithm in a mobile hotspot. To this end, a vehicle is considered which has an access point with a fixed capacity. The vehicle alternates between stop and moving phases. When the vehicle is in the stop phase, it services new and handover calls by prioritizing them via a probabilistic bandwidth reservation (BR) policy. Based on this policy, new handover calls may enter the reservation space with a predefined probability. When the vehicle is in the moving phase, it services new calls only. In that phase, two different policies are considered: (a) the classical complete sharing (CS) policy, where new calls are accepted in the system whenever there exists available bandwidth, and (b) the probabilistic BR policy. Depending on the selected policy in the moving phase, we propose the probabilistic BR loss model (if the CS policy is selected) and the generalized probabilistic BR loss model (if the probabilistic BR policy is selected). In both stop and moving phases, where the call arrival process is Poisson, calls require a single bandwidth unit in order to be accepted in the system, while the service time is exponentially distributed. To analytically determine call blocking probabilities and the system’s utilization, we propose efficient iterative algorithms based on two-dimensional Markov chains. The accuracy of the proposed algorithms is verified via simulation.

Network Selection in Wireless Heterogeneous Environment Based on Available Bandwidth Estimation

2019 ◽  
Vol 12 ◽  
Author(s):  
Kiran Ahuja ◽  
Brahmjit Singh ◽  
Rajesh Khanna
Keyword(s):  
Real Time ◽  
Estimation Error ◽  
Network Selection ◽  
Bandwidth Estimation ◽  
Heterogeneous Environment ◽  
Bootstrap Approximation ◽  
Available Bandwidth ◽  
Internet Connection ◽  
Available Bandwidth Estimation ◽  
Selection Of

Background: With the availability of multiple options in wireless network simultaneously, Always Best Connected (ABC) requires dynamic selection of the best network and access technologies. Objective: In this paper, a novel dynamic access network selection algorithm based on the real time is proposed. The available bandwidth (ABW) of each network is required to be estimated to solve the network selection problem. Method: Proposed algorithm estimates available bandwidth by taking averages, peaks, low points and bootstrap approximation for network selection. It monitors real-time internet connection and resolves the selection issue in internet connection. The proposed algorithm is capable of adapting to prevailing network conditions in heterogeneous environment of 2G, 3G and WLAN networks without user intervention. It is implemented in temporal and spatial domains to check its robustness. Estimation error, overhead, estimation time with the varying size of traffic and reliability are used as the performance metrics. Results: Through numerical results, it is shown that the proposed algorithm’s ABW estimation based on bootstrap approximation gives improved performance in terms of estimation error (less than 20%), overhead (varies from 0.03% to 83%) and reliability (approx. 99%) with respect to existing techniques. Conclusion: Our proposed methodology of network selection criterion estimates the available bandwidth by taking averages, peaks, and low points and bootstrap approximation method (standard deviation) for the selection of network in the wireless heterogeneous environment. It monitors real-time internet connection and resolves internet connections selection issue. All the real-time usage and test results demonstrate the productivity and adequacy of available bandwidth estimation with bootstrap approximation as a practical solution for consistent correspondence among heterogeneous wireless networks by precise network selection for multimedia services.

A high performance scalable fuzzy based modified Asymmetric Heterogene Multiprocessor System on Chip (AHt-MPSOC) reconfigurable architecture

2021 ◽  
pp. 1-12
Author(s):  
Arun Prasath Raveendran ◽  
Jafar A. Alzubi ◽  
Ramesh Sekaran ◽  
Manikandan Ramachandran
Keyword(s):  
High Performance ◽  
Standard Technique ◽  
System On Chip ◽  
Mixed Integer ◽  
Multiprocessor System ◽  
Compound System ◽  
Available Bandwidth ◽  
Mip Model ◽  
Fpga Chip ◽  
On Chip

This Ensuing generation of FPGA circuit tolerates the combination of lot of hard and soft cores as well as devoted accelerators on a chip. The Heterogene Multi-Processor System-on-Chip (Ht-MPSoC) architecture accomplishes the requirement of modern applications. A compound System on Chip (SoC) system designed for single FPGA chip, and that considered for the performance/power consumption ratio. In the existing method, a FPGA based Mixed Integer Programming (MIP) model used to define the Ht-MPSoC configuration by taking into consideration the sharing hardware accelerator between the cores. However, here, the sharing method differs from one processor to another based on FPGA architecture. Hence, high number of hardware resources on a single FPGA chip with low latency and power targeted. For this reason, a fuzzy based MIP and Graph theory based Traffic Estimator (GTE) are proposed system used to define New asymmetric multiprocessor heterogene framework on microprocessor (AHt-MPSoC) architecture. The bandwidths, energy consumption, wait and transmission range are better accomplished in this suggested technique than the standard technique and it is also implemented with a multi-task framework. The new Fuzzy control-based AHt-MPSoC analysis proves significant improvement of 14.7 percent in available bandwidth and 89.8 percent of energy minimized to various traffic scenarios as compared to conventional method.

Sign in / Sign up

Export Citation Format

Share Document