Learning to Share: Narrowband-Friendly Wideband Networks (2009)
Hariharan Rahul, Nate Kushman, Dina Katabi, Charles Sodini, Farinaz Edalat
Wideband technologies in the unlicensed spectrum can satisfy the ever-increasing demands for wireless bandwidth created by emerging rich media applications. The key challenge for such systems,...
Symbol-level Network Coding for Wireless Mesh Networks (2009)
Sachin Katti, Dina Katabi, Hari Balakrishnan, Muriel Medard
This paper describes MIXIT, a system that improves the throughput of wireless mesh networks. MIXIT exploits a basic property of mesh networks: even when no node receives a packet correctly, any given...
Learning to Share: Narrowband-Friendly Wideband Networks (2009)
Hariharan Rahul, Nate Kushman, Dina Katabi, Charles Sodini, Farinaz Edalat
Wideband technologies in the unlicensed spectrum can satisfy the ever-increasing demands for wireless bandwidth created by emerging rich media applications. The key challenge for such systems,...
What’sGoingOn?LearningCommunicationRulesIn (2009)
Srikanth Kandula, Ranveer Chandra, Dina Katabi
Existing trafficanalysis toolsfocusontrafficvolume. Theyidentify theheavy-hitters—flowsthatexchangehighvolumesofdata,yetfail toidentifythestructureimplicitinnetworktraffic—docertainflows...
1 Joint Relaying and Network Coding in Wireless Networks (2009)
Sachin Katti, Ivana Marić, Andrea Goldsmith, Dina Katabi, Muriel Médard
Abstract — Relaying is a fundamental building block of wireless networks. Sophisticated relaying strategies at the physical layer have been developed for a single flow, but multiple flows are...
Simple LCD Transmitter Camera Receiver Data Link (2009)
Katabi, Dina, Raskar, Ramesh, Mohan, Ankit, Woo, Grace
We demonstrate a freespace optical system using a consumer camera and projector in indoor environments using available devices for visual computing. Through design, prototype and experimentation with...
Simple LCD Transmitter Camera Receiver Data Link (2009)
Katabi, Dina, Raskar, Ramesh, Mohan, Ankit, Woo, Grace
We demonstrate a freespace optical system using a consumer camera and projector in indoor environments using available devices for visual computing. Through design, prototype and experimentation with...
Overcoming the Antennas-Per-Node Throughput Limit in MIMO LANs (2009)
Gollakota, Shyamnath, Perli, Samuel David, Katabi, Dina
Today, the number of concurrent packets in a MIMO LAN is limited by the number of antennas on the AP. This paper shows how to overcome this limit. It presents a new design where multiple client-AP...
Overcoming the Antennas-Per-Node Throughput Limit in MIMO LANs (2009)
Perli, Samuel David, Gollakota, Shyamnath, Katabi, Dina
Today, the number of concurrent packets in a MIMO LAN is limited by the number of antennas on the AP. This paper shows how to overcome this limit. It presents a new design where multiple client-AP...
SoftCast: One Video to Serve All Wireless Receivers (2009)
Jakubczak, Szymon, Rahul, Hariharan, Katabi, Dina
The main challenge in wireless video multicast is to scalably servemultiple receivers who have different channel characteristics. Currentwireless transmission schemes, however, cannot support...
SoftCast: One Video to Serve All Wireless Receivers (2009)
Katabi, Dina, Rahul, Hariharan, Jakubczak, Szymon
The main challenge in wireless video multicast is to scalably serve multiple receivers who have different channel characteristics. Current wireless transmission schemes, however, cannot support...
— A systems approach to network coding (2009)
Wenjun Hu, Sachin Katti, Hariharan Rahul, Dina Katabi, Jon Crowcroft
Sending more for less bandwidth and power
Sachin Katti, Dina Katabi, Wenjun Hu, Hariharan Rahul, Muriel Médard
This paper applies network coding to wireless mesh networks and presents the first implementation results. It introduces COPE, an opportunistic approach to network coding, where each node snoops on...
Sachin Katti, Dina Katabi, Wenjun Hu, Hariharan Rahul, Muriel Médard
This paper applies network coding to wireless mesh networks and presents the first implementation results. It introduces COPE, an opportunistic approach to network coding, where each node snoops on...
Sachin Katti, Dina Katabi, Wenjun Hu, Hariharan Rahul, Muriel Médard
This paper applies network coding to wireless mesh networks and presents the first implementation results. It introduces COPE, an opportunistic approach to network coding, where each node snoops on...
ABSTRACT Can You Hear Me Now?! It Must Be BGP (2008)
Nate Kushman, Srikanth Kandula, Dina Katabi
Industry observers expect VoIP to eventually replace most of the existing land-line telephone connections. Currently however, quality and reliability concerns largely limit VoIP usage to either...
One Video Stream to Serve Diverse Receivers (2008)
Chachulski, Szymon, Katabi, Dina, Woo, Grace
The fundamental problem of wireless video multicast is to scalably serve multiple receivers which may have very different channel characteristics. Ideally, one would like to broadcast a single stream...
One Video Stream to Serve Diverse Receivers (2008)
Chachulski, Szymon, Katabi, Dina, Woo, Grace
The fundamental problem of wireless video multicast is to scalably serve multiple receivers which may have very different channel characteristics. Ideally, one would like to broadcast a single stream...
ZigZag Decoding: Combating Hidden Terminals In Wireless Networks (2008)
Gollakota, Shyamnath, Katabi, Dina
This paper presents ZigZag, an 802.11 receiver design that combats hidden terminals. ZigZag's core contribution is a new form of interference cancellation that exploits asynchrony across successive...
ZigZag Decoding: Combating Hidden Terminals In Wireless Networks (2008)
Gollakota, Shyamnath, Katabi, Dina
This paper presents ZigZag, an 802.11 receiver design that combats hidden terminals. ZigZag's core contribution is a new form of interference cancellation that exploits asynchrony across successive...
Sachin Katti, Dina Katabi, Wenjun Hu, Hariharan Rahul, Muriel Médard
This paper applies network coding to wireless mesh networks and presents the first implementation results. It introduces COPE, an opportunistic approach to network coding, where each node snoops on...
Resilient Network Coding in the Presence of Byzantine Adversaries (2008)
Jaggi, Sidharth, Langberg, Michael, Katti, Sachin, Ho, Tracey, Katabi, Dina, Médard, Muriel, ...
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up...
ZigZag Decoding: Combating Hidden Terminals in Wireless Networks (2008)
Katabi, Dina, Gollakota, Shyamnath
This paper presents ZigZag, an 802.11 receiver that combats hidden terminals. ZigZag exploits 802.11 retransmissions which, in the case of hidden terminals, cause successive collisions. Due to...
ZigZag Decoding: Combating Hidden Terminals in Wireless Networks (2008)
Katabi, Dina, Gollakota, Shyamnath
This paper presents ZigZag, an 802.11 receiver that combats hidden terminals. ZigZag exploits 802.11 retransmissions which, in the case of hidden terminals, cause successive collisions. Due to...
Rules of Abnormal BGP Events (2008)
Jun Li, Dejing Dou, Zhen Wu, Shiwoong Kim, Vikash Agarwal, Dina Katabi, ...
There is an emergent interest in using statistical and Machine Learning techniques to mine network data. Papers that use neural networks, Bayesian analysis, SVM, PCA, are increasingly common. They...
Beyond the bits: Cooperative packet recovery using phy information (2008)
Grace R. Woo, Pouya Kheradpour, Dawei Shen, Dina Katabi
Users increasingly depend on WLAN for business and entertainment. However, they occasionally experience dead spots and high loss rates. We show that these problems can be addressed by exposing...
Wireless Network Coding: Opportunities & Challenges (2008)
Christina Fragouli, Dina Katabi, Athina Markopoulou, Muriel Médard, Hariharan Rahul
Abstract—Wireless networks suffer from a variety of unique problems such as low throughput, dead spots, and inadequate support for mobility. However, their characteristics such as the broadcast...
Beyond the bits: Cooperative packet recovery using phy information (2008)
Grace Rusi Woo, Pouya Kheradpour, Dina Katabi, Grace Rusi, Woo Pouya, Kheradpour Dina Katabi
Wireless networks can suffer from high packet loss rates. This paper shows that the loss rate can be significantly reduced by exposing information readily available at the physical layer. We make the...
ABSTRACT Trading Structure for Randomness in Wireless Opportunistic Routing (2008)
Szymon Chachulski, Michael Jennings, Sachin Katti, Dina Katabi
Opportunistic routing is a recent technique that achieves high throughput in the face of lossy wireless links. The current opportunistic routing protocol, ExOR, ties the MAC with routing, imposing a...
ABSTRACT Walking the Tightrope: Responsive Yet Stable Traffic Engineering (2008)
Current intra-domain Traffic Engineering (TE) relies on offline methods, which use long term average traffic demands. It cannot react to realtime traffic changes caused by BGP reroutes, diurnal...
Zigzag decoding: Combating hidden terminals in wireless networks (2008)
Shyamnath Gollakota, Dina Katabi
This paper presents ZigZag, an 802.11 receiver design that combats hidden terminals. ZigZag’s core contribution is a new form of interference cancellation that exploits asynchrony across successive...
This paper presents new non-intrusive measurement techniques to detect sharing of upstream congestion and discover bottleneck router link speeds. Our techniques are completely passive and require...
This paper presents new non-intrusive measurement techniques to detect sharing of upstream congestion and discover bottleneck router link speeds. Our techniques are completely passive and require...
Using Precise Feedback for Controlling Congestion in the Internet (2007)
Mark H, Dina Katabi, Dina Katabi, Mark Handley
This paper explores the potential of improving Internet congestion control by providing precise congestion feedback to the sources instead of the implicit and binary feedback used by TCP. We propose...
Abstract Using Precise Feedback for Controlling Congestion in the Internet (2007)
Mark H, Dina Katabi, Dina Katabi, Mark Handley
This paper explores the potential of improving Internet congestion control by providing precise congestion feedback to the sources instead of the implicit and binary feedback used by TCP. We propose...
MIXIT: The Network Meets the Wireless Channel (2007)
The traditional contract between the network and the lower layers states that the network does routing and the lower layers deliver correct packets. In a wireless network, however, different nodes...
MIXIT: The Network Meets the Wireless Channel (2007)
The traditional contract between the network and the lower layers states that the network does routing and the lower layers deliver correct packets. In a wireless network, however, different nodes...
Beyond the Bits: Cooperative Packet Recovery Using Physical Layer Information (2007)
Woo, Grace Rusi, Kheradpour, Pouya, Katabi, Dina
PhD thesis
Beyond the Bits: Cooperative Packet Recovery Using Physical Layer Information (2007)
Woo, Grace Rusi, Kheradpour, Pouya, Katabi, Dina
PhD thesis
Embracing Wireless Interference: Analog Network Coding (2007)
Katti, Sachin, Gollakota, Shyamnath, Katabi, Dina
Traditionally, interference is considered harmful.Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the opposite...
Information Slicing: Anonymity Using Unreliable Overlays (2007)
Katti, Sachin, Cohen, Jeffrey, Katabi, Dina
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the public keys of the...
Trading Structure for Randomness in Wireless Opportunistic Routing (2007)
Chachulski, Szymon, Jennings, Michael, Katti, Sachin, Katabi, Dina
Opportunistic routing is a recent technique that achieves high throughput in the face of lossy wireless links. The current opportunistic routing protocol, ExOR, ties the MAC with routing, imposing a...
Trading Structure for Randomness in Wireless Opportunistic Routing (2007)
Chachulski, Szymon, Jennings, Michael, Katti, Sachin, Katabi, Dina
Opportunistic routing is a recent technique that achieves high throughput in the face of lossy wireless links. The current opportunistic routing protocol, ExOR, ties the MAC with routing, imposing a...
Information Slicing: Anonymity Using Unreliable Overlays (2007)
Katti, Sachin, Cohen, Jeffrey, Katabi, Dina
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the public keys of the...
Embracing Wireless Interference: Analog Network Coding (2007)
Katti, Sachin, Gollakota, Shyamnath, Katabi, Dina
Traditionally, interference is considered harmful.Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the opposite...
Embracing wireless interference: Analog network coding (2007)
Sachin Katti, Shyamnath Gollakota, Dina Katabi
Traditionally, interference is considered harmful. Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the...
Information slicing: Anonymity using unreliable overlays (2007)
Sachin Katti, Jeff Cohen, Dina Katabi
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the public keys of the...
Joint Relaying and Network Coding in Wireless Networks (2007)
Sachin Katti, Ivana Marić, Andrea Goldsmith, Dina Katabi, Muriel Médard
Abstract — Relaying is a fundamental building block of wireless networks. Sophisticated relaying strategies at the physical layer have been developed for a single flow, but multiple flows are...
Embracing wireless interference: Analog network coding (2007)
Sachin Katti, Shyamnath Gollakota, Dina Katabi
Traditionally, interference is considered harmful. Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the...
Embracing wireless interference: Analog network coding (2007)
Sachin Katti, Shyamnath Gollakota, Dina Katabi
Traditionally, interference is considered harmful. Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the...
R-BGP: Staying Connected in a Connected World (2007)
Nate Kushman, Srikanth Kandula, Dina Katabi, Bruce M. Maggs
Many studies show that, when Internet links go up or down, the dynamics of BGP may cause several minutes of packet loss. The loss occurs even when multiple paths between the sender and receiver...
Trading structure for randomness in wireless opportunistic routing (2007)
Szymon Chachulski, Szymon Chachulski, Michael Jennings, Michael Jennings, Sachin Katti, Dina Katabi, ...
Opportunistic routing is a recent technique that achieves high throughput in the face of lossy wireless links. The current opportunistic routing protocol, ExOR, ties the MAC with routing, imposing a...
Trading structure for randomness in wireless opportunistic routing (2007)
Dina Katabi, Szymon Chachulski, Szymon Chachulski
by
Embracing wireless interference: Analog network coding (2007)
Sachin Katti, Shyamnath Gollakota, Dina Katabi
Traditionally, interference is considered harmful. Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the...
Can you hear me now?! it must be BGP (2007)
Nate Kushman, Srikanth Kandula, Dina Katabi
This paper uses empirical results to argue that VoIP’s performance is unacceptable and BGP is the main culprit. 1
R-BGP: Staying Connected In a Connected World (2007)
Nate Kushman, Srikanth Kandula, Dina Katabi, Bruce M. Maggs
Many studies show that, when Internet links go up or down, the dynamics of BGP may cause several minutes of packet loss. The loss occurs even when multiple paths between the sender and receiver...
Resilient Network Coding In the Presence of Byzantine Adversaries (2006)
Jaggi, Sidharth, Langberg, Michael, Katti, Sachin, Ho, Tracy, Katabi, Dina, Medard, Muriel
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up...
Resilient Network Coding In the Presence of Byzantine Adversaries (2006)
Jaggi, Sidharth, Langberg, Michael, Katti, Sachin, Ho, Tracy, Katabi, Dina, Medard, Muriel
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up...
Iterative Collaborative Ranking of Customers and Providers (2006)
This paper introduces a new application: predicting the Internet provider-customer market. We cast the problem in the collaborative filtering framework, where we use current and past...
Iterative Collaborative Ranking of Customers and Providers (2006)
This paper introduces a new application: predicting the Internet provider-customer market. We cast the problem in the collaborative filtering framework, where we use current and past...
MORE: A Network Coding Approach to Opportunistic Routing (2006)
Chachulski, Szymon, Jennings, Michael, Katti, Sachin, Katabi, Dina
Opportunistic routing has the potential to substantially increase wireless network throughput. Prior work on opportunistic routing, however, requires tight node coordination. Different nodes in a...
MORE: A Network Coding Approach to Opportunistic Routing (2006)
Chachulski, Szymon, Jennings, Michael, Katti, Sachin, Katabi, Dina
Opportunistic routing has the potential to substantially increase wireless network throughput. Prior work on opportunistic routing, however, requires tight node coordination. Different nodes in a...
Network Coding Made Practical (2006)
Katti, Sachin, Rahul, Hariharan, Hu, Wenjun, Katabi, Dina, Crowcroft, Jon
We propose a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each...
Network Coding Made Practical (2006)
Katti, Sachin, Rahul, Hariharan, Hu, Wenjun, Katabi, Dina, Crowcroft, Jon
We propose a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each...
A Consistency Management Layer for Inter-Domain Routing (2006)
Kushman, Nate, Katabi, Dina, Wroclawski, John
This paper proposes an isolation layer -- a shim -- betweeninter-domain routing and packet forwarding. The job of this layer isto coordinate between Autonomous Systems (AS's) on when and how tomodify...
A Consistency Management Layer for Inter-Domain Routing (2006)
Kushman, Nate, Katabi, Dina, Wroclawski, John
This paper proposes an isolation layer -- a shim -- betweeninter-domain routing and packet forwarding. The job of this layer isto coordinate between Autonomous Systems (AS's) on when and how tomodify...
Dynamic Load Balancing Without Packet Reordering (2006)
Srikanth Kandula, Dina Katabi, Shantanu Sinha, Arthur Berger
Dynamic load balancing is a popular recent technique that protects ISP networks from sudden congestion caused by load spikes or link failures. Dynamic load balancing protocols, however, require...
XORs in The Air: Practical Wireless Network Coding (2006)
Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft
This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content...
XORs in the air: practical wireless network coding (2006)
Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft
This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content...
XORs in the air: practical wireless network coding (2006)
Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft
This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content...
Slicing the Onion: Anonymous Routing Without PKI (2005)
Katti, Sachin, Katabi, Dina, Puchala, Katarzyna
Recent years have witnessed many proposals for anonymous routing in overlay peer-to-peer networks. The proposed protocols either expose the receiver and the message content, or require the overlay...
Slicing the Onion: Anonymous Routing Without PKI (2005)
Katti, Sachin, Katabi, Dina, Puchala, Katarzyna
Recent years have witnessed many proposals for anonymous routing in overlay peer-to-peer networks. The proposed protocols either expose the receiver and the message content, or require the overlay...
Slicing the onion: Anonymous routing without PKI (2005)
Sachin Katti, Dina Katabi, Katarzyna Puchala
Abstract – Recent years have witnessed many proposals for anonymous routing in overlay peer-to-peer networks. To provide both sender and receiver anonymity, the proposed protocols require the...
Slicing the onion: Anonymous routing without PKI (2005)
Sachin Katti, Dina Katabi, Katarzyna Puchala
Abstract – Recent years have witnessed many proposals for anonymous routing in overlay peer-to-peer networks. The proposed protocols either expose the receiver and the message content, or require...
Slicing the onion: Anonymous routing without PKI (2005)
Sachin Katti, Dina Katabi, Katarzyna Puchala
Abstract – Recent years have witnessed many proposals for anonymous routing in overlay peer-to-peer networks. To provide both sender and receiver anonymity, the proposed protocols require the...
Botz-4-sale: Surviving organized ddos attacks that mimic flash crowds (2005)
Srikanth Kandula, Dina Katabi, Matthias Jacob, Arthur Berger
Abstract – Recent denial of service attacks are mounted by professionals using Botnets of tens of thousands of compromised machines. To circumvent detection, attackers are increasingly moving away...
Botz-4-sale: Surviving organized ddos attacks that mimic flash crowds (2005)
Srikanth Kandula, Dina Katabi, Matthias Jacob, Arthur Berger
Abstract – Recent denial of service attacks are mounted by professionals using Botnets of tens of thousands of compromised machines. To circumvent detection, attackers are increasingly moving away...
Botz-4-sale: Surviving organized ddos attacks that mimic flash crowds (2005)
Srikanth Kandula, Dina Katabi, Matthias Jacob, Arthur Berger
Abstract – Recent denial of service attacks are mounted by professionals using Botnets of tens of thousands of compromised machines. To circumvent detection, attackers are increasingly moving away...
Botz-4-sale: Surviving organized ddos attacks that mimic flash crowds (2005)
Srikanth Kandula, Dina Katabi, Matthias Jacob, Arthur Berger
Abstract – Recent denial of service attacks are mounted by professionals using Botnets of tens of thousands of compromised machines. To circumvent detection, attackers are increasingly moving away...
Collaborating Against Common Enemies (2005)
Sachin Katti Balachander, Sachin Katti, Balachander Krishnamurthy, Dina Katabi
This paper presents the first wide-scale study of correlated attacks, i.e., attacks mounted by the same source IP against di#erent networks. Using a large dataset from 1700 intrusion detection...
Collaborating against common enemies (2005)
Sachin Katti, Balachander Krishnamurthy, Dina Katabi
This paper presents the first wide-scale study of correlated attacks, i.e., attacks mounted by the same source IP against different networks. Using a large dataset from 1700 intrusion detection...
Collaborating against common enemies (2005)
Sachin Katti, Balachander Krishnamurthy, Dina Katabi
This paper presents the first wide-scale study of correlated attacks, i.e., attacks mounted by the same source IP against different networks. Using a large dataset from 1700 intrusion detection...
Slicing the onion: Anonymous routing without PKI (2005)
Sachin Katti, Sachin Katti, Dina Katabi, Dina Katabi, Katarzyna Puchala, Katarzyna Puchala
Abstract – Recent years have witnessed many proposals for anonymous routing in overlay peer-to-peer networks. The proposed protocols either expose the receiver and the message content, or require...
Botz-4-Sale: Surviving Organized DDoS Attacks that Mimic Flash Crowds (2004)
Kandula, Srikanth, Katabi, Dina, Jacob, Matthias, Berger, Arthur
Recent denial of service attacks are mounted by professionalsusing Botnets of tens of thousands of compromisedmachines. To circumvent detection, attackers areincreasingly moving away from pure...
Botz-4-Sale: Surviving Organized DDoS Attacks that Mimic Flash Crowds (2004)
Kandula, Srikanth, Katabi, Dina, Jacob, Matthias, Berger, Arthur
Recent denial of service attacks are mounted by professionalsusing Botnets of tens of thousands of compromisedmachines. To circumvent detection, attackers areincreasingly moving away from pure...
M&M: A Passive Toolkit for Measuring, Correlating, and Tracking Path Characteristics (2004)
Katti, Sachin, Katabi, Dina, Kohler, Eddie, Strauss, Jacob
This paper presents M&M, a passive measurement toolkitsuitable for large-scale studies of Internet path characteristics.The multiQ tool uses equally-spaced mode gaps in TCP flowsÂpacket...
M&M: A Passive Toolkit for Measuring, Correlating, and Tracking Path Characteristics (2004)
Katti, Sachin, Katabi, Dina, Kohler, Eddie, Strauss, Jacob
This paper presents M&M, a passive measurement toolkitsuitable for large-scale studies of Internet path characteristics.The multiQ tool uses equally-spaced mode gaps in TCP flowsÂpacket...
M&M: A passive toolkit for measuring, correlating, and tracking path characteristics (2004)
Sachin Katti, Dina Katabi, Eddie Kohler, Jacob Strauss
This paper presents M&M, a passive measurement toolkit suitable for large-scale studies of Internet path characteristics. ThemultiQ tool uses equally-spaced mode gaps in TCP flows’ packet...
M&M: A passive toolkit for measuring, tracking and correlating path characteristics (2004)
Sachin Katti, Dina Katabi, Chuck Blake, Eddie Kohler, Jacob Strauss
This paper presents M&M, a passive measurement toolkit suitable for large-scale studies of Internet path characteristics. ThemultiQ tool uses equally-spaced mode gaps in TCP flows’ packet...
MultiQ: Automated Detection of Multiple Bottleneck Capacities Along a Path (2004)
Sachin Katti, Dina Katabi, Charles Blake, Eddie Kohler, Jacob Strauss
multiQ is a passive capacity measurement tool suitable for largescale studies of Internet path characteristics. It is the first passive tool that discovers the capacity of multiple congested links...
Shantanu K Sinha, Al N, Dina Katabi, Shantanu K Sinha
TCP's burstiness is usually regarded as harmful, or at best, inconvenient. Instead, this thesis suggests a new perspective and examines whether TCP's burstiness is useful for certain...
MultiQ: Automated Detection of Multiple Bottleneck Capacities Along a Path (2004)
Sachin Katti, Dina Katabi, Charles Blake, Eddie Kohler, Jacob Strauss
multiQ is a passive capacity measurement tool suitable for largescale studies of Internet path characteristics. It is the first passive tool that discovers the capacity of multiple congested links...
A measurement study of available bandwidth estimation tools (2003)
Jacob Strauss, Dina Katabi, Frans Kaashoek
Available bandwidth estimation is useful for route selection in overlay networks, QoS verification, and traffic engineering. Recent years have seen a surge in interest in available bandwidth...
David Clark, Dina Katabi, Dina Katabi
In this dissertation, we propose a new architecture for Internet congestion control that decouples the control of congestion from the bandwidth allocation policy. We show that the new protocol,...
Congestion control for high bandwidth-delay product networks (2002)
Dina Katabi, Mark Handley, Charlie Rohrs
Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes...
Congestion control for high bandwidth-delay product networks (2002)
Dina Katabi, Mark H, Ley Charlie Rohrs
Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes...
A note on the stability requirements of adaptive virtual queue (2002)
Choosing the correct values for the parameters of an Active Queue Management (AQM) scheme is a well-known hard problem. The Adaptive Virtual Queue (AVQ) attempts at solving this problem by using...
Internet congestion control for future high bandwidth-delay product environments (2002)
Dina Katabi, Mark Handley, Charlie Rohrs
Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes...
Internet Congestion Control for Future High Bandwidth-Delay Product (2002)
Environments Dina Katabi, Dina Katabi, Mark Handley, Charlie Rohrs
Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes...
Congestion control for high bandwidth-delay product networks (2002)
For the Internet to continue to thrive, its congestion control mechanism must remain effective as the network evolves. Technology trends indicate that the future Internet will have a large number of...
A Passive Approach for Detecting Shared Bottlenecks (2001)
Dina Katabi, Issam Bazzi, Xiaowei Yang
There is a growing interest in discovering Internet path characteristics using end-to-end measurements. However, the current mechanisms for performing this task either send probe traffic, or require...
Inferring congestion sharing and path characteristics for packet interarrival times (2001)
This paper presents new non-intrusive measurement techniques to detect sharing of upstream congestion and discover bottleneck router link speeds. Our techniques are completely passive and require...
A Framework for Scalable Global IP-Anycast (GIA (2000)
This paper proposes GIA, a scalable architecture for global IPanycast. Existing designs for providing IP-anycast must either globally distribute routes to individual anycast groups, or confine each...
Dina Katabi, Issam Bazzi, Xiaowei Yang
Recent years have marked a growing interest in studying Internet path characteristics. However, most of the currently available tools to an end system to perform such measurements are slow inaccurate...
Dina Katabi, Issam Bazzi, Xiaowei Yang
Recent years have marked a growing interest in studying Internet performance. However, most of the currently available tools to an end system to perform such measurements are slow inaccurate and...
Future Generation Network Architecture (New Arch) (1998)
Clark, David, Sollins, Karen, Wroclawski, John, Katabi, Dina, Kulik, Joanna
This report describes an effort to understand how the Internet might be designed today if we could make a fresh start. The goal is to understand the current set of requirements that drive the...
New ARCH: Future Generation Internet Architecture (1998)
Clark, David, Braden, Robert, Sollins, Karen, Wroclawski, John, Katabi, Dina
This report describes an effort to understand how the Internet might be designed today if we could make a fresh start. The goal is to understand the current set of requirements that drive the...