See this document in CiteSeerX!

Deterministic Analysis of Flow and Congestion Control Policies in Virtual Circuits (1990)  (Make Corrections)  (3 citations)
Samar Singh Department of Computer Science and Engineering, Indian Institute...



  Home/Search   Context   Related

 
View or download:
cornell.edu/skeshav/tenet...SiAgKe90.ps
berkeley.edu/pub/tenet/Pa...SiAgKe90.ps
cornell.edu/Info/People/s...SiAgKe90.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cornell.edu/skeshav/papers (more)
From:  cornell.edu/Info/People/...papers
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Network congestion can be triggered by transient phenomena that are hard to study using classical stochastic approaches. We show that a deterministic analysis of virtual circuits (VC) allows us to precisely quantify these transients. We analyze some existing window and rate based flow control schemes, and propose a new protocol, 2P, that exploits the deterministic nature of a VC to provide optimal performance. Our analysis focuses on two issues: utilization of available bandwidth and congestion ... (Update)

Context of citations to this paper:   More

.... since it has been shown that a deterministic modeling of a RAS network allows network transients to be calculated exactly [7]. Waclawsky and Agrawala have developed and analyzed a similar deterministic model for studying the effect of window flow control protocols...

...a stochastic model for a conversation in a network of RASs. This is an extension of the deterministic model presented in References [53, 58, 59]. We model a conversation in a RAS network as a sequence of regularly spaced packets from a source to a destination over a series of...

Cited by:   More
Flow Control in High-Speed Networks with Long Delays - Keshav (1992)   (Correct)
Packet-Pair Flow Control - Keshav (1994)   (Correct)
A Control-Theoretic Approach to Flow Control - Keshav (1991)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Round-Robin Scheduling for Max-Min Fairness in Data Networks - Hahne (1991)   (Correct)
0.2:   Edge Provisioning and Fairness in VPN-Diffserv Networks - Khalil, Braun (2000)   (Correct)
0.2:   Edge Provisioning and Fairness in VPN-DiffServ Networks - Khalil, Braun (2001)   (Correct)

Similar documents based on text:   More   All
0.1:   Duality in the Parametric Polytope and its Application to a.. - Subramani (2000)   (Correct)
0.0:   An Empirical Evaluation of Virtual Circuit Holding .. - Keshav, Lund.. (1995)   (Correct)
0.0:   Transient Modeling Synthesis: a flexible analysis/synthesis .. - Verma, Levine, Meng (1997)   (Correct)

Related documents from co-citation:   More   All
3:   Congestion avoidance and control - Jacobson - 1988
3:   Design and Analysis of a Flow Control Algorithm for a Network of Rate Allocating.. (context) - Keshav, Agrawala et al. - 1991
3:   Asymptotically Optimal Design of Congestion Control for High Speed Data Networks (context) - Mitra - 1991

BibTeX entry:   (Update)

S. Singh, A. K. Agrawala and S. Keshav, Deterministic Analysis of Flow and Congestion Control Policies in Virtual Circuits, Tech. Rpt.-2490, University of Maryland, June 1990. http://citeseer.ist.psu.edu/singh90deterministic.html   More

@techreport{ singh90deterministic,
    author = "S. Singh and A. Agrawala and S. Keshav",
    title = "Deterministic Analysis of Flow and Congestion Control Policies in Virtual Circuits",
    number = "2490",
    year = "1990",
    url = "citeseer.ist.psu.edu/singh90deterministic.html" }
Citations (may not include all citations):
1330   Congestion Avoidance and Control - Jacobson - 1988
790   Analysis and Simulation of a Fair-queueing Algorithm (context) - Demers, Keshav et al. - 1990
151   Congestion Avoidance in Computer Networks with a Connectionl.. - Jain, Ramakrishnan - 1988
123   Improving Round-Trip Time Estimates in Reliable Transport Pr.. - Karn, Partridge - 1987
96   A Delay-based Approach for Congestion Avoidance in Interconn.. - Jain - 1989
78   On Packet Switches with infinite Storage (context) - Nagle - 1987
64   A New Architecture for Packet Switching Network Protocols (context) - Zhang - 1989
62   Flow Control : A Comparative Survey (context) - Gerla, Kleinrock - 1980
59   NETBLT: A Bulk Data Transfer Protocol (context) - Clark, Lambert et al. - 1987
42   Why TCP timers don't work well (context) - Zhang - 1986
40   A timeout-based congestion control scheme for window flow-co.. - Jain - 1986
37   Round Robin Scheduling for Fair Flow Control in Data Communi.. (context) - Hahne - 1986
22   Window and Acknowledgement Strategy in TCP (context) - Clark - 1982
20   Congestion Control in TCP/IP Internetworks (context) - Nagle - 1984
13   Queueing Disciplines and Passive Congestion Control in Byte-.. (context) - Morgan - 1989
13   Design and Analysis of Flow Control Algorithm for Networks o.. (context) - Keshav, Agrawala et al.
4   Fairness in Window Flow- controlled Computer Networks (context) - Wong, De Marca - 1989
3   Dynamic behavior of data flow within Virtual Circuits (context) - Waclawsky, Agrawala - 1989

Documents on the same site (http://www.cs.cornell.edu/skeshav/papers.html):   More
The ENTRAPID Protocol Development Environment - Huang Sharma (1999)   (Correct)
Fuzzy Prediction of Timeseries - Khedkar, Keshav (1992)   (Correct)
Stop-and-Go Service Using Hierarchical Round Robin - Keshav Att   (Correct)

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