Poor Man's Content Centric Networking (with TCP)

A number of different architectures have been proposed in support of data-oriented or information-centric networking. Besides a similar visions, they share the need for designing a new networking architecture. We present an incrementally deployable approach to content-centric networking based upon TCP. Content-aware senders cooperate with probabilistically operating routers for scalable content delivery (to unmodified clients), effectively supporting opportunistic caching for time-shifted access as well as de-facto synchronous multicast delivery. Our approach is application protocol-independent and provides support beyond HTTP caching or managed CDNs. We present our protocol design along with a Linux-based implementation and some initial feasibility checks

Building self-optimized communication systems based on applicative cross-layer information

This article proposes the Implicit Packet Meta Header(IPMH) as a standard method to compute and represent common QoS properties of the Application Data Units (ADU) of multimedia streams using legacy and proprietary streams’ headers (e.g. Real-time Transport Protocol headers). The use of IPMH by mechanisms located at different layers of the communication architecture will allow implementing fine per-packet selfoptimization of communication services regarding the actual application requirements. A case study showing how IPMH is used by error control mechanisms in the context of wireless networks is presented in order to demonstrate the feasibility and advantages of this approach

Greediness control algorithm for multimedia streaming in wireless local area networks

This work investigates the interaction between the application and transport layers while streaming multimedia in a residential Wireless Local Area Network (WLAN). Inconsistencies have been identified that can have a severe impact on the Quality of Experience (QoE) experienced by end users. This problem arises as a result of the streaming processes reliance on rate adaptation engines based on congestion avoidance mechanisms, that try to obtain as much bandwidth as possible from the limited network resources. These upper transport layer mechanisms have no knowledge of the media which they are carrying and as a result treat all traffic equally. This lack of knowledge of the media carried and the characteristics of the target devices results in fair bandwidth distribution at the transport layer but creates unfairness at the application layer. This unfairness mostly affects user perceived quality when streaming high quality multimedia. Essentially, bandwidth that is distributed fairly between competing video streams at the transport layer results in unfair application layer video quality distribution. Therefore, there is a need to allow application layer streaming solutions, tune the aggressiveness of transport layer congestion control mechanisms, in order to create application layer QoE fairness between competing media streams, by taking their device characteristics into account. This thesis proposes the Greediness Control Algorithm (GCA), an upper transport layer mechanism that eliminates quality inconsistencies caused by rate / congestion control mechanisms while streaming multimedia in wireless networks. GCA extends an existing solution (i.e. TCP Friendly Rate Control (TFRC)) by introducing two parameters that allow the streaming application to tune the aggressiveness of the rate estimation and as a result, introduce fair distribution of quality at the application layer. The thesis shows that this rate adaptation technique, combined with a scalable video format allows increased overall system QoE. Extensive simulation analysis demonstrate that this form of rate adaptation increases the overall user QoE achieved via a number of devices operating within the same home WLAN

Towards a sender-based TCP friendly rate control (TFRC) protocol

Pervasive communications are increasingly sent over mobile devices and personal digital assistants. This trend is currently observed by mobile phone service providers which have measured a significant increase in multimedia traffic. To better carry multimedia traffic, the IETF standardized a new TCP Friendly Rate Control (TFRC) protocol. However, the current receiver-based TFRC design is not well suited to resource limited end systems. In this paper, we propose a scheme to shift resource allocation and computation to the sender. This sender-based approach led us to develop a new algorithm for loss notification and loss-rate computation. We detail the complete implementation of a user-level prototype and demonstrate the gain obtained in terms of memory requirements and CPU processing compared to the current design. We also evaluate the performance obtained in terms of throughput smoothness and fairness with TCP and we note this shifting solves security issues raised by classical TFRC implementations

A selective delayed channel access (SDCA) for the high-throughput IEEE 802.11n

Abstract— In this paper we investigate the potential benefits of a selective delayed channel access algorithm (SDCA) for the future IEEE 802.11n based high-throughput networks. The proposed solution aims to resolve the poor channel utilization and the low efficiency that EDCA’s high priority stations adhere due to shorter waiting times and consequently to the network’s degrading overall end performance. The algorithm functions at the MAC level where it delays the packets from being transmitted by postponing the channel access request, based on their traffic characteristics. As a result, the flow’s average aggregate size increases and consequently so is the channel efficiency. However, in some situations we notice that further deferring has a negative impact with TCP applications, thus we further introduce a traffic awareness feature that allows the algorithm to distinguish which flows are using the TCP protocol and override any additional MAC delay. We validate through various simulations that SDCA improves throughput significantly and maximizes channel utilization