D. Harrison, S. Kalyanaraman, and S. Ramakrishnan. Overlay Bandwidth Services: Basic framework and an edge-toedge closed-loop building block, Jan. 2001. Preprint. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
MCA: A Rate-based End-to-end Multicast Congestion Avoidance.. - Li, Kalyanaraman (2002) Self-citation (Kalyanaraman) (Correct)
No context found.
D. Harrison, S. Kalyanaraman, S. Ramakrishnan, "Overlay Bandwidth Services: Basic Framework and an Edge-to-Edge Closed-Loop Building Block," preprint, 2001. Available from: http://www.ecse.rpi.edu/Homepages/shivkuma/research/papers-rpi.html
Distributed Dynamic Capacity Contracting: An overlay.. - Yuksel, Kalyanaraman Self-citation (Kalyanaraman) (Correct)
....we do not focus on detailed description of them. VII. DISTRIBUTED DCC: POCC ARCHITECTURE In this section, we develop necessary components in order to adapt Distributed DCC framework to POCC architecture. First, we will briefly describe an edge to edge congestion control mechanism Riviera [23], 24] Then, we will address problems defined in Section III B for the case of overlaying Distributed DCC over Riviera. This will fit Distributed DCC to the POCC architecture. Also, to summarize the previous and this section, Table II shows differences between Distributed DCC s PFCC and POCC ....
....to the POCC architecture. Also, to summarize the previous and this section, Table II shows differences between Distributed DCC s PFCC and POCC versions. A. Edge to Edge Congestion Control: Riviera We now describe overall properties of an edge to edge congestion control scheme, Riviera [23], 24] which we will also use in our experiments later in the paper. Riviera takes advantage of two way communication between ingress and egress edge routers in a diff serv network. Ingress sends a forward feedback to egress in response to feedback from egress, and egress sends backward ....
D. Harrison, S. Kalyanaraman, and S. Ramakrishnan, "Overlay bandwidth services: Basic framework and edge-to-edge closedloop building block," Poster in SIGCOMM, 2001.
Price Discovery at Network Edges - Arora, Yuksel, Kalyanaraman.. (2002) Self-citation (Kalyanaraman) (Correct)
....period i, it uses two parameters: queue length at the edge (edge queue) q i 1 and estimated capacity C i . With a simple coordination between ingress and egress edge routers, both q i 1 and C i are available in an edge to edge framework. By using edge to edge congestion detection techniques (e.g. [15]) C i can be varied to alleviate congestion, it typically decreases during congestion epochs (so that a part of available capacity can be used for draining the queues that build up during congestion) and increases (to increase utilization of the edge to edge capacity) when there is no congestion. ....
....architecture to provide better than best effort services, it is desirable to perform complex operations at network edges and simple forwarding operations at network interior. In such an edge to edge scenario, it is possible to coordinate edge routers in order to achieve various objectives [15], such as congestion control, capacity estimation, flow control. By employing edge to edge congestion control, it is possible to push congestion back from the interior of a network and distribute it across network edges where the smaller congestion problems can be handled with flexible and ....
[Article contains additional citation context not shown here]
D. Harrison, S. Kalyanaraman, and S. Ramakrishnan, "Overlay bandwidth services: Basic framework and edge-to-edge closed-loop building block," Poster in the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2001.
MCA: A Rate-based End-to-end Multicast Congestion Avoidance.. - Li, Kalyanaraman (2002) Self-citation (Kalyanaraman) (Correct)
....goes at the rate allowed by the worst congested receiver and does not expect packet marking or other support from intermediate bottlenecks. Congestion is detected autonomously at receivers using the concept of accumulation and simple thresholding techniques proposed in our recent unicast work [8]. Congestion feedback to senders can be in the form of single bit congestion indication (CIs) or as a multi bit output rate measure. The feedback is sparse in the sense that at most one feedback is generated per measurement period (unlike multiple loss indications generated during packet loss) ....
.... scale receiver sets (up to 10,000 receivers) There exist another distinct class of congestion control schemes which are multirate (eg: RLC, FLID DL [18] 5] Our proposed scheme, MCA, uses a new concept of accumulation and simple thresholding techniques proposed in our recent unicast work [8] to achieve congestion avoidance on a purely end to end basis, i.e. with no marking support from interior bottlenecks. In this sense, our work is comparable to the unicast work of TCP Vegas [4] which assumes a similar model, albeit in a unicast, window based TCP context. Just like TCP Vegas [12] ....
[Article contains additional citation context not shown here]
D. Harrison, S. Kalyanaraman, S. Ramakrishnan, "Overlay Bandwidth Services: Basic Framework and an Edge-to-Edge Closed-Loop Building Block," preprint, 2001. Available from: http://www.ecse.rpi.edu/Homepages/shivkuma/research/papersrpi. html
OverQoS: An Overlay based Architecture for Enhancing.. - Subramanian, Stoica.. (2004) (2 citations) (Correct)
No context found.
D. Harrison, S. Kalyanaraman, and S. Ramakrishnan. Overlay Bandwidth Services: Basic framework and an edge-toedge closed-loop building block, Jan. 2001. Preprint.
OverQoS: An Overlay based Architecture for Enhancing .. - Subramanian.. (2004) (2 citations) (Correct)
No context found.
D. Harrison, S. Kalyanaraman, and S. Ramakrishnan. Overlay Bandwidth Services: Basic framework and an edge-toedge closed-loop building block, Jan. 2001. Preprint.
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