The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we carry out a detailed investigation on two Train Inauguration Protocols proposed by WG43 for IEC 61375-2-5: ETB Train Inauguration (ETBTI) and Train Topology Discovery Protocol(T2DP). ETBTI uses Layer 2 LLDP to discovery neighbor peers and uses Layer 3 ETBIP to broadcast the information of single node to all the others. On the other hand, T2DP focuses on Layer 2 and modifies LLDP...
To improve the efficiency and the topology mismatch problem of P2P overlay network, a new method of topology construction, CLSP2P, was introduced. The topology construction of CLSP2P not only consideration the physical location of nodes, but also consideration the semantic information of nodes: Nodes in CLSP2P were first organized as autonomous domain based on their physical location, then the nodes...
In this decade, peer-to-peer (P2P) applications have emerged as popular tools for sharing data and they have gained much attention. Such P2P applications build overlay networks on top of existing infrastructure networks and disseminate data in a peer-to-peer manner. How well the P2P overlay network maps onto the underlying physical network topology can significantly impact P2P application performances...
This paper deals with the effect of mesh and cluster-tree topologies (that are defined in 802.15.4/Zigbee or 802.15.4a standards) in the performance of cooperative and range-based localization algorithms. In this type of localization at least three reference or anchor nodes within range are needed for location estimation (two dimensions). Therefore the successful localization depends on the connectivity...
If we draw the virtual topology representing the communication in networks, we observe that the structure is similar to those of the social networks. Social networks are these networks with the characteristic relating densely some entities than others. These dense zones are called communities. Generally, the members of a same community share the same interest. In this work, we look for which virtual...
The performance of P2P networks have decreased severely because of the large number of free-riders. How to incentive nodes to provide service is an important factor to improve the performance of P2P networks. A novel ultra-node selection mechanism with incentive called USMI is presented in this paper. The main contributions of USMI are following: 1) any node in USMI has a value called utility. The...
P2P network is the one of the most important application models in Internet. Numerous structured and unstructured P2P models have been proposed in the last ten years, and both models do have distinctive advantages and disadvantages. We proposed a hybrid model to strike a balance between these two models using peer grouping. Since the size of peer groups is essential to performance, we analyze the...
In an unstructured peer-to-peer (P2P) network (e.g., Gnutella), participating peers choose their neighbors randomly such that the resultant P2P network mismatches its underlying physical network, resulting in the lengthy communication between the peers and redundant network traffics generated in the underlying network. Previous solutions to the topology-mismatch problem in the literature are far from...
As an infrastructure for data distribution, overlay networks have to feature efficient routing and adequate robustness to achieve fast and accurate data distribution in the environment with node churn. Considering that the existing overlay networks mostly focus on single optimization objective and fail to ensure routing efficiency and robustness simultaneously, a hybrid overlay network for content-based...
Many structured Peer-to-Peer-Systems (P2P) have been developed over the past years. However, most of them rely on hash-functions and thus put major restrictions on applications being implemented on top of them. In this paper we present a very detailed description of Papnet, a hash-free P2P overlay-network that supports range-queries and realizes an infinite alphanumeric address space that can be used...
Application layer multicast is an alternative to network layer multicast. The existing application layer multicast approaches are focus on single source multicast and insufficient in supporting distributed applications that require multi-source and fast recovery abilities with dynamic membership. This paper proposes a novel application layer multicast and its proactive recovery approaches for multi-source...
Grids now-a-days comprise of individual resources. These types of grids are called dynamic grids. The centralized grid services are being gradually replaced by distributed and scalable algorithms. One such grid service is dissemination of resource information (DRI) state among the nodes. Every node in a dynamic grid has resource information associated with it. There are different methods proposed...
Wireless ad hoc networks consist of nodes which can communicate with each other in a peer-to-peer fashion over single hop or multi hops without any fixed infrastructure such as access point or base station. In flat topology there is no topology management concept and all the nodes participate in routing. In this paper the task of topology management for ad hoc networks is implemented using routing...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.