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.
Due to the mass-market of file sharing, majority of existing P2P systems are based on unstructured overlay networks, where P2P search still remains challenging issues. In this paper, we propose a small-world based semantic search architecture in P2P Networks, called CommuSearch, which has three distinguished features: 1) grouping peers into hierarchical class by exploiting heterogeneity; 2) constructing...
In order to achieve the self-adaptive architecture-centric services' selection, this paper put forward the design principle of topology routing about service nodes, a network structure is built that agent is viewed as the basic Internetware granularity unit; By virtue of P2P environment such as open, dynamic, varied and more controllable evolution character, it is done to expand the self-adaptive...
Traffic grooming in wavelength division multiplexing networks merges low-speed flows into large capacity pipes so that the bandwidth discrepancy between them will not lead to underutilization of resources. Dynamic grooming deals with requests for wavelength allocation based on a dynamic pattern of arrivals in contrast to the situation of static grooming in which the pattern of arrivals must be previously...
Modeling Internet topology is necessary for analyzing of network characteristics for the large and even growing network size. For example, the evolution of network structure and node attributes in the network is a key issue for us to understand the network properties and to design appropriate internetworking technology. In this paper, we define ??favorability degree?? to quantity the attributes of...
This paper proposes a novel network architecture called cloud control plane (Cloud C-plane) to reduce the power consumption of networks. In Cloud C-plane, the forwarding functions and control functions are decoupled, and the control functions are placed in the cloud. In addition, physical network topology is modified to improve the energy efficiency when the load of traffic changes. The routing engine...
Searching in unstructured peer-to-peer network with scalability and effectiveness is still a challenging problem. Recently in many applications, one-hop index replication becomes a fundamental technique for improving the search performance. However, when we extend one-hop index replication to multiple hops for locating both popular contents and rare objects with high lookup success rate, index storage...
Resource space model (RSM) is a normalized classification model that uses m-dimensional semantic spaces to share and manage various resources in a centralized manner. This paper explores how to use the idea of classification semantics to organize indexes of resources in a decentralized manner. We deploy RSM on a structured P2P topology HRing by two ID management methods. HRing is a ring-structured...
In a mobile ad hoc network, link failures and route changes occur frequently. Mistaking these events for congestion degrades TCP performance. Hence, TCP congestion control mechanisms should not react to such loss events. This paper deals with an enhancement of the congestion control mechanism, called TCP Adaptive RTO (TCP AR). This proposal relies on two basic concepts. First, it distinguishes routes...
Traffic grooming in wavelength division multiplexing networks merges low-speed flows into large capacity pipes so that the bandwidth discrepancy between them will not lead to underutilization of resources. On-line solutions for dynamic grooming typically involve the construction of an auxiliary graph for deciding on the routing and wavelength assignment. An auxiliary graph can represent the network...
Discovering properties of the Internet topology is important for evaluating performance of various network protocols and applications. The discovery of power-laws and the application of spectral analysis to the Internet topology data indicate a complex behavior of the underlying network infrastructure that carries a variety of the Internet applications. In this paper, we present analysis of datasets...
To deal with problems such as load imbalance, topology mismatch and network instability for P2P systems, propose the method of implementing the functions of message routing and service index maintenance on different layers. Design algorithms for building clusters and hierarchical overlay, and propose an analytic model of traffic load for evaluation. Simulation results indicate that compared with 2-layer...
Efficient file query is important to the overall performance of Peer-to-Peer (P2P) file sharing systems. In this paper, we introduce an interest-based P2P file sharing system based on a structured P2P. It groups peers based on both interest and proximity. The proposed system is able to support sophisticated routing and clustering strategies based on the file attribute and topology used. Simulation...
One of the goals of P2P file-sharing system is to provide reliable and convenient sharing mechanism for users, so the resources can be gotten more quickly. However, in traditional DHT network, the problem of mismatching between the P2P overlay network and the physical underlying network has not been taken into consideration, which greatly limits the performance in various search or routing techniques...
The conceptions of informational networks routing were reviewed and analyzed in this paper. A choice of the appropriate routing conceptions, strategies and algorithmic mechanisms was related with common network loading indexes. A new algorithm of the a priori determined topological structural work-load calculation and it application into routing mechanisms is offered and analytically described. Simulation...
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.