149 research outputs found
Mathematical analysis of scheduling policies in peer-to-peer video streaming networks
Las redes de pares son comunidades virtuales autogestionadas, desarrolladas en la capa de aplicaciĂłn sobre la infraestructura de Internet, donde los usuarios (denominados pares) comparten recursos (ancho de banda, memoria, procesamiento) para alcanzar un fin comĂșn. La distribuciĂłn de video representa la aplicaciĂłn mĂĄs desafiante, dadas las limitaciones de ancho de banda. Existen bĂĄsicamente tres servicios de video. El mĂĄs simple es la descarga, donde un conjunto de servidores posee el contenido original, y los usuarios deben descargar completamente este contenido previo a su reproducciĂłn. Un segundo servicio se denomina video bajo demanda, donde los pares se unen a una red virtual siempre que inicien una solicitud de un contenido de video, e inician una descarga progresiva en lĂnea. El Ășltimo servicio es video en vivo, donde el contenido de video es generado, distribuido y visualizado simultĂĄneamente. En esta tesis se estudian aspectos de diseño para la distribuciĂłn de video en vivo y bajo demanda. Se presenta un anĂĄlisis matemĂĄtico de estabilidad y capacidad de arquitecturas de distribuciĂłn bajo demanda hĂbridas, asistidas por pares. Los pares inician descargas concurrentes de mĂșltiples contenidos, y se desconectan cuando lo desean. Se predice la evoluciĂłn esperada del sistema asumiendo proceso Poisson de arribos y egresos exponenciales, mediante un modelo determinĂstico de fluidos. Un sub-modelo de descargas secuenciales (no simultĂĄneas) es globalmente y estructuralmente estable, independientemente de los parĂĄmetros de la red. Mediante la Ley de Little se determina el tiempo medio de residencia de usuarios en un sistema bajo demanda secuencial estacionario. Se demuestra teĂłricamente que la filosofĂa hĂbrida de cooperaciĂłn entre pares siempre desempeña mejor que la tecnologĂa pura basada en cliente-servidor
Development of a system compliant with the Application-Layer Traffic Optimization Protocol
Dissertação de mestrado integrado em Engenharia InformåticaWith the ever-increasing Internet usage that is following the start of the new decade,
the need to optimize this world-scale network of computers becomes a big priority
in the technological sphere that has the number of users rising, as are the Quality of
Service (QoS) demands by applications in domains such as media streaming or virtual
reality.
In the face of rising traffic and stricter application demands, a better understand ing of how Internet Service Providers (ISPs) should manage their assets is needed. An
important concern regards to how applications utilize the underlying network infras tructure over which they reside. Most of these applications act with little regard for
ISP preferences, as exemplified by their lack of care in achieving traffic locality during
their operation, which would be a preferable feature for network administrators, and
that could also improve application performance. However, even a best-effort attempt
by applications to cooperate will hardly succeed if ISP policies arenât clearly commu nicated to them. Therefore, a system to bridge layer interests has much potential in
helping achieve a mutually beneficial scenario.
The main focus of this thesis is the Application-Layer Traffic Optimization (ALTO) work ing group, which was formed by the Internet Engineering Task Force (IETF) to explore
standardizations for network information retrieval. This group specified a request response protocol where authoritative entities provide resources containing network
status information and administrative preferences. Sharing of infrastructural insight
is done with the intent of enabling a cooperative environment, between the network
overlay and underlay, during application operations, to obtain better infrastructural re sourcefulness and the consequential minimization of the associated operational costs.
This work gives an overview of the historical network tussle between applications
and service providers, presents the ALTO working groupâs project as a solution, im plements an extended system built upon their ideas, and finally verifies the developed
systemâs efficiency, in a simulation, when compared to classical alternatives.Com o acrescido uso da Internet que acompanha o inĂcio da nova dĂ©cada, a necessidade de otimizar esta rede global de computadores passa a ser uma grande prioridade
na esfera tecnolĂłgica que vĂȘ o seu nĂșmero de utilizadores a aumentar, assim como a
exigĂȘncia, por parte das aplicaçÔes, de novos padrĂ”es de Qualidade de Serviço (QoS),
como visto em domĂnios de transmissĂŁo de conteĂșdo multimĂ©dia em tempo real e em
experiĂȘncias de realidade virtual.
Face ao aumento de trĂĄfego e aos padrĂ”es de exigĂȘncia aplicacional mais restritos, Ă©
necessårio melhor compreender como os fornecedores de serviços Internet (ISPs) devem
gerir os seus recursos. Um ponto fulcral é como aplicaçÔes utilizam os seus recursos
da rede, onde muitas destas nĂŁo tĂȘm consideração pelas preferĂȘncias dos ISPs, como
exemplificado pela sua falta de esforço em localizar tråfego, onde o contrårio seria
preferĂvel por administradores de rede e teria potencial para melhorar o desempenho
aplicacional. Uma tentativa de melhor esforço, por parte das aplicaçÔes, em resolver
este problema, nĂŁo serĂĄ bem-sucedida se as preferĂȘncias administrativas nĂŁo forem
claramente comunicadas. Portanto, um sistema que sirva de ponte de comunicação
entre camadas pode potenciar um cenårio mutuamente benéfico.
O foco principal desta tese Ă© o grupo de trabalho Application-Layer Traffic Optimization (ALTO), que foi formado pelo Internet Engineering Task Force (IETF) para explorar
estandardizaçÔes para recolha de informação da rede. Este grupo especificou um protocolo onde entidades autoritårias disponibilizam recursos com informação de estado
de rede, e preferĂȘncias administrativas. A partilha de conhecimento infraestrutural
Ă© feita para possibilitar um ambiente cooperativo entre redes overlay e underlay, para
uma mais eficiente utilização de recursos e a consequente minimização de custos operacionais.
à pretendido dar uma visão da histórica disputa entre aplicaçÔes e ISPs, assim como
apresentar o projeto do grupo de trabalho ALTO como solução, implementar e melhorar sobre as suas ideias, e finalmente verificar a eficiĂȘncia do sistema numa simulação,
quando comparado com alternativas clĂĄssicas
A framework for the dynamic management of Peer-to-Peer overlays
Peer-to-Peer (P2P) applications have been associated with inefficient operation, interference with other network services and large operational costs for network providers. This thesis presents a framework which can help ISPs address these issues by means of intelligent management of peer behaviour. The proposed approach involves limited control of P2P overlays without interfering with the fundamental characteristics of peer autonomy and decentralised operation.
At the core of the management framework lays the Active Virtual Peer (AVP). Essentially intelligent peers operated by the network providers, the AVPs interact with the overlay from within, minimising redundant or inefficient traffic, enhancing overlay stability and facilitating the efficient and balanced use of available peer and network resources. They offer an âinsiderâsâ view of the overlay and permit the management of P2P functions in a compatible and non-intrusive manner. AVPs can support multiple P2P protocols and coordinate to perform functions collectively.
To account for the multi-faceted nature of P2P applications and allow the incorporation of modern techniques and protocols as they appear, the framework is based on a modular architecture. Core modules for overlay control and transit traffic minimisation are presented. Towards the latter, a number of suitable P2P content caching strategies are proposed.
Using a purpose-built P2P network simulator and small-scale experiments, it is demonstrated that the introduction of AVPs inside the network can significantly reduce inter-AS traffic, minimise costly multi-hop flows, increase overlay stability and load-balancing and offer improved peer transfer performance
A Peer-to-Peer Network Framework Utilising the Public Mobile Telephone Network
P2P (Peer-to-Peer) technologies are well established and have now become accepted as a mainstream networking approach. However, the explosion of participating users has not been replicated within the mobile networking domain. Until recently the lack of suitable hardware and wireless network infrastructure to support P2P activities was perceived as contributing to the problem. This has changed with ready availability of handsets having ample processing resources utilising an almost ubiquitous mobile telephone network. Coupled with this has been a proliferation of software applications written for the more capable `smartphone' handsets. P2P systems have not naturally integrated and evolved into the mobile telephone ecosystem in a way that `client-server' operating techniques have. However as the number of clients for a particular mobile application increase, providing the `server side' data storage infrastructure becomes more onerous. P2P systems offer mobile telephone applications a way to circumvent this data storage issue by dispersing it across a network of the participating users handsets.
The main goal of this work was to produce a P2P Application Framework that supports developers in creating mobile telephone applications that use distributed storage. Effort was assigned to determining appropriate design requirements for a mobile handset based P2P system. Some of these requirements are related to the limitations of the host hardware, such as power consumption. Others relate to the network upon which the handsets operate, such as connectivity. The thesis reviews current P2P technologies to assess which was viable to form the technology foundations for the framework. The aim was not to re-invent a P2P system design, rather to adopt an existing one for mobile operation. Built upon the foundations of a prototype application, the P2P framework resulting from modifications and enhancements grants access via a simple API (Applications Programmer Interface) to a subset of Nokia `smartphone' devices. Unhindered operation across all mobile telephone networks is possible through a proprietary application implementing NAT (Network Address Translation) traversal techniques.
Recognising that handsets operate with limited resources, further optimisation of the P2P framework was also investigated. Energy consumption was a parameter chosen for further examination because of its impact on handset participation time.
This work has proven that operating applications in conjunction with a P2P data storage framework, connected via the mobile telephone network, is technically feasible. It also shows that opportunity remains for further research to realise the full potential of this data storage technique
Recommended from our members
Resistance commons : file-sharing litigation and the social system of commoning
textThis dissertation is an investigation into the practice of peer-to-peer file-sharing and the litigation campaign targeting individual file-sharers carried out by the Recording Industry Association of America (RIAA) from 2003 to 2008. The competing conceptualizations of social relations which motivate the conflict over peer-to-peer file-sharing are explored using a combination of Autonomist Marxist theory and structuration theory. Peer-to-peer file-sharing is framed as part of the social system of commoning stemming from the recent ascendancy of immaterial labor within that sector of the economy dedicated to the production and distribution of informational and cultural goods. The RIAA litigation campaign is framed as a reaction to the emergence of new forms of social relations which are seen by the content-producing industries as subversive of revenue streams premised on commodity exchange in informational and cultural goods. The history of the RIAA litigation campaign is presented in detail with careful attention given to those instances in which defendants and other interested parties fought back against RIAA legal actions. The acts of resistance within the legal arena affected the ultimate potential of the litigation campaign to control the spread of file-sharing activities. Subsequent legal campaigns which have been based on the RIAA litigation model are also examined. These later file-sharing cases have been met with similar forms of resistance which have likewise mitigated the impact of legal efforts to combat file-sharing. In addition, a survey of file-sharers is included in this research as part of an attempt to understand the relationship between legal actions targeting peer-to-peer systems and individual file-sharers and the technological and social development of peer-to-peer systems. This research argues that file-sharing litigation has proven ineffective in turning back the flood of file-sharing and may have increased the technological sophistication and community ties among file-sharers. In the end, the conflict over peer-to-peer file-sharing is cast as a manifestation of a larger dynamic of capitalist crisis as content-producing industries attempt to come to terms with the contradictory tendencies of immaterial labor and the production of common pools of digital resources.Radio-Television-Fil
Smart PIN: performance and cost-oriented context-aware personal information network
The next generation of networks will involve interconnection of heterogeneous individual
networks such as WPAN, WLAN, WMAN and Cellular network, adopting the IP as common infrastructural protocol and providing virtually always-connected network. Furthermore,
there are many devices which enable easy acquisition and storage of information as pictures, movies, emails, etc. Therefore, the information overload and divergent contentâs
characteristics make it difficult for users to handle their data in manual way. Consequently, there is a need for personalised automatic services which would enable data exchange across heterogeneous network and devices. To support these personalised services, user centric approaches
for data delivery across the heterogeneous network are also required.
In this context, this thesis proposes Smart PIN - a novel performance and cost-oriented context-aware Personal Information Network. Smart PIN's architecture is detailed including its network, service and management components. Within the service component, two novel schemes for efficient delivery of context and content data are proposed:
Multimedia Data Replication Scheme (MDRS) and Quality-oriented Algorithm for Multiple-source Multimedia Delivery (QAMMD).
MDRS supports efficient data accessibility among distributed devices using data replication which is based on a utility function and a minimum data set. QAMMD employs a buffer underflow avoidance scheme for streaming, which achieves high multimedia quality without content adaptation to network conditions. Simulation models for MDRS and
QAMMD were built which are based on various heterogeneous network scenarios. Additionally a multiple-source streaming based on QAMMS was implemented as a prototype and tested in an emulated network environment. Comparative tests show that MDRS and QAMMD perform significantly better than other approaches
Video streaming over the internet using application layer multicast
Multicast is a very important communication paradigm. However, the deployment of multicast at IP layer is very slow, due to development and deployment issues such as ISPs' lack of incentives to update routers and inter-operability among multicast routing protocols. Application Layer Multicast (ALM) is a good alternative, where participating peers organize themselves into a logical overlay network atop the physical links and data is \tunneled" to each other via unicast links. The distinctive feature between IP multicast and ALM is that in ALM, data replication and forwarding functionalities are performed by participating peers (a.k.a. end systems), rather than the routers in Internet Protocol (IP) multicast. This fundamental difference enables ALM to be able to circumvent the development and deployment issues of IP multicast, by exploiting the resources (e.g., CPU cycles, storage, and access bandwidth) at the edge of the network. Nevertheless, it also raises other challenges, as peers are not as stable as routers since they may join and depart the on-going session at will. In this thesis, we address some of the challenges and they are summarized as follows: First, most current P2P or ALM streaming systems are equipped with a non-scalable membership management algorithm, greatly hindering their applicability to large-scale implementations over the Internet: they either rely on a central entity to handle group membership, or simply assume that all group members are visible to each other and flooding is the main mechanism used to disseminate membership-related updates to all participating group members. This implies that they are only applicable to small groups. Second, one of ALM's prominent features, flexility, has not been fully exploited: moving the multicast functionalities from lower layer (IP layer) to higher layer (Application layer) can greatly facilitate the integration of Quality-of-Service (QoS) support. The end-to-end philosophy states that it is better to leave those functionalities to higher layers because the heterogeneity among users' requirements can be handled much better by end users, rather than the network. However, QoS, and in particular, reliability has not been thoroughly addressed in existing ALM schemes. Third, admission control algorithms are essential to the success of any ALM system, due to the fact that in ALM, each peer acts as both a client as well as a server. On the other hand, the heterogeneity among peers, in terms of their computational power, storage capacity, and access bandwidth, further complicates the design of a good admission control. Several contributions are made to address the aforementioned research challenges, and they are outlined as follows: The first contribution is a devised gossip-based membership management algorithm that is able to collect and disseminate membership-related information under high rate of churn, using relatively low communication overheads. The second contribution is a reliability-centric multicast tree construction algorithm that greatly enhance peers' perceived reliability. The third contribution is a QoS-aware tree construction algorithm that accommodates the heterogeneity among peers, such as access bandwidth, network distance, and reliability. The last contribution is the identification of the admission control problem in this overlay video streaming
- âŠ