V. Padmanabhan. Addressing the Challenges of Web Data Transport. PhD thesis, Univ. of California, Berkeley, September 1998. 26  Home/Search   Document Details and Download   Summary   Related Articles   Check

....is built on top of TCP, which provides reliable delivery between communication peers. Though TCP has been successful in delivering web traffic in many environments, previous research work have revealed the following intrinsic problems with TCP that hinders further performance improvement [8] [18]. TCP is a connection oriented protocol that ensures communication reliability. The participants first setup a communication channel by a three way handshaking process, which is lengthy for high delay environment and short connections like HTML page delivery. Web servers could redirect the ....

....with various tag distances under loss rate 10 1000 10000 0 20 40 60 80 100 120 140 160 time (ms) Request UDP CATP Fig. 17. Internet test VII. RELATED WORKS Research on HTTP transportation protocols mainly focused on how to adapt TCP to transfer short HTTP files. Persistent HTTP[8] [18], 19] P HTTP) has been proposed to reduce the setup cost in TCP. TCP fast start [19] is a technique that utilizes prior connections information to avoid slow start of TCP thus speed up short file downloading. Performance of various HTTP transportation protocols was analyzed in [9] The authors ....

V. N. Padmanabhan, "Addressing the Challenges of Web Data Transport." PhD thesis, Computer Science Division, University of California at Berkeley, 1998.

....ance and control algorithms. However, while TCP does implement congestion control [17] many applications including the Web [5, 11] use several logically differ ent streams in parallel, using multiple concurrent TCP connections between the same pair of hosts. As several researchers have shown [2, 3, 27, 28, 42], these con current connections compete with rather than learn from each other about network conditions to the same receiver, and end up being unfair to other applications that use fewer connections. The ability to share conges tion information between concurrent flows is therefore a useful ....

PADMANABHAN, V. Addressing the Challenges of Web Data Transport. PhD thesis, Univ. of California, Berkeley, Sep 1998.

....error losses were run with the same sequence of packet drops. This allows obtaining statistically sound data with the limited number of replications. We have extended the Linux kernel to print the values of internal TCP variables into the kernel log. In general, tcpstats is used for this purpose [Pad98] it is the de facto complement for tcpdump in the TCP analysis. Unfortunately, tcpstats is available only for BSD Unix OS. In the future, we plan porting tcpstats to Linux and developing an analysis tool similar to MultiTracer [LRK 99] The new tool will allow automatically combining and ....

V. N. Padmanabhan. Addressing the Challenges of Web Data Transport. PhD thesis, University of California at Berkeley, September 1998.

....across flows. In RFC 2140 [34] Touch proposes a scheme called TCP control block interdependence, where the goal is to share part of the TCP control block between connections to improve transient TCP performance, while maintaining backwardcompatibility with existing implementations. In [1, 24], the authors present an integrated approach to TCP where TCP control block state is shared for better congestion control and loss recovery for concurrent connections. However, both 4 these proposals restrict themselves to simultaneous TCP connections and do not consider other types of ....

....congestion management across concurrent rate based audio flows and window based TCP flows) 5. 2 Transport level solutions Motivated in part by the drawbacks of the above solutions and by the desire to improve Web transfer performance, various researchers have proposed modifications to TCP itself [1, 24, 34]. Although these approaches do solve most of the problems associated with the Web scenario, they are transport specific. They only handle TCP transfers, and applications that use other protocols cannot take advantage of them. Prominent examples of such applications include various real time ....

PADMANABHAN,V.N.Addressing the Challenges of Web Data Transport. PhD thesis, Univ. of California, Berkeley, 1998. In preparation.

....transcoding, the systems will automatically notify the authors for the usage. 4 Web warehouse as large scale intelligent cache Data retrievals from remote web sites are far more expensive than from local sources due to the scarcity of bandwidth and the inherent latency in distance data transport [10]. The rapid growth of the web implies the demand for bandwidth will far out pace the rate of network construction. Even with sufficient bandwidth, the inherent latency is considerable, for example, the latency in transoceanic data transfer is between 200ms and 300ms. Finally and most importantly, ....

Venkata N. Padmanabhan. Addressing the Challenges of Web Data Transport. PhD thesis, Computer Science Division, University of California at Berkeley, USA, September 1998. Also published as Technical Report UCB/CSD-98-1016. Available at http://www.research.microsoft.com/ padmanab/phdthesis. html.

....determined by the sender s window size, which is conveyed to the receiver in a new TCP option. The receiver should send at least one ACK (preferably more) for each window of data from the sender. Otherwise, it could cause the sender to stall until the receiver s delayed ack timer (usually set at 200 ms) kicks in and forces an ACK to be sent. Despite RED ECN, there may be times when the upstream router queue fills up, and it needs to drop a packet. The router can pick a packet to drop in various ways. For instance, it can drop from the tail, or it can drop a packet al..ready in the queue at ....

....ACKs First Scheduling In the case of bidirectional transfers, data as well as ACK packets compete for resources in the upstream direction. In this case, a single first in first out (FIFO) queue for both data packets and ACKs could cause problems. For example, if the upstream channel is a 28.8 kb s dialup line, the transmission of a 1 kbyte sized data packet would take about 280 ms. So even if just two such data packets get queued ahead of ACKs (not an uncommon occurrence since data packets are sent out in pairs during slow start) they would shut out ACKs for well over half a ....

[Article contains additional citation context not shown here]

V. N. Padmanabhan, "Addressing the Challenges of Web Data Transport," Ph.D. thesis, UCBerkeley, Sept. 1998.

....over long time scales to produce aggregated analyses, but does not lend itself well to providing answers to the ne grained needs of network aware applications. Another approach is statistical inference of network internal characteristics based on end to end measurements of point to point trac [3, 9, 6, 41, 24, 36, 32, 28, 39]. This approach can be further classi ed by active approaches and passive approaches. The bene t of the former is exibility: one can make measurements at those locations and times which are most valuable; while the bene t of the latter is that no additional bandwidth and network resources are ....

Venkata N. Padmanabhan. Addressing the challenges of Web Data Transport. PhD thesis, University of California at Berkeley, September 1998.

....of where each link will take them. In another part of [8] Jakob Nielsen notes that speed must be the overriding design criterion. The issue of improving data transport has been addressed by many different solutions that apply to clients, servers and proxies. Persistent HTTP is presented in [5,12,14] and has become a part of the HTTP 1.1 [7] protocol. This technique enables the existence of a TCP connection even after the transfer of the page component that it has been opened for, in order to be used for the transfer of other components. Predictive pre fetching [15] is another very ....

Venkata N. Padmanabhan "Addressing the challenges of Web Data Transport" PhD Dissertation , University of California at Berkeley, 1998

.... TCP connections share portions of the protocol control block for path related parameters [24] Balakrishnan et al. proposed an integrated congestion control and loss recovery mechanism for TCP [1] called TCP INT, which was refined and extended by Padmanabhan into a session oriented variant of TCP [17]. Although these approaches solve most of the problems associated with the Web scenario, they are transport specific, and applications that use protocols other than TCP cannot take advantage of them. Recently, a transport protocol for heterogeneous packet flows (HPF) has been described in [14] A ....

V. N. Padmanabhan. Addressing the Challenges of Web Data Transport. PhD thesis, Univ. of California, Berkeley, September 1998.

.... compression of the HTML objects via the deflate coding of the public domain zlib compression library [9] This is a hybrid LZ77 [28] Huffman coding [10] When applied to HTML data, it can typically result in a greater than 3x reduction in the size of the HTML file [17] TCP sessions [2][18] have been proposed to allow sharing of state between related TCP connections, such as those connecting the same host pair, at the transport layer. If any connection in the session experiences congestion, all connections can reduce their windows. In this way the network friendly behavior of ....

Padmanabhan, Venkat and Randy H. Katz, "Addressing the Challenges of Web Data Transport," unpublished.

....of P HTTP led to the development of a comprehensive solution, which has two components. The first component, TCP session, de couples TCP s ordered byte stream service abstraction from its congestion control and loss 15 recovery mechanisms. The second component of the solution, TCP fast start [13], improves bandwidth utilization for short transfers by reusing information about the network conditions cached in the recent past instead of initiating the Slow Start discovery procedure each time. To avoid adverse effects in case the cached information is stale, TCP fast start exploits priority ....

Venkata N. Padmanabhan. Addressing the Challenges of Web Data Transport, Doctor of Philosophy Dissertation. September 1998.

.... from Web MUX [13] proposes to deliver multiplexed bidirectional reliable ordered message streams over a bidirectional reliable ordered byte stream protocol such as TCP [44] We note that the problem of shared congestion control disappears when congestion state is shared across TCP connections [1, 23, 39] or more generally, across all protocols using the CM. The WebTP protocol argues that TCP is inappropriate for Web data and aims to replace HTTP and TCP with a single customizable receiver driven transport protocol [16] WebTP handles only client server transactions and not other forms of ....

PADMANABHAN, V. Addressing the Challenges of Web Data Transport. PhD thesis, Univ. of California, Berkeley, Sep 1998.

No context found.

Padmanabhan, V.N., "Addressing the Challenges of Web Data Transport", Ph.D. Thesis, University of California at Berkeley, USA, September 1998 (also Tech Report UCB/CSD98 -1016). http://www.cs.berkeley.edu/padmanab/phdthesis. html

No context found.

V. Padmanabhan. Addressing the Challenges of Web Data Transport. PhD thesis, Univ. of California, Berkeley, September 1998. 26

No context found.

V. Padmanabhan. Addressing the Challenges of Web Data Transport. PhD thesis, UC Berkeley, September 1998.

No context found.

V. Padmanabhan, Addressing the challenges of web data transport, Ph.D. thesis.

No context found.

Padmanabhan, V. Addressing the Challenges of Web Data Transport. PhD thesis, Univ. of California, Berkeley, Sep 1998.

No context found.

V. Padmanabhan. Addressing the Challenges of Web Data Transport. PhD thesis, Univ. of California, Berkeley, September 1998. 26

No context found.

Padmanabhan, V. Addressing the Challenges of Web Data Transport. PhD thesis, Univ. of California, Berkeley, Sep 1998.

No context found.

V. Padmanabhan, Addressing the challenges of web data transport, Ph.D. thesis.

No context found.

Padmanabhan, V., "Addressing the Challenges of Web Data Transport," PhD thesis, Univ. of California, Berkeley, December 1998.

No context found.

Venkata N. Padmanabhan. Addressing the Challenges of Web Data Transport. PhD thesis, University of California, Berkeley, 1998.

No context found.

V. N. Padmanabhan. Addressing the Challenges of Web Data Transport. PhD thesis, University of California at Berkeley, September 1998.

No context found.

Venkata N. Padmanabhan, Addressing the Challenges of Web Data Transport, Ph.D. thesis, University of California, Berkeley, 1998. 28

No context found.

V.N. Padmanabhan. Addressing the Challenges of Web Data Transport. Ph.D. Thesis, UC Berkeley, 1998.

First 50 documents

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