II. BANDWIDTH MEASUREMENT MODELS AND TOOLS
|
|
|
- Gervase Richardson
- 10 years ago
- Views:
Transcription
1 FEAT: Improving Accuracy in End-to-end Available Bandwidth Measurement Qiang Wang and Liang Cheng Laboratory Of Networking Group (LONGLAB, Department of Computer Science and Engineering, Lehigh University, Bethlehem, PA Abstract This report describes our ongoing work on a new end-to-end available-bandwidth measurement tool: FEAT (Fish-Eye Availablebandwidth Tool). FEAT features a new dynamic pattern of probes called a Fisheye Stream. One fisheye stream covers a range of packet probing rates. A fisheye stream consists of a focus region, where the probing rates are sampled more frequently and the number of packets used at each rate is larger. This creates a fisheye effect that the focus region enables an easily identified turning point for accurate measurements. When the dynamic available bandwidth is outside the region, the surrounding regions enable the tool to automatically refocus. Fisheye streams offer several advantages over current probing schemes that are based on packet pairs, packet trains, or packet chirps. FEAT is also fast, nearly nonintrusive, and clock resolution insensitive. Experiments show that FEAT provides accurate estimations of the available bandwidth with low overhead compared to the existing techniques. Keyword available bandwidth, measurement, fisheye stream I I. INTRODUCTION n recent years, available bandwidth ( avi-bw for short) measurement techniques have received extensive attentions in the research community. Avi-bw measurement tools have been used in network-aware adaptive applications [3], admission control [2], route selection [1], TCP slow start [5], and TCP throughput [14] etc. Generally speaking, end-to-end available bandwidth is the unused capacity of a network path, and it is mathematically formulized in [15] etc. The avi-bw measurement requires a fast, accurate, and non-intrusive technique. These requirements raise many challenges in the decentralized Internet. End-to-end avi-bw measurement techniques usually use active probing packets from the network edge. Several active probing tools have been studied in recent years, including TOPP [12], pathload [7], IGI [6], pathchirp [15], spruce [16], netest [9], Pathmon [10], etc. This report describes our on-going work on a new end-to-end avi-bw tool: FEAT (Fish-Eye Avi-bw Tool). It has been studied in experiments to achieve accurate estimations of the available bandwidth comparing with other tools. FEAT also provides a fast measurement in seconds. Moreover, FEAT is nearly non-intrusive by carefully scheduling the fisheye streams. II. BANDWIDTH MEASUREMENT MODELS AND TOOLS Probe Gap Model (e.g. Spruce, IGI) and Probe Rate Model (e.g. Pathload, Pathchirp) have been studied for the avi-bw measurements [16]. FEAT is a tool based on the rate model. A. Rate Model The rate model (a.k.a, self-induced congestion) is based on the following heuristic argument: If the rate of a probing stream exceeds the avi-bw of the path from the sender to the receiver, a shortterm congestion happens at the tight link (i.e. the link with the smallest avi-bw). A queue builds up on the tight link with the interleaving of probe packets and cross traffic packets. 1) Metrics of OWD and relative OWD The self-induced congestion causes that the queuing delay and the OWD (one-way delay) increase when the congestion happens. The process of estimating the avi-bw is then transformed into identifying the turning point at which the OWD sees an increasing trend. Relative 1
2 OWD is also used as a metric by some tools. Pathload [7] uses a CBR (constant bit rate) probing stream and changes the rate in its successive rounds. Pathload adjusts the rate of the packet train based on the receiver s feedback. Pathload narrows the probing rate space using a binary search scheme. The final output after multiple rounds of a measurement is a value range that contains the available bandwidth. pathchirp [15] uses a VBR (varying bit rate) probing stream called a chirp. Packets in a chirp are exponentially spaced. Effectively, a chirp probes the network over a range of rates. If the OWD shows an increasing trend starting from a particular packet, the corresponding packet rate is used to estimate the avi-bw. In case of VBR cross traffic, pathchirp identifies excursions. It should be noticed that a chirp stream samples the sending rate with different frequency because packets are exponentially spaced. FEAT also uses VBR probing streams covering a range of probing rate. However, the pattern of a fisheye stream in FEAT is different. 2) Metrics of offered rate and measured rate Besides the OWD, several other metrics are used by different measurement tools. TOPP uses a metric of offered rate R 0 (packet sending rate) and a measured rate R m at the receiver (packet receiving rate). If R 0 >avi-bw, then R m <R 0. The turning point is the maximum offered rate such that R m R 0. 3) Metrics of cumulative sending gap and received gap Similar to the offered/measured rate metrics, if sending_rate>avi-bw, the inter-packet intervals increase at the receiver side. The relationship between the sending gap and the receiving gap is difficult to be identified due to measurement noises. Thus PathMon uses a cumulative interpacket gap, which is relatively easier to detect the divergence point of two gap curves. The accuracy of a tool highly depends on efficient filtering technologies. Through experiments and observations, FEAT uses the OWD as the metric since it does not need advanced filtering technologies to find the turning point. Moreover, FEAT uses a fisheye stream to make the turning point earlier to be identified and thus it improves the measurement accuracy. Our future work will study whether one metric is more robust than the others in the presence of measurement noises. B. Gap Model The gap model has several assumptions. (1) Cross traffic is of a fluid type. (2) The narrow link and the tight link are identical. (3) Packets must be queued together before being transmitted to the narrow link. (4) Accurate timing is needed to compute the packet gaps. Spruce sends out a pair of packets in each round. The intra-pair gap in Spruce is the transmission time of the first packet on the tight link (under the assumption #2). This enables the two packets to be queued together. When the gap model assumptions do not hold, Spruce is expected not performing well. IGI experimentally determines the initial packet-pair gap that gives a high correlation between the packet-gap changes and the cross traffic on the tight link. The turning point is where the average gap of a packet pair equals the average destination gap of the pair. III. FEAT: FISH-EYE AVAILABLE-BANDWIDTH TOOL A. Fisheye Stream Focus region Figure 1: A fisheye magnifier and a city map under the fisheye lens The fisheye-stream measurement can be analogized as a fish-eye magnifier, where objects in the middle are shown in great details while objects in the surroundings are visible but not in great details as shown in Fig. 1. The fisheye stream is based on observations that the smaller the sample intervals around the turning 2
3 point, the more accurately we can find the turning point. The larger the number of packets at the same rate around the turn point, the more quickly the queue will be built up. A fisheye stream consists of K packets of equal size that are sent at a changing rate from L (the lower bound) to U (the upper bound). Inside this range, there is an area called a focus region, where the avi-bw to be measured is most likely to be in this range. (We will explain how to refocus the region when the avi-bw is not inside the region). Around the center, packet instantaneous-rate sampling is more frequent. The number of packets at each sampling rate is larger. Outside the focus region, the rate sampling is less frequent; however, it still covers the range from L to U. A fisheye stream is difference from a CBR stream used by pathload and a chirp stream by pathchirp. Compared with the CBR stream, the fisheye stream covers a range of rates in one stream. Pathload has to send a sequence of streams in order to have a proper coverage from the lower-bound rate to the upper bound. The process of the binary search is time-consuming. Comparing to the chirp stream in pathchirp, the fisheye stream is similar in the sense that one stream covers a range of rates. However, the fisheye stream has two distinct features. First, the rate sampling method is different. A chirp stream samples the low rate more frequently than the high rate, and its probing-packet pattern is not adaptive to historical values of the avi-bw. For example, for a spread factor r=1.2, if a chirp uses 27 packets for a rate range from 1 Mbps to 120Mbps, the first 13 packet rates are all less than 10 Mbps, while the last 5 packet rates corresponds to the avi-bw from 55.2 Mbps to Mbps. In contrast, a fisheye stream has more sampling frequency around the center of its focus region. Second, the number of packets at each rate is different. The chirp stream uses one packet for each packet rate, while the fisheye stream uses more packets for rates within the focus region. The self-induced congestion requires a stream to build up a queue with a certain number of packets whose rates are larger than the avi-bw. The high sampling frequency and the large number of packets at each rate in the focus region create a turning point that is easier to be identified. Previous technologies have focused on how to find a turning point, while the fisheye stream focuses on how to create a more identifiable turning point. The actual function of creating a fisheye stream is shown in Fig. 2. The default value of the lower bound L is set as 10 Kbps. The upper bound U is the Average Dispersion Rate (ADR) as used in pathload [4]. The focus center C is adjusted after each round of the measurement, and it is initially at the center of L and U. The focus length is also adjustable and it is initially set to the 1/5 of the total range (U L). N is the height of the focus lens. Outside the focus region, the number of packets used for each rate drops from N to 1. N M Num of Packets L γ k + 1 γ k FL Focus length γ 2 γ γ γ 2 C d FU γ γ k+ 1 k Figure 2: A fisheye stream d U Packet rate The rate sampling function is similar to that of pathchirp. Assume that the instantaneous packet rate at the focus center is C. Starting from C towards the upper bound U, instantaneous packet rates are C+, C+ r 1, C+ r 2, It is essentially an exponential function as a chirp. However, from C towards the lower bound L, instantaneous packet rates are C, C r 1, C r 2,. Thus it is a reversed chirp. The default value of r is 1.2 and the default value of is (U-L)/100. B. Dynamics of the Available Bandwidth The design philosophy of refocusing the fisheye stream is based on the long-term stability and predictability of the Internet. Results in [17] show that the change-free durations of the throughput often last more than one hour. The available bandwidth of an Internet path usually shows a 3
4 certain degree of constancy within a few minutes or even hours. In order to decide the width of the focus region, we collect the MRTG (Multi-Router Traffic Grapher [13]) data from 123 routers in our campus network in a two-day time period and calculate the avi-bw change percentage, which is the difference of two sequential measurements divided by the link capacity. Our data shows about 90% of the avi-bw change percentages are within 5%. Significant avi-bw changes are relatively less frequent. The MRTG gives a 5- minute average and the short-term avi-bw would be more bursty. Therefore we use 20% of the link capacity as the width of the focus region in order to accommodate the variance of avi-bw. FEAT can also automatically adjust the focus-region width based on the dynamics of historical data. C. Measurement Process The first step of FEAT is to estimate the upper bound U of the avi-bw capacity using the wellknown Average Dispersion Rate technology [4]. This process only needs to be executed once whenever a new path is measured. FEAT takes advantage of the constancy of the Internet by refocusing on previously measured avi-bw value. The sender sends the fisheye stream to the receiver. The receiver uses similar filtering functions as those in pathchirp to find the turning point and compute the corresponding avi-bw x. If x is in the focus region, the sender displays x as one reportable measurement result and refocuses the focus region by moving the center C to x. If x is not in the focus region, FEAT refocuses the center C to x and uses additional round(s) to obtain a reportable result until x falls in the focus region. A. Testbed Validation PC1 PC3 Probe traffic switch Cross traffic IV. VALIDATIONS Cisco 3200 Cisco 3200 Figure 3: Testbed configuration switch Fig. 3 shows the testbed configuration. Two Cisco 3200 routers are connected back-to-back using fast serial interfaces. The speed of the backto-back connection is adjustable by setting the clock rate of the interfaces. Each router connects to a Cisco Catalyst 2900 switch. Two Dell Dimension PCs, i.e. PC1 and PC2, using Linux Red Hat 9 run FEAT and other avi-bw tools. Another two PCs, i.e., PC3 and PC4, run a commercial traffic generator [11] to generate controllable cross traffics. We set the inter-router link bandwidth as 1.3 Mbps and generate 0.2, 0.4,..., 1.2 Mbps CBR cross traffic. We do not tune these tools, except set the capacity parameter 1.3 Mbps for Spruce. We test each tool 20 times in each cross traffic configuration and plot the averaged results in Fig. 4. The true value of the avi-bw is the straight line with a slope 1 shown in Fig. 4. PathChirp does not have the process of detecting the upper bound of avi-bw. In every new measurement, pathchirp adjusts the probe range from [10M.. 200M], [1.43M.. 70M] to [0.204M.. 10M]. We only use results in the [0.204M.. 10M] range. Via discussions with pathchirp author, the [ M] range is still too large for our configuration, which could explain why pathchirp did not perform well in our tests. It takes about 270 seconds in average for pathload to finish a test. IGI uses 1 to 3 seconds when the cross traffic is light, and increases to about 40 seconds when the cross traffic approaches 1.2 Mbps. Spruce, pathchirp and FEAT are all under one second per test. PC2 PC4 4
5 Our experiments show that pathload constantly underestimates the avi-bw. Pathchirp and IGI constantly overestimate the avi-bw. Spruce results in a mixed pattern. IGI frequently underestimate the tight link capacity in our tests, with very occasions that the tight link capacity is many times higher than the true value. These exceptions have been excluded in the statistics as outliers. All tools are fairly accurate when the link utilization is low, while relative errors are large when the link utilization is high. When the link utilization is from low to high, the performance of FEAT is consistent, e.g. with 90% of times the relative errors are less than 20%. avi_bw (Mbps) cross traffic (Mbps) True value IGI pathload average pathchirp spruce FEAT Figure 4: Available-bandwidth (avi-bw) test results B. Internet Test Methodology Testbed validations and ns-2 simulations could verify the idea of a tool. However, there is no better approach than using actual network paths. Similar to [16], we validate FEAT with the help of the MRTG tool on network paths. Although the 5- minute resolution of the MRTG data is low, the MRTG tool is so far the most accurate way to validate the output of an avi-bw tool. MRTG validation requires accesses to MRTG log data from all links of a path and the capacity of each link. We have collected MRTG data of 123 routers in Lehigh campus and downloaded the freely available Abilene network MRTG logs. We have applied the MRTG test to several paths that traverse the Lehigh campus network. Our ongoing tests include paths from Berkeley, U. Northwestern, U. Florida to Lehigh. The initial Internet test shows positive results. However, extensive Internet testing is still an ongoing work and we expect the result in next few months. Our Internet validation will test the relative error, absolute errors as well as the agility of the tools over these selected Internet paths. V. CONCLUSIONS AND FUTURE WORK This report introduces FEAT, an end-to-end available bandwidth tool that features a fisheye probing packet stream. The tool has been tested in the lab testbed setting as well as a small number of Internet paths. Current experiments indicate that FEAT is accurate, fast and nearly nonintrusive. We will deploy FEAT in larger scales, integrate it with middleware [18] for adaptive distributed applications, and investigate the sources of errors to improve its accuracy. We also plan to test it on Emulab [19], which can create controllable multihop scenarios that are hard to test in the Internet. An extensive study of algorithms in various tools is also needed in order to better understand the theoretical and practical issues of the available bandwidth measurement. ACKNOWLEDGEMENT This work is sponsored by National Science Foundation under the NSF Award # SCI: NMI DEVELOPMENT: Middleware for Adaptive Robust Collaborations across Heterogeneous Environments and Systems (MARCHES). REFERENCES [1] D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, Resilient overlay networks, in Proc. ACM SOSP, pp , [2] L. Breslau, E. Knightly, S. Shenker, and I. Stoica, Endpoint admission control: architectural issues and performance, in Proc. ACM SIGCOMM, pp , [3] S.-W. Cheng and D. Garlan, Software architecture-based adaptation for pervasive 5
6 systems, in Proc. of Intl. Conf. on Arch. of Computing, [4] C. Dovrolis, P. Ramanathan, and D. Moore, What do packet dispersion techniques measure? in Proc. of IEEE INFOCOM, pp , [5] N. Hu and P. Steenkiste, Improving TCP startup performance using active measurements: algorithm and evaluation, in Proc. of ICNP [6] N. Hu and P. Steenkiste, Evaluation and characterization of available bandwidth probing techniques, IEEE JSAC, Vol. 21, No. 6, [7] M. Jain and C. Dovrolis, Pathload: a measurement tool for end-to-end available bandwidth, in Proc. of PAM, pp , March [8] G. Jin and B. L. Tierney, System capability effects on algorithms for network bandwidth measurement, in Proc. of ACM SIGCOMM Internet Measurement Workshop 2001, pp , [9] G. Jin and B. Tierney, Netest: a tool to measure the maximum burst size, available bandwidth and achievable throughput, LBNL report # [10] D. Kiwior, J. Kingston, and A. Spratt, PATHMON: a methodology for determining available bandwidth over an unknown network, in Proc. of IEEE Sarnoff 2004 Symposium, pp , April 26-27, [11] ZTI Co. Ltd., LanTraffic V2.0., [12] B. Melander, M. Bjrkman, and P. Gunningberg, A new end-to-end probing and analysis method for estimating bandwidth bottlenecks, in Proc. of IEEE Globecom, pp , [13] T. Oetiker, MRTG: the multi router traffic grapher, in Proc. of the 12th Conference on Systems Administration (LISA 98), pp , [14] R. Prasad, M. Jain, and C. Dovrolis, Socket buffer auto-sizing for high-performance data transfers, Journal of Grid Computing, 1(4), [15] V. Ribeiro, R. Riedi, R. Baraniuk, J. Navratil, and L. Cottrell, pathchirp: efficient available bandwidth estimation for network paths, in Proc. of Passive and Active Measurement Workshop, April [16] J. Strauss, D. Katabi, and F. Kaashoek, A measurement study of available bandwidth estimation tools, in Proc. of 2003 ACM SIGCOMM Conf. on Internet Measurement, pp , Oct [17] Y. Zhang, N.G. Duffield, V. Paxson, and S. Shenker, On the constancy of Internet path properties, in Proc. of ACM SIGCOMM Internet Measurement Workshop 2001, pp , [18] Q. Wang and L. Cheng, AwareWare: an adaptation middleware for heterogeneous environments, in Proc. of ICC, pp , [19] Emulab: 6
Bandwidth Measurement in Wireless Networks
Bandwidth Measurement in Wireless Networks Andreas Johnsson, Bob Melander, and Mats Björkman {andreas.johnsson, bob.melander, mats.bjorkman}@mdh.se The Department of Computer Science and Engineering Mälardalen
A Measurement Study of Available Bandwidth Estimation Tools
A Measurement Study of Available Bandwidth Estimation Tools Jacob Strauss [email protected] Dina Katabi [email protected] MIT Computer Science and Artificial Intelligence Laboratory Frans Kaashoek [email protected]
Path Optimization in Computer Networks
Path Optimization in Computer Networks Roman Ciloci Abstract. The main idea behind path optimization is to find a path that will take the shortest amount of time to transmit data from a host A to a host
MONITORING AVAILABLE BANDWIDTH OF UNDERLYING GRID NETWORKS
MONITORING AVAILABLE BANDWIDTH OF UNDERLYING GRID NETWORKS Marcia Zangrilli Bruce B. Lowekamp, advisor Department of Computer Science College of William and Mary Abstract Harnessing the complete power
Ten Fallacies and Pitfalls on End-to-End Available Bandwidth Estimation
Ten Fallacies and Pitfalls on End-to-End Available Bandwidth Estimation Manish Jain Georgia Tech [email protected] Constantinos Dovrolis Georgia Tech [email protected] ABSTRACT The area of available
Effects of Interrupt Coalescence on Network Measurements
Effects of Interrupt Coalescence on Network Measurements Ravi Prasad, Manish Jain, and Constantinos Dovrolis College of Computing, Georgia Tech., USA ravi,jain,[email protected] Abstract. Several
An Improved Available Bandwidth Measurement Algorithm based on Pathload
An Improved Available Bandwidth Measurement Algorithm based on Pathload LIANG ZHAO* CHONGQUAN ZHONG Faculty of Electronic Information and Electrical Engineering Dalian University of Technology Dalian 604
A Hidden Markov Model Approach to Available Bandwidth Estimation and Monitoring
A Hidden Markov Model Approach to Available Bandwidth Estimation and Monitoring Cesar D Guerrero 1 and Miguel A Labrador University of South Florida Department of Computer Science and Engineering Tampa,
End-to-End Available Bandwidth Estimation Tools, an Experimental Comparison
End-to-End Available Bandwidth Estimation Tools, an Experimental Comparison Emanuele Goldoni 1 and Marco Schivi 2 1 University of Pavia, Dept. of Electronics, 27-Pavia, Italy [email protected]
How To Compare Available Bandwidth On A Network With A Powerline To A Network On A Testbed On A Computer Or Network On An Ipad Or Ipad On A 2Mbb (Or Ipad) On A 4Ghz Network On The
2009 International Symposium on Computing, Communication, and Control (ISCCC 2009) Proc.of CSIT vol.1 (2011) (2011) IACSIT Press, Singapore Path-F3: Improving Accuracy and Network Load in Available Estimation
Title: Scalable, Extensible, and Safe Monitoring of GENI Clusters Project Number: 1723
Title: Scalable, Extensible, and Safe Monitoring of GENI Clusters Project Number: 1723 Authors: Sonia Fahmy, Department of Computer Science, Purdue University Address: 305 N. University St., West Lafayette,
Techniques for available bandwidth measurement in IP networks: A performance comparison
Computer Networks 50 (2006) 332 349 www.elsevier.com/locate/comnet Techniques for available bandwidth measurement in IP networks: A performance comparison Leopoldo Angrisani a, Salvatore DÕAntonio b, *,
Bandwidth Measurement in xdsl Networks
Bandwidth Measurement in xdsl Networks Liang Cheng and Ivan Marsic Center for Advanced Information Processing (CAIP) Rutgers The State University of New Jersey Piscataway, NJ 08854-8088, USA {chengl,marsic}@caip.rutgers.edu
Cloud Monitoring Framework
Cloud Monitoring Framework Hitesh Khandelwal, Ramana Rao Kompella, Rama Ramasubramanian Email: {hitesh, kompella}@cs.purdue.edu, [email protected] December 8, 2010 1 Introduction With the increasing popularity
Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow
International Journal of Soft Computing and Engineering (IJSCE) Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow Abdullah Al Masud, Hossain Md. Shamim, Amina Akhter
Using Passive Traces of Application Traffic in a Network Monitoring System
Using Passive Traces of Application Traffic in a Network Monitoring System Marcia Zangrilli and Bruce B. Lowekamp Computer Science Department College of William and Mary Williamsburg, VA 23187-8795 {mazang,lowekamp}@cs.wm.edu
Comparative Analysis of Congestion Control Algorithms Using ns-2
www.ijcsi.org 89 Comparative Analysis of Congestion Control Algorithms Using ns-2 Sanjeev Patel 1, P. K. Gupta 2, Arjun Garg 3, Prateek Mehrotra 4 and Manish Chhabra 5 1 Deptt. of Computer Sc. & Engg,
Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation
Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation R.Navaneethakrishnan Assistant Professor (SG) Bharathiyar College of Engineering and Technology, Karaikal, India.
Requirements for Simulation and Modeling Tools. Sally Floyd NSF Workshop August 2005
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005 Outline for talk: Requested topic: the requirements for simulation and modeling tools that allow one to study, design,
THE INTERNATIONAL JOURNAL OF SCIENCE & TECHNOLEDGE
THE INTERNATIONAL JOURNAL OF SCIENCE & TECHNOLEDGE Remote Path Identification using Packet Pair Technique to Strengthen the Security for Online Applications R. Abinaya PG Scholar, Department of CSE, M.A.M
XCP-i : explicit Control Protocol for heterogeneous inter-networking of high-speed networks
: explicit Control Protocol for heterogeneous inter-networking of high-speed networks D. M. Lopez-Pacheco INRIA RESO/LIP, France Email: [email protected] C. Pham, Member, IEEE LIUPPA, University of
A Catechistic Method for Traffic Pattern Discovery in MANET
A Catechistic Method for Traffic Pattern Discovery in MANET R. Saranya 1, R. Santhosh 2 1 PG Scholar, Computer Science and Engineering, Karpagam University, Coimbatore. 2 Assistant Professor, Computer
Smart Queue Scheduling for QoS Spring 2001 Final Report
ENSC 833-3: NETWORK PROTOCOLS AND PERFORMANCE CMPT 885-3: SPECIAL TOPICS: HIGH-PERFORMANCE NETWORKS Smart Queue Scheduling for QoS Spring 2001 Final Report By Haijing Fang([email protected]) & Liu Tang([email protected])
Load Balancing Mechanisms in Data Center Networks
Load Balancing Mechanisms in Data Center Networks Santosh Mahapatra Xin Yuan Department of Computer Science, Florida State University, Tallahassee, FL 33 {mahapatr,xyuan}@cs.fsu.edu Abstract We consider
CONTROL SYSTEM FOR INTERNET BANDWIDTH BASED ON JAVA TECHNOLOGY
CONTROL SYSTEM FOR INTERNET BANDWIDTH BASED ON JAVA TECHNOLOGY SEIFEDINE KADRY, KHALED SMAILI Lebanese University-Faculty of Sciences Beirut-Lebanon E-mail: [email protected] ABSTRACT This paper presents
Quality of Service versus Fairness. Inelastic Applications. QoS Analogy: Surface Mail. How to Provide QoS?
18-345: Introduction to Telecommunication Networks Lectures 20: Quality of Service Peter Steenkiste Spring 2015 www.cs.cmu.edu/~prs/nets-ece Overview What is QoS? Queuing discipline and scheduling Traffic
TCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) Internet Protocol (IP)
TCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) *Slides adapted from a talk given by Nitin Vaidya. Wireless Computing and Network Systems Page
Robust Router Congestion Control Using Acceptance and Departure Rate Measures
Robust Router Congestion Control Using Acceptance and Departure Rate Measures Ganesh Gopalakrishnan a, Sneha Kasera b, Catherine Loader c, and Xin Wang b a {[email protected]}, Microsoft Corporation,
Stability of QOS. Avinash Varadarajan, Subhransu Maji {avinash,smaji}@cs.berkeley.edu
Stability of QOS Avinash Varadarajan, Subhransu Maji {avinash,smaji}@cs.berkeley.edu Abstract Given a choice between two services, rest of the things being equal, it is natural to prefer the one with more
Simulation technique for available bandwidth estimation
Simulation technique for available bandwidth estimation T.G. Sultanov Samara State Aerospace University Moskovskoe sh., 34, Samara, 443086, Russia E-mail: [email protected] A.M. Sukhov Samara State Aerospace
Moving to the Cloud: Estimating the Internet Connection Bandwidth. Abstract
Moving to the Cloud: Estimating the Internet Connection Bandwidth Luís Ferreira da Silva 1, Fernando Brito e Abreu 1,2 1) QUASAR, CITI, FCT/UNL, 2829-516 Caparica, Portugal [email protected] 2)
STANDPOINT FOR QUALITY-OF-SERVICE MEASUREMENT
STANDPOINT FOR QUALITY-OF-SERVICE MEASUREMENT 1. TIMING ACCURACY The accurate multi-point measurements require accurate synchronization of clocks of the measurement devices. If for example time stamps
AN IMPROVED SNOOP FOR TCP RENO AND TCP SACK IN WIRED-CUM- WIRELESS NETWORKS
AN IMPROVED SNOOP FOR TCP RENO AND TCP SACK IN WIRED-CUM- WIRELESS NETWORKS Srikanth Tiyyagura Department of Computer Science and Engineering JNTUA College of Engg., pulivendula, Andhra Pradesh, India.
Bandwidth Estimation using Passive Monitoring for WLANs Case Study Report
Bandwidth Estimation using Passive Monitoring for WLANs Case Study Report Investing in the future by working together for a sustainable and competitive region Bandwidth Estimation using Passive Monitoring
Netest: A Tool to Measure the Maximum Burst Size, Available Bandwidth and Achievable Throughput
Netest: A Tool to Measure the Maximum Burst Size, Available Bandwidth and Achievable Throughput Guojun Jin Brian Tierney Distributed Systems Department Lawrence Berkeley National Laboratory 1 Cyclotron
Quantifying the Performance Degradation of IPv6 for TCP in Windows and Linux Networking
Quantifying the Performance Degradation of IPv6 for TCP in Windows and Linux Networking Burjiz Soorty School of Computing and Mathematical Sciences Auckland University of Technology Auckland, New Zealand
Analysis of IP Network for different Quality of Service
2009 International Symposium on Computing, Communication, and Control (ISCCC 2009) Proc.of CSIT vol.1 (2011) (2011) IACSIT Press, Singapore Analysis of IP Network for different Quality of Service Ajith
Available bandwidth measurement as simple as running wget
Available bandwidth measurement as simple as running wget Demetres Antoniades 1, Manos Athanatos 1, Antonis Papadogiannakis 1, Evangelos P. Markatos 1, Constantine Dovrolis 2 1 Institute of Computer Science
Performance Measurement of Wireless LAN Using Open Source
Performance Measurement of Wireless LAN Using Open Source Vipin M Wireless Communication Research Group AU KBC Research Centre http://comm.au-kbc.org/ 1 Overview General Network Why Network Performance
Dynamic Congestion-Based Load Balanced Routing in Optical Burst-Switched Networks
Dynamic Congestion-Based Load Balanced Routing in Optical Burst-Switched Networks Guru P.V. Thodime, Vinod M. Vokkarane, and Jason P. Jue The University of Texas at Dallas, Richardson, TX 75083-0688 vgt015000,
VMWARE WHITE PAPER 1
1 VMWARE WHITE PAPER Introduction This paper outlines the considerations that affect network throughput. The paper examines the applications deployed on top of a virtual infrastructure and discusses the
A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks
A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks Didem Gozupek 1,Symeon Papavassiliou 2, Nirwan Ansari 1, and Jie Yang 1 1 Department of Electrical and Computer Engineering
Continuous One-Way Available Bandwidth Change Detection in High Definition Video Conferencing
Continuous One-Way Available Bandwidth Change Detection in High Definition Video Conferencing Aziz Khanchi, Mehdi Semsarzadeh, Abbas Javadtalab and Shervin Shirmohammadi Distributed and Collaborative Virtual
A Passive Method for Estimating End-to-End TCP Packet Loss
A Passive Method for Estimating End-to-End TCP Packet Loss Peter Benko and Andras Veres Traffic Analysis and Network Performance Laboratory, Ericsson Research, Budapest, Hungary {Peter.Benko, Andras.Veres}@eth.ericsson.se
Bandwidth estimation: metrics, measurement techniques, and tools
1 Bandwidth estimation: metrics, measurement techniques, and tools R. S. Prasad M. Murray C. Dovrolis K. Claffy [email protected] [email protected] [email protected] [email protected] Abstract In a packet
A Routing Metric for Load-Balancing in Wireless Mesh Networks
A Routing Metric for Load-Balancing in Wireless Mesh Networks Liang Ma and Mieso K. Denko Department of Computing and Information Science University of Guelph, Guelph, Ontario, Canada, N1G 2W1 email: {lma02;mdenko}@uoguelph.ca
Internet Infrastructure Measurement: Challenges and Tools
Internet Infrastructure Measurement: Challenges and Tools Internet Infrastructure Measurement: Challenges and Tools Outline Motivation Challenges Tools Conclusion Why Measure? Why Measure? Internet, with
How To Choose A Path On A Network With Available Bandwidth On A Pms Network
A New Path Selection Algorithm for MPS Networks Based on Available Bandwidth Measurement T. Anjali, C. Scoglio, J. de Oliveira,. C. Chen, I. F. Akyildiz, J. A. Smith *, G. Uhl *, A. Sciuto * Broadband
Requirements of Voice in an IP Internetwork
Requirements of Voice in an IP Internetwork Real-Time Voice in a Best-Effort IP Internetwork This topic lists problems associated with implementation of real-time voice traffic in a best-effort IP internetwork.
Analyzing Marking Mod RED Active Queue Management Scheme on TCP Applications
212 International Conference on Information and Network Technology (ICINT 212) IPCSIT vol. 7 (212) (212) IACSIT Press, Singapore Analyzing Marking Active Queue Management Scheme on TCP Applications G.A.
Transparent Optimization of Grid Server Selection with Real-Time Passive Network Measurements. Marcia Zangrilli and Bruce Lowekamp
Transparent Optimization of Grid Server Selection with Real-Time Passive Network Measurements Marcia Zangrilli and Bruce Lowekamp Overview Grid Services Grid resources modeled as services Define interface
Comparing Passive Network Monitoring of Grid Application Traffic with Active Probes
Appears in Grid 3 c 3 IEEE Comparing Passive Network Monitoring of Grid Application Traffic with Active Probes Marcia Zangrilli and Bruce B. Lowekamp College of William and Mary {mazang, lowekamp}@cs.wm.edu
Multi-service Load Balancing in a Heterogeneous Network with Vertical Handover
1 Multi-service Load Balancing in a Heterogeneous Network with Vertical Handover Jie Xu, Member, IEEE, Yuming Jiang, Member, IEEE, and Andrew Perkis, Member, IEEE Abstract In this paper we investigate
Low-rate TCP-targeted Denial of Service Attack Defense
Low-rate TCP-targeted Denial of Service Attack Defense Johnny Tsao Petros Efstathopoulos University of California, Los Angeles, Computer Science Department Los Angeles, CA E-mail: {johnny5t, pefstath}@cs.ucla.edu
An enhanced TCP mechanism Fast-TCP in IP networks with wireless links
Wireless Networks 6 (2000) 375 379 375 An enhanced TCP mechanism Fast-TCP in IP networks with wireless links Jian Ma a, Jussi Ruutu b and Jing Wu c a Nokia China R&D Center, No. 10, He Ping Li Dong Jie,
Research on Errors of Utilized Bandwidth Measured by NetFlow
Research on s of Utilized Bandwidth Measured by NetFlow Haiting Zhu 1, Xiaoguo Zhang 1,2, Wei Ding 1 1 School of Computer Science and Engineering, Southeast University, Nanjing 211189, China 2 Electronic
GREEN: Proactive Queue Management over a Best-Effort Network
IEEE GlobeCom (GLOBECOM ), Taipei, Taiwan, November. LA-UR -4 : Proactive Queue Management over a Best-Effort Network Wu-chun Feng, Apu Kapadia, Sunil Thulasidasan [email protected], [email protected], [email protected]
Round-Trip Time Inference Via Passive Monitoring
Round-Trip Time Inference Via Passive Monitoring Ryan Lance Department of Mathematics University of Maryland College Park, Maryland [email protected] Ian Frommer Applied Mathematics and Scientific Computation
Seamless Congestion Control over Wired and Wireless IEEE 802.11 Networks
Seamless Congestion Control over Wired and Wireless IEEE 802.11 Networks Vasilios A. Siris and Despina Triantafyllidou Institute of Computer Science (ICS) Foundation for Research and Technology - Hellas
Performance of networks containing both MaxNet and SumNet links
Performance of networks containing both MaxNet and SumNet links Lachlan L. H. Andrew and Bartek P. Wydrowski Abstract Both MaxNet and SumNet are distributed congestion control architectures suitable for
Network Performance Monitoring at Small Time Scales
Network Performance Monitoring at Small Time Scales Konstantina Papagiannaki, Rene Cruz, Christophe Diot Sprint ATL Burlingame, CA [email protected] Electrical and Computer Engineering Department University
An Adaptive Load Balancing to Provide Quality of Service
An Adaptive Load Balancing to Provide Quality of Service 1 Zahra Vali, 2 Massoud Reza Hashemi, 3 Neda Moghim *1, Isfahan University of Technology, Isfahan, Iran 2, Isfahan University of Technology, Isfahan,
NETWORK REQUIREMENTS FOR HIGH-SPEED REAL-TIME MULTIMEDIA DATA STREAMS
NETWORK REQUIREMENTS FOR HIGH-SPEED REAL-TIME MULTIMEDIA DATA STREAMS Andrei Sukhov 1), Prasad Calyam 2), Warren Daly 3), Alexander Iliin 4) 1) Laboratory of Network Technologies, Samara Academy of Transport
packet retransmitting based on dynamic route table technology, as shown in fig. 2 and 3.
Implementation of an Emulation Environment for Large Scale Network Security Experiments Cui Yimin, Liu Li, Jin Qi, Kuang Xiaohui National Key Laboratory of Science and Technology on Information System
The ISP Column A monthly column on all things Internet
The ISP Column A monthly column on all things Internet Just How Good are You? Measuring Network Performance February 2003 Geoff Huston If you are involved in the operation of an IP network, a question
4 High-speed Transmission and Interoperability
4 High-speed Transmission and Interoperability Technology 4-1 Transport Protocols for Fast Long-Distance Networks: Comparison of Their Performances in JGN KUMAZOE Kazumi, KOUYAMA Katsushi, HORI Yoshiaki,
Research of TCP ssthresh Dynamical Adjustment Algorithm Based on Available Bandwidth in Mixed Networks
Research of TCP ssthresh Dynamical Adjustment Algorithm Based on Available Bandwidth in Mixed Networks 1 Wang Zhanjie, 2 Zhang Yunyang 1, First Author Department of Computer Science,Dalian University of
Using TrueSpeed VNF to Test TCP Throughput in a Call Center Environment
Using TrueSpeed VNF to Test TCP Throughput in a Call Center Environment TrueSpeed VNF provides network operators and enterprise users with repeatable, standards-based testing to resolve complaints about
