Results 1 -
8 of
8
Synapse: A Scalable Protocol for Interconnecting Heterogeneous Overlay Networks
, 2009
"... Abstract. This paper presents Synapse, a scalable protocol for information retrieval over the inter-connection of heterogeneous overlay networks. Applications on top of Synapse see those intra-overlay networks as a unique inter-overlay network. Scalability in Synapse is achieved via co-located nodes ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
(Show Context)
Abstract. This paper presents Synapse, a scalable protocol for information retrieval over the inter-connection of heterogeneous overlay networks. Applications on top of Synapse see those intra-overlay networks as a unique inter-overlay network. Scalability in Synapse is achieved via co-located nodes, i.e. nodes that are part of multiple overlay networks at the same time. Co-located nodes, playing the role of neural synapses and connected to several overlay networks, allow a larger search area and provide alternative routing. Synapse can either work with “open” overlays adapting their protocol to synapse interconnection requirements, or with “closed ” overlays that will not accept any change to their protocol. Results from simulation and experiments show that Synapse is scalable, with a communication and state overhead scaling similarly as the networks interconnected. Thanks to alternate routing paths, Synapse also gives a practical solution to network partitions. We precisely capture the behavior of traditional metrics of overlay networks within Synapse and present results from simulations as well as some actual experiments of a client prototype on the Grid’5000 platform. The prototype developed implements the Synapse protocol in the particular case of the interconnection of many Chord overlay networks. Keywords. Peer-to-peer, overlay networks, information retrieval. 1
Dynamic Clustering and Prioritization in Vehicular Ad-hoc Networks: Zone Based approach
"... Copyright © 2013 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. ABSTRACT: Vehicular Ad hoc Network (VANET) is new net ..."
Abstract
- Add to MetaCart
(Show Context)
Copyright © 2013 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. ABSTRACT: Vehicular Ad hoc Network (VANET) is new network type which is used for short range high speed communication among vehicles and between vehicles and road side infrastructure units. In most of the existing literature, the gateways are considered static, deployed on the road side at fixed distance from each other, depending on their transmission range, which makes the overall system costly. The proposed work is for enabling the mobile data access for vehicle anytime and anywhere. Dynamic clustering of vehicles is used to achieve this access of mobile data in vehicles. Clustering is done here based on zone based approach and by considering the dwelling time of vehicles with their velocity. Dwelling time of a vehicle is the time of that vehicle that resides in a particular range. Zone based clustering is similar to normal clustering but all of the members of this clusters can act as cluster head. The different clusters can be overlapping each other. The velocity of vehicles taken here are 40m/s, 60m/s, 80m/s and 100m/s. The velocities of vehicles in same track have same velocities for simplifying the simulation. Requirements of vehicles such as ambulance, fire service vans are crucial during emergency situations. Hence such vehicles need to be given a high priority in this network architecture. Prioritization of vehicles can be done by considering inter vehicular communication property calculating the deviation of vehicular velocities.
THEME
"... 5.1.1. Epidemic models of propagation of content 3 5.1.2. Control and game models for malware attack 3 5.1.3. Time random walks on time varying graphs 3 5.1.4. Quick detection of central nodes 3 5.1.5. Graph-based semi-supervised learning 3 5.1.6. Optimal weight selection in average consensus protoc ..."
Abstract
- Add to MetaCart
5.1.1. Epidemic models of propagation of content 3 5.1.2. Control and game models for malware attack 3 5.1.3. Time random walks on time varying graphs 3 5.1.4. Quick detection of central nodes 3 5.1.5. Graph-based semi-supervised learning 3 5.1.6. Optimal weight selection in average consensus protocols 4 5.1.7. Reducing communication overhead of average consensus protocols 4 5.2. Wireless Networks 4 5.2.1. Estimation of population sizes in sensor networks 4
Domaine: Réseaux, systèmes et services, calcul distribué
, 2010
"... apport de recherche ..."
(Show Context)
2. Overall Objectives........................................................................ 1 2.1. LogNet’s Motto and Logo 1
"... c t i v it y e p o r t ..."
(Show Context)
Contract Start Date: 01/09/05 Duration: 48 months
"... The work within this subproject focuses on the study of fundamental issues for accessing and managing communications resources in an overlay computer. Our researches address algorithmic issues for efficient resource and discovery and querying like construction of overlay networks, query routing and ..."
Abstract
- Add to MetaCart
(Show Context)
The work within this subproject focuses on the study of fundamental issues for accessing and managing communications resources in an overlay computer. Our researches address algorithmic issues for efficient resource and discovery and querying like construction of overlay networks, query routing and execution and for sharing critical resources like bandwidth. Our work also includes mechanism design for coping with selfish behavior when allocating resources in a distributed, uncoordinated system such as a global or overlay computer. Description of work During the third year of the project we have followed the implementation plan and provided various results and algorithmic solutions for resource discovery, resource sharing and mechanism designs. We summarize quickly the main results we have obtained; more details can be found in the three deliverables [3, 4, 5]. WP 2.1. Resource Discovery
Content Discovery in Mobile Networks Using the Publish-and-Subscribe Paradigm
"... Abstract—We present Figaro, a content discovery solution for mobile ad hoc networks. Our main focus is on urban environments, featuring high densities of users in relatively narrow, circumscribed areas where wireless connectivity is pro-vided by an infrastructure (e.g., bus stops integrating a wirel ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—We present Figaro, a content discovery solution for mobile ad hoc networks. Our main focus is on urban environments, featuring high densities of users in relatively narrow, circumscribed areas where wireless connectivity is pro-vided by an infrastructure (e.g., bus stops integrating a wireless access point). Figaro superimposes an overlay network onto the mobile ad hoc network, exploits the the well-known publish-and-subscribe paradigm for content discovery and resorts to peer-to-peer communication for content delivery. In our work, we study the performance of Figaro and address important issues in content sharing systems, such as the identification and isolation of misbehaving nodes and the cooperative caching of rare contents. I.
