A Study of Impacts of Flow Timeouts on Link Provisioning
|
|
- Anastasia Brown
- 6 years ago
- Views:
Transcription
1 A Study of Impacts of Flow Timeouts on Link Provisioning Jeroen Fokkema University of Twente P.O. Box 217, 7500AE Enschede The Netherlands ABSTRACT Link provisioning is used in backbone links to ensure that quality of service goals are met. This relies on accurate estimations of the required capacity for a link. Current approached lack this accuracy which may result in problems of over- and underdimensioning of links. Alternative approaches, as found in the literature, often require network traffic measurements at the packet level. These measurements are most of the time costly and not scalable at high-speed networks. Therefore, a new method for doing link dimensioning is proposed. This method relies on traffic measurements at the flow-level and the results are promising. This research further investigates this method by assessing the impact of flow timeouts on the accuracy of the bandwidth provisioning formula. Our results show that the smaller the timeouts, the higher the costs for doing bandwidth dimensioning. On the other hand do smaller timeouts not automatically result in more accurate results. Keywords Link dimensioning, Bandwidth estimation, flows, IPFIX, NetFlow 1. INTRODUCTION Link dimensioning is a method to dimension the bandwidth capacity of a link to a certain amount. This method is used by ISP s to manage the bandwidth availability, but in order to do proper link dimensioning, information is needed about the usage of a link. Most of the time, this is done by measuring the average traffic on the link. SNMP [14] counters are used this purpose, using time intervals of five to ten minutes. The collected data can be to estimate the usage of a link in the future by taking the average traffic into account and by adding a safety margin to handle short bursts of traffic. Hereafter the link can be dimensioned using this information. The major problem with this link dimensioning method is that peaks in the bandwidth usage on short timescales cannot be measured. Adding a safety margin to the dimensioned link can be used as a solution to this problem. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. 19 th Twente Student Conference on IT June 24 st, 2013, Enschede, The Netherlands. Copyright 2013, University of Twente, Faculty of Electrical Engineering, Mathematics and Computer Science. However this is done using a rule of thumb and therefore not accurate. Another solution to this problem is by measuring the packets that are sent over the link instead of measuring the averaged traffic. But these packet traces are very costly and are not scalable at high speed networks. Therefore, a new method and formula for doing bandwidth (link) dimensioning is proposed, which uses flow-data [12]. This method still uses averages, but the periods of time over which these averages are calculated are much smaller than those currently used to calculate average bandwidth values. There are several parameters that influence the outcome of the proposed bandwidth formula provided by [12]. These are for example the flow timeouts. This paper investigates the impact of different settings for these timeouts. This is done by observing the accuracy of the bandwidth provisioning and the costs of doing this for some different timeout settings. The outcomes of this research can be used to investigate the impact of these these flow timeouts when using the new bandwidth estimation formula. To research the reliability and costs of the bandwidth provisioning method for different flow timeouts, the following main research question need to be answered: What are best timer settings for doing bandwidth estimation using flow-level measurements?. This question has been divided in two subquestions, namely: 1. What are the implications of different timer settings on the costs of doing bandwidth estimations using flow-data? 2. What are the implications of different timer settings on the accuracy of bandwidth estimation? These two questions are answered by experiments and analyzing their results. Section 2 provides the state of the art. Section 3 describes the setup of the experiments. The results of the experiments are described in Section 4. Section 5 analyses the results and answers the research questions (1) and (2). Finally section 6 provides the conclusions and recommends the future work. 2. STATE OF ART 2.1 Current Bandwidth Provisioning methods Currently, bandwidth provisioning is mostly done using the following steps. First, the average usage of a link is measured by using SNMP counters [14]. Then the capacity of this link will be dimensioned to the value of this average usage plus a safety margin of about 30 percent to deal with fluctuations in the usage of the link. This method is easy to deploy, since all network devices implement SNMP.
2 However, fluctuations of the traffic are not measured. This can result in a bad user experience when the traffic on the link consists of a lot of short bursts [9]. Likewise, this method can also result in overprovisioning and thus a waste of resources for the maintainer of the link. 2.2 Methods for Bandwidth Estimation To get a better estimation of the bandwidth usage, some methods have been proposed. For example, research has been done using the Gaussian distribution of traffic in fast networks [10, 5, 8, 2]. Research has also been done using the Batch Markov model [7]. This is just a subset of the proposed methods for measuring link usage and most of these methods provide accurate results. However, all these methods rely on packet traces for finding the right parameters to work with. The costs of acquiring packet traces make daily use of these methods very unattractive. Therefore bandwidth estimation using flow-level measurements can be considered as an alternative. 2.3 Flow-level Measurements Some methods have been proposed that use flow-level measurements to do bandwidth provisioning [12, 13]. These methods rely on flow-data from, for example, NetFlow [4] or IPFIX [11]. Because many network devices implement one or more of these protocols, using flow-level measurements can be done without great investments. Furthermore the method of supporting bandwidth estimations using flow-data requires much less resources than the bandwidth estimations methods using packet traces. Flow-data is acquired by measuring flows, which are a set of packets that share common properties, passing an observation point in the network [11]. The difference between flow-level measurements and the method often used for bandwidth provisioning nowadays is that the timescale over which flow-level measurements take averages is much smaller. This increases the probability recognizing small bursts of data are much higher. Furthermore flow-level measurements measure averages for every connection on a link and not the average for all of the connections on a link. Therefore, it can be considered that flow-level measurements will be much more accurate than methods often used nowadays. 2.4 Contribution of the Proposed Research To use flow-level measurements as proposed by [12], some parameters have to be precisely configured in order to get accurate estimations. Two of these parameters are the active and the inactive timeout of the timers used to create the flows. The active timeout defines the length of a flow. However, the active timer is used in combination with the inactive timer in the following way. When a flow becomes idle for the time set by the inactive timeout and the time set by the active timeout has not expired yet, then the flow will be terminated. The lower these parameters are set, the more the bandwidth usage estimation is expected to be equal to the actual bandwidth usage. However, the costs, in terms of using computing recourses to do the bandwidth estimation, are expected to be higher. This research investigates the actual effects of these parameters and searches for a good balance between the accuracy of the estimation and the costs of doing the measurements. 3. SETUP OF THE EXPERIMENTS The traffic used in this work was captured in a backbone link that interconnects the cities of Chicago and Seattle [3]. A total of one hour of measurements was used, and these are divided in four 15-minute trace files. The trace files are called trace 1, trace 2, trace 3 and trace 4. These traces consist of packet-data and out of that flow-data has been generated. So for all of the files packet-data as well as flow-data is available. To process these files and obtain usable output, the tool YAF [6] has been used. This tool processes the flows from the trace files and makes readable text out them. The rest of the processing for the research has been done using self written AWK [1], bash scripts and C++ tools. For the plotting gnuplot 1 has been used. 3.1 Measuring the Costs In order to assess the implications for the cost on accomplishing the bandwidth provisioning for different flow timeouts, the properties of the flow-data have to be acquired. This is done by generating data from the trace files for different timeout settings using YAF. The active timeouts are 300, 120, 30 and 5 seconds and the inactive timeouts are respectively set to 120, 30, 10 and 2 seconds. For the rest of this paper, these timeout combinations will be presented in the form of [active timeout]-[inactive timeout]. The combination of 120 seconds for the active timeout setting and 30 seconds for the inactive timeout setting (120-30) is a standard combination used for flow monitoring on the University of Twente. Since it is likely that lower timeouts give better results, the [active timeout]-[inactive timeout] combinations of 30s-10s and 5s-2s are used. But to have some data to compare with, also the higher flow timeout combination of [active timeout]-[inactive timeout] 300s-120s is chosen to investigate. The costs will be analyzed by measuring the amount of flow records that are generated using different flow timeouts. The amount of flow records are an indication for the amount of resources that have to be used doing the bandwidth estimation using these timeouts. If the data is to be used for doing real-time measurements, then every record has to be sent over the network, which can result in large amounts of extra traffic. On the other hand, when the records are not used real time but have to be stored on the network device, these devices require large storage. Every flow record is needed when doing bandwidth provisioning estimation, so this is a good indication for the costs using different flow timeouts. 3.2 Bandwidth Provisioning The bandwidth provisioning is accomplished by using the formula proposed in [12]: C(T, ɛ) = ρ + 1 T 2 log(ɛ) v(t ). This formula has different parameters that have to be set. First of all, there is the fault-margin, called ɛ. This is set to 1 percent, as we do want to take care of most of the fluctuations in the traffic. It means that 1 percent of the time, the traffic is allowed to have a higher bandwidth than provisioned by the formula. Furthermore we have to set the maximum amount of delay a user may experience: T. This parameter is set to 500ms, 750ms, 1 second, 2 seconds and 5 seconds. This is because 1 second has been shown to be the delay a user may experience before labeling his connectivity as a bad user experience [8]. Using values around this 1 second allows us to compare the results that the formula gives. ρ is the mean throughput of the traffic and v the variance of the traffic. Providing the bandwidth provisioning is a case of using the proposed formula for all of the generated flow files. This is 1 accessed on June 1, 2013
3 done by calculating ρ and ɛ with use of the flow files. ρ is calculated by taking the amount of bytes of every flow and then divide that by the number of flows. ɛ is calculated using the standard formula to calculate variance. This is the part of the bandwidth provisioning where the difference in flow timeouts result in different outcomes. Since the ρ and ɛ are calculated using the flow files. These variables will differ for each of the flow timeout settings, while all of the other variables are not influenced by these settings. The outcome of the formula is then evaluated by plotting the time series of the packet data. This data may exceed the amount of data the bandwidth provisioning formula is suggesting to dimension the link. But if the data exceeds this limit more than the fault margin of 1 percent, the outcome of the bandwidth provisioning formula is not applicable for these flow timeout settings, since the outcome is too inaccurate. The last part of the research is to take the outcomes of the bandwidth provisioning formula that are applicable and to see how accurate the results are. In other words: how much the minimum amount of bandwidth that should be provisioned according to the bandwidth estimation formula approaches the maximum amount of bandwidth that is actually used, when taking the traffic peaks into account. These results show the influence of the different timeout settings on the accuracy of the bandwidth estimation formula. 4. RESULTS 4.1 The Implications of Using Flow-Data instead of Packet-Data Figure 1 show the usage of the measured link over a period of 100 seconds - a larger amount of time would generate an unreadable graph. One of the lines represent the packetdata. This packet data represents the actual usage of the link. The other four lines show the usage of the link as measured when using flow-data. Every one of the lines has made use of a different [active timeout]-[inactive timeout] combination. It is clear that at the beginning of the measurements, using flow-data with large timeouts result in an inaccurate representation of the real bandwidth usage. The reason for this inaccuracy is that for the amount of time which is shorter than the inactive timeout, none of the flows will be terminated. This means that all the short bursts of traffic in this time-space will not be accurately measured. At the same time, some heavy fluctuations of bandwidth usage associated with the flow-data can be observed. This is because long connections are cut into smaller flows. At the beginning of the measurements, this results in the peaks that can be observed. For example, every 5 seconds for the timeout combination 5s-2s a drop in traffic is measured, because no flow will be longer than 5 seconds when these timeouts are used. This graph shows the implications of using flow-data. There are some irregularities in the representing of the actual traffic when using flow-data. These irregularities may result in inaccurate bandwidth provisioning. 4.2 Record Measurements Table 1 shows the number of flow records that are generated using different combinations of flow timeouts for the first of the four trace files. The left column of the table shows the flow timeout combinations, while the right column show the number of records that were generated using these timeouts. These results are also generated for Table 1. number of records for trace Table 2. Bandwidth provisioning formula outcomes for trace 1 timeouts T outcome e the other three traces and can be found in Appendix a, table 3, table 4 and table 5, respectively. All of these results show almost the same number of records that have been generated for each of the combination of timeouts. 4.3 Bandwidth Provisioning Table 2 shows the results of the bandwidth provisioning formula for the first of the four trace files. The column timeouts shows the combination of timeout settings that have been used for generating the flows and the column T shows the value that has been set as the maximum amount of delay a user may experience in milliseconds. The column outcome presents the outcome of the bandwidth dimensioning formula in megabits per second. The column ɛ shows the error of the outcome of the formula, e.g. the percentage of time that the link has a higher bandwidth usage than it should be provisioned according to the bandwidth dimensioning formula. If ɛ is larger then 1, the outcome of the formula is too inaccurate to be applicable. The results for the bandwidth provisioning formula using the other trace files can be found in the provided appendix. 5. DISCUSSION 5.1 Cost Analysis As becomes clear out of tables 1, 3, 4 and 5, the costs for measuring flow-data is lower for larger flow timeouts than for smaller timeouts. The combination of timeouts 300s- 120s results in a average number of records of ; the combination of timeouts 120s-30s results in an average of records; 30s-10s results in an average of records and 5s-2s in an average of records. Between the largest timeouts of 300s-120s and the smallest of 5s-2s this is a difference of 79%. On the
4 Mbps packet-data seconds Figure 1. flow-series vs. packet-series using T = 1000 same time, the timeouts are 60 times shorter. The differences between the three longest timeout combinations are much smaller. The difference between the combination 300s-120s and 30s-10s is only 29%. So taking very small timeouts is very costly while the difference between the other timeouts are not that large. 5.2 Accuracy of the Bandwidth Provisioning Formula First of all the results with an inaccuracy greater than 1% should be discarded. Tables 2, 6, 7 and 8 show that the inaccuracy is greater than 1% for all the results where T = 5 seconds (5000 ms) and for almost all of the results where T = 2 seconds. Apparently, the bandwidth provisioning formula does not generate accurate results for values of T > 1 second, regardless of the flow timeout settings. So the analysis the results have to be done using the results where the error is smaller than 1%. Using these results, it becomes clear that the combinations of flow timeout settings of 30s-10s generate the lowest results, while still remaining accurate. The results using timeouts of 120s- 30s are very close and on average only differ for the value of 8.1 Mbps. The results while using timeouts of 5s-2s are on average 62.1 Mbps larger than the situation is using 30s-10s and the results using timeouts of 300s-120s are on average 73 Mbps larger then when the combination 30s-10s is used. A difference of 73 Mbps on a maximum amount of bandwidth of 1588 Mbps - according to the packet-data - is only a difference of 4.6%. 5.3 Balance between costs and accuracy According to the obtained results, the costs are lower for higher flow timeouts, but the accuracy of the bandwidth estimation formula is not the highest for the lowest flow timeouts. For the combination of flow timeouts of 5s-2s the costs are the highest, but the results are worse than when flow timeouts are chosen of 30s-10s or even of 120s- 30s. This is the same for all of the values of T. Thus the results do not outweigh the costs for the flow timeouts of 5s-2s. For the other timeouts the following conclusion applies: the smaller the timeouts, the larger the costs and the better the accuracy of the bandwidth dimensioning formula. The relative difference in the accuracy does not differ significantly: 4.6% or in other words 73 Mbps. The costs, on the other hand, do differ 29%, which is much more. Thus the costs do increase a lot more for smaller timeouts then the difference in accuracy does. 6. CONCLUSION AND FUTURE WORK When doing bandwidth provisioning using the proposed formula, it is clear that a trade-off has to be made between the costs of doing the provisioning and the accuracy that the bandwidth dimensioning formula gives. First of all, the results of this research show that it is not recommended to use a T higher than 1 seconds, when the flow timeouts are used that are tested in this paper. The results for T = 2000ms and T = 5000ms are mostly inaccurate. At the same time, flow timeouts that are very low, like 5s-2s, are much more expensive, but the provisioning is very inaccurate. So the combination of these timeouts are discouraged to use in practice. The trade off between the other tested combinations of flow timeout settings may be harder to make. It seems the best choice to use a relative high timeout, because the costs are reasonably lower, while the results of the bandwidth provisioning are just a bit better. But when the bandwidth on a link is relative costly, lower flow timeouts may pay out. For improving the researched method of doing bandwidth provisioning, future work can be done to investigate the impact of the variable T of the formula. This research did not intend to research the impact of this variable, but the accuracy differences of the formula were large for different values of T. Furthermore this research could be extended by investigating the impact of other flow timeout combinations. For example larger values could be taken for the inactive timeout. By trying more different flow timeout combinations, more information becomes available to improve bandwidth provisioning models using flow-data. 7. REFERENCES [1] A. V. Aho, B. W. Kernighan, and P. J. Weinberger. Awk - a pattern scanning and processing language.
5 Software Pract Exper, 9(4): , [2] H. v. d. Berg, M. Mandjes, R. v. d. Meent, A. Pras, F. Roijers, and P. Venemans. Qos-aware bandwidth provisioning for ip network links. Computer Networks, 50(5): , [3] K. Claffy, D. Andersen, and P. Hick. The caida anonymized 2011 internet traces dataset.xml, Accessed on March 20, [4] B. Clause. Cisco systems netflow services export version 9. RFC 3954, IETF, [5] C. Fraleigh, F. Tobagi, and C. Diot. Provisioning ip backbone networks to support latency sensitive traffic. In INFOCOM Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, volume 1, pages , [6] C. M. Inacio and B. Trammell. Yaf: yet another flowmeter. In Proceedings of the 24th international conference on Large installation system administration, LISA 10, pages USENIX Association, [7] A. Klemm, C. Lindemann, and M. Lohmann. Modeling ip traffic using the batch markovian arrival process. Performance Evaluation, 54(2): , [8] R. v. d. Meent. Network link dimensioning : a measurement & modeling based approach. PhD thesis, Enschede, March Accessed on: June 10, [9] R. v. d. Meent, A. Pras, M. Mandjes, H. v. d. Berg, and L. Nieuwenhuis. Traffic measurements for link dimensioning: A case study, volume 2867 of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) [10] A. Pras, L. Nieuwenhuis, R. v. d. Meent, and M. Mandjes. Dimensioning network links: A new look at equivalent bandwidth. IEEE Network, 23(2):5 10, [11] J. Quittek, T. Zseby, B. Claise, and S. Zander. Requirements for ip flow information export(ipfix). RFC 3917, IETF, [12] R. d. O. Schmidt, R. Sadre, A. Sperotto, H. v. d. Berg, and A. Pras. Link dimensioning: A flow-based procedure. waiting for appliance, [13] R. d. O. Schmidt, A. Sperotto, R. Sadre, and A. Pras. Towards bandwidth estimation using flow-level measurements. In Dependable Networks and Services, volume 7279 of Lecture Notes in Computer Science, pages Springer Berlin / Heidelberg, [14] J. Schönwalder. Simple network management protocol (snmp) context engineid discovery. RFC 5343, IETF, 2008.
6 APPENDIX A. NUMBER OF RECORDS AND BAND- WIDTH PROVISIONING RESULTS Table 3. number of records for trace Table 4. number of records for trace Table 5. number of records for trace Table 6. Bandwidth provisioning formula outcomes for trace 2 timeouts T outcome percentage Table 7. Bandwidth provisioning formula outcomes for trace 3 timeouts T outcome percentage Table 8. Bandwidth provisioning formula outcomes for trace 4 timeouts T outcome percentage
Towards Bandwidth Estimation Using Flow-Level Measurements
Towards Bandwidth Estimation Using Flow-Level Measurements Ricardo O. Schmidt, Anna Sperotto, Ramin Sadre, Aiko Pras To cite this version: Ricardo O. Schmidt, Anna Sperotto, Ramin Sadre, Aiko Pras. Towards
More informationReal-Time and Resilient Intrusion Detection: A Flow-Based Approach
Real-Time and Resilient Intrusion Detection: A Flow-Based Approach Rick Hofstede, Aiko Pras To cite this version: Rick Hofstede, Aiko Pras. Real-Time and Resilient Intrusion Detection: A Flow-Based Approach.
More informationTraffic Measurements for Link Dimensioning
Traffic Measurements for Link Dimensioning A Case Study Remco van de Meent Aiko Pras Michel Mandjes Hans van den Berg Lambert Nieuwenhuis 13th August 2003 University of Twente CWI Abstract Traditional
More informationSelf-Management of Hybrid Networks: Can We Trust NetFlow Data?*
Self-Management of Hybrid Networks: Can We Trust NetFlow Data?* by Tiago Fioreze Co-authors: Lisandro Zambenedetti Granville, Aiko Pras, Anna Sperotto, and Ramin Sadre * Tiago Fioreze, Lisandro Zambenedetti
More informationAd hoc networking using Wi-Fi during natural disasters: overview and improvements.
Ad hoc networking using Wi-Fi during natural disasters: overview and improvements. Matthijs Gielen University of Twente P.O.Box 217, 7500AE Enschede The Netherlands m.w.gielen@student.utwente.nl ABSTRACT
More informationIP Multicast Traffic Measurement Method with IPFIX/PSAMP
IP Multicast Traffic Measurement Method with IPFIX/PSAMP Atsushi Kobayashi, Yutaka Hirokawa, and Haruhiko Nishida NTT Information Sharing Platform Laboratories 3-9-11 Midori-cho, Musashino, Tokyo 18-8585,
More informationDomain Based Metering
Domain Based Metering Róbert Párhonyi 1 Bert-Jan van Beijnum 1 1 Faculty of Computer Science, University of Twente P.O. Box 217, 7500 AE Enschede, The Netherlands E-mail: {parhonyi, beijnum}@cs.utwente.nl
More informationThis chapter provides information to configure Cflowd.
Cflowd In This Chapter This chapter provides information to configure Cflowd. Topics in this chapter include: Cflowd Overview on page 564 Operation on page 565 Cflowd Filter Matching on page 569 Cflowd
More informationDesign and Implementation of Measurement-Based Resource Allocation Schemes Using the Realtime Traffic Flow Measurement Architecture
Design and Implementation of Measurement-Based Resource Allocation Schemes Using the Realtime Traffic Flow Measurement Architecture Robert D. Callaway, Michael Devetsikiotis, and Chao Kan Department of
More informationset active-probe (PfR)
set active-probe (PfR) set active-probe (PfR) To configure a Performance Routing (PfR) active probe with a forced target assignment within a PfR map, use the set active-probe command in PfR map configuration
More informationTraffic Flow Measurements within IP Networks: Requirements, Technologies and Standardization
Traffic Flow Measurements within IP Networks: Requirements, Technologies and Standardization Jürgen Quittek NEC Europe Ltd., Network Laboratories, Heidelberg, Germany Tanya Szeby, Georg Carle, Sebastian
More informationEnemy Territory Traffic Analysis
Enemy Territory Traffic Analysis Julie-Anne Bussiere *, Sebastian Zander Centre for Advanced Internet Architectures. Technical Report 00203A Swinburne University of Technology Melbourne, Australia julie-anne.bussiere@laposte.net,
More informationTHE EFFICIENCY OF CONSTRAINT BASED ROUTING IN MPLS NETWORKS
VOLUME: 9 NUMBER: 5 SPECIAL ISSUE THE EFFICIENCY OF CONSTRAINT BASED ROUTING IN MPLS NETWORKS Martin MEDVECKY Department of Telecommunications, Faculty of Electrical Engineering and Information Technology,
More informationUvA-DARE (Digital Academic Repository)
UvA-DARE (Digital Academic Repository) Dimensioning network links: A new look at equivalent bandwidth Pras, A.; Nieuwenhuis, L.; van de Meent, R.; Mandjes, M.R.H. Published in: IEEE Network DOI: 10.1109/MNET.2009.4804330
More informationApplication of SDN: Load Balancing & Traffic Engineering
Application of SDN: Load Balancing & Traffic Engineering Outline 1 OpenFlow-Based Server Load Balancing Gone Wild Introduction OpenFlow Solution Partitioning the Client Traffic Transitioning With Connection
More informationPractical Design of Upper-Delay Bounded Switched Local Area Network
Practical Design of Upper-Delay Bounded ed Local Area Network M. O. EYINAGHO** Electrical and Information Engineering Department, Covenant University, Ota, Nigeria eyimon@yahoo.com ABSTRACT When designing
More informationA Fluid-Flow Characterization of Internet1 and Internet2 Traffic *
A Fluid-Flow Characterization of Internet1 and Internet2 Traffic * Joe Rogers and Kenneth J. Christensen Department of Computer Science and Engineering University of South Florida Tampa, Florida 33620
More informationThe Network Data Handling War: MySQL vs. NfDump
The Network Data Handling War: vs. Rick Hofstede, Anna Sperotto, Tiago Fioreze, and Aiko Pras University of Twente Centre for Telematics and Information Technology Faculty of Electrical Engineering, Mathematics
More informationDeliverable 1.1.6: Finding Elephant Flows for Optical Networks
Deliverable 1.1.6: Finding Elephant Flows for Optical Networks This deliverable is performed within the scope of the SURFnet Research on Networking (RoN) project. These deliverables are partly written
More informationMigration Based Page Caching Algorithm for a Hybrid Main Memory of DRAM and PRAM
Migration Based Page Caching Algorithm for a Hybrid Main Memory of DRAM and PRAM Hyunchul Seok Daejeon, Korea hcseok@core.kaist.ac.kr Youngwoo Park Daejeon, Korea ywpark@core.kaist.ac.kr Kyu Ho Park Deajeon,
More informationWeb File Transmission by Object Packaging Performance Comparison with HTTP 1.0 and HTTP 1.1 Persistent Connection
Web File Transmission by Performance Comparison with and Hiroshi Fujinoki, Murugesan Sanjay, and Chintan Shah Department of Computer Science Southern Illinois University at Edwardsville Edwardsville, Illinois
More informationTM ALGORITHM TO IMPROVE PERFORMANCE OF OPTICAL BURST SWITCHING (OBS) NETWORKS
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 232-7345 TM ALGORITHM TO IMPROVE PERFORMANCE OF OPTICAL BURST SWITCHING (OBS) NETWORKS Reza Poorzare 1 Young Researchers Club,
More informationBGP Inbound Optimization Using Performance Routing
BGP Inbound Optimization Using Performance Routing The PfR BGP Inbound Optimization feature introduced support for the best entrance selection for traffic that originates from prefixes outside an autonomous
More informationRD-TCP: Reorder Detecting TCP
RD-TCP: Reorder Detecting TCP Arjuna Sathiaseelan and Tomasz Radzik Department of Computer Science, King s College London, Strand, London WC2R 2LS {arjuna,radzik}@dcs.kcl.ac.uk Abstract. Numerous studies
More informationMeasurement-Based Network Link Dimensioning
Measurement-ased Network Link imensioning Ricardo de O. Schmidt, Hans van den erg,2 and iko Pras University of Twente, nschede, The Netherlands 2 TNO Information and ommunication Technology, elft, The
More informationTraffic Measurements for Link Dimensioning
Traffic Measurements for Link Dimensioning A Case Study Remco van de Meent, Aiko Pras, Michel Mandjes, Hans van den Berg, and Lambert Nieuwenhuis University of Twente The Netherlands meent@cs.utwente.nl
More informationIntelligent WAN NetFlow Monitoring Deployment Guide
Cisco Validated design Intelligent WAN NetFlow Monitoring Deployment Guide September 2017 Table of Contents Table of Contents Deploying the Cisco Intelligent WAN... 1 Deployment Details...1 Deploying NetFlow
More informationA Ns2 model for the Xbox System Link game Halo
A Ns2 model for the Xbox System Link game Halo Tanja Lang, Grenville Armitage Centre for Advanced Internet Architectures. Technical Report 030613A Swinburne University of Technology Melbourne, Australia
More informationNetwork Readiness Guide Technology Readiness for Personalized Learning and College and Career Standards
Network Readiness Guide Technology Readiness for Personalized Learning and College and Career Standards Is Your School Network Ready? Network readiness is an important factor in any new IT project at companies
More informationDesign and Implementation of Measurement-Based Resource Allocation Schemes Within The Realtime Traffic Flow Measurement Architecture
Design and Implementation of Measurement-Based Resource Allocation Schemes Within The Realtime Traffic Flow Measurement Architecture Robert D. allaway and Michael Devetsikiotis Department of Electrical
More informationGarbage Collection (2) Advanced Operating Systems Lecture 9
Garbage Collection (2) Advanced Operating Systems Lecture 9 Lecture Outline Garbage collection Generational algorithms Incremental algorithms Real-time garbage collection Practical factors 2 Object Lifetimes
More informationConfiguring Performance Routing Cost Policies
Configuring Performance Routing Cost Policies Last Updated: October 10, 2011 This module describes how to configure and apply Cisco IOS Performance Routing (PfR) cost policies. Performance Routing is an
More informationINTERNET TRAFFIC MEASUREMENT (PART II) Gaia Maselli
INTERNET TRAFFIC MEASUREMENT (PART II) Gaia Maselli maselli@di.uniroma1.it Prestazioni dei sistemi di rete 2 Overview Basic concepts Characterization of traffic properties that are important to measure
More informationAnalysis of Elephant Users in Broadband Network Traffic
Analysis of in Broadband Network Traffic Péter Megyesi and Sándor Molnár High Speed Networks Laboratory, Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics,
More informationThe rollout of IPv6. Is its usage increasing rapidly? J.W.C. Beusink
The rollout of IPv6 Is its usage increasing rapidly? J.W.C. Beusink jwc@beusink.com ABSTRACT This paper discusses the current level of IPv6 usage on the Abilene network. The relation between usage of IPv6
More informationAdaptation of Real-time Temporal Resolution for Bitrate Estimates in IPFIX Systems
Adaptation of Real-time Temporal Resolution for Bitrate Estimates in IPFIX Systems Rosa Vilardi, Luigi Alfredo Grieco, Gennaro Boggia DEE - Politecnico di Bari - Italy Email: {r.vilardi, a.grieco, g.boggia}@poliba.it
More informationOvercoming PCI-Express Physical Layer Challenges
Overcoming PCI-Express Physical Layer Challenges PCI Express is a ubiquitous and flexible bus addressing many markets. Unfortunately this flexibility can also cause integration issues that are very difficult
More informationAutomatic Generation of Graph Models for Model Checking
Automatic Generation of Graph Models for Model Checking E.J. Smulders University of Twente edwin.smulders@gmail.com ABSTRACT There exist many methods to prove the correctness of applications and verify
More informationNetwork Support for Multimedia
Network Support for Multimedia Daniel Zappala CS 460 Computer Networking Brigham Young University Network Support for Multimedia 2/33 make the best of best effort use application-level techniques use CDNs
More informationIntroducing Frame Relay
Frame Relay CCNA 4 Note Much of the information in this presentation comes from the CCNP 2 version 3.0 module on Frame Relay. I find a lot of the information in CCNA 4 module 5 Frame Relay not very well
More informationPerformance Evaluation of Active Route Time-Out parameter in Ad-hoc On Demand Distance Vector (AODV)
Performance Evaluation of Active Route Time-Out parameter in Ad-hoc On Demand Distance Vector (AODV) WADHAH AL-MANDHARI, KOICHI GYODA 2, NOBUO NAKAJIMA Department of Human Communications The University
More informationGeneralized Burst Assembly and Scheduling Techniques for QoS Support in Optical Burst-Switched Networks
Generalized Assembly and cheduling Techniques for Qo upport in Optical -witched Networks Vinod M. Vokkarane, Qiong Zhang, Jason P. Jue, and Biao Chen Department of Computer cience, The University of Texas
More information[MS-SQOS]: Storage Quality of Service Protocol. Intellectual Property Rights Notice for Open Specifications Documentation
[MS-SQOS]: Intellectual Property Rights Notice for Open Specifications Documentation Technical Documentation. Microsoft publishes Open Specifications documentation ( this documentation ) for protocols,
More informationIP SLAs Overview. Finding Feature Information. Information About IP SLAs. IP SLAs Technology Overview
This module describes IP Service Level Agreements (SLAs). IP SLAs allows Cisco customers to analyze IP service levels for IP applications and services, to increase productivity, to lower operational costs,
More informationTelecommunication Services Engineering Lab. Roch H. Glitho
1 Quality of Services 1. Terminology 2. Technologies 2 Terminology Quality of service Ability to control network performance in order to meet application and/or end-user requirements Examples of parameters
More informationConfiguring Advanced Radio Settings on the WAP371
Article ID: 5069 Configuring Advanced Radio Settings on the WAP371 Objective Radio settings are used to configure the wireless radio antenna and its properties on the wireless access point (WAP) device
More informationNetwork Readiness Guide Technology Readiness for Personalized Learning and College and Career Standards
Network Readiness Guide Technology Readiness for Personalized Learning and College and Career Standards Is Your School Network Ready? Network readiness is an important factor in any new IT project at organizations
More informationFast RTP Retransmission for IPTV - Implementation and Evaluation
Fast RTP Retransmission for IPTV - Implementation and Evaluation M.J. Prins, M. Brunner, G. Karagiannis, H. Lundqvist, and G. Nunzi Abstract With the deployment of IPTV reliability for multicast is becoming
More informationComparison of Shaping and Buffering for Video Transmission
Comparison of Shaping and Buffering for Video Transmission György Dán and Viktória Fodor Royal Institute of Technology, Department of Microelectronics and Information Technology P.O.Box Electrum 229, SE-16440
More informationWeb File Transmission by Object Packaging Performance Comparison with HTTP 1.0 and HTTP 1.1 Persistent Connection
Web File Transmission by Performance Comparison with HTTP 1. and Hiroshi Fujinoki, Murugesan Sanjay, and Chintan Shah Department of Computer Science Southern Illinois University at Edwardsville Edwardsville,
More informationEffect of Payload Length Variation and Retransmissions on Multimedia in a WLANs
Effect of Payload Length Variation and Retransmissions on Multimedia in 8.a WLANs Sayantan Choudhury Dept. of Electrical and Computer Engineering sayantan@ece.ucsb.edu Jerry D. Gibson Dept. of Electrical
More informationA Comparison of Error Metrics for Learning Model Parameters in Bayesian Knowledge Tracing
A Comparison of Error Metrics for Learning Model Parameters in Bayesian Knowledge Tracing Asif Dhanani Seung Yeon Lee Phitchaya Phothilimthana Zachary Pardos Electrical Engineering and Computer Sciences
More informationCHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS
28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the
More informationEqualLogic Storage and Non-Stacking Switches. Sizing and Configuration
EqualLogic Storage and Non-Stacking Switches Sizing and Configuration THIS WHITE PAPER IS FOR INFORMATIONAL PURPOSES ONLY, AND MAY CONTAIN TYPOGRAPHICAL ERRORS AND TECHNICAL INACCURACIES. THE CONTENT IS
More informationTuning RED for Web Traffic
Tuning RED for Web Traffic Mikkel Christiansen, Kevin Jeffay, David Ott, Donelson Smith UNC, Chapel Hill SIGCOMM 2000, Stockholm subsequently IEEE/ACM Transactions on Networking Vol. 9, No. 3 (June 2001)
More informationMonitor Application Health
About Application Experience, on page 1 Enable Cisco NetFlow Collection, on page 1 View the Application Experience of a Client Device, on page 2 Monitor the Health of All Applications, on page 3 Monitor
More informationA Novel Priority-based Channel Access Algorithm for Contention-based MAC Protocol in WBANs
A Novel Priority-based Channel Access Algorithm for Contention-based MAC Protocol in WBANs BeomSeok Kim Dept. of Computer Engineering Kyung Hee University Yongin 446-701, Korea passion0822@khu.ac.kr Jinsung
More informationInternational Journal of Advance Engineering and Research Development. Simulation Based Improvement Study of Overprovisioned IP Backbone Network
Scientific Journal of Impact Factor (SJIF): 4.72 International Journal of Advance Engineering and Research Development Volume 4, Issue 8, August -2017 e-issn (O): 2348-4470 p-issn (P): 2348-6406 Simulation
More informationTDDD82 Secure Mobile Systems Lecture 6: Quality of Service
TDDD82 Secure Mobile Systems Lecture 6: Quality of Service Mikael Asplund Real-time Systems Laboratory Department of Computer and Information Science Linköping University Based on slides by Simin Nadjm-Tehrani
More informationIntended status: Informational Expires: January 5, 2015 July 4, 2014
DNSOP Internet-Draft Intended status: Informational Expires: January 5, 2015 G. Deng N. Kong S. Shen CNNIC July 4, 2014 Approach on optimizing DNS authority server placement draft-deng-dns-authority-server-placement-00
More informationENHANCING ENERGY EFFICIENT TCP BY PARTIAL RELIABILITY
ENHANCING ENERGY EFFICIENT TCP BY PARTIAL RELIABILITY L. Donckers, P.J.M. Havinga, G.J.M. Smit, L.T. Smit University of Twente, department of Computer Science, PO Box 217, 7 AE Enschede, the Netherlands
More informationTechnology Challenges for Clouds. Henry Newman CTO Instrumental Inc
Technology Challenges for Clouds Henry Newman CTO Instrumental Inc hsn@instrumental.com I/O Modeling Plan: What is the Weather March 31, 2010 Henry Newman Instrumental Inc/CTO hsn@instrumental.com Agenda
More informationNot all SD-WANs are Created Equal: Performance Matters
SD-WAN Lowers Costs and Increases Productivity As applications increasingly migrate from the corporate data center into the cloud, networking professionals are quickly realizing that traditional WANs were
More informationSource Routing Algorithms for Networks with Advance Reservations
Source Routing Algorithms for Networks with Advance Reservations Lars-Olof Burchard Communication and Operating Systems Technische Universitaet Berlin ISSN 1436-9915 No. 2003-3 February, 2003 Abstract
More informationNET0183 Networks and Communications
Lectures 7 and 8 Measured performance of an Ethernet Ethernet is a CSMA/CD network. Carrier Sense Multiple Access with Collision Detection 1 Historical Case Study http://portal.acm.org/beta/citation.cfm?id=359044
More informationA QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism
A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada and Akira Chugo Fujitsu Laboratories Ltd. 4-1-1, Kamikodanaka, Nakahara, Kawasaki,
More informationResearch Article Average Bandwidth Allocation Model of WFQ
Modelling and Simulation in Engineering Volume 2012, Article ID 301012, 7 pages doi:10.1155/2012/301012 Research Article Average Bandwidth Allocation Model of WFQ TomášBaloghandMartinMedvecký Institute
More informationThe Basics of Network Structure
The Basics of Network Structure James M. Cook University of Maine at Augusta james.m.cook@maine.edu Keywords Betweenness; Centrality; Closeness; Degree; Density; Diameter; Distance; Clique; Connected Component;
More informationBIG-IP Analytics: Implementations. Version 12.1
BIG-IP Analytics: Implementations Version 12.1 Table of Contents Table of Contents Setting Up Application Statistics Collection...5 What is Analytics?...5 About HTTP Analytics profiles...5 Overview: Collecting
More informationChapter H through R. loss (PfR), page 28. load-balance, page 23 local (PfR), page 24 logging (PfR), page 26
Chapter H through R holddown (PfR), page 3 host-address (PfR), page 5 hub, page 7 inside bgp (PfR), page 8 interface (PfR), page 10 interface tunnel (global configuration), page 12 jitter (PfR), page 13
More informationFile Size Distribution on UNIX Systems Then and Now
File Size Distribution on UNIX Systems Then and Now Andrew S. Tanenbaum, Jorrit N. Herder*, Herbert Bos Dept. of Computer Science Vrije Universiteit Amsterdam, The Netherlands {ast@cs.vu.nl, jnherder@cs.vu.nl,
More informationCause Analysis of Packet Loss in Underutilized Enterprise Network Links
Cause Analysis of Packet Loss in Underutilized Enterprise Network Links 2005.12.21 Thesis Defense Deepali Agrawal deepali@postech.ac.kr Distributed Processing & Network Management Lab. Department of Computer
More informationUsing NetFlow Filtering or Sampling to Select the Network Traffic to Track
Using NetFlow Filtering or Sampling to Select the Network Traffic to Track First Published: June 19, 2006 Last Updated: December 17, 2010 This module contains information about and instructions for selecting
More informationTop-Down Network Design
Top-Down Network Design Chapter Two Analyzing Technical Goals and Tradeoffs Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Technical Goals Scalability Availability Performance Security Manageability
More informationResource Guide Implementing QoS for WX/WXC Application Acceleration Platforms
Resource Guide Implementing QoS for WX/WXC Application Acceleration Platforms Juniper Networks, Inc. 1194 North Mathilda Avenue Sunnyvale, CA 94089 USA 408 745 2000 or 888 JUNIPER www.juniper.net Table
More informationVisualization of Node Interaction Dynamics in Network Traces
Visualization of Node Interaction Dynamics in Network Traces Jürgen Schönwälder AIMS 2009, Enschede, 2009-07-01 Co-authors: Petar Dobrev, Sorin Stancu-Mara Support: EU IST-EMANICS Network of Excellence
More informationIntroduction to Network Discovery and Identity
The following topics provide an introduction to network discovery and identity policies and data: Host, Application, and User Detection, on page 1 Uses for Host, Application, and User Discovery and Identity
More informationQoS provisioning. Lectured by Alexander Pyattaev. Department of Communications Engineering Tampere University of Technology
QoS provisioning Lectured by Alexander Pyattaev Department of Communications Engineering Tampere University of Technology alexander.pyattaev@tut.fi March 6, 2012 Outline 1 Introduction 2 QoS support elements
More informationMcGill University - Faculty of Engineering Department of Electrical and Computer Engineering
McGill University - Faculty of Engineering Department of Electrical and Computer Engineering ECSE 494 Telecommunication Networks Lab Prof. M. Coates Winter 2003 Experiment 5: LAN Operation, Multiple Access
More informationTop-Down Network Design
Top-Down Network Design Chapter Five Designing a Network Topology Original slides copyright by Cisco Press & Priscilla Oppenheimer Network Topology Design Issues Hierarchy Redundancy Modularity Well-defined
More informationCisco Performance Routing
Cisco Performance Routing As enterprise organizations grow their businesses, the demand for real-time application performance and a better application experience for users increases. For example, voice
More informationECE 610: Homework 4 Problems are taken from Kurose and Ross.
ECE 610: Homework 4 Problems are taken from Kurose and Ross. Problem 1: Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 248. Suppose
More informationOptimal Path Planning with A* Search Algorithm
Optimal Path Planning with A* Search Algorithm M. Michael Nourai Department of Computer Science University of Massachusetts Lowell mnourai@cs.uml.edu ABSTRACT In this paper I describe my findings and implementation
More informationEIGRP Dynamic Metric Calculations
The features enables the Enhanced Interior Gateway Routing Protocol (EIGRP) to use dynamic raw radio-link characteristics (current and maximum bandwidth, latency, and resources) to compute a composite
More informationBIG-IP Analytics: Implementations. Version 13.1
BIG-IP Analytics: Implementations Version 13.1 Table of Contents Table of Contents Setting Up Application Statistics Collection...5 What is Analytics?...5 About HTTP Analytics profiles... 5 Overview:
More informationPerformance of Multicast over Unicast in Wi-Fi
Performance of Multicast over Unicast in Wi-Fi Ruben Groot Roessink University of Twente P.O. Box 217, 7500AE Enschede The Netherlands r.grootroessink@student.utwente.nl ABSTRACT This paper describes research
More informationAn Energy Consumption Analytic Model for A Wireless Sensor MAC Protocol
An Energy Consumption Analytic Model for A Wireless Sensor MAC Protocol Hung-Wei Tseng, Shih-Hsien Yang, Po-Yu Chuang,Eric Hsiao-Kuang Wu, and Gen-Huey Chen Dept. of Computer Science and Information Engineering,
More informationRouter Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13
Router Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13 Department of Electrical Engineering and Computer Sciences University of California Berkeley Review: Switch Architectures Input Queued
More informationPassive One-Way-Delay Measurements and Data Export
Passive One-Way-Delay Measurements and Data Export Tanja Zseby, Lutz Mark, Carsten Schmoll, Guido Pohl Fraunhofer FOKUS Kaiserin-Augusta-Allee 31, 10589 Berlin, Germany {zseby, mark, schmoll, pohl}@fokus.fraunhofer.de
More informationA Synthetic Traffic Model for Half-Life
A Synthetic Traffic Model for Half-Life Tanja Lang, Grenville Armitage, Phillip Branch, Hwan-Yi Choo Centre for Advanced Internet Architectures Swinburne University of Technology Melbourne, Australia tlang@swin.edu.au,
More informationsflow Agent Contents 14-1
14 sflow Agent Contents Overview..................................................... 14-2 Flow Sampling by the sflow Agent........................... 14-2 Counter Polling by the sflow Agent...........................
More informationCE Ethernet Operation
25 CHAPTER Note The terms "Unidirectional Path Switched Ring" and "UPSR" may appear in Cisco literature. These terms do not refer to using Cisco ONS 15xxx products in a unidirectional path switched ring
More informationThe Cisco WebEx Node for the Cisco ASR 1000 Series Delivers the Best Aspects of On-Premises and On-Demand Web Conferencing
. White Paper The Cisco WebEx Node for the Cisco ASR 1000 Series Delivers the Best Aspects of On-Premises and On-Demand Web Conferencing Executive Summary The Cisco WebEx Node for the Cisco ASR 1000 Series,
More informationDNS: a statistical analysis of name server traffic at local network-to-internet connections
DNS: a statistical analysis of name server traffic at local network-to-internet connections C. J. Brandhorst, University of Twente {c.j.brandhorst}@cs.utwente.nl ABSTRACT This paper puts forward a purely
More informationImpact of End-to-end QoS Connectivity on the Performance of Remote Wireless Local Networks
Impact of End-to-end QoS Connectivity on the Performance of Remote Wireless Local Networks Veselin Rakocevic School of Engineering and Mathematical Sciences City University London EC1V HB, UK V.Rakocevic@city.ac.uk
More informationEnterprise QoS. Tim Chung Network Architect Google Corporate Network Operations March 3rd, 2010
Enterprise QoS Tim Chung Network Architect Google Corporate Network Operations March 3rd, 2010 Agenda Challenges Solutions Operations Best Practices Note: This talk pertains to Google enterprise network
More informationChallenging the Supremacy of Traffic Matrices in Anomaly Detection
Challenging the Supremacy of Matrices in Detection ABSTRACT Augustin Soule Thomson Haakon Ringberg Princeton University Multiple network-wide anomaly detection techniques proposed in the literature define
More informationELECTRONIC COPY SAMKNOWS ANALYSIS OF ROGERS BROADBAND PERFORMANCE IN FEBRUARY 2015 ELECTRONIC COPY. Delivered by to: Shane Jansen.
ELECTRONIC COPY SAMKNOWS ANALYSIS OF ROGERS BROADBAND PERFORMANCE IN FEBRUARY 2015 Delivered by Email to: Shane Jansen Rogers Dated: February 25, 2015 ELECTRONIC COPY [THIS PAGE LEFT INTENTIONALLY BLANK]
More informationConfiguring Modular QoS on Link Bundles
A link bundle is a group of one or more ports that are aggregated together and treated as a single link. This module describes QoS on link bundles. Line Card, SIP, and SPA Support Feature ASR 9000 Ethernet
More informationReducing SpaceWire Time-code Jitter
Reducing SpaceWire Time-code Jitter Barry M Cook 4Links Limited The Mansion, Bletchley Park, Milton Keynes, MK3 6ZP, UK Email: barry@4links.co.uk INTRODUCTION Standards ISO/IEC 14575[1] and IEEE 1355[2]
More information