Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. End-to-End Transmission Control by Modeling Uncertainty about the Network State

End-to-End Transmission Control by Modeling Uncertainty about the Network State

Thumbnail Image
Name

dspace.pdf

Size

259 KB

Format

Adobe PDF

Checksum (MD5)

017547af1c31d6924ad44855b09be78b

Author(s)
Winstein, Keith J.
•
Balakrishnan, Hari
Date Issued
November 2011
Journal
Proceedings of the Tenth ACM Workshop on Hot Topics in Networks (Hotnets X)
Publisher
Association for Computing Machinery
Citation
Winstein, Keith and Hari Balakrishnan. "End-to-End Transmission Control by Modeling Uncertainty about the Network State." In: Proceedings of the Tenth ACM Workshop on Hot Topics in Networks (Hotnets X), November 14-15, 2011, Cambridge, Mass.
Version
Author's final manuscript
Abstract
This paper argues that the bar for the incorporation of a new subnetwork or link technology in the current Internet is much more than the ability to send minimum-sized IP packets: success requires that TCP perform well over any subnetwork. This requirement imposes a number of additional constraints, some hard to meet because TCP’s network model is limited and its overall objective challenging to specify precisely. As a result, network evolution has been hampered and the potential of new subnetwork technologies has not been realized in practice. The poor end-to-end performance of many important subnetworks, such as wide-area cellular networks that zealously hide non-congestive losses and introduce enormous delays as a result, or home broadband networks that suffer from the notorious “bufferbloat” problem, are symptoms of this more general issue. We propose an alternate architecture for end-to-end resource management and transmission control, in which the endpoints work directly to achieve a specified goal. Each endpoint treats the network as an nondeterministic automaton whose parameters and topology are uncertain. The endpoint maintains a probability distribution on what it thinks the network’s configuration may be. At each moment, the endpoint acts to maximize the expected value of a utility function that is given explicitly. We present preliminary simulation results arguing that the approach is tractable and holds promise.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
http://creativecommons.org/licenses/by-nc-sa/3.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/67032
DOI of Published Version
http://conferences.sigcomm.org/hotnets/2011/program.shtml
http://dblp.uni-trier.de/db/conf/hotnets/hotnets2011.html
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.