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.
As the rapid development of P2P application, many applications based on P2P technology are produced and applied over the Internet. Therefore, searching efficiency, bandwidth utilization rate, average download time and throughput become the key issues of P2P. In order to improve the performance of P2P applications, we propose an integration of search and incentive strategy (ISI) in this paper, which...
The amount of P2P traffic is rising quickly, so that an increasing research focuses on P2P traffic control issues. In this paper, we propose a cooperation strategy called HIC in the aim of controlling cross-ISP traffic without scarifying the system performance. We introduce an incentive mechanism and hidden coordinator of ISP into HIC. The incentive mechanism is used to guide P2P traffic to hidden...
Peer-to-Peer (P2P) live video streaming over the Internet is becoming increasingly popular, but it is still plagued by problems of high playback latency and intermittent playback streams. This paper presents GLive, a distributed market-based solution that builds a mesh overlay for P2P live streaming. The mesh overlay is constructed such that (i) nodes with increasing upload bandwidth are located closer...
Based on the concept of the flooding algorithm and its improved algorithm the search algorithm in P2P networks is proposed based on the direction. This algorithm dynamically generates a search tree taken the source point to be its root which makes the search processing along the search tree. By this algorithm the production of redundant search packets can be effectively avoided in the search process,...
Loss tomography aims at inferring the loss rate of links in a network from end-to-end measurements. Previous work has developed optimal maximum likelihood estimators (MLEs) for link loss rates in a single-source multicast tree. However, only sub-optimal algorithms have been developed for multiple-source loss tomography. In this paper, we revisit multiple-source loss tomography in tree networks with...
Memory consumption is a critical problem for large-scale network simulations. Particularly, the large memory footprint needed for maintaining routing tables can severely obturate scalability. We present an approach of composing large-scale network models using sharable model fragments to achieve significant reduction in the amount of memory required for storing forwarding tables in simulation. Our...
In this paper the problem of enhancing trust establishment in multi-hop wireless networks is addressed. Exploiting small-world features and based on preferential attachment and initial node trust values, we design inverse Topology Control methods that achieve to reduce the mean hop-distance between two nodes and increase the average trust value of the shortest paths. Based on continuum theory a mathematical...
Local knowledge routing schemes based on virtual coordinates taken from the hyperbolic plane have attracted considerable interest in recent years. In this paper, we propose a new approach for seizing the power of the hyperbolic geometry. We aim at building a scalable and reliable system for creating and managing overlay networks over the Internet. The system is implemented as a peer-to-peer infrastructure...
Resource provision within critical friend environment take place on a demand fashion and it is based on the aptitude of members to look across multiple locations for resource discovery and allocation. A major concern of such large scale and uncertain topology setting is the capability of members (nodes) to efficiently search and locate neighbouring participants. Here we adopt a Peer to Peer (P2P)...
Network coding is a novel technique that can increase network throughput by linearly combining data packets in intermediate nodes and recovering them before delivery at their destinations. This paper discusses the applicability of network coding to NoCs and evaluates the potential advantages of that technique when supporting multicast communication.
In this paper, P2P resource search mechanism which based on ant colony algorithm usually allows resources and general inquiries restricted in area, when the resource cannot query in domain, using a combination of ant colony algorithm search mechanism for inter-domain; simulation results show that this model improves the efficiency of the query and hit ratio, reducing the bandwidth occupied.
We propose a simulation tool able to test hybrid GNSS-terrestrial and cooperative positioning algorithms that fuse both pseudorange measurements from satellites and range estimates between terrestrial receivers. In particular, the tool simulates devices belonging to a peer-to-peer (P2P) network where peers cooperate by exchanging data in order to improve both positioning accuracy and availability...
In this paper, we address the problem of efficient routing in delay tolerant network. We propose a new routing protocol dubbed as ORION. In ORION, only a single copy of a data packet is kept in the network and transmitted, contact by contact, towards the destination. The aim of the ORION routing protocol is twofold: on one hand, it enhances the delivery ratio in networks where an end-to-end path does...
Sandstorms are serious natural disasters, which are commonly seen in the Middle East, Northern Africa, and Northern China.In these regions, sandstorms have caused massive damages to the natural environment, national economy, and human health. To avoid such damages, it is necessary to effectively monitor the origin and development of sandstorms. To this end, wireless sensor networks (WSNs) can be deployed...
Energy efficient broadcasting is of paramount importance for many broadcast applications in wireless ad hoc networks. With respects network coding, it has been proved that the energy gain is upper bounded by 3. However, the coding opportunity is often highly dependent on the established routing paths, resulting in that a lot of coding opportunities could be lost in practice. By combining network coding...
The paper presents a concept of a rating algorithm aiming at overall peer-to-peer traffic reduction (and locality awareness) and decrease of load on costly links, thus diminishing operator's costs. The rating algorithm is not only performed by a sole Oracle, as is typically proposed, but its operation is also supported by a similar entity located in other domains. Due to this concept, a usually omitted...
Emerging technologies of autonomic networks impose demanding requirements on self-healing capabilities of networks. Fault management techniques based on the exploitation of fault propagation models (FPM) are a promising solution to conduct fault isolation and infer the root cause of problems observed in the network. In this study, we investigate a fault propagation model developed for the needs of...
In this paper we present an in-network caching architecture based on content routers to improve the traffic efficiency in the Internet. The main idea is to provide a forwarding fabric where data requests are forwarded towards the closest caches in the network path. Conversely, data chunks from the servers are cached in the content routers along the path, serving further requests. In addition, content...
In multi-domain optical networks, due to confidentiality and management considerations, it may be infeasible to broadcast complete domain state information among domains. Nevertheless, sufficient information on each domain is required in order to keep network activities operating successfully. Topology Aggregation (TA) may be adopted to abstract a domain's detailed topology into an aggregated topology...
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.