@article {43200,
	title = {Proxy Path Scheduling and Erasure Reconstruction for Low Delay mmWave Communication},
	journal = {IEEE Communications Letters},
	volume = {27},
	year = {2023},
	month = {06/2023},
	pages = {1649-1653},
	publisher = { IEEE},
	keywords = {erasure reconstruction, mmWave, Multipath scheduling},
	issn = {1558-2558},
	doi = {10.1109/LCOMM.2023.3269526},
	url = {https://ieeexplore.ieee.org/document/10107383},
	author = {David Andrew {Hayes} and Ros, David and Ytrehus, {\O}yvind}
}
@article {42554,
	title = {Investigating Predictive Model-Based Control to Achieve Reliable Consistent Multipath mmWave Communication},
	journal = {Computer Communications},
	volume = {194},
	year = {2022},
	month = {10/2022},
	pages = {29-43},
	publisher = { Elsevier},
	abstract = {Millimeter-wave (mmWave) radio is a key building block in 5G and beyond cellular networks. However, mmWave channels are very sensitive to environmental conditions and depend on Line-of-Sight\&nbsp; connections to provide very high data rates. Achieving reliable, consistent communication {\textemdash} i.e., a steady link rate together with low delay {\textemdash} over mmWave links is therefore a challenging problem. The goal of this work is to explore the use of predictive control to manage and simultaneously use multiple available mmWave paths to achieve reliable consistent communication by means of a multipath proxy. We investigate transient solutions of Markov Modulated Fluid Queues (MMFQ) to model the short-term evolution of the proxy{\textquoteright}s packet queue, consistent with the use of Markovian models to capture the behavior of mmWave channel blocking. We propose a combination of models that can be solved using newly proposed matrix-analytic techniques in a timely enough manner for use in real-time control. This gives us a prediction, over a short time horizon, of either proxy queue distributions or probabilities of reaching particular proxy buffer levels. Thus, it enables the proxy to make preemptive path decisions in order to maintain a desired Quality of Service. A proof-of-concept simulation study demonstrates the efficacy of our proposed MMFQ-based predictive approach over both static and purely reactive control approaches. Further, we explore the potential benefits of a hybrid approach to path management, combining both predictive and reactive control. This can allow the controller to cater for unforeseen events that cannot be forecast by the predictive controller, mitigating the resulting extra queuing and corresponding delay spikes.},
	keywords = {5G/6G/+, mmWave, Mobile networks, Multipath, Proxy},
	doi = {10.1016/j.comcom.2022.07.011},
	url = {https://www.sciencedirect.com/science/article/pii/S0140366422002596},
	author = {David Andrew {Hayes} and Ros, David and Alay, {\"O}zg{\"u} and Teymoori, Peyman and Tine Margretha {Vister}}
}
@inproceedings {27953,
	title = {Reliable Consistent Multipath mmWave Communication},
	journal = {International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM{\textquoteright}21)},
	year = {2021},
	note = {Authors{\textquoteright} version of the work available. Please refer to DOI for the definitive version.},
	month = {11/2021},
	pages = { 149{\textendash}158},
	publisher = {ACM},
	address = {New York, NY, USA},
	abstract = {Reliable consistent communication over millimeter-wave (mmWave) channels is a challenging problem due to their sensitivity to blocking of Line of Sight connections. Even though mmWave is a key building block in 5G and future generation cellular networks, making solutions to this problem space important. Our aim is to use predictive control to manage and simultaneously use multiple available mmWave paths to achieve reliable consistent communication (i.e. steady transmission rate with low delay) with a multipath proxy. To this end we investigate transient solutions of Markov Modulated Fluid Queue models (MMFQ), apt because the mmWave blocking has been modeled with Markovian models. We propose a combination of models that can be solved using newly proposed matrix analytic techniques in a timely enough manner for use in real-time control. This gives us a prediction of either proxy queue distributions or probabilities of reaching proxy buffer levels over a short time horizon, enabling the proxy to make preemptive path decisions to maintain a desired Quality of Service. A proof of concept simulation study demonstrates the efficacy of our proposed MMFQ-based predictive approach over either static or purely reactive control approaches.},
	isbn = {9781450390774},
	doi = {10.1145/3479239.3485684},
	url = {https://doi.org/10.1145/3479239.3485684},
	author = {David Andrew {Hayes} and Ros, David and Alay, {\"O}zg{\"u} and Teymoori, Peyman}
}
@article {27365,
	title = {Online Identification of Groups of Flows Sharing a Network Bottleneck},
	journal = {IEEE/ACM Transactions on Networking},
	volume = {28},
	number = {5},
	year = {2020},
	note = {Published in the Early Access area on IEEE Xplore.\&nbsp;\&nbsp;The content is final as presented with the exception of pagination andissue designation, which will be assigned when included in the future issue.},
	pages = {2229--2242},
	publisher = {IEEE/ACM},
	abstract = {Abstract{\textemdash}Most Internet hosts today support multiple access technologies and network interfaces. Multipath transport protocols, like MPTCP, are being deployed (e.g., in smartphones), allowing transparent simultaneous use of multiple links. Besides providing increased resilience to link failures, multipath trans- ports may better exploit available (aggregate) capacity across all interfaces. The safest way to ensure fairness is to assume that any subflows of a multipath end-to-end connection may share bottleneck links, but knowledge of non-shared bottlenecks could allow multipath senders to exploit more capacity without being unfair to other flows. The problem of reliably detecting the existence of (non)-shared bottlenecks is not trivial and is compounded by the fact that bottlenecks may change due to traffic dynamics. In this paper we focus on practical methods to reliably group flows that share, possibly dynamic, bottlenecks online and in a passive manner (i.e., without injecting measurement traffic). We introduce a novel dynamic clustering algorithm that we apply to update our previous shared bottleneck flow grouping (SBFG) method standardized by the IETF, based on delay statistics. We also adapt an offline SBFG method based on wavelet filters to enable it for online operation. These SBFG methods are evaluated by a simple testbed, rigorous simulation and real-world Internet experiments in a testbed comprised of multihomed hosts. Our results suggest that there is no clear winner, and selection of the {\textquotedblleft}best{\textquotedblright} SBFG method will have to consider tradeoffs regarding accuracy, lag, and application requirements.},
	keywords = {dynamic clustering, Internet congestion control, multipath congestion control., shared bottleneck detection},
	issn = {Print ISSN: 1063-6692, Electronic ISSN: 1558-2566},
	doi = { 10.1109/TNET.2020.3007346},
	author = {David Andrew {Hayes} and Welzl, Michael and Ferlin, Simone and Ros, David and Islam, Safiqul}
}
@inproceedings {26628,
	title = {On the importance of TCP splitting proxies for future 5G mmWave communications},
	journal = { IEEE Local Computer Networks (LCN) Symposium on Emerging Topics in Networking},
	year = {2019},
	month = {10/2019},
	pages = {108--116},
	publisher = {IEEE},
	abstract = {Abstract{\textemdash}5G mmWave technology promises capacities 10 to 100 times that of 4G. However, mmWave links are very sensitive to having direct line of sight between sender and receiver, with dramatically fluctuating capacities due to transient blocking and shadow fading, which can substantially degrade TCP performance. TCP-splitting proxies (SPEPs) are often used to improve TCP performance over wireless links. We investigate current operator SPEPs (used in 4G LTE networks) under mmWave-like dynamics using the MONROE\&nbsp;testbed. We introduce a mmWave emulation model for an urban canyon scenario, and use it to evaluate how current operational SPEPs impact the performance. Our results from experiments including four operators and three countries, indicate that SPEPs will be even more important for 5G mmWave than they are in LTE. Current 4G SPEPs provide significant, though not optimal, benefits under mmWave-like conditions, allowing them to be utilized as the network transitions to 5G technology.},
	isbn = {978-1-7281-2561-9},
	doi = {10.1109/LCNSymposium47956.2019.9000661},
	url = {http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\&arnumber=9000661\&isnumber=9000653},
	author = {David Andrew {Hayes} and Ros, David and Alay, {\"O}zg{\"u}},
	editor = {Khoukh, Lyes}
}
@inproceedings {25278,
	title = {Alternative Backoff: Achieving Low Latency and High Throughput with ECN and AQM},
	journal = {IFIP Networking},
	year = {2017},
	note = {Best Paper Award},
	publisher = {IFIP},
	abstract = {A number of recently proposed Active Queue Management (AQM) mechanisms instantiate shallow buffers with burst tolerance to minimise the time that packets spend enqueued at a bottleneck. However, shallow buffering causes noticeable TCP performance degradation as a path{\textquoteright}s underlying round trip time (RTT) heads above typical intra-country levels. Using less-aggressive multiplicative backoffs in TCP can compensate for shallow bottleneck buffering. AQM mechanisms may either drop packets or mark them using Explicit Congestion Notification (ECN), depending on whether the sender marked packets as ECN-capable. While a drop may therefore stem from any type of queue, an ECN-mark indicates that an AQM mechanism has done its job, and therefore the queue is likely to be shallow. We propose ABE: {\textquotedblleft}Alternative Backoff with ECN{\textquotedblright}, which consists of enabling ECN and letting individual TCP senders back off less aggressively in reaction to ECN-marks from AQM-enabled bottlenecks. Using controlled testbed experiments with standard NewReno and CUBIC flows, we show significant performance gains in lightly-multiplexed scenarios, without losing the delay-reduction benefits of deploying AQM. ABE is a sender-side-only modification that can be deployed across networks incrementally (requiring no flag-day) and offers a compelling reason to deploy and enable ECN across the Internet.},
	keywords = {AQM, congestion control, ECN, low latency, tcp},
	url = {http://dl.ifip.org/db/conf/networking/networking2017/1570335770.pdf},
	author = {Khademi, Naeem and Armitage, Grenville and Welzl, Michael and Zander, Sebastian and Fairhurst, Gorry and Ros, David}
}
@inproceedings {25373,
	title = {Evaluating CAIA Delay Gradient as a Candidate for Deadline-Aware Less-than-Best-Effort Transport},
	journal = {Workshop on Future of Internet Transport (FIT 2017)},
	year = {2017},
	publisher = {IFIP},
	abstract = {Less-than-best-effort (LBE) congestion control offers a low-priority service for applications tolerant to high latency and low throughput, like peer-to-peer file transfers or automatic software updates. There are, however, situations where it would be beneficial for the application to specify a soft deadline for task completion. Examples of such situations could be completion of backup tasks or synchronisation between CDN data centres. Since network conditions change over time, a deadline-aware LBE (DA-LBE) congestion control would need the ability to dynamically adapt how aggressively it competes for capacity to meet the soft deadline, trading low-priority behaviour for timeliness. One candidate that shows promise as a LBE congestion control is CAIA Delay Gradient (CDG). CDG uses changes in measured end-to-end delay to control the congestion window. CDG has several parameters that might help tune its {\textquotedblleft}aggressiveness{\textquotedblright} in a way that might help achieve the goal of DA-LBE congestion control. We have evaluated CDG in order to establish how it can be tuned to exhibit different degrees of LBE behaviour under varying network conditions. Our results show that it is possible to control CDG to vary its aggressiveness in a consistent way, making it a prime candidate to implement a DA-LBE congestion control system.},
	keywords = {congestion control, deadline-aware congestion control, Less-than-Best-Effort Service, scavenger service},
	isbn = {978-3-901882-94-4},
	doi = {10.23919/IFIPNetworking.2017.8264882},
	url = {http://dl.ifip.org/db/conf/networking/networking2017/1570350870.pdf},
	author = {Tor Christian {Tangenes} and David Andrew {Hayes} and Petlund, Andreas and Ros, David}
}
@inproceedings {25279,
	title = {A Framework for Less than Best Effort Congestion Control with Soft Deadlines},
	journal = {2017 IFIP Networking Conference (IFIP Networking) and Workshops},
	year = {2017},
	publisher = {IEEE},
	abstract = {Applications like inter data-centre synchronisation or client-to-cloud backups require a reliable end-to-end data transfer, however, they typically do not have strong capacity or latency constraints, just a loose delivery deadline. Besides, their potential to disrupt more quality-constrained flows should be kept to a minimum. These applications could be well served by a transport protocol providing a less-than-best-effort (LBE) or scavenger service rather than TCP but, neither TCP nor standard LBE methods like LEDBAT consider any notion of deadline or completion time. TCP simply tries to maximise the use of available capacity, while LEDBAT tries to enforce an LBE behaviour regardless of any timeliness requirements.This paper introduces a framework for adding both LBE behaviour and awareness of {\textquotedblleft}soft{\textquotedblright} delivery deadlines to any congestion control (CC) algorithm, whether loss-based, delay-based or explicit signaling-based. This effectively allows it to turn an arbitrary CC protocol into a scavenger protocol that dynamically adapts its sending rate to network conditions and remaining time before the deadline, to balance timeliness and transmission aggressiveness. Network utility maximization (NUM) theory provides a solid foundation for the proposal. The effectiveness of the approach is validated by numerical and simulation experiments, with TCP Cubic and Vegas used as examples.},
	isbn = {978-3-901882-94-4},
	doi = {10.23919/IFIPNetworking.2017.8264853},
	url = {http://dl.ifip.org/db/conf/networking/networking2017/1570334752.pdf},
	author = {David Andrew {Hayes} and Ros, David and Petlund, Andreas and Ahmed, Iffat},
	editor = {Karlsson, Gunnar and Brunstr{\"o}m, Anna and Jiang, Hongbo and Wolf, Tilman and Fodor, Viktoria}
}
@article {25372,
	title = {NEAT: A Platform- and Protocol-Independent Internet Transport API},
	journal = {IEEE Communications Magazine},
	volume = {55},
	year = {2017},
	month = {06/2017},
	pages = {46-54},
	publisher = {IEEE},
	abstract = {The sockets Applications Programming Interface (API) has become the standard way that applications access the transport services offered by the Internet Protocol stack. This paper presents NEAT, a user-space library that can provide an alternate transport API. NEAT allows applications to request the service they need using a new design that is agnostic to the specific choice of transport protocol underneath. This not only allows applications to take advantage of common protocol machinery, but also eases introduction of new network mechanisms and transport protocols. The paper describes the components of the NEAT library and illustrates the important benefits that can be gained from this new approach. NEAT is a software platform for developing advanced network applications that was designed in accordance with the standardization efforts on Transport Services (TAPS) in the Internet Engineering Task Force (IETF), but its features exceed the envisioned functionality of a TAPS system.},
	issn = {0163-6804},
	doi = {https://doi.org/10.1109/MCOM.2017.1601052},
	author = {Khademi, Naeem and Ros, David and Welzl, Michael and Bozakov, Zdravko and Brunstr{\"o}m, Anna and Fairhurst, Gorry and Grinnemo, Karl-Johan and David Andrew {Hayes} and Hurtig, Per and Jones, Tom and Mangiante, Simone and T{\"u}xen, Michael and Weinrank, Felix}
}
@article {24987,
	title = {Operating ranges, tunability and performance of CoDel and PIE},
	journal = {Computer Communications},
	volume = {103},
	year = {2017},
	month = {05/2017},
	pages = {74-82},
	publisher = {Elsevier},
	abstract = {Bufferbloat is excessive delay due to the accumulation of packets in a router\&rsquo;s oversized queues. CoDel and PIE are two recent Active Queue Management (AQM) algorithms that have been proposed to address bufferbloat by reducing the queuing delay while trying to maintain a high bottleneck utilization. This paper fills a gap by outlining what are the operating ranges, that is the network characteristics (in terms of round-trip times and bottleneck capacity), for which these algorithms achieve their design goals. This new approach to the problem lets us identify deployment scenarios where both AQM schemes result in poor performance when used with default parameters. Because PIE and CoDel have been proposed with RED\&rsquo;s deployment issues in mind, it was essential to evaluate to what extent we can tune them to achieve various trade-offs and let them control the queuing delay outside their default operating range. We find that, by appropriate tuning (1) the amount of buffering can easily be controlled with PIE, (2) the Round Trip Time (RTT) sensitivity of CoDel can be reduced. Also, we observe there is more correlation between the congestion level, the achieved queuing delay and the targeted delay with CoDel than with PIE. This paper therefore concludes there is no single overall best AQM scheme, as each scheme proposes a specific trade-off.},
	keywords = {AQM, Bufferbloat, CoDel, congestion control, PIE},
	doi = {http://dx.doi.org/10.1016/j.comcom.2016.07.013},
	author = {Kuhn, Nicolas and Ros, David and Amadou Baba {Bagayoko} and Kulatunga, Chamil and Fairhurst, Gorry and Khademi, Naeem}
}
@inproceedings {25398,
	title = {Path Transparency Measurements from the Mobile Edge with PATHspider},
	journal = {IEEE/IFIP Mobile Network Measurements Workshop},
	year = {2017},
	publisher = {IEEE},
	doi = {10.23919/TMA.2017.8002922},
	author = {Iain R. {Learmonth} and Lutu, Andra and Fairhurst, Gorry and Ros, David and Alay, {\"O}zg{\"u}},
	editor = {mellia, marco and Halepovic, Emir and Malone, David}
}
@techreport {aqm-eval-draft,
	title = {AQM Characterization Guidelines},
	year = {2016},
	month = {07/2016},
	publisher = {IETF},
	abstract = {Unmanaged large buffers in today\&$\#$39;s networks have given rise to a slew\&nbsp;of performance issues. \&nbsp;These performance issues can be addressed by\&nbsp;some form of Active Queue Management (AQM) mechanism, optionally in\&nbsp;combination with a packet scheduling scheme such as fair queuing.\&nbsp;The IETF Active Queue Management and Packet Scheduling working group\&nbsp;was formed to standardize AQM schemes that are robust, easily\&nbsp;implementable, and successfully deployable in today\&$\#$39;s networks. \&nbsp;This\&nbsp;document describes various criteria for performing precautionary\&nbsp;characterizations of AQM proposals. \&nbsp;This document also helps in\&nbsp;ascertaining whether any given AQM proposal should be taken up for\&nbsp;standardization by the AQM WG.},
	keywords = {Active Queue Management},
	issn = {2070-1721},
	url = {https://tools.ietf.org/html/rfc7928},
	author = {Kuhn, Nicolas and Natarajan, Preethi and Khademi, Naeem and Ros, David}
}
@misc {24440,
	title = {AQM for ISPs - decision maker video},
	year = {2016},
	publisher = {Reducing Internet Transport Latency},
	address = {RITE website},
	abstract = {This video is directed at decision makers in Network operators and equipment manufacturers. It contains a to-the-point explanation of some key technologies that needs to go into the Internet to reach the next evolutionary step.},
	keywords = {AQM, Internet latency, ISP},
	url = {https://videopress.com/v/WskDNI5r},
	author = {Briscoe, Bob and Petlund, Andreas and Ahmed, Iffat and Fairhurst, Gorry and Brunstr{\"o}m, Anna and Ros, David}
}
@inproceedings {24988,
	title = {On the Cost of Using Happy Eyeballs for Transport Protocol Selection},
	journal = {Applied Networking Research Workshop (ANRW)},
	year = {2016},
	month = {07/2016},
	pages = {45-51},
	publisher = {ACM},
	abstract = {Concerns have been raised in the past several years that introducing new transport protocols on the Internet has become increasingly difficult, not least because there is no agreed-upon way for a source end host to find out if a transport protocol is supported all the way to a destination peer. A solution to a similar problem\&mdash;finding out support for IPv6\&mdash;has been proposed and is currently being deployed: the Happy Eyeballs (HE) mechanism. HE has also been proposed as an efficient way for an application to select an appropriate transport protocol. Still, there are few, if any, performance evaluations of transport HE. This paper demonstrates that transport HE could indeed be a feasible solution to the transport support problem. The paper evaluates HE between TCP and SCTP using TLS encrypted and unencrypted traffic, and shows that although there is indeed a cost in terms of CPU load to introduce HE, the cost is relatively small, especially in comparison with the cost of using TLS encryption. Moreover, our results suggest that HE has a marginal impact on memory usage. Finally, by introducing caching of previous connection attempts, the additional cost of transport HE could be significantly reduced.},
	keywords = {CPU load, Happy Eyeballs, memory usage, SCTP, tcp, TLS, Transport-protocol selection},
	isbn = {978-1-4503-4443-2},
	doi = {https://doi.org/10.1145/2959424.2959437},
	url = {https://irtf.org/anrw/2016/anrw16-final27.pdf},
	author = {Papastergiou, Georgios and Grinnemo, Karl-Johan and Brunstr{\"o}m, Anna and Ros, David and T{\"u}xen, Michael and Khademi, Naeem and Hurtig, Per}
}
@article {24989,
	title = {De-ossifying the Internet transport layer: A survey and future perspectives},
	journal = {IEEE Communications Surveys and Tutorials},
	year = {2016},
	month = {11/2016},
	publisher = {IEEE},
	abstract = {It is widely recognized that the Internet transport layer has become ossified, where further evolution has become hard or even impossible. This is a direct consequence of the ubiquitous deployment of middleboxes that hamper the deployment of new transports, aggravated further by the limited flexibility of the Application Programming Interface (API) typically presented to applications. To tackle this problem, a wide range of solutions have been proposed in the literature, each aiming to address a particular aspect. Yet, no single proposal has emerged that is able to enable evolution of the transport layer. In this work, after an overview of the main issues and reasons for transport-layer ossification, we survey proposed solutions and discuss their potential and limitations. The survey is divided into five parts, each covering a set of point solutions for a different facet of the problem space: 1) designing middleboxproof transports, 2) signaling for facilitating middlebox traversal, 3) enhancing the API between the applications and the transport layer, 4) discovering and exploiting end-to-end capabilities, and 5) enabling user-space protocol stacks. Based on this analysis, we then identify further development needs towards an overall solution. We argue that the development of a comprehensive transport layer framework, able to facilitate the integration and cooperation of specialized solutions in an application-independent and flexible way, is a necessary step toward making the Internet transport architecture truly evolvable. To this end, we identify the requirements for such a framework and provide insights for its development.},
	keywords = {API, middleboxes, protocol-stack ossification, transport protocols, user-space networking stacks},
	issn = {1553-877X},
	doi = {https://doi.org/10.1109/COMST.2016.2626780},
	author = {Papastergiou, Georgios and Fairhurst, Gorry and Ros, David and Brunstr{\"o}m, Anna and Grinnemo, Karl-Johan and Hurtig, Per and Khademi, Naeem and T{\"u}xen, Michael and Welzl, Michael and Damjanovic, Dragana and Mangiante, Simone}
}
@misc {24995,
	title = {NEAT {\textendash} A New, Evolutive API and Transport-Layer Architecture for the Internet},
	year = {2016},
	month = {06/2016},
	address = { 12th Swedish National Computer Networking Workshop (SNCNW 2016), Sundsvall, Sweden, June 1-2, 2016},
	keywords = {application-aware networking, Internet architecture, ossification, transport API, transport layer},
	doi = {https://doi.org/10.5281/zenodo.55588},
	author = {Grinnemo, Karl-Johan and Jones, Tom and Fairhurst, Gorry and Ros, David and Brunstr{\"o}m, Anna and Hurtig, Per}
}
@inproceedings {24530,
	title = {Towards a Flexible Internet Transport Layer Architecture},
	journal = {IEEE LANMAN},
	year = {2016},
	publisher = {IEEE},
	abstract = {There is a growing concern that the Internet transport layer has become less adaptive to the requirements of new applications, and that further evolution has become very difficult. This is because a fundamental assumption no longer holds: it can no longer be assumed that the transport layer is only in the scope of end-hosts. The success of TCP and UDP and the ubiquity of middleboxes have led to ossification of both the network infrastructure and the API presented to applications. This has led to the development of workarounds and point solutions that fail to cover many facets of the problem. To address this issue, this paper identifies requirements for a new transport layer and then proposes a conceptual architecture that we argue is both flexible and evolvable. This new architecture requires that applications interface to the transport at a higher abstraction level, where an application can express communication preferences via a new richer API. Protocol machinery can use this information to decide which of the available transport protocols is used. By placing the protocol machinery in the transport layer, the new architecture can allow for new protocols to be deployed and enable evolution of the transport layer.},
	keywords = {application-aware networking, Internet architecture, ossification, transport API, transport layer},
	isbn = {978-1-4673-9882-4},
	issn = {1944-0375},
	doi = {https://doi.org/10.1109/LANMAN.2016.7548846},
	author = {Grinnemo, Karl-Johan and Jones, Tom and Fairhurst, Gorry and Ros, David and Brunstr{\"o}m, Anna and Hurtig, Per}
}
@techreport {abe-caia-2015,
	title = {Alternative Backoff: Achieving Low Latency and High Throughput with ECN and AQM},
	year = {2015},
	month = {07/2015},
	publisher = {Centre for Advanced Internet Architectures (CAIA), Swinburne University of Technology},
	address = {Melbourne, Australia},
	abstract = {CoDel and PIE are recently proposed Active Queue Management (AQM) mechanisms that minimize the time packets spend enqueued at a bottleneck, instantiating shallow, 5 ms to 20 ms buffers with short-term packet burst tolerance. However, shallow buffering causes noticeable TCP performance degradation when a path{\textquoteright}s underlying round trip time (RTT) heads above 60ms to 80ms (not uncommon with cross-continental and inter-continental traffic). Using less-aggressive multiplicative backoffs is known to compensate for shallow bottleneck buffering. We propose ABE: {\textquotedblleft}Alternative Backoff with ECN{\textquotedblright}, which consists of enabling Explicit Congestion Notification (ECN) and letting individual TCP senders use a larger multiplica- tive decrease factor in reaction to ECN-marks from AQM- enabled bottlenecks. Using a mix of experiments, theory and simulations with standard NewReno and CUBIC flows, we show significant performance gains in lightly- multiplexed scenarios, without losing the delay-reduction benefits of deploying CoDel or PIE. ABE is a sender- side-only modification that can be deployed incrementally (requiring no flag-day) and offers a compelling reason to deploy and enable ECN across the Internet.},
	url = {http://caia.swin.edu.au/reports/150710A/CAIA-TR-150710A.pdf},
	author = {Khademi, Naeem and Welzl, Michael and Armitage, Grenville and Kulatunga, Chamil and Ros, David and Fairhurst, Gorry and Gjessing, Stein and Zander, Sebastian}
}
@inproceedings {23496,
	title = {Internet Latency: Causes, Solutions and Trade-offs},
	journal = {EuCNC Special session on latency},
	year = {2015},
	month = {05/2015},
	abstract = {This paper is a digest of [1], an extensive survey discussing the merits of over 300 techniques for reducing Internet latency. It gives a broad overview of the causes, solutions, and trade-offs involved in reducing latency in the Internet. The overview covers key sources of delays and proposed solutions: due to the structural arrangement of the network, how network end-points interact, along the end-to-end path, related to link capacities, within end-hosts, and those that address multiple sources. Trade-offs are discussed in terms of the latency reduction different techniques provide versus their deployability},
	url = {https://riteproject.files.wordpress.com/2015/12/p548-hayes.pdf},
	author = {David Andrew {Hayes} and Tsang, Ing-Jyh and Ros, David and Petlund, Andreas and Briscoe, Bob}
}
@misc {23933,
	title = {MONROE: Measuring Mobile Broadband Networks in Europe},
	howpublished = {IRTF/ISOC Workshop on Research and Applications of Internet Measurements},
	year = {2015},
	type = {Measurement platforms \& tools},
	url = {https://irtf.org/raim-2015},
	author = {Alay, {\"O}zg{\"u} and Lutu, Andra and Ros, David and Garcia, Rafael and Mancuso, Vincenzo and Audun Fosselie {Hansen} and Brunstr{\"o}m, Anna and Marco Ajmone {Marsan} and Lonsethagen, Hakon}
}
@techreport {23800,
	title = {Report on Prototype Development and Evaluation of Network and Interaction Techniques},
	year = {2015},
	month = {09/2015},
	publisher = {RITE Eu FP7 Project 317700},
	keywords = {Algorithms, characterisation, co-ordination, congestion, Data Communication, Delay, Internet, metrics, networks, overhead, Performance, QoS, standardisation},
	url = {https://riteproject.files.wordpress.com/2015/12/rite-deliverable-2-3.pdf},
	author = {Briscoe, Bob and Ros, David and Petlund, Andreas and Ahmed, Iffat and Kargar, Minoo and Bondarenko, Olga and Others, Numerous},
	editor = {Briscoe, Bob}
}
@inproceedings {bufferbloat-eucnc,
	title = {Tackling Bufferbloat in Capacity-limited Networks},
	journal = {Proceedings of EuCNC 2015},
	year = {2015},
	address = {Paris},
	abstract = {Over-provisioned network buffers, often at the Internet edge, induce large queuing delay and high latency; this issue is known as Bufferbloat. In response to this, a set of recently proposed Active Queue Management (AQM) algorithms attempt to reduce standing queues, while maintaining the bottleneck utilisation at an acceptable level. This paper assesses the performance of two AQM schemes (CoDel and FQ-CoDel) over capacity-limited networks with large Round-Trip Time (RTT). In such settings, these AQM schemes have difficulty controlling the buffering level, resulting in both momentarily high queuing delay and low bottleneck utilisation, even if the methods are claimed to be insensitive to link rates and round-trip delays. We explore this issue and show that it is possible to adapt the parameterisation of CoDel and FQ-CoDel to offer a higher bottleneck utilisation while maintaining a low queuing delay. We present experiments over an emulated test bed and a satellite network to confirm that our new parameterisation improves the download time of moderate-size files and reduces the latency for capacity-limited and large-RTT networks.},
	keywords = {AQM, Bufferbloat, CoDel, Rural Broadband},
	author = {Kulatunga, Chamil and Kuhn, Nicolas and Fairhurst, Gorry and Ros, David}
}
@inproceedings {aqm-eval-gi-symposium,
	title = {The New AQM Kids on the Block: An Experimental Evaluation of CoDel and PIE},
	journal = {17th IEEE Global Internet Symposium},
	year = {2014},
	month = {04/2014},
	publisher = {IEEE},
	address = {Toronto},
	abstract = {Active Queue Management (AQM) design has again come into the spotlight of network operators, vendors and OS developers. This reflects the growing concern and sensitivity about the end-to-end latency perceived by today{\textquoteright}s Internet users. CoDel and PIE are two AQM mechanisms that have recently been presented and discussed in the IRTF and the IETF as solutions for keeping latency low. To the best of our knowledge, they have so far only been evaluated or compared against each other using default parameter settings, which naturally presents a rather limited view of their operational range. We set thus to perform a broader experimental evaluation using real-world implementations in a wired testbed. We have in addition compared them with a decade-old variant of RED called Adaptive RED, which shares with CoDel and PIE the goal of {\textquoteleft}{\textquoteleft}knob-free{\textquoteright}{\textquoteright} operation. Surprisingly, in several instances results were favorable towards Adaptive RED.
},
	doi = {http://dx.doi.org/10.1109/INFCOMW.2014.6849173},
	author = {Khademi, Naeem and Ros, David and Welzl, Michael}
}
@article {19168,
	title = {Reducing Internet Latency: A Survey of Techniques and their Merits},
	journal = {IEEE Communications Surveys and Tutorials},
	volume = {18},
	year = {2014},
	month = {10/2016},
	pages = {2149{\textendash}2196},
	publisher = {IEEE Communications Society},
	abstract = {Latency is increasingly becoming a performance bottleneck for Internet Protocol (IP) networks, but historically networks have been designed with aims of maximizing throughput and utilization. This article offers a broad survey of techniques aimed at tackling latency in the literature up to August 2014, and their merits. A goal of this work is to be able to quantify and compare the merits of the different Internet latency reducing techniques, contrasting their gains in delay reduction versus the pain required to implement and deploy them. We found that classifying techniques according to the sources of delay they alleviate provided the best insight into the following issues: 1) the structural arrangement of a network, such as placement of servers and suboptimal routes, can contribute significantly to latency; 2) each interaction between communicating endpoints adds a Round Trip Time (RTT) to latency, especially significant for short flows; 3) in addition to base propagation delay, several sources of delay accumulate along transmission paths, today intermittently dominated by queuing delays; 4) it takes time to sense and use available capacity, with overuse inflicting latency on other flows sharing the capacity; and 5) within end systems delay sources include operating system buffering, head-of-line blocking, and hardware interaction. No single source of delay dominates in all cases, and many of these sources are spasmodic and highly variable. Solutions addressing these sources often both reduce the overall latency and make it more predictable.},
	keywords = {Internet, latency, network},
	issn = {1553-877X},
	doi = {10.1109/COMST.2014.2375213},
	url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true\&arnumber=6967689},
	author = {Briscoe, Bob and Brunstr{\"o}m, Anna and Petlund, Andreas and David Andrew {Hayes} and Ros, David and Tsang, Ing-Jyh and Gjessing, Stein and Fairhurst, Gorry and Griwodz, Carsten and Welzl, Michael}
}
@inproceedings {Briscoe13a:latency_survey_pos,
	title = {A Survey of Latency Reducing Techniques and their Merits},
	journal = {Proc. ISOC Workshop on Reducing Internet Latency},
	year = {2013},
	note = {(Position Paper)},
	month = {09/2013},
	keywords = {Algorithms, characterisation, co-ordination, congestion, Data Communication, Delay, Internet, metrics, networks, overhead, Performance, QoS, standardisation},
	url = {http://www.internetsociety.org/sites/default/files/pdf/accepted/16_rite-latency_survey_pos.pdf},
	author = {Briscoe, Bob and Brunstr{\"o}m, Anna and Ros, David and Petlund, Andreas and Tsang, Ing-Jyh and Gjessing, Stein and Fairhurst, Gorry}
}
