P
Peter Key
Researcher at Microsoft
Publications - 142
Citations - 5171
Peter Key is an academic researcher from Microsoft. The author has contributed to research in topics: Network congestion & Network packet. The author has an hindex of 39, co-authored 142 publications receiving 5042 citations. Previous affiliations of Peter Key include University of Cambridge & BT Group.
Papers
More filters
Proceedings ArticleDOI
PIC: practical Internet coordinates for distance estimation
TL;DR: PIC is introduced, a practical coordinate-based mechanism to estimate Internet network distance that does not rely on infrastructure nodes and it can compute accurate coordinates even when some peers are malicious.
Proceedings ArticleDOI
Rethinking Indoor Wireless Mesh Design: Low Power, Low Frequency, Full-Duplex
Bozidar Radunovic,Dinan Gunawardena,Peter Key,Alexandre Proutiere,Nikhil Singh,Vlad Balan,Gerald DeJean +6 more
TL;DR: This work proposes a novel indoor wireless mesh design paradigm, based on Low Frequency, using the newly freed white spaces previously used as analogue TV bands, and Low Power - 100 times less power than currently used.
Journal ArticleDOI
A decision-theoretic approach to call admission control in ATM networks
TL;DR: A simple and robust ATM call admission control is described, and the theoretical background for its analysis is developed, allowing an explicit treatment of the trade-off between cell loss and call rejection.
Journal ArticleDOI
Distributed admission control
TL;DR: This paper describes a framework for admission control for a packet-based network where the decisions are taken by edge devices or end-systems, rather than resources within the network, and allows networks to be explicitly analyzed, and consequently engineered.
Proceedings ArticleDOI
Efficient and fair MAC for wireless networks with self-interference cancellation
Nikhil Singh,Dinan Gunawardena,Alexandre Proutiere,Bozidar Radunovi,Horia Vlad Balan,Peter Key +5 more
TL;DR: This work proposes ContraFlow, a novel MAC that exploits the benefits of self-interference cancellation and increases spatial reuse, and uses full-duplex to eliminate hidden terminals, and rectify decentralized coordination inefficiencies among nodes, thereby improving fairness.