The Experts below are selected from a list of 114 Experts worldwide ranked by ideXlab platform

Palvorsen - One of the best experts on this subject based on the ideXlab platform.

  • LCN - Latency and fairness trade-off for thin Streams using redundant data bundling in TCP
    2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015
    Co-Authors: Bendik R. Opstad, Jonas Markussen, Iffat Ahmed, Andreas Petlund, Carsten Griwodz, Palvorsen
    Abstract:

    Time-dependent applications using TCP often send thin-Stream Traffic, characterised by small packets and high inter-transmission-times. Retransmissions after packet loss can result in very high delays for such flows as they often cannot trigger fast retransmit. Redundant Data Bundling is a mechanism that preempts the experience of loss for a flow by piggybacking unacknowledged segments with new data as long as the total packet size is lower than the flow maximum segment size. Although successful at reducing retransmission latency, this mechanism had design issues leaving it open for abuse, effectively making it unsuitable for general Internet deployment. In this paper, we have redesigned the RDB mechanism to make it safe for deployment. We improve the trigger for when to apply it and evaluate its fairness towards competing Traffic. Extensive experimental results confirm that our proposed modifications allows for inter-flow fairness while maintaining the significant latency reductions from the original RDB mechanism.

Bendik R. Opstad - One of the best experts on this subject based on the ideXlab platform.

  • Latency and Fairness Trade-Off for Thin Streams using Redundant Data Bundling in TCP
    2016
    Co-Authors: Bendik R. Opstad, Jonas Markussen, Iffat Ahmed, Andreas Petlund, Carsten Griwodz
    Abstract:

    Abstract—Time-dependent applications using TCP often send thin-Stream Traffic, characterised by small packets and high inter-transmission-times. Retransmissions after packet loss can result in very high delays for such flows as they often cannot trigger fast retransmit. Redundant Data Bundling is a mechanism that preempts the experience of loss for a flow by piggybacking unacknowledged segments with new data as long as the total packet size is lower than the flow maximum segment size. Although successful at reducing retransmission latency, this mechanism had design issues leaving it open for abuse, effectively making it unsuitable for general Internet deployment. In this paper, we have redesigned the RDB mechanism to make it safe for deployment. We improve the trigger for when to apply it and evaluate its fairness towards competing Traffic. Extensive experimental results confirm that our proposed modifications allows for inter-flow fairness while maintaining the significant latency reductions from the original RDB mechanism. Index Terms—Data-bundling, thin Streams, TCP, latency, fair-ness

  • LCN - Latency and fairness trade-off for thin Streams using redundant data bundling in TCP
    2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015
    Co-Authors: Bendik R. Opstad, Jonas Markussen, Iffat Ahmed, Andreas Petlund, Carsten Griwodz, Palvorsen
    Abstract:

    Time-dependent applications using TCP often send thin-Stream Traffic, characterised by small packets and high inter-transmission-times. Retransmissions after packet loss can result in very high delays for such flows as they often cannot trigger fast retransmit. Redundant Data Bundling is a mechanism that preempts the experience of loss for a flow by piggybacking unacknowledged segments with new data as long as the total packet size is lower than the flow maximum segment size. Although successful at reducing retransmission latency, this mechanism had design issues leaving it open for abuse, effectively making it unsuitable for general Internet deployment. In this paper, we have redesigned the RDB mechanism to make it safe for deployment. We improve the trigger for when to apply it and evaluate its fairness towards competing Traffic. Extensive experimental results confirm that our proposed modifications allows for inter-flow fairness while maintaining the significant latency reductions from the original RDB mechanism.

Carsten Griwodz - One of the best experts on this subject based on the ideXlab platform.

  • Latency and Fairness Trade-Off for Thin Streams using Redundant Data Bundling in TCP
    2016
    Co-Authors: Bendik R. Opstad, Jonas Markussen, Iffat Ahmed, Andreas Petlund, Carsten Griwodz
    Abstract:

    Abstract—Time-dependent applications using TCP often send thin-Stream Traffic, characterised by small packets and high inter-transmission-times. Retransmissions after packet loss can result in very high delays for such flows as they often cannot trigger fast retransmit. Redundant Data Bundling is a mechanism that preempts the experience of loss for a flow by piggybacking unacknowledged segments with new data as long as the total packet size is lower than the flow maximum segment size. Although successful at reducing retransmission latency, this mechanism had design issues leaving it open for abuse, effectively making it unsuitable for general Internet deployment. In this paper, we have redesigned the RDB mechanism to make it safe for deployment. We improve the trigger for when to apply it and evaluate its fairness towards competing Traffic. Extensive experimental results confirm that our proposed modifications allows for inter-flow fairness while maintaining the significant latency reductions from the original RDB mechanism. Index Terms—Data-bundling, thin Streams, TCP, latency, fair-ness

  • LCN - Latency and fairness trade-off for thin Streams using redundant data bundling in TCP
    2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015
    Co-Authors: Bendik R. Opstad, Jonas Markussen, Iffat Ahmed, Andreas Petlund, Carsten Griwodz, Palvorsen
    Abstract:

    Time-dependent applications using TCP often send thin-Stream Traffic, characterised by small packets and high inter-transmission-times. Retransmissions after packet loss can result in very high delays for such flows as they often cannot trigger fast retransmit. Redundant Data Bundling is a mechanism that preempts the experience of loss for a flow by piggybacking unacknowledged segments with new data as long as the total packet size is lower than the flow maximum segment size. Although successful at reducing retransmission latency, this mechanism had design issues leaving it open for abuse, effectively making it unsuitable for general Internet deployment. In this paper, we have redesigned the RDB mechanism to make it safe for deployment. We improve the trigger for when to apply it and evaluate its fairness towards competing Traffic. Extensive experimental results confirm that our proposed modifications allows for inter-flow fairness while maintaining the significant latency reductions from the original RDB mechanism.

Jonas Markussen - One of the best experts on this subject based on the ideXlab platform.

  • Latency and Fairness Trade-Off for Thin Streams using Redundant Data Bundling in TCP
    2016
    Co-Authors: Bendik R. Opstad, Jonas Markussen, Iffat Ahmed, Andreas Petlund, Carsten Griwodz
    Abstract:

    Abstract—Time-dependent applications using TCP often send thin-Stream Traffic, characterised by small packets and high inter-transmission-times. Retransmissions after packet loss can result in very high delays for such flows as they often cannot trigger fast retransmit. Redundant Data Bundling is a mechanism that preempts the experience of loss for a flow by piggybacking unacknowledged segments with new data as long as the total packet size is lower than the flow maximum segment size. Although successful at reducing retransmission latency, this mechanism had design issues leaving it open for abuse, effectively making it unsuitable for general Internet deployment. In this paper, we have redesigned the RDB mechanism to make it safe for deployment. We improve the trigger for when to apply it and evaluate its fairness towards competing Traffic. Extensive experimental results confirm that our proposed modifications allows for inter-flow fairness while maintaining the significant latency reductions from the original RDB mechanism. Index Terms—Data-bundling, thin Streams, TCP, latency, fair-ness

  • LCN - Latency and fairness trade-off for thin Streams using redundant data bundling in TCP
    2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015
    Co-Authors: Bendik R. Opstad, Jonas Markussen, Iffat Ahmed, Andreas Petlund, Carsten Griwodz, Palvorsen
    Abstract:

    Time-dependent applications using TCP often send thin-Stream Traffic, characterised by small packets and high inter-transmission-times. Retransmissions after packet loss can result in very high delays for such flows as they often cannot trigger fast retransmit. Redundant Data Bundling is a mechanism that preempts the experience of loss for a flow by piggybacking unacknowledged segments with new data as long as the total packet size is lower than the flow maximum segment size. Although successful at reducing retransmission latency, this mechanism had design issues leaving it open for abuse, effectively making it unsuitable for general Internet deployment. In this paper, we have redesigned the RDB mechanism to make it safe for deployment. We improve the trigger for when to apply it and evaluate its fairness towards competing Traffic. Extensive experimental results confirm that our proposed modifications allows for inter-flow fairness while maintaining the significant latency reductions from the original RDB mechanism.

Iffat Ahmed - One of the best experts on this subject based on the ideXlab platform.

  • Latency and Fairness Trade-Off for Thin Streams using Redundant Data Bundling in TCP
    2016
    Co-Authors: Bendik R. Opstad, Jonas Markussen, Iffat Ahmed, Andreas Petlund, Carsten Griwodz
    Abstract:

    Abstract—Time-dependent applications using TCP often send thin-Stream Traffic, characterised by small packets and high inter-transmission-times. Retransmissions after packet loss can result in very high delays for such flows as they often cannot trigger fast retransmit. Redundant Data Bundling is a mechanism that preempts the experience of loss for a flow by piggybacking unacknowledged segments with new data as long as the total packet size is lower than the flow maximum segment size. Although successful at reducing retransmission latency, this mechanism had design issues leaving it open for abuse, effectively making it unsuitable for general Internet deployment. In this paper, we have redesigned the RDB mechanism to make it safe for deployment. We improve the trigger for when to apply it and evaluate its fairness towards competing Traffic. Extensive experimental results confirm that our proposed modifications allows for inter-flow fairness while maintaining the significant latency reductions from the original RDB mechanism. Index Terms—Data-bundling, thin Streams, TCP, latency, fair-ness

  • LCN - Latency and fairness trade-off for thin Streams using redundant data bundling in TCP
    2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015
    Co-Authors: Bendik R. Opstad, Jonas Markussen, Iffat Ahmed, Andreas Petlund, Carsten Griwodz, Palvorsen
    Abstract:

    Time-dependent applications using TCP often send thin-Stream Traffic, characterised by small packets and high inter-transmission-times. Retransmissions after packet loss can result in very high delays for such flows as they often cannot trigger fast retransmit. Redundant Data Bundling is a mechanism that preempts the experience of loss for a flow by piggybacking unacknowledged segments with new data as long as the total packet size is lower than the flow maximum segment size. Although successful at reducing retransmission latency, this mechanism had design issues leaving it open for abuse, effectively making it unsuitable for general Internet deployment. In this paper, we have redesigned the RDB mechanism to make it safe for deployment. We improve the trigger for when to apply it and evaluate its fairness towards competing Traffic. Extensive experimental results confirm that our proposed modifications allows for inter-flow fairness while maintaining the significant latency reductions from the original RDB mechanism.