1,643 research outputs found
Multi-path Probabilistic Available Bandwidth Estimation through Bayesian Active Learning
Knowing the largest rate at which data can be sent on an end-to-end path such
that the egress rate is equal to the ingress rate with high probability can be
very practical when choosing transmission rates in video streaming or selecting
peers in peer-to-peer applications. We introduce probabilistic available
bandwidth, which is defined in terms of ingress rates and egress rates of
traffic on a path, rather than in terms of capacity and utilization of the
constituent links of the path like the standard available bandwidth metric. In
this paper, we describe a distributed algorithm, based on a probabilistic
graphical model and Bayesian active learning, for simultaneously estimating the
probabilistic available bandwidth of multiple paths through a network. Our
procedure exploits the fact that each packet train provides information not
only about the path it traverses, but also about any path that shares a link
with the monitored path. Simulations and PlanetLab experiments indicate that
this process can dramatically reduce the number of probes required to generate
accurate estimates
Control-Based Resource Management Procedures for Satellite Networks
This paper describes the resource management of a DVBRCS
geostationary satellite network. The functional modules
of the access layer aim at efficiently exploiting the link
resources while assuring the contracted Quality of Service
(QoS) to the traffic entering the satellite network. The main
novelty is the integration between the Connection Admission
Control and the Congestion Control procedures. Both them
exploit the estimation of the traffic load, performed by a
Kalman filter. The proposed solution has been analysed via
computer simulations, which confirmed their effectiveness
Large scale probabilistic available bandwidth estimation
The common utilization-based definition of available bandwidth and many of
the existing tools to estimate it suffer from several important weaknesses: i)
most tools report a point estimate of average available bandwidth over a
measurement interval and do not provide a confidence interval; ii) the commonly
adopted models used to relate the available bandwidth metric to the measured
data are invalid in almost all practical scenarios; iii) existing tools do not
scale well and are not suited to the task of multi-path estimation in
large-scale networks; iv) almost all tools use ad-hoc techniques to address
measurement noise; and v) tools do not provide enough flexibility in terms of
accuracy, overhead, latency and reliability to adapt to the requirements of
various applications. In this paper we propose a new definition for available
bandwidth and a novel framework that addresses these issues. We define
probabilistic available bandwidth (PAB) as the largest input rate at which we
can send a traffic flow along a path while achieving, with specified
probability, an output rate that is almost as large as the input rate. PAB is
expressed directly in terms of the measurable output rate and includes
adjustable parameters that allow the user to adapt to different application
requirements. Our probabilistic framework to estimate network-wide
probabilistic available bandwidth is based on packet trains, Bayesian
inference, factor graphs and active sampling. We deploy our tool on the
PlanetLab network and our results show that we can obtain accurate estimates
with a much smaller measurement overhead compared to existing approaches.Comment: Submitted to Computer Network
On-Line End-to-End Congestion Control
Congestion control in the current Internet is accomplished mainly by TCP/IP.
To understand the macroscopic network behavior that results from TCP/IP and
similar end-to-end protocols, one main analytic technique is to show that the
the protocol maximizes some global objective function of the network traffic.
Here we analyze a particular end-to-end, MIMD (multiplicative-increase,
multiplicative-decrease) protocol. We show that if all users of the network use
the protocol, and all connections last for at least logarithmically many
rounds, then the total weighted throughput (value of all packets received) is
near the maximum possible. Our analysis includes round-trip-times, and (in
contrast to most previous analyses) gives explicit convergence rates, allows
connections to start and stop, and allows capacities to change.Comment: Proceedings IEEE Symp. Foundations of Computer Science, 200
eChirp: Measuring Available Bandwidth for the Internet Using Multiple Chirp Packet Trains
Measuring available bandwidth over a network path in the Internet is a challenging research problem. In this thesis we have studied this problem and developed a new technique called "eChirp". First, the effectiveness of pathChirp [1] is studied in terms of model performance of chirp packet train structure, actual bandwidth, queuing delay and excursion segmentation. Then we remodeled the chirp train structure. The eChirp can measure the available bandwidth over a network path efficiently and accurately with heavy and light load links. To measure the available bandwidth, the packet probing rate configuration used in pathChirp technique is modified by changing its chirp train structure. The modified structure uses multiple chirp trains (three trains) that provides better probing rate configuration and ultimately gives better bandwidth measurement. Per-packet available bandwidth is calculated using weighted average of per-packet bandwidth of three trains. We also determined the bounds of probing rate parameter which was questionable in pathChirp and affects the available bandwidth measurement accuracy. The eChirp technique has been experimented with numerous network path topologies with low and high link loads with CBR cross-traffic conditions using NS-2 simulated network and results are compared with most recent pathChirp technique. Simulation results show that the proposed eChirp technique is better than pathChirp scheme in terms of estimating available bandwidth
Wireless measurement Scheme for bandwidth Estimation in Multihop Wireless Adhoc network
The necessity to bear real time and multimedia application for users of Mobile 1D468;1D485;1D489;1D490;1D484; Network (1D474;1D468;1D475;1D46C;1D47B;) is becoming vital. Mobile 1D468;1D485;1D489;1D490;1D484; network facilitates decentralized network that can present multimedia users with mobility that they have demanded, if proficient 1D478;1D490;1D47A; multicast strategies were developed. By giving the guarantee of 1D478;1D490;1D47A; in 1D468;1D485;1D489;1D490;1D484; network, the proficient bandwidth estimation method plays a very important role. The research paper represented here presents a splendid method for estimating or measuring Bandwidth in 1D468;1D485;1D489;1D490;1D484; network whose character is decentralized in nature. Contrasting in the centralized formation, the bandwidth estimating in 1D468;1D485;1D489;1D490;1D484; is significant and this eventually makes an influence over the 1D478;1D490;1D47A; of the network communication. The admission control and dynamic bandwidth management method which is presented here, facilitates it with fairness and rate guarantees despite the distributed link layer fair scheduling being absent. Alteration has been made over 1D474;1D468;1D46A; layer and this method is appropriate where the peer-to-peer (1D477;1D7D0;1D477;) multimedia transmissions rates are amended in compliantly fashion.In the research work presented here the architecture of the 1D474;1D468;1D46A; layer has been altered and the data handling capacity has been increased. This technique is adopted to facilitate higher data rate transmission and eliminate congestion over the considerednetwork. The proposed technique implements the splitting of 1D474;1D468;1D46A; into two sub layer where one will be responsible for control data transmission while other effectively transmits the data bits. Thus it results into higher data rate transmission with better accuracy and optimized network throughput. The research work in the presented paper exhibits superior accuracy and is very much effective in bandwidth estimation and management application in multi hop Mobile Ad-H
- …