Popularity-Based Adaptive Content Delivery Scheme with In-Network Caching

To solve the increasing popularity of video streaming services over the Internet, recent research activities have addressed the locality of content delivery from a network edge by introducing a storage module into a router. To employ in-network caching and persistent request routing, this paper introduces a hybrid content delivery network (CDN) system combining novel content routers in an underlay together with a traditional CDN server in an overlay. This system first selects the most suitable delivery scheme (that is, multicast or broadcast) for the content in question and then allocates an appropriate number of channels based on a consideration of the content’s popularity. The proposed scheme aims to minimize traffic volume and achieve optimal delivery cost, since the most popular content is delivered through broadcast channels and the least popular through multicast channels. The performance of the adaptive scheme is clearly evaluated and compared against both the multicast and broadcast schemes in terms of the optimal in-network caching size and number of unicast channels in a content router to observe the significant impact of our proposed scheme

Optimized algorithms for multimedia streaming

Ph.DDOCTOR OF PHILOSOPH

Building Internet caching systems for streaming media delivery

The proxy has been widely and successfully used to cache the static Web objects fetched by a client so that the subsequent clients requesting the same Web objects can be served directly from the proxy instead of other sources faraway, thus reducing the server\u27s load, the network traffic and the client response time. However, with the dramatic increase of streaming media objects emerging on the Internet, the existing proxy cannot efficiently deliver them due to their large sizes and client real time requirements.;In this dissertation, we design, implement, and evaluate cost-effective and high performance proxy-based Internet caching systems for streaming media delivery. Addressing the conflicting performance objectives for streaming media delivery, we first propose an efficient segment-based streaming media proxy system model. This model has guided us to design a practical streaming proxy, called Hyper-Proxy, aiming at delivering the streaming media data to clients with minimum playback jitter and a small startup latency, while achieving high caching performance. Second, we have implemented Hyper-Proxy by leveraging the existing Internet infrastructure. Hyper-Proxy enables the streaming service on the common Web servers. The evaluation of Hyper-Proxy on the global Internet environment and the local network environment shows it can provide satisfying streaming performance to clients while maintaining a good cache performance. Finally, to further improve the streaming delivery efficiency, we propose a group of the Shared Running Buffers (SRB) based proxy caching techniques to effectively utilize proxy\u27s memory. SRB algorithms can significantly reduce the media server/proxy\u27s load and network traffic and relieve the bottlenecks of the disk bandwidth and the network bandwidth.;The contributions of this dissertation are threefold: (1) we have studied several critical performance trade-offs and provided insights into Internet media content caching and delivery. Our understanding further leads us to establish an effective streaming system optimization model; (2) we have designed and evaluated several efficient algorithms to support Internet streaming content delivery, including segment caching, segment prefetching, and memory locality exploitation for streaming; (3) having addressed several system challenges, we have successfully implemented a real streaming proxy system and deployed it in a large industrial enterprise

Convergence du web et des services de communication

