Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bob Briscoe

dblp:49/3745 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
3 papers
Transport protocols and congestion control · 64% Network optimization and economics · 27% Internet architecture and protocols · 10%
Network and information security
1 paper
Cryptographic protocols and secure computation · 50% Network security · 25% Authentication and access control · 25%

Topics — the 13 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
active queue management
0.212016
PI2: A Linearized AQM for both Classic and Scalable TCP · CoNEXT 2016
Transport protocols and congestion control › active queue management
PI controller
0.212016
PI2: A Linearized AQM for both Classic and Scalable TCP · CoNEXT 2016
Internet architecture and protocols
traffic policing
0.122008
Policing freedom to use the internet resource pool · CoNEXT 2008
Policing congestion response in an internetwork using re-feedback · SIGCOMM 2005
Network optimization and economics
fairness
0.112008
Policing freedom to use the internet resource pool · CoNEXT 2008
Network optimization and economics
resource allocation
0.112008
Policing freedom to use the internet resource pool · CoNEXT 2008
Network optimization and economics
resource sharing
0.112008
Policing freedom to use the internet resource pool · CoNEXT 2008
Transport protocols and congestion control › TCP variants
scalable TCP
0.112016
PI2: A Linearized AQM for both Classic and Scalable TCP · CoNEXT 2016
Transport protocols and congestion control
TCP congestion control
0.112016
PI2: A Linearized AQM for both Classic and Scalable TCP · CoNEXT 2016
Network optimization and economics › network economics › internet economics
network neutrality
0.012008
Policing freedom to use the internet resource pool · CoNEXT 2008
Cryptographic protocols and secure computation
key management
0.011999
Nark: receiver-based multicast non-repudiation and key management · EC 1999
Cryptographic protocols and secure computation › key management › key distribution › group key distribution
multicast key distribution
0.011999
Nark: receiver-based multicast non-repudiation and key management · EC 1999
Authentication and access control
non-repudiation
0.011999
Nark: receiver-based multicast non-repudiation and key management · EC 1999
Network security › secure communication › secure group communication
secure multicast
0.011999
Nark: receiver-based multicast non-repudiation and key management · EC 1999

Methods — techniques the papers use, named apart from their topics

linearization · 0.2control theory · 0.2architectural analysis · 0.1game-theoretic mechanism design · 0.1receiver-based protocols · 0.0
YearPublicationVenuePosition
2016 PI2: A Linearized AQM for both Classic and Scalable TCP
abstract
This paper concerns the use of Active Queue Management (AQM) to reduce queuing delay. It offers insight into why it has proved hard for a Proportional Integral (PI) controller to remain both responsive and stable while controlling `Classic' TCP flows, such as TCP Reno and Cubic. Due to their non-linearity, the controller's adjustments have to be smaller when the target drop probability is lower. The PI Enhanced (PIE) algorithm attempts to solve this problem by scaling down the adjustments of the controller using a look-up table. Instead, we control an internal variable that is by definition linearly proportional to the load, then post-process it into the required Classic drop probability---in fact we show that the output simply needs to be squared. This allows tighter control, giving responsiveness and stability better or no worse than PIE achieves, but without all its corrective heuristics.
Koen De Schepper, Olga Bondarenko, Ing Jyh Tsang, Bob Briscoe
CoNEXT4
2016 Ultra-low delay for all: live experience, live analysis
abstract
This demo dramatically illustrates how replacing 'Classic' TCP congestion control (Reno, Cubic, etc.) with a 'Scalable' alternative like Data Centre TCP (DCTCP) keeps queuing delay ultra-low; not just for a select few light applications like voice or gaming, but even when a variety of interactive applications all heavily load the same (emulated) Internet access. DCTCP has so far been confined to data centres because it is too aggressive---it starves Classic TCP flows. To allow DCTCP to be exploited on the public Internet, we developed DualQ Coupled Active Queue Management (AQM), which allows the two TCP types to safely co-exist. Visitors can test all these claims. As well as running Web-based apps, they can pan and zoom a panoramic video of a football stadium on a touch-screen, and experience how their personalized HD scene seems to stick to their finger, even though it is encoded on the fly on servers accessed via an emulated delay, representing 'the cloud'. A pair of VR goggles can be used at the same time, making a similar point. The demo provides a dashboard so that visitors can not only experience the interactivity of each application live, but they can also quantify it via a wide range of performance stats, updated live. It also includes controls so visitors can configure different TCP variants, AQMs, network parameters and background loads and immediately test the effect.
Olga Bondarenko, Koen De Schepper, Ing Jyh Tsang, Bob Briscoe, Andreas Petlund, Carsten Griwodz
MMSys4
2008 Policing freedom to use the internet resource pool
abstract
Ideally, everyone should be free to use as much of the Internet resource pool as they can take. But, whenever too much load meets too little capacity, everyone's freedoms collide. We show that attempts to isolate users from each other have corrosive side-effects - discouraging mutually beneficial sharing of the resource pool and harming the Internet's evolvability. We describe an unusual form of traffic policing which only pushes back against those who use their freedom to limit the freedom of others. This offers a vision of how much better the Internet could be. But there are subtle aspects missing from the current Internet architecture that prevent this form of policing being deployed. This paper aims to shift the research agenda onto those issues, and away from earlier attempts to isolate users from each other.
Arnaud Jacquet, Bob Briscoe, Toby Moncaster
CoNEXT2
2005 Policing congestion response in an internetwork using re-feedback
abstract
This paper introduces a novel feedback arrangement, termed re-feedback. It ensures metrics in data headers such as time to live and congestion notification will arrive at each relay carrying a truthful prediction of the remainder of their path. We propose mechanisms at the network edge that ensure the dominant selfish strategy of both network domains and end-points will be to set these headers honestly and to respond correctly to path congestion and delay, despite conflicting interests. Although these mechanisms influence incentives, they don't involve tampering with end-user pricing. We describe a TCP rate policer as a specific example of this new capability. We show it can be generalised to police various qualities of service. We also sketch how a limited form of re-feedback could be deployed incrementally around unmodified routers without changing IP.
Bob Briscoe, Arnaud Jacquet, Carla Di Cairano-Gilfedder, Alessandro Salvatori, Andrea Soppera, Martin Koyabe
SIGCOMM1
2003 A market managed multi-service Internet (M3I)
Bob Briscoe, Vasilios Darlagiannis, Oliver Heckmann, Huw Oliver, Vasilios A. Siris, David Songhurst, Burkhard Stiller
Comput. Commun.1
2002 Economic models for resource control in wireless networks
abstract
We present a model based on congestion pricing for resource control in wireless CDMA networks carrying traffic streams that have fixed-rate requirements, but can adapt their signal quality. Our model considers the resource usage constraint in the uplink of CDMA networks, and does not differentiate users based on their distance from the base station. We compare our model with other economic models that have appeared in the literature, identifying their similarities and differences. Our investigations include the effects of a mobile's distance and the wireless network's load on the target signal quality, the transmission power, and the user benefit.
Vasilios A. Siris, Bob Briscoe, David Songhurst
PIMRC2
1999 A Charging Model for Sessions on the Internet
abstract
A chargeable session on the Internet may consist of more than one underlying chargeable service. Typically there will be two, one at the network layer and one at the session layer. Since different applications can have different demands from the network, a generic charging scheme has to separate the service provided by the network from the service provided by an application/service provider. In this paper we propose a pricing model which is session-based and we look at the impact of this on real-time multimedia conferencing over the Internet. In this model, we are trying to allow for the optional integration of charging at the network layer with charging at the session layer, while keeping the underlying technologies still cleanly apart. This paper also highlights the fact that the main problem of pricing application on the Internet is not just a simple case of analyzing the most technically feasible pricing mechanism but also making the solution acceptable to users. We take the position that session-based pricing is easier for end users to accept and understand and show why this is the case in this paper.
Nadia Kausar, Bob Briscoe, Jon Crowcroft
ISCC2
1999 Nark: receiver-based multicast non-repudiation and key management
abstract
Article Nark: receiver-based multicast non-repudiation and key management Share on Authors: Bob Briscoe BT Research, B54/74, BT Adastral Park, Martlesham Heath, Ipswich, IP5 3RE, England BT Research, B54/74, BT Adastral Park, Martlesham Heath, Ipswich, IP5 3RE, EnglandView Profile , Ian Fairman BT Research, c/o B54/74, BT Adastral Park, Martlesham Heath, Ipswich, IP5 3RE, England BT Research, c/o B54/74, BT Adastral Park, Martlesham Heath, Ipswich, IP5 3RE, EnglandView Profile Authors Info & Claims EC '99: Proceedings of the 1st ACM conference on Electronic commerceNovember 1999 Pages 22–30https://doi.org/10.1145/336992.336999Online:01 November 1999Publication History 18citation569DownloadsMetricsTotal Citations18Total Downloads569Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Bob Briscoe, Ian Fairman
EC1