Z. Cao, Z. Wang, and E. Zegura, "Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-flow State," in IEEE INFOCOM 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....impact on the overall performance of the Internet. Concerns about the impact of streaming media on Internet performance have translated into a variety of research papers that propose new network protocols [4] 5] or network routers that seek to lessen the impact of streaming media [6] 7] [8], 9] or that characterize streaming behavior [10] 11] 12] 13] 14] 15] to better understand its impact. A key point of the latter category of research is to characterize typical streaming traffic produced by today s Internet applications. Unfortunately, to the best of our knowledge, ....

Z. Cao, Z. Wang, and E. Zegura, "Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State," in Proceedings of IEEE INFOCOM, Mar. 2000.

....networks. There has been an increased interest in developing Differentiated Services (DS) architecture for provisioning IP QoS over satellite networks [7] DS aims to provide scalable service differentiation in the Internet that can be used to permit differentiated pricing of Internet service [8, 9, 10, 11, 12]. In this paper we present a new scheme in which during congestion, IP bandwidth is allocated in proportion to the users negotiated bandwidth agreement. 1 0 7803 7651 X 03 17.00 2003 IEEE 2 IEEEAC paper 41197, Updated December 10, 2002 The current Internet, over terrestrial and satellite ....

....than the allowed fraction of SIR is reduced to its maximum allowed data rate. Thus PAB differentiates between flows and allocates bandwidth in proportion to the SIR of the flows. 3. IMPLEMENTATION OF PAB Our technique for implementing PAB is based on the principles of Differentiated Services [8, 10]. To avoid per flow state information in the core routers, our technique uses labels to indicate the ratio of flow rate to the SIR of the flow. Packets are marked with labels at the edge of the satellite network. The ratio of flow rate to the SIR of each flow is encoded as the label on the flow s ....

Z. Cao, Z. Wang, E. Zegura, "Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State", Proceedings IEEE INFOCOM 2000, Conference on Computer Communications, p.922-31 vol.2.

.... the unresponsive UDP flows to expand to use the vacant bandwidth, or, worse, contribute to congestion collapse of the Internet [9] In light of this, recent research has explored router queue management approaches to identify and police unresponsive flows [10] 11] 12] 13] 14] 15] [16]. Such research often models unresponsive flows as transmitting data at a constant packet size and constant packet rate (CBR) or, as firehose applications, transmitting at an unyielding, maximum rate. However, commercial media products have been shown to not be strictly CBR [17] and, although ....

Z. Cao, Z. Wang, and E. Zegura, "Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State," in Proceedings of IEEE INFOCOMM, Mar. 2000.

....management [13] mechanisms in network routers. For instance, per flow packet scheduling mechanisms like Weighted Fair Queueing (WFQ) 7] 8] attempt to offer fair allocations of bandwidth to flows contending for the same link. So do Core Stateless Fair Queueing (CSFQ) 9] Rainbow Fair Queueing [10] and CHOKe [11] which are approximations of WFQ that do not require core routers to maintain per flow state. Active queue management mechanisms like Fair Random Early Detection (FRED) 14] also attempt to limit malicious or unresponsive flows by preferentially discarding packets from flows that ....

....wide area networks in which thousands of flows may be active at any one time. Recognizing the scalability difficulties of Fair Queuing, several researchers have proposed more scalable core stateless approximations of Fair Queuing, such as Core Stateless Fair Queuing [9] Rainbow Fair Queuing [10] and CHOke [11] The general idea behind these mechanisms is that edge routers label packets entering the network with the state of their associated flows, and core routers use the state recorded in the packets to de 13 cide whether to drop them or when to schedule them for transmission. This ....

Z. Cao, Z. Wang, and E. Zegura, "Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State," in Proc. of IEEE Infocom '2000, March 2000.

No context found.

Z. Cao, Z. Wang, and E. Zegura, "Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-flow State," in IEEE INFOCOM 2000.

No context found.

Z. Cao, Z. Wang, E. Zegura, "Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State", Proceedings IEEE INFOCOM 2000,Conference on Computer Communications, p.922-31 vol.2.

No context found.

Z. Cao, Z. Wang and E. Zegura. Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State. IEEE INFOCOM, 2000.

No context found.

Z. Cao, Z. Wang, E. Zegura, "Rainbow Fair Queuing: Fair Bandwidth Sharing Without PerFlow State", Proceedings IEEE INFOCOM 2000,Conference on Computer Communications, p.922-31 vol.2.

No context found.

Z. Cao, Z. Wang, E. Zegura, "Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State", Proceedings IEEE INFOCOM 2000,Conference on Computer Communications, p.922-31 vol.2.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC