Results 11 - 20
of
23
ABSTRACT OF THE DISSERTATION Content Caching, Retrieval and Dissemination in Networks with Storage
, 2011
"... The overwhelming use of today’s network is for an endpoint to acquire a named content file. As a result, efficient content discovery and dissemination are becoming one of the key challenges for the design of future Internet protocols. With significant advances in the technology areas of data storage ..."
Abstract
- Add to MetaCart
(Show Context)
The overwhelming use of today’s network is for an endpoint to acquire a named content file. As a result, efficient content discovery and dissemination are becoming one of the key challenges for the design of future Internet protocols. With significant advances in the technology areas of data storage, storage capacities have increased dramatically while the price has been dropping very fast. Thus it is valid to assume that each router on the Internet can cache content files that pass by and reply to content requests with its local copies. In this thesis, We firstly introduce the In-Network Caching framework. The content dissemination consists of two phases. The first phase is content discovery, which is the service provided by Content Name Resolution. Through CNRS a requester discovers the location(s) of the desired content files. We present the hybrid CNRS architecture, in which CNRS servers form a hierarchy, with national, regional, institutional CNRS servers from top to bottom. On each level, each CNRS server is responsible of monitoring the caching locations of a predesignated group of content files. While there is a miss at the lower level, the CNRS ii request will be forwarded to the higher level server, which is similar to the hierarchical web
A Swarm Algorithm for a Self-Structured P2P Information System
"... Abstract-This paper introduces Antares, a bio-inspired algorithm for the construction of a decentralized and self-organized P2P information system in Computational Grids. This algorithm exploits the properties of ant systems, in which a number of entities/agents perform simple operations at the loc ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract-This paper introduces Antares, a bio-inspired algorithm for the construction of a decentralized and self-organized P2P information system in Computational Grids. This algorithm exploits the properties of ant systems, in which a number of entities/agents perform simple operations at the local level, but together engender an advanced form of "swarm intelligence" at the global level. Here the work of ant-inspired agents is tailored to the controlled replication and relocation of "descriptors", that is, documents that contain metadata information about Grid resources. Agents travel the Grid through P2P interconnections, and replicate and spatially sort descriptors so as to accumulate those represented by identical or similar indexes into neighbor Grid hosts. The resulting information system is here referred to as self-structured, because it exploits the self-organizing characteristics of ant-inspired agents, and the association of descriptors with hosts is not pre-determined but adapts to the varying conditions of the Grid. This self-structured organization combines the benefits of both unstructured and structured P2P information systems. Indeed, being basically unstructured, Antares is easy to maintain in a dynamic Grid, in which joins and departs of hosts can be frequent events. On the other hand, the aggregation and spatial ordering of descriptors can improve the rapidity and effectiveness of discovery operations, which is a beneficial feature typical of structured systems. Performance analysis proves that ant operations allow the information system to be efficiently reorganized thus improving the efficacy of both simple and range queries.
Rights Archived with thanks to Future Generation Computer Systems Downloaded 20-Sep-2016 10:09:58
"... This paper presents small world architecture for P2P networks (SWAN) for content discovery in multi-group P2P systems. A semi-structured P2P algorithm of SWAN is utilized to create and find long-range shortcuts toward remote peer groups. In SWAN, not every peer node needs to be connected to remote g ..."
Abstract
- Add to MetaCart
(Show Context)
This paper presents small world architecture for P2P networks (SWAN) for content discovery in multi-group P2P systems. A semi-structured P2P algorithm of SWAN is utilized to create and find long-range shortcuts toward remote peer groups. In SWAN, not every peer node needs to be connected to remote groups, but every peer node can easily find which peer nodes have external connections to a specific peer group. From our analysis and simulation, SWAN has the advantages of both structured and unstructured P2P networks and can achieve good performance in both stable and dynamic environments.
par
, 2012
"... En vue de l’obtention du grade de Docteur de l’Université de Montpellier II ..."
Abstract
- Add to MetaCart
(Show Context)
En vue de l’obtention du grade de Docteur de l’Université de Montpellier II
par
, 2012
"... En vue de l’obtention du grade de Docteur de l’Université de Montpellier II ..."
Abstract
- Add to MetaCart
(Show Context)
En vue de l’obtention du grade de Docteur de l’Université de Montpellier II
The Replica Location Service: Design and Experience
"... We describe the implementation and evaluate the performance of a Replica Location Service that is part of the Globus Toolkit Versions 3.0 and 4.0. A Replica Location Service (RLS) provides a mechanism for registering the existence of replicas and discovering them. Features of our implementation incl ..."
Abstract
- Add to MetaCart
(Show Context)
We describe the implementation and evaluate the performance of a Replica Location Service that is part of the Globus Toolkit Versions 3.0 and 4.0. A Replica Location Service (RLS) provides a mechanism for registering the existence of replicas and discovering them. Features of our implementation include the use of soft state update protocols to populate a distributed index and optional Bloom filter compression to reduce the size of these updates. We present the design of the RLS system and different deployment options for the distributed index. We also present performance measurements that demonstrate that RLS scales well for individual servers with millions of entries and hundreds of clients. We describe the use of RLS in several production Grid environments and describe how RLS has been integrated into higher-level data management services. Categories and Subject Descriptors
Small World VoIP
"... Abstract. We present the analysis and design of a Small World VoIP system (SW-VoIP) which is geared towards customers that are communicating with their Small World of social contacts. We use the term Small World to refer to the Peer-to-Peer (P2P) network of a client and his contacts both incoming an ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. We present the analysis and design of a Small World VoIP system (SW-VoIP) which is geared towards customers that are communicating with their Small World of social contacts. We use the term Small World to refer to the Peer-to-Peer (P2P) network of a client and his contacts both incoming and outbound. We reconstruct the small world of a user by collecting calling patterns over a configurable period of time. We enable user mobility by using a stepwise social identity to an IP address binding propagation model. We propose an efficient algorithm to locate users by electing popular users and leveraging the users closeness. We also introduce a self-stabilized load balancing mechanism to optimize the system performance under heavy network traffic. We evaluate our SW-VoIP system performance by simulating the user’s lookup process using real-world telephone logs. Our experimental results show that our SW-VoIP system offers a better performance in optimizing the required routing path and reducing the average lookup delay when compared to traditional, non small-world P2P VoIP systems. Key words: small world, VoIP, Peer-to-peer, mobility, electing, popular,
Achieving Timeliness and High Throughput Metrics in Dissemination Systems
"... Abstract- Existing systems for information dissemination is inadequate and typically results in information gaps. The lack of a clear concise system for information dissemination makes it difficult to determine the most efficient and effective way to pass information especially in the fields of ecom ..."
Abstract
- Add to MetaCart
Abstract- Existing systems for information dissemination is inadequate and typically results in information gaps. The lack of a clear concise system for information dissemination makes it difficult to determine the most efficient and effective way to pass information especially in the fields of ecommerce and security alerting systems to the appropriate parties. These systems usually require that the desired information be matched between numerous sources and sinks based on established subscriptions. Timeliness and Throughput are performance metrics used for evaluation. And these existing systems fail to achieve a balance between the two. So a much better system termed INFOD (INFOrmation Dissemination) was proposed earlier that achieves a balance between performance metrics. We observed that an Integrated Control Loop used by admission control scheme of INFOD employs PL/SQL stored procedures that are huge computation overhead. We propose to replace them with Java stored procedures that can tremendously increase the performance. Keywords: INFOD, ICL. I.
