Back to search

Athens University Economics and Business (AUEB)

Congestion and error control for multi-party content distribution

Abstract

dc:description

We have recently experienced a considerable research drive targeting new architectures for the next generation of the Internet, which drop the current design in order to improve the efficiency of large-scale content delivery, as well as other emerging applications, such as machine to machine communications. These efforts have brought to the forefront alternative communication paradigms: some future Internet architectures are based on native one-to-many (multicast) communication to make content distribution more efficient, most sensor network architectures focus on many-to-one communication from the sensors to the sink, while file exchange applications like BitTorrent make use of many-to-many communication. The design and implementation of the omnipresent Internet architecture however leans on the traditional telephone network idea, where there are only two parties wishing to communicate. Extending the Internet model to multiparty communication requires considerable engineering effort and costs, as such a radical redesign brings to the forefront the need to design new protocols at all layers of the networking stack. This dissertation focuses on the design of transport and application layer protocols that can support different types of multi-party content distribution applications. The first part of this dissertation deals with the issue of error control for multicast communication, as applied to the Information Centric Networking (ICN) context. Despite the fact there is a lot of work on reliable transport for IP Multicast, none has achieved to fully solve the problem of feedback implosion towards the sender as group size grows, while existing solutions are not amenable to the special characteristics of ICN and its native multicast mechanisms. We have proposed a suitable solution for ICN (RMTPSI) and we compared it against one of the most well-known mechanisms for IP Multicast (PGM). Our simulations show that RMTPSI is more efficient than PGM, while requiring the same time to complete a reliable transfer as PGM; specifically, RMTPSI requires 2.9% to 10.2% fewer downstream transmissions and 4.6% to 12.1% fewer total transmissions than PGM. In the second part of this dissertation we move from one-to-many communication to the reverse problem, reliable many-to-one communication, a very common problem in the sensor networks area, where large numbers of sensors transmit data to a single sink node. As sensors become cheaper and more powerful, sensor networks face the challenge of controlling all these devices in a efficient manner, which naturally leads to a sink-driven transport scheme. We have proposed a sink-driven reliable transport protocol for sensor networks which places the responsibility for transmission rate allocation, congestion avoidance and error control to the sink. The protocol is implemented at the application level, which allows it to be used without supervisor privileges, as well as enabling the application at hand to fine tune its operational parameters. Our protocol was implemented and tested over a real network with emulated losses and compared against a well-known sink driven approach (RCRT). The results show that our approach exploits available bandwidth in all cases, while RCRT succeeds to use 60% to 90% of it. Finally, the overhead of protocol operation, in terms of required computation resources and control messages, is much lower for our approach. Finally, in the third part we investigate the many-to-many communication model for use in streaming multimedia services. We approach the problem by evaluating extensions to the well-known BitTorrent application, in order to meet the requirements of on-demand and live video streaming. We implemented a number of proposed solutions to this problem to our own comprehensive packet level BitTorrent Simulator and evaluated their behavior with streaming video from both the network and the user experience points of view, considering players that either skip over missing pieces or stall until they arrive. We concluded that the simplest proposed solution is no worse than the others under a very wide range of parameters, and that its user-level performance is actually quite acceptable for real use, when properly configured.

Degree

thesis:*
Grantor dc:publisher
Athens University Economics and Business (AUEB)
Year dc:date
2016

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Stais, Charilaos
  • Στάης, Χαρίλαος

Subjects

dc:subject × 12

Rights

Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/39278

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Stais, Charilaos; Στάης, Χαρίλαος. Congestion and error control for multi-party content distribution. Athens University Economics and Business (AUEB), 2016. http://hdl.handle.net/10442/hedi/39278