Les services de communication, du courrier postal à la téléphonie, en passant par la voix et la vidéo sur IP (Internet Protocol), la messagerie électronique, les salons de discussion sur Internet, les visioconférences ou les télécommunications immersives ont évolué au fil du temps. Un système de communication voix-vidéo sur IP est réalisé grâce à deux couches architecturales fondamentales : la couche de signalisation et la couche média. Le protocole de signalisation est utilisé pour créer, modifier et terminer des sessions multimédias entre des participants. La couche de signalisation est divisée en deux sous-couches - la couche de service et celle de contrôle - selon la spécification de l IP Multimedia Subsystem (IMS). Deux systèmes de communication largement utilisés sont l IMS et SIP Pair-à- Pair (P2P SIP). Les fournisseurs de services, qui se comportent en tant qu intermédiaires entre appelants et appelés, implémentent les systèmes de communication, contrôlant strictement la couche signalisation. Or ces fournisseurs de services ne prennent pas en compte la diversité des utilisateurs. Cette thèse identifie trois barrières technologiques dans les systèmes de communication actuels et plus précisément concernant la couche de signalisation. I. Un manque d ouverture et de flexibilité dans la couche de signalisation pour les utilisateurs. II. Un développement difficile des services basés sur le réseau et les sessions. III. Une complexification du la couche de signalisation lors d un très grand nombre d appels. Ces barrières technologiques gênent l innovation des utilisateurs avec ces services de communication. Basé sur les barrières technologiques listées cidessus, le but initial de cette thèse est de définir un concept et une architecture de système de communication dans lequel chaque individu devient un fournisseur de service. Le concept, "My Own Communication Service Provider" (MOCSP) et le système MOCSP sont proposés, accompagné d un diagramme de séquence. Ensuite, la thèse fournit une analyse qui compare le système MOCSP avec les systèmes de communication existants en termes d ouverture et de flexibilité. La seconde partie de la thèse présente des solutions pour les services basés sur le réseau ou les sessions, mettant en avant le système MOCSP proposé. Deux services innovants, user mobility et partial session transfer/retrieval (PSTR) sont pris comme exemples de services basés sur le réseau ou les sessions. Les services basés sur un réseau ou des sessions interagissent avec une session ou sont exécutés dans une session. Dans les deux cas, une seule entité fonctionnelle entre l appelant et l appelé déclenche le flux multimédia pendant l initialisation de l appel et/ou en cours de communication. De plus, la coopération entre le contrôle d appel réseau et les différents pairs est facilement réalisé. La dernière partie de la thèse est dédiée à l extension de MOCSP en cas de forte densité d appels, elle inclut une analyse comparative. Cette analyse dépend de quatre facteurs - limite de passage à l échelle, niveau de complexité, ressources de calcul requises et délais d établissement de session - qui sont considérés pour évaluer le passage à l échelle de la couche de signalisation. L analyse comparative montre clairement que la solution basée sur MOCSP est simple et améliore l usage effectif des ressources de calcul par rapport aux systèmes de communication traditionnelsDifferent communication services from delivery of written letters to telephones, voice/video over Internet Protocol(IP), email, Internet chat rooms, and video/audio conferences, immersive communications have evolved over time. A communication system of voice/video over IP is the realization of a two fundamental layered architecture, signaling layer and media layer. The signaling protocol is used to create, modify, and terminate media sessions between participants. The signaling layer is further divided into two layers, service layer and service control layer, in the IP Multimedia Subsystem (IMS) specification. Two widely used communication systems are IMS, and Peer-to-Peer Session Initiation Protocol (P2P SIP). Service providers, who behave as brokers between callers and callees, implement communication systems, heavily controlling the signaling layer. These providers do not take the diversity aspect of end users into account. This dissertation identifies three technical barriers in the current communication systems especially in the signaling layer. Those are: I. lack of openness and flexibility in the signaling layer for end users. II. difficulty of development of network-based, session-based services. III. the signaling layer becomes complex during the high call rate. These technical barriers hinder the end-user innovation with communication services. Based on the above listed technical barriers, the first part of this thesis defines a concept and architecture for a communication system in which an individual user becomes the service provider. The concept, My Own Communication Service Provider (MOCSP) and MOCSP system is proposed and followed by a call flow. Later, this thesis provides an analysis that compares the MOCSP system with existing communication systems in terms of openness and flexibility. The second part of this thesis presents solutions for network-based, session based services, leveraging the proposed MOCSP system. Two innovative services, user mobility and partial session transfer/retrieval are considered as examples for network-based, session-based services. The network-based, sessionbased services interwork with a session or are executed within a session. In both cases, a single functional entity between caller and callee consistently enables the media flow during the call initiation and/or mid-call. In addition, the cooperation of network call control and end-points is easily achieved. The last part of the thesis is devoted to extending the MOCSP for a high call rate and includes a preliminary comparative analysis. This analysis depends on four factors - scalability limit, complexity level, needed computing resources and session setup latency - that are considered to specify the scalability of the signaling layer. The preliminary analysis clearly shows that the MOCSP based solution is simple and has potential for improving the effective usage of computing resources over the traditional communication systemsEVRY-INT (912282302) / SudocSudocFranceF

Content Placement as a Key to a Content-Dominated, Highly mobile Internet

Most of the Internet traffic is content, and most of the Internet connected hosts are mobile. Our work focuses on the design of infrastructure services needed to support such a content-dominated, highly mobile Internet. In the design of these services, three sets of decisions arise frequently: (1) Content placment for selecting the locations where a content is placed, (2) request redirection for selecting the location where a particular request is served from and (3) network routing for selecting the physical path between clients and the services they are accessing. Our central thesis is that content placement is a powerful factor, and is often more powerful than redirection and routing, in determining the cost, performance and energy-related metrics for these services. In support of this thesis, we consider three types of infrastructure. Internet service provider (ISP): In an ISP carrying content-dominated traffic, we show that combinations of simple placement and routing schemes are effective in optimizing an ISP\u27s performance and cost objectives. Further, we show that effective content placement contributes more than optimizing network routing to achieve an ISP\u27s objectives. Our findings question the value of traditional ISP traffic engineering schemes that optimize routing alone, while simplifying the task of traffic engineering for the operators. Global name service (GNS): We design and implement a GNS, \auspice, that resolves names to network addresses for highly mobile entities, thereby providing a key building block for establishing communication between mobile entities in the Internet. A key distinction between \auspice\ and other name services is a {\em demand-aware} replica {placement engine} that intelligently replicates name records to provide low lookup latency, low update cost, and high availability. In our experiments, Auspice\u27s placement scheme enables it to significantly outperform commercial managed DNS providers, DHT-based replication as well as static placement schemes that use the same redirection scheme as Auspice. Content datacenter (CDC): Content datacenters cache and serve content to improve user-perceived performance for content accesses. In a CDC, we quantify the tradeoff between energy savings via consolidation and the user-perceived performance impact based on a real CDC workload. A key insight, supported via experiments, is that despite server consolidation, a simple caching scheme is able to achieve cache hit rates close to an unconsolidated datacenter, which helps mitigate the impact of consolidation on user-perceived latencies. Further, our work is the first to propose a network-aware server consolidation approach that enables additional network energy savings over network-unaware server consolidation schemes for common datacenter topologies

Routing in heterogeneous wireless ad hoc networks

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2008.Includes bibliographical references (p. 135-146).Wireless ad hoc networks are used in several applications ranging from infrastructure monitoring to providing Internet connectivity to remote locations. A common assumption about these networks is that the devices that form the network are homogeneous in their capabilities. However in reality, the networks can be heterogeneous in the capabilities of the devices. The main contribution of this thesis is the identification of issues for efficient communication in heterogeneous networks and the proposed solutions to these issues. The first part of the thesis deals with the issues of unambiguous classification of devices and device identification in ad hoc networks. A taxonomical approach is developed, which allows devices with wide range of capabilities to be classified on the basis of their functionality. Once classified, devices are characterized on the basis of different attributes. An IPv6 identification scheme and two routing services based on this scheme that allow object-object communication are developed. The identification scheme is extended to a multi-addressing scheme for wireless ad hoc networks. These two issues and the developed solutions are applicable to a broad range of heterogeneous networks. The second part of the thesis deals with heterogeneous networks consisting of omnidirectional and directional antennas. A new MAC protocol for directional antennas, request-to-pause-directional-MAC (RTP-DMAC) protocol is developed that solves the deafness issue, which is common in networks with directional antennas. Three new routing metrics, which are extensions to the expected number of transmissions (ETX) metric are developed. The first metric, ETX1, reduces the route length by increasing the transmission power. The routing and MAC layers assume the presence of bidirectional links for their proper operation. However networks with omnidirectional and directional antennas have unidirectional links. The other two metrics, unidirectional-ETX (U-ETX) and unidirectional-ETX1 (U-ETX1), increase the transmission power of the directional nodes so that the unidirectional links appear as bidirectional links at the MAC and the routing layers. The performance of these metrics in different scenarios is evaluated.by Sivaram M.S.L. Cheekiralla.Ph.D

Locality-driven checkpoint and recovery

Checkpoint and recovery are important fault-tolerance techniques for distributed systems. The two categories of existing strategies incur unacceptable performance cost either at run time or upon failure recovery, when applied to large-scale distributed systems. In particular, the large number of messages and processes in these systems causes either considerable checkpoint as well as logging overhead, or catastrophic global-wise recovery effect. This thesis proposes a locality-driven strategy for efficiently checkpointing and recovering such systems with both affordable runtime cost and controllable failure recoverability. Messages establish dependencies between distributed processes, which can be either preserved by coordinated checkpoints or removed via logging. Existing strategies enforce a uniform handling policy for all message dependencies, and hence gains advantage at one end but bears disadvantage at the other. In this thesis, a generic theory of Quasi-Atomic Recovery has been formulated to accommodate message handling requirements of both kinds, and to allow using different message handling methods together. Quasi-atomicity of recovery blocks implies proper confinement of recoveries, and thus enables localization of checkpointing and recovery around such a block and consequently a hybrid strategy with combined advantages from both ends. A strategy of group checkpointing with selective logging has been proposed, based on the observation of message localization around 'locality regions' in distributed systems. In essence, a group-wise coordinated checkpoint is created around such a region and only the few inter-region messages are logged subsequently. Runtime overhead is optimized due to largely reduced logging efforts, and recovery spread is as localized as region-wise. Various protocols have been developed to provide trade-offs between flexibility and performance. Also proposed is the idea of process clone that can be used to effectively remove program-order recovery dependencies among successive group checkpoints and thus to stop inter-group recovery spread. Distributed executions exhibit locality of message interactions. Such locality originates from resolving distributed dependency localization via message passing, and appears as a hierarchical 'region-transition' pattern. A bottom-up approach has been proposed to identify those regions, by detecting popular recurrence patterns from individual processes as 'locality intervals', and then composing them into 'locality regions' based on their tight message coupling relations between each other. Experiments conducted on real-life applications have shown the existence of hierarchical locality regions and have justified the feasibility of this approach. Performance optimization of group checkpoint strategies has to do with their uses of locality. An abstract performance measure has been-proposed to properly integrate both runtime overhead and failure recoverability in a region-wise marner. Taking this measure as the optimization objective, a greedy heuristic has been introduced to decompose a given distributed execution into optimized regions. Analysis implies that an execution pattern with good locality leads to good optimized performance, and the locality pattern itself can serve as a good candidate for the optimal decomposition. Consequently, checkpoint protocols have been developed to efficiently identify optimized regions in such an execution, with assistance of either design-time or runtime knowledge

Efficient Passive Clustering and Gateways selection MANETs

Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets