Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Short flows"”.
-
Reducing short flows' latency in the internet
Short flows are highly valuable in the modern Internet and are widely used by applications in the form of web requests or with user interactions. These kinds of applications are extremely sensitive to latency. A small additional delay, like one or two round trip times (RTTs), may easily cause user …
-
Making short flows finish faster with TCP
… to many hosts, this requires that small flows complete quickly at high percentiles. We explore how to achieve this goal with protocols that do not require modifications to all the routers and agents transmitting the flow. Our simulations indicate that both Random Early Detection and Fair …
-
Opportunistic Packet Forwarding for Proactive Transport in Datacenters
… be assigned to the new flow. To avoid stalling flows, modern proactive protocols allow a new flow to blast a burst of unscheduled packets at line rate during the pre-credit phase. However, sending too many unscheduled packets could cause temporary traffic spikes that lead to queue build-ups, …
-
The influence of magma supply and eruptive processes on axial morphology, crustal construction and magma chambers
… linked to spreading events which occur on much shorter time scales (ca. 10-100 yr) than the longer-term variations in magma supply reflected in along-axis changes in ridge morphology. The seismically constrained depths of ridge crest magma sills (>1-2 km) are considerably deeper than the level …
-
Congestion Control in Highly Variable Networks
… and achieves 2.3 - 60× lower tail latency for short flows and 1.6 - 5× better average completion time for long flows. Nimbus proposes a new feedback mechanism, elasticity detection, to robustly characterize the nature of cross-traffic competing a flow. Nimbus enables low delay congestion …
-
Neyman-Pearson Decision in Traffic Analysis
… anonymous connections. In many cases, the flows of interest are relayed through many nodes that reencrypt the flow, making traffic analysis the only possible solution. There exist two well-known techniques to solve this problem: passive traffic analysis and flow watermarking. The former is …
-
Efficient cross-layer routing and congestion control architectures for distributed systems
… drawback of not accurately knowing rate share of flows at bottleneck links. Some protocols proposed to address these drawbacks are not fair to short flows, which are the majority of the Internet traffic. Other protocols result in high queue length and packet drops which translate into a high …