GREEN: An Active Queue Management Algorithm for a Self Managed Internet
|
|
- Arnold Bond
- 8 years ago
- Views:
Transcription
1 : An Active Queue Management Agorithm for a Sef Managed Internet Bartek Wydrowski and Moshe Zukerman ARC Specia Research Centre for Utra-Broadband Information Networks, EEE Department, The University of Mebourne, Parkvie, Vic. 300, Austraia Abstract - In this paper we introduce a new active queue management (AQM) agorithm caed. provides high ink utiization whist maintaining ow deay and packet oss. enabes ow atency interactive appications such as teephony and network games. is shown to outperform the current AQM agorithms. Certain performance probems with current AQMs are discussed.. INTRODUCTION The Internet is essentiay a network of interconnected queues. The two most fundamenta experiences of a packet whist traversing this network are deay and oss. The Internet is facing increasing packet oss rates and queuing deays. Lost packets waste resources, and may resut in congestion coapse [2], whereas queuing causes packet deay which reduces the quaity of interactive appications. Active queue management (AQM) agorithms were introduced to aeviate the probems of network congestion. In genera, AQM schemes contro congestion by controing fow. Congestion is measured and a contro action is taken. There are two approaches for measuring congestion: () queue based, and (2) fow based. In queue based AQMs congestion is observed by queue size. The drawback of this is that a backog of packets is inherenty necessitated by the contro mechanism, as congestion is observed when the queue is aready positive. This creates unnecessary deay and jitter. Fow based AQMs, on the other hand, determine congestion and take action based on the packet arriva rate. For such schemes, backog, and a its adverse impications, is not necessary for the contro mechanism. The tota Network deay is essentiay the sum of queuing deay (in routers and switches) and propagation deay. Currenty queuing deay dominates most round trip times (RTT). The goa shoud be to reduce the network deay to just the propagation deay. Currenty packet oss is both a signa of congestion and resut of overfowing queues. The Internet engineering task force (IETF) are introducing expicit congestion notification (ECN) to feedback congestion by packet marking instead. (We wi refer to congestion notification to mean either packet dropping or ECN). With ECN, AQM queues can operate with minima packet oss. The next generation of network paradigm wi have AQMs that maintain high ink utiisation whist achieving the QoS requirements of imited packet oss and deay. In this paper, we introduce a new AQM agorithm caed that achieves this objective. The paper is organised as foows: in Chapter 2 we describe current AQMs, pointing out their drawbacks. In Chapter 3 we demonstrate the performance of versus the other AQMs. In Chapters 5 and 6 we discuss the impications of depoying or in on the Internet. 2. CURRENT AQM ALGORITHMS In this section, we describe the currenty proposed AQMs and discuss performance issues. Droptai: Under Droptai when queue overfow occurs, arriving packets are dropped. This eads to high queue sizes and high oss rates at congested inks. Droptai is effectivey no management. Random Eary Drop (RED) [2] [3] [5]: RED is a first generation AQM. The rate of congestion notification is a function of the queue size. As discussed in depth in [5] RED suffers from severe shortcomings. The queue size is not a good indicator of the severity of the congestion, and the eve of congestion notifications issued may be too great and bursty, eading to excessive packet oss. RED is prone to periods of high oss foowed by ink underutiization. BLUE [5]: BLUE is a hybrid fow and queue based congestion contro scheme. It uses packet oss (queue) and ink under-utiization (fow) events to adjust the rate of congestion notification. The congestion notification rate p m is increased at a set rate if the queue size exceeds a threshod L, and it is decreased if the ink is ide. The amount of increase is d, and decrease d2, at a rate of /freezetime. We uncovered a subte drawback with BLUE that may imit its practicabiity. BLUE behaves we if operated within a region of RTT and number of connections N for which the parameters d and d2 were set. However, changes in the dominant RTT of the connections going through the queue, or a significant change in N can invaidate the parameter settings and ead to queue backog osciation between oss and under-utiization. The amount of change of notification rate p m during a queue fu or ink ide event, is the product of the time spent in this event mutipied by the rate of change d(,2)/freezetime. This time is reated to the deay in the response of the TCP sources to the changed notification rate (2 x RTT). The greater the RTT, the greater wi be the p m adjustment. If the RTT increases, so does the change in p m and this may resut in backog osciation. This was observed in simuations using the recommended parameter settings of [5]. Another cause of instabiity is a arge change in the number of connections. It is not our intention to expore BLUE in depth here, but this instabiity is the resut of the adjustment of congestion notification rate p m by a constant d or d2, despite the non inear reation of p m and N. Reca
2 that based on the TCP Friendy Equation [2] the function of p m versus N requires arger changes of p m for arger N. Random Exponentia Marking () [6]: is a framework for communicating congestion information from inks to sources by exponentia marking. A compete impementation consists of marking at the ink and decoding at the source, however operation on the current Internet with ony the ink agorithm and TCP has been suggested [6]. Three different aternative pricing agorithms PC-PC3 constitute. PC3 is evauated here Eq (), because of its superiority over PC and PC2 [6]: + PC3: p t + ) = [ p ( t) + γ ( α b ( t) + x ( t) c )] () ( where x is the aggregate arriva rate, c ink capacity, b backog, and α and γ are pricing constants. An exponentia function determines the marking probabiity from the ink price: p ( t) m = φ (2) where φ contros marking. Athough works very we in a steady state situation, the behaviour in transient conditions, and with reaisticay constrained buffer sizes is not necessariy optima. The experimenta resuts detai how in an environment with a wide variation in N and finite buffers the performance suffers. 3. The agorithm is a feedback contro function which adjusts the rate of congestion notification in response to the fow based congestion measure, x est, the estimated data arriva rate. is based on a threshod function. If the ink s estimated data arriva rate x est is above the target ink capacity c, the rate of congestion notification, P, is incremented by P at a rate of / T. Conversey, if x est is beow c, P is decremented by P at a rate of / T. The agorithm appies probabiistic marking of incoming packets at the rate P, either by dropping packets, or setting the ECN. Let the step function U(x) be defined by: + x 0 U ( x) = (3) x < 0. Therefore, P = P + P U x est c ). (4) ( t The target ink capacity, c t is assigned a vaue just beow the actua ink capacity c, typicay 0.97 c, so that the queue size converges to 0. Incoming data rate estimation is performed using exponentia averaging: x est = (-exp(-de/k))*(b/de)+exp(-de/k)* x est (5) where De is the inter-packet deay, B the packet size and K the time constant. Other arriva rate estimation techniques coud aso be used successfuy. In [4] Eq (5) is shown to converge to the actua data rate under a wide set of conditions. There is a reationship between PC3 and. If Eq (2) is inearised, m = P, the exponentia marking is eiminated. Furthermore if the buffer term α = 0, and the inear constant γ is repaced with the step function (3), s congestion notification rate P becomes equivaent to s Price p. 4. PERFORMANCE EVALUATION A number of simuations were performed to compare the performance of,, BLUE, RED and Drop- Tai using the NS-2 simuator [8]. The network topoogy (Fig ) and parameters common to a trias are described here. The nodes A-J are the sources and Node 2 is the sink. The AQM agorithm is paced in Node, which represents the ingress of an edge router and governs the 2 ink. Each tria asted 20 seconds with measurements being taken after a 20 second warm up period. Mutipe TCP connections can originate from each source. The active TCP connections were eveny distributed among the A-J sources. Connections were started at a uniformy distributed time over the test period with a uniformy distributed duration between 3 and 23 seconds. The packet size was 000 bytes. Figure. Simuation Scenario B C D E F G H I 4ms 00Mb 9ms 00Mb ms 00Mb 9ms 00Mb 37ms 00Mb 73ms 00Mb 0ms 00Mb 20ms 00Mb A J 3ms 00Mb 20ms 0Mb 8ms 00Mb The configuration parameters for each of the AQMs foowed recommended settings: RED : min th =20% and max th = 80% of the queue size. BLUE: Threshod L is 66% of the queue size. d=0.00, d2=0.0002, freezetime=0ms. 2
3 Packet Loss Probabiity Deay (ms) Fig a: Packet Loss Probabiity vs Number of TCP Sessions Average Aggregate Number of TCP sessions DropTai RED BLUE Fig 2a: Mean Queueing Deay vs Max Buffer Size Max Buffer Size (ms Deay) DropTai RED BLUE : (Parameters adapted from Interworking with Reno [6]) γ=0.0 φ=.003 α=0. updatetime=0.0 bo=55. (Pubic domain rem-mark.cc, was used). : T=0ms, P=0.00,C =0.97% of Capacity, K=0.. A agorithms were configured to use ECN. Tria : The AQMs were tested under different traffic oads, by varying the number of TCP sessions. The tota number of TCP sessions activated in a 20 s simuation period was varied from 00 to 300 ( to 4 concurrent sessions on average), in increments of 00 sessions. The buffer size was 9 packets (72.8ms), making some of the connections bandwidth deay greater than this. Tabe summarizes the utiisation, oss and deay of the 3 simuation periods (00 to 300 sessions) from each AQM. RED and Droptai suffered unacceptabe oss and deay across the whoe range of resuts. BLUE performed we in packet oss and deay, at the price of utiisation. To match the utiisation of the other agorithms, the buffer size woud have to be increased significanty resuting in arger average backog and oss. sighty outperformed. The traffic in an edge router may vary from tens to hundreds of connections, which represents a vast change in the aggregation of the traffic. An AQM agorithm must cope with this range of traffic conditions without reconfiguration. performs better across a wide range of sessions for reasons detaied in Trai 3. Tabe. Tria Resut Summary Droptai RED BLUE Uti % Loss % Deay(ms) Tria 2: The buffer size was varied to determine the performance of AQMs under the reaistic constrained of finite buffer, which is cose to the bandwidth deay product of the network. 000 TCP sessions over 20 seconds were initiated for each queue size. Utiisation, packet oss and deay were measured. For brevity, ony the deay performance is shown Fig Ta. This tria shows ceary how queue based AQMs maintain a higher average backog. Figure Ta demonstrates that the backog for RED, Droptai and BLUE is reated to the buffer size. The Fow based AQMs, and can maintain the same utiisation with ow backog even with high buffer sizes. This means it is possibe to have a arge buffer, to reduce packet oss, without the drawback of high packet deay common to queue based fow contro agorithms. Indeed with and, it is possibe to seect a ow target utiisation, and operate amost entirey in the zero queue region, eiminating queuing deay. A agorithms except BLUE maintained high utiisation as BLUE sacrificed utiisation for ower backog and oss. There is a singe sweet-spot for BLUE at around 00 ms queue size, where greater maximum buffer sizes increase the queuing deay, and a ower buffer size decreases the utiisation. In contrast, has consistent performance across a variety of buffer sizes. By operating with a sufficient buffer size, is in a very robust region where queuing deay and packet oss probabiity are ow. This makes much easier to depoy, and more ikey to perform better with unpredictabe traffic patterns. has a very simiar performance to in this tria.
4 Tria 3: Tria 3 expores further the behaviour of and in an edge router. The deay of the botteneck ink -2 was varied from 0 to 80 ms in this tria. 400 TCP sources were started during the 20 second simuation period (43 concurrent fows average). A buffer size of 9 packets was used. Any AQM depoyed must be robust to variations in RTT, which resut from the wide use of RED and drop-tai. For an AQM to be robust, there must be a gracefu degradation in queuing performance if the actua bandwidth deay product becomes greater than the buffer size. Figures 3a and 3b show how the AQMs performance degrades when the botteneck ink s deay is increased, making the bandwidth deay product greater than the queue size (around 30 ms ink -2 deay). s oss rate increased significanty beyond this threshod, whereas s performance degraded more gracefuy. The difference in performance between and originates in s inear price adjustment (x-c) in Eq (). exhibits the probem that when the traffic drops, the price P is decreased drasticay because of (x-c). A drop in arriva rate does not aways represent a drop in demand. PC3 misinterprets the instantaneous fow decrease to a decrease in demand and decreases its price in two situations: ) Finite queues mean there is a possibiity of overfow. Upon overfow, the fow rate decreases drasticay. misinterprets this as a decrease in demand and drops the price heaviy. By dropping the ink price, invites another overfow. remains cam upon overfow by ignoring the magnitude of x-c. 2) With ony tens of fows active, the traffic is bursty and refects TCPs ramp behaviour. Smooth Gaussian packet arrivas begin to occur with ony hundreds of fows. The parameters of the AQM must be vaid for this range of traffic without reconfiguration, as the edge router ives in such an environment. As is more aggressive in price adjustment, the bursty packet arrivas with tens of sources can be misinterpreted as a drop in demand. maintains a more steady dropping probabiity in face of ow number of sources which resuts in a ower packet oss probabiity as seen in Tria 2. Decreasing γ in can achieve this for one set of operating conditions, however at the cost of performance at higher fow eves. wi not aways outperform. There is a sacrifice in the convergence rate by not having s x-c term from Eq, however this is margina. By definition, the arriva rate must be matched to the ink capacity for a system to maintain high utiisation. With finite buffers, this variation in arriva rate must be tighty bounded, otherwise overfow wi occur. So ony sma deviations in x away from c occur in a stabe system with ow oss and high utiisation, and most of the contro action is done in this region. Large differences in x-c are more ikey due to buffer overfow or TCP ramp behaviour in the ow aggregation case. By using a step function as a marking probabiity adjustment, ignores arge differences which are more ikey discontinuous conditions, such as buffer overfow, than changes in bandwidth demand. This makes robust in a wide set of reaistic constrained conditions. Utiisation Packet Loss Probabiity Fig 3a: Packet Loss Probabiity vs 0.04 RTT botteneck ink deay (ms) Fig 3b: Link Utiisation vs RTT botteneck ink deay (ms) 5. MULTI-SERVICE IMPLICATIONS Diffserv is being proposed as a means for providing QoS to different services. Packets are abeed with a priority and a scheduing decision is made at each node based on this priority. With a simper soution is possibe, where capacity distribution is sef-managed according to the utiity functions of the sources [6]. Capacity aocation is performed on a macro-economic mode; the congestion notification rate can be viewed as the price of sending a byte. If capacity is oversubscribed, the price goes up and sources receive more congestion notifications. Sources that pace a higher vaue on having more capacity, simpy
5 react ess to the price increase, and do not reduce their rate as much despite the congestion notification rate increase. In the simpest case, et us assume there are two types of appications, ) rea-time (RT) and 2) non-rea-time (NRT). RT appications require ow deay and may not impement congestion contro. NRT appications are insensitive to deay, and impement congestion contro, such as TCP, ie: HTTP, FTP and Tenet. A ink using wi deiver ow deay and oss to RT appications, as s congestion contro forces NRT appications to buffer at the source (sow send rate) in face of increased RT demand. Assuming that the tota capacity is greater than the RT peak demand, s congestion notification contros the responsive NRT arriva rate so that the aggregate arriva rate (NRT+RT) is beow the capacity. Depoying enabes both casses of traffic to coexist, without the extra infrastructure of packet cassification, or cass capacity reservations. 6. DEPLOYMENT WITH NO ECN Currenty the Internet has few ECN enabed TCP sources, so the significant congestion notification mechanism is packet dropping. A side effect of AQM agorithms which reduce the network atency, ( and ), is that a high congestion notification rate is required to contro TCP sessions which become very aggressive with ow RTT. With ow RTT and the resuting high packet dropping rates for non-ecn sources, the effective throughput suffers and TCP experiences significant timeouts. In a network that is not fuy ECN capabe, a guaranteed minimum packet atency is required for non-ecn TCP sources to keep the packet oss beow a maximum toerabe amount max. The key concept is that an artificia packet deay is induced to minimise packet oss. This deay, D, can be the minimum deay required to maintain a packet oss requirement. ECN enabed packets need not suffer this deay. The fu technique is discussed in [9]. 7. CONCLUSION This paper has presented some deficiencies in we known queue management agorithms and provided an aternative agorithm,. was shown to maintain a ow packet oss rate as we as ow average queue size. The agorithm is simpe, robust, ow in computationa compexity, easiy configured, and sefcontained to a singe router, making it easy to depoy. Depoyment of ow deay, ow oss agorithms such as wi improve Internet performance and enabe rea-time appications. ACKNOWLEDGEMENTS This work was financiay supported by Agient Technoogies. REFERENCES [] Ion Stoica, Scott Shenker, Hui Zhang, "Core-Stateess Fair Queueing: A Scaabe Architecture to Approximate Fair Bandwidth Aocations in High Speed Networks", SIGCOMM, 998. [2] Foyd, S. and Fa, K, Router mechanisms to support end-to-end congestion contro., Tech.rep, LBL, 997. ( [3] S. Foyd and V. Jacobson, Random eary detection gateways for congestion avoidance IEEE/ACM Transactions on Networking, vo., Number 4, pp397-43, August 993. [4] I. Stoica, S. Shenker, and H. Zhang. Core-stateess fair queueing: Achieving approximatey fair bandwidth aocations in high speed networks, Technica Report CMU-CS-98-36, Carnegie Meon University. June 998. [5] W. Feng, D. Kandur, D. Saha, K. Shin, "Bue: A New Cass of Active Queue Management Agorithms" U. Michigan CSE-TR , Apri 999. [6] S. Athuraiya and S.H. Low. "Optimization Fow Contro, II: Random Exponentia Marking", Submitted for pubication, May [7] W. Feng, D. Kandur, D. Saha, K. Shin, "Stochastic Fair Bue: A Queue Management Agorithm for Enforcing Fairness", in Proc. of INFOCOM 200, Apri 200. [8] The Network Simuator - ns-2 homepage: [9] B. Wydrowski and M.Zukerman, On the Transition to the Next Generation ow atency TCP/IP Internet, (submitted for pubication, avaiabe
Rate-Based Active Queue Management: A Green Algorithm in Congestion Control
Rate-Based Active Queue Management: A Green Algorithm in Congestion Control Balveer Singh #1, Diwakar Saraswat #2 #1 HOD Computer Sc. & Engg. #2 Astt. Prof. Computer Sc. & Engg PKITM Mathura (UP) India
More informationSecure Network Coding with a Cost Criterion
Secure Network Coding with a Cost Criterion Jianong Tan, Murie Médard Laboratory for Information and Decision Systems Massachusetts Institute of Technoogy Cambridge, MA 0239, USA E-mai: {jianong, medard}@mit.edu
More informationFast Robust Hashing. ) [7] will be re-mapped (and therefore discarded), due to the load-balancing property of hashing.
Fast Robust Hashing Manue Urueña, David Larrabeiti and Pabo Serrano Universidad Caros III de Madrid E-89 Leganés (Madrid), Spain Emai: {muruenya,darra,pabo}@it.uc3m.es Abstract As statefu fow-aware services
More informationVirtual trunk simulation
Virtua trunk simuation Samui Aato * Laboratory of Teecommunications Technoogy Hesinki University of Technoogy Sivia Giordano Laboratoire de Reseaux de Communication Ecoe Poytechnique Federae de Lausanne
More informationComparative 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,
More informationLecture 7 Datalink Ethernet, Home. Datalink Layer Architectures
Lecture 7 Dataink Ethernet, Home Peter Steenkiste Schoo of Computer Science Department of Eectrica and Computer Engineering Carnegie Meon University 15-441 Networking, Spring 2004 http://www.cs.cmu.edu/~prs/15-441
More informationChapter 3: e-business Integration Patterns
Chapter 3: e-business Integration Patterns Page 1 of 9 Chapter 3: e-business Integration Patterns "Consistency is the ast refuge of the unimaginative." Oscar Wide In This Chapter What Are Integration Patterns?
More informationNovel Approach for Queue Management and Improvisation of QOS for Communication Networks
Novel Approach for Queue Management and Improvisation of QOS for Communication Networks J. Venkatesan 1, S. Thirumal 2 1 M. Phil, Research Scholar, Arignar Anna Govt. Arts College, Cheyyar, T.V Malai Dt,
More informationPricing Internet Services With Multiple Providers
Pricing Internet Services With Mutipe Providers Linhai He and Jean Warand Dept. of Eectrica Engineering and Computer Science University of Caifornia at Berkeey Berkeey, CA 94709 inhai, wr@eecs.berkeey.edu
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1 Scaabe Muti-Cass Traffic Management in Data Center Backbone Networks Amitabha Ghosh, Sangtae Ha, Edward Crabbe, and Jennifer
More information3.3 SOFTWARE RISK MANAGEMENT (SRM)
93 3.3 SOFTWARE RISK MANAGEMENT (SRM) Fig. 3.2 SRM is a process buit in five steps. The steps are: Identify Anayse Pan Track Resove The process is continuous in nature and handed dynamicay throughout ifecyce
More informationSimultaneous Routing and Power Allocation in CDMA Wireless Data Networks
Simutaneous Routing and Power Aocation in CDMA Wireess Data Networks Mikae Johansson *,LinXiao and Stephen Boyd * Department of Signas, Sensors and Systems Roya Institute of Technoogy, SE 00 Stockhom,
More information17: Queue Management. Queuing. Mark Handley
17: Queue Management Mark Handley Queuing The primary purpose of a queue in an IP router is to smooth out bursty arrivals, so that the network utilization can be high. But queues add delay and cause jitter.
More informationPerformance improvement of active queue management with per-flow scheduling
Performance improvement of active queue management with per-flow scheduling Masayoshi Nabeshima, Kouji Yata NTT Cyber Solutions Laboratories, NTT Corporation 1-1 Hikari-no-oka Yokosuka-shi Kanagawa 239
More informationScheduling in Multi-Channel Wireless Networks
Scheduing in Muti-Channe Wireess Networks Vartika Bhandari and Nitin H. Vaidya University of Iinois at Urbana-Champaign, USA vartikab@acm.org, nhv@iinois.edu Abstract. The avaiabiity of mutipe orthogona
More informationComparison of Traditional and Open-Access Appointment Scheduling for Exponentially Distributed Service Time
Journa of Heathcare Engineering Vo. 6 No. 3 Page 34 376 34 Comparison of Traditiona and Open-Access Appointment Scheduing for Exponentiay Distributed Service Chongjun Yan, PhD; Jiafu Tang *, PhD; Bowen
More informationNetwork congestion, its control and avoidance
MUHAMMAD SALEH SHAH*, ASIM IMDAD WAGAN**, AND MUKHTIAR ALI UNAR*** RECEIVED ON 05.10.2013 ACCEPTED ON 09.01.2014 ABSTRACT Recent years have seen an increasing interest in the design of AQM (Active Queue
More informationAdvanced ColdFusion 4.0 Application Development - 3 - Server Clustering Using Bright Tiger
Advanced CodFusion 4.0 Appication Deveopment - CH 3 - Server Custering Using Bri.. Page 1 of 7 [Figures are not incuded in this sampe chapter] Advanced CodFusion 4.0 Appication Deveopment - 3 - Server
More informationThe guaranteed selection. For certainty in uncertain times
The guaranteed seection For certainty in uncertain times Making the right investment choice If you can t afford to take a ot of risk with your money it can be hard to find the right investment, especiay
More informationAustralian Bureau of Statistics Management of Business Providers
Purpose Austraian Bureau of Statistics Management of Business Providers 1 The principa objective of the Austraian Bureau of Statistics (ABS) in respect of business providers is to impose the owest oad
More informationAn FDD Wideband CDMA MAC Protocol for Wireless Multimedia Networks
An FDD ideband CDMA MAC Protoco for ireess Mutimedia Networks Xudong ang Broadband and ireess Networking (BN) Lab Schoo of Eectrica and Computer Engineering Georgia Institute of Technoogy Atanta, GA 3332
More informationDynamic Pricing Trade Market for Shared Resources in IIU Federated Cloud
Dynamic Pricing Trade Market or Shared Resources in IIU Federated Coud Tongrang Fan 1, Jian Liu 1, Feng Gao 1 1Schoo o Inormation Science and Technoogy, Shiiazhuang Tiedao University, Shiiazhuang, 543,
More informationTraffic classification-based spam filter
Traffic cassification-based spam fiter Ni Zhang 1,2, Yu Jiang 3, Binxing Fang 1, Xueqi Cheng 1, Li Guo 1 1 Software Division, Institute of Computing Technoogy, Chinese Academy of Sciences, 100080, Beijing,
More informationBetting Strategies, Market Selection, and the Wisdom of Crowds
Betting Strategies, Market Seection, and the Wisdom of Crowds Wiemien Kets Northwestern University w-kets@keogg.northwestern.edu David M. Pennock Microsoft Research New York City dpennock@microsoft.com
More informationEarly access to FAS payments for members in poor health
Financia Assistance Scheme Eary access to FAS payments for members in poor heath Pension Protection Fund Protecting Peope s Futures The Financia Assistance Scheme is administered by the Pension Protection
More informationTCP, Active Queue Management and QoS
TCP, Active Queue Management and QoS Don Towsley UMass Amherst towsley@cs.umass.edu Collaborators: W. Gong, C. Hollot, V. Misra Outline motivation TCP friendliness/fairness bottleneck invariant principle
More informationGREEN: 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 feng@lanl.gov, akapadia@uiuc.edu, sunil@lanl.gov
More informationLoad Balancing in Distributed Web Server Systems with Partial Document Replication *
Load Baancing in Distributed Web Server Systems with Partia Document Repication * Ling Zhuo Cho-Li Wang Francis C. M. Lau Department of Computer Science and Information Systems The University of Hong Kong
More informationMulti-Robot Task Scheduling
Proc of IEEE Internationa Conference on Robotics and Automation, Karsruhe, Germany, 013 Muti-Robot Tas Scheduing Yu Zhang and Lynne E Parer Abstract The scheduing probem has been studied extensivey in
More informationEducation sector: Working conditions and job quality
European Foundation for the Improvement of Living and Working Conditions sector: Working conditions and job quaity Work pays a significant roe in peope s ives, in the functioning of companies and in society
More informationChapter 2 Traditional Software Development
Chapter 2 Traditiona Software Deveopment 2.1 History of Project Management Large projects from the past must aready have had some sort of project management, such the Pyramid of Giza or Pyramid of Cheops,
More informationTCP/IP Gateways and Firewalls
Gateways and Firewas 1 Gateways and Firewas Prof. Jean-Yves Le Boudec Prof. Andrzej Duda ICA, EPFL CH-1015 Ecubens http://cawww.epf.ch Gateways and Firewas Firewas 2 o architecture separates hosts and
More informationPricing and Revenue Sharing Strategies for Internet Service Providers
Pricing and Revenue Sharing Strategies for Internet Service Providers Linhai He and Jean Warand Department of Eectrica Engineering and Computer Sciences University of Caifornia at Berkeey {inhai,wr}@eecs.berkeey.edu
More informationMarket Design & Analysis for a P2P Backup System
Market Design & Anaysis for a P2P Backup System Sven Seuken Schoo of Engineering & Appied Sciences Harvard University, Cambridge, MA seuken@eecs.harvard.edu Denis Chares, Max Chickering, Sidd Puri Microsoft
More informationDesign Considerations
Chapter 2: Basic Virtua Private Network Depoyment Page 1 of 12 Chapter 2: Basic Virtua Private Network Depoyment Before discussing the features of Windows 2000 tunneing technoogy, it is important to estabish
More informationTechnical Support Guide for online instrumental lessons
Technica Support Guide for onine instrumenta essons This is a technica guide for Music Education Hubs, Schoos and other organisations participating in onine music essons. The guidance is based on the technica
More informationPerformance 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
More informationConference Paper Service Organizations: Customer Contact and Incentives of Knowledge Managers
econstor www.econstor.eu Der Open-Access-Pubikationsserver der ZBW Leibniz-Informationszentrum Wirtschaft The Open Access Pubication Server of the ZBW Leibniz Information Centre for Economics Kirchmaier,
More informationCapacity of Multi-service Cellular Networks with Transmission-Rate Control: A Queueing Analysis
Capacity of Muti-service Ceuar Networs with Transmission-Rate Contro: A Queueing Anaysis Eitan Atman INRIA, BP93, 2004 Route des Lucioes, 06902 Sophia-Antipois, France aso CESIMO, Facutad de Ingeniería,
More informationActive Queue Management and Wireless Networks
Active Queue Management and Wireless Networks Vikas Paliwal November 13, 2003 1 Introduction Considerable research has been done on internet dynamics and it has been shown that TCP s congestion avoidance
More informationFixed income managers: evolution or revolution
Fixed income managers: evoution or revoution Traditiona approaches to managing fixed interest funds rey on benchmarks that may not represent optima risk and return outcomes. New techniques based on separate
More informationLife Contingencies Study Note for CAS Exam S. Tom Struppeck
Life Contingencies Study Note for CAS Eam S Tom Struppeck (Revised 9/19/2015) Introduction Life contingencies is a term used to describe surviva modes for human ives and resuting cash fows that start or
More informationA Supplier Evaluation System for Automotive Industry According To Iso/Ts 16949 Requirements
A Suppier Evauation System for Automotive Industry According To Iso/Ts 16949 Requirements DILEK PINAR ÖZTOP 1, ASLI AKSOY 2,*, NURSEL ÖZTÜRK 2 1 HONDA TR Purchasing Department, 41480, Çayırova - Gebze,
More informationCooperative Content Distribution and Traffic Engineering in an ISP Network
Cooperative Content Distribution and Traffic Engineering in an ISP Network Wenjie Jiang, Rui Zhang-Shen, Jennifer Rexford, Mung Chiang Department of Computer Science, and Department of Eectrica Engineering
More informationRobust 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 {ganeshg@microsoft.com}, Microsoft Corporation,
More informationChapter 3: JavaScript in Action Page 1 of 10. How to practice reading and writing JavaScript on a Web page
Chapter 3: JavaScript in Action Page 1 of 10 Chapter 3: JavaScript in Action In this chapter, you get your first opportunity to write JavaScript! This chapter introduces you to JavaScript propery. In addition,
More informationPassive Queue Management
, 2013 Performance Evaluation of Computer Networks Objectives Explain the role of active queue management in performance optimization of TCP/IP networks Learn a range of active queue management algorithms
More informationOn Packet Marking Function of Active Queue Management Mechanism: Should It Be Linear, Concave, or Convex?
On Packet Marking Function of Active Queue Management Mechanism: Should It Be Linear, Concave, or Convex? Hiroyuki Ohsaki and Masayuki Murata Graduate School of Information Science and Technology Osaka
More informationCongestion Control Review. 15-441 Computer Networking. Resource Management Approaches. Traffic and Resource Management. What is congestion control?
Congestion Control Review What is congestion control? 15-441 Computer Networking What is the principle of TCP? Lecture 22 Queue Management and QoS 2 Traffic and Resource Management Resource Management
More informationmi-rm mi-recruitment Manager the recruitment solution for Talent Managers everywhere
mi-rm mi-recruitme Manager the recruitme soution for Tae Managers everywhere mi-rm mi-recruitme Manager Your very own tae manager First Choice Software has been a eading suppier of recruitme software since
More informationFace Hallucination and Recognition
Face Haucination and Recognition Xiaogang Wang and Xiaoou Tang Department of Information Engineering, The Chinese University of Hong Kong {xgwang1, xtang}@ie.cuhk.edu.hk http://mmab.ie.cuhk.edu.hk Abstract.
More informationGreenTE: Power-Aware Traffic Engineering
GreenTE: Power-Aware Traffic Engineering Mingui Zhang zmg6@mais.tsinghua.edu.cn Cheng Yi yic@emai.arizona.edu Bin Liu iub@tsinghua.edu.cn Beichuan Zhang bzhang@arizona.edu Abstract Current network infrastructures
More informationTelephony Trainers with Discovery Software
Teephony Trainers 58 Series Teephony Trainers with Discovery Software 58-001 Teephony Training System 58-002 Digita Switching System 58-003 Digita Teephony Training System 58-004 Digita Trunk Network System
More informationThe 4th International Conference on Internet Applications, Protocols and Services (NETAPPS2015)
The 4 Internationa Conference on Internet Appications, Protocos and Services (NETAPPS2015) Fairness in Active Queue Management Agorims: A Review Aeer Fayh Hassan, Suhaidi Hassan, and Suki Arif InterNetWorks
More informationAA Fixed Rate ISA Savings
AA Fixed Rate ISA Savings For the road ahead The Financia Services Authority is the independent financia services reguator. It requires us to give you this important information to hep you to decide whether
More informationWINMAG Graphics Management System
SECTION 10: page 1 Section 10: by Honeywe WINMAG Graphics Management System Contents What is WINMAG? WINMAG Text and Graphics WINMAG Text Ony Scenarios Fire/Emergency Management of Fauts & Disabement Historic
More informationInsertion and deletion correcting DNA barcodes based on watermarks
Kracht and Schober BMC Bioinformatics (2015) 16:50 DOI 10.1186/s12859-015-0482-7 METHODOLOGY ARTICLE Open Access Insertion and deetion correcting DNA barcodes based on watermarks David Kracht * and Steffen
More informationAdaptive Virtual Buffer(AVB)-An Active Queue Management Scheme for Internet Quality of Service
Adaptive Virtual Buffer(AVB)-An Active Queue Management Scheme for Internet Quality of Service Xidong Deng, George esidis, Chita Das Department of Computer Science and Engineering The Pennsylvania State
More informationPay-on-delivery investing
Pay-on-deivery investing EVOLVE INVESTment range 1 EVOLVE INVESTMENT RANGE EVOLVE INVESTMENT RANGE 2 Picture a word where you ony pay a company once they have deivered Imagine striking oi first, before
More informationA Distributed MAC Scheme Supporting Voice Services in Mobile Ad Hoc Networks 1
A Distributed MAC Scheme Supporting Voice Services in Mobie Ad Hoc Networks 1 Hai Jiang, Ping Wang, H. Vincent Poor, and Weihua Zhuang Department of Eectrica & Computer Engineering, University of Aberta,
More informationWIRELESS Mesh Networks (WMNs) have recently attracted
3968 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 2, NO. 8, AUGUST 23 A New MPLS-Based Forwarding Paradigm for Muti-Radio Wireess Mesh Networks Stefano Avaone and Giovanni Di Stasi Abstract Routing
More informationCOMPARISON OF DIFFUSION MODELS IN ASTRONOMICAL OBJECT LOCALIZATION
COMPARISON OF DIFFUSION MODELS IN ASTRONOMICAL OBJECT LOCALIZATION Františe Mojžíš Department of Computing and Contro Engineering, ICT Prague, Technicá, 8 Prague frantise.mojzis@vscht.cz Abstract This
More informationDESIGN OF ACTIVE QUEUE MANAGEMENT BASED ON THE CORRELATIONS IN INTERNET TRAFFIC
DESIGN OF ACTIVE QUEUE MANAGEMENT BASED ON THE CORRELATIONS IN INTERNET TRAFFIC KHALID S. AL-AWFI AND MICHAEL E. WOODWARD { k.s.r.alawf, m.e.woodward }@bradford.ac.uk Department of Computing, University
More informationarxiv:1506.05851v1 [cs.ai] 18 Jun 2015
Smart Pacing for Effective Onine Ad Campaign Optimization Jian Xu, Kuang-chih Lee, Wentong Li, Hang Qi, and Quan Lu Yahoo Inc. 7 First Avenue, Sunnyvae, Caifornia 9489 {xuian,kcee,wentong,hangqi,qu}@yahoo-inc.com
More informationUsing median filtering in active queue management for telecommunication networks
Using median filtering in active queue management for telecommunication networks Sorin ZOICAN *, Ph.D. Cuvinte cheie. Managementul cozilor de aşteptare, filtru median, probabilitate de rejectare, întârziere.
More informationTake me to your leader! Online Optimization of Distributed Storage Configurations
Take me to your eader! Onine Optimization of Distributed Storage Configurations Artyom Sharov Aexander Shraer Arif Merchant Murray Stokey sharov@cs.technion.ac.i, {shraex, aamerchant, mstokey}@googe.com
More informationBite-Size Steps to ITIL Success
7 Bite-Size Steps to ITIL Success Pus making a Business Case for ITIL! Do you want to impement ITIL but don t know where to start? 7 Bite-Size Steps to ITIL Success can hep you to decide whether ITIL can
More informationDesign and Analysis of a Hidden Peer-to-peer Backup Market
Design and Anaysis of a Hidden Peer-to-peer Backup Market Sven Seuken, Denis Chares, Max Chickering, Mary Czerwinski Kama Jain, David C. Parkes, Sidd Puri, and Desney Tan December, 2015 Abstract We present
More informationA New Statistical Approach to Network Anomaly Detection
A New Statistica Approach to Network Anomay Detection Christian Caegari, Sandrine Vaton 2, and Michee Pagano Dept of Information Engineering, University of Pisa, ITALY E-mai: {christiancaegari,mpagano}@ietunipiit
More informationRandomized Algorithms for Scheduling VMs in the Cloud
Randomized Agorithms for Scheduing VMs in the Coud Javad Ghaderi Coumbia University Abstract We consider the probem of scheduing VMs (Virtua Machines) in a muti-server system motivated by coud computing
More informationPerformance 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
More informationCERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY. Course Offered By: Indian Environmental Society
CERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY Course Offered By: Indian Environmenta Society INTRODUCTION The Indian Environmenta Society (IES) a dynamic and fexibe organization with a goba vision
More informationActive Queue Management A router based control mechanism
Active Queue Management A router based control mechanism Chrysostomos Koutsimanis B.Sc. National Technical University of Athens Pan Gan Park B.Sc. Ajou University Abstract In this report we are going to
More informationLeakage detection in water pipe networks using a Bayesian probabilistic framework
Probabiistic Engineering Mechanics 18 (2003) 315 327 www.esevier.com/ocate/probengmech Leakage detection in water pipe networks using a Bayesian probabiistic framework Z. Pouakis, D. Vaougeorgis, C. Papadimitriou*
More informationTERM INSURANCE CALCULATION ILLUSTRATED. This is the U.S. Social Security Life Table, based on year 2007.
This is the U.S. Socia Security Life Tabe, based on year 2007. This is avaiabe at http://www.ssa.gov/oact/stats/tabe4c6.htm. The ife eperiences of maes and femaes are different, and we usuay do separate
More informationThe eg Suite Enabing Rea-Time Monitoring and Proactive Infrastructure Triage White Paper Restricted Rights Legend The information contained in this document is confidentia and subject to change without
More informationWe are XMA and Viglen.
alearn with Microsoft 16pp 21.07_Layout 1 22/12/2014 10:49 Page 1 FRONT COVER alearn with Microsoft We are XMA and Vigen. Ca us now on 0115 846 4900 Visit www.xma.co.uk/aearn Emai alearn@xma.co.uk Foow
More informationWith the arrival of Java 2 Micro Edition (J2ME) and its industry
Knowedge-based Autonomous Agents for Pervasive Computing Using AgentLight Fernando L. Koch and John-Jues C. Meyer Utrecht University Project AgentLight is a mutiagent system-buiding framework targeting
More informationRicoh Healthcare. Process Optimized. Healthcare Simplified.
Ricoh Heathcare Process Optimized. Heathcare Simpified. Rather than a destination that concudes with the eimination of a paper, the Paperess Maturity Roadmap is a continuous journey to strategicay remove
More informationData Centers as Demand Response Resources in the Electricity Market: Some Preliminary Results
Data Centers as Demand Response Resources in the Eectricity Maret: Some Preiminary Resuts Rui Wang ECE Department Drexe University Phiadephia, PA 19104, USA rui.wang@drexe.edu Nagarajan Kandasamy ECE Department
More informationBreakeven analysis and short-term decision making
Chapter 20 Breakeven anaysis and short-term decision making REAL WORLD CASE This case study shows a typica situation in which management accounting can be hepfu. Read the case study now but ony attempt
More informationEuropean Journal of Operational Research
European Journa of Operationa Research 198 (2009) 435 446 Contents ists avaiabe at ScienceDirect European Journa of Operationa Research journa homepage: www.esevier.com/ocate/ejor Production, Manufacturing
More informationIterative Water-filling for Load-balancing in Wireless LAN or Microcellular Networks
terative Water-fiing for Load-baancing in Wireess LAN or Microceuar Networks Jeremy K. Chen Theodore S. Rappaport Gustavo de Veciana Wireess Networking and Communications Group (WNCG), be University of
More informationSELECTING THE SUITABLE ERP SYSTEM: A FUZZY AHP APPROACH. Ufuk Cebeci
SELECTING THE SUITABLE ERP SYSTEM: A FUZZY AHP APPROACH Ufuk Cebeci Department of Industria Engineering, Istanbu Technica University, Macka, Istanbu, Turkey - ufuk_cebeci@yahoo.com Abstract An Enterprise
More informationTeamwork. Abstract. 2.1 Overview
2 Teamwork Abstract This chapter presents one of the basic eements of software projects teamwork. It addresses how to buid teams in a way that promotes team members accountabiity and responsibiity, and
More information(12) Patent Application Publication (10) Pub. N0.: US 2006/0105797 A1 Marsan et al. (43) Pub. Date: May 18, 2006
(19) United States US 20060105797A (12) Patent Appication Pubication (10) Pub. N0.: US 2006/0105797 A1 Marsan et a. (43) Pub. Date: (54) METHOD AND APPARATUS FOR (52) US. C...... 455/522 ADJUSTING A MOBILE
More informationThe growth of online Internet services during the past decade has
IEEE DS Onine, Voume 2, Number 4 Designing an Adaptive CORBA Load Baancing Service Using TAO Ossama Othman, Caros O'Ryan, and Dougas C. Schmidt University of Caifornia, Irvine The growth of onine Internet
More informationBusiness schools are the academic setting where. The current crisis has highlighted the need to redefine the role of senior managers in organizations.
c r o s os r oi a d s REDISCOVERING THE ROLE OF BUSINESS SCHOOLS The current crisis has highighted the need to redefine the roe of senior managers in organizations. JORDI CANALS Professor and Dean, IESE
More informationHuman Capital & Human Resources Certificate Programs
MANAGEMENT CONCEPTS Human Capita & Human Resources Certificate Programs Programs to deveop functiona and strategic skis in: Human Capita // Human Resources ENROLL TODAY! Contract Hoder Contract GS-02F-0010J
More informationApplying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks
Applying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks Jian Chen and Victor C.M. Leung Department of Electrical and Computer Engineering The
More informationThe definition of insanity is doing the same thing over and over again and expecting different results
insurance services Sma Business Insurance a market opportunity being missed Einstein may not have known much about insurance, but if you appy his definition to the way existing brands are deveoping their
More informationSNMP Reference Guide for Avaya Communication Manager
SNMP Reference Guide for Avaya Communication Manager 03-602013 Issue 1.0 Feburary 2007 2006 Avaya Inc. A Rights Reserved. Notice Whie reasonabe efforts were made to ensure that the information in this
More informationThe BBC s management of its Digital Media Initiative
The BBC s management of its Digita Media Initiative Report by the Comptroer and Auditor Genera presented to the BBC Trust s Finance and Compiance Committee, 13 January 2011 Department for Cuture, Media
More informationNCH Software FlexiServer
NCH Software FexiServer This user guide has been created for use with FexiServer Version 1.xx NCH Software Technica Support If you have difficuties using FexiServer pease read the appicabe topic before
More informationPrecise assessment of partial discharge in underground MV/HV power cables and terminations
QCM-C-PD-Survey Service Partia discharge monitoring for underground power cabes Precise assessment of partia discharge in underground MV/HV power cabes and terminations Highy accurate periodic PD survey
More informationIncome Protection Options
Income Protection Options Poicy Conditions Introduction These poicy conditions are written confirmation of your contract with Aviva Life & Pensions UK Limited. It is important that you read them carefuy
More informationVoIP Network Dimensioning using Delay and Loss Bounds for Voice and Data Applications
VoIP Network Dimensioning using Delay and Loss Bounds for Voice and Data Applications Veselin Rakocevic School of Engineering and Mathematical Sciences City University, London, UK V.Rakocevic@city.ac.uk
More informationAnalyzing 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.
More informationHow To Get Acedo With Microsoft.Com
alearn with Microsoft We are XMA. Ca us now on 0115 846 4900 Visit www.xma.co.uk/aearn Emai alearn@xma.co.uk Foow us @WeareXMA Introduction Use our 'steps to alearn' framework to ensure you cover a bases...
More informationBig Data projects and use cases. Claus Samuelsen IBM Analytics, Europe csa@dk.ibm.com
Big projects and use cases Caus Samuesen IBM Anaytics, Europe csa@dk.ibm.com IBM Sofware Overview of BigInsights IBM BigInsights Scientist Free Quick Start (non production): IBM Open Patform BigInsights
More information