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 5 of 5 for “"Flow Completion Time"”.

  1. Phurti: application and network-aware flow scheduling for MapReduce

    … job in a datacenter consists of multiple network flows. Traditionally, network resources have been allocated to optimize network-level metrics such as flow completion time or throughput. Some recent schemes propose using application-aware scheduling which can reduce the average job completion

    uiuc Repository record for Phurti: application and network-aware flow scheduling for MapReduce (opens in a new tab)

  2. Opportunistic Packet Forwarding for Proactive Transport in Datacenters

    … are designed to avoid congestion by regulating flow sending rates via credit allocation. However, when a new flow starts, it takes one Round-Trip Time (RTT) before credits can be assigned to the new flow. To avoid stalling flows, modern proactive protocols allow a new flow to blast a burst of …

    calgary Repository record for Opportunistic Packet Forwarding for Proactive Transport in Datacenters (opens in a new tab)

  3. 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 …

    uiuc Repository record for Reducing short flows' latency in the internet (opens in a new tab)

  4. 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 …

    uiuc Repository record for Making short flows finish faster with TCP (opens in a new tab)

  5. 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 …

    uiuc Repository record for Efficient cross-layer routing and congestion control architectures for distributed systems (opens in a new tab)