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.
P2P traffic has taken up the most significant portion of the network traffic. Effective identification of P2P traffic becomes an important role for network traffic management. However, with the wide application of dynamic port and content encrypted techniques, traditional P2P identification methods are powerless. To address the issues of port hopping and unconspicuous application characters, a fast...
Peer-to-peer (P2P) applications have shown their popularity in the Internet, while become a burden of Internet Service Providers (ISPs) because they produce huge traffic on network. The enormous traffic comes from the fact that when P2P systems construct overlay networks, they ignore the underlying network topology, so most of the connections are between remote peers and cross different networks....
P2P systems can be used to form a low latency decentralized data delivery system. Structured P2P systems provide both low latency and excellent load balance with uniform query and data distributions, however, in the real application environment, requests distributions are often skewed and follow a Zipf law, some objects will become hotspots, individual nodes are easily overloaded, resulting in poor...
Bamboo is one structured P2P overlay, that likes others (e.g. Chord, Kademlia, Pastry), organizes peers into a flat overlay network and offers distributed hash table (DHT) functionality. It is very promising for its efficient routing performance. However, one disadvantage impeding the DHT algorithm popularity is the routing information maintenance overhead; it generates considerable network traffic...
Both SIP and various peer-to-peer protocols have been widely deployed, there is little operational experience with SIP using overlay networks. Also, some researches have proposed to leverage peer-to-peer computing to control multimedia sessions in a decentralized manner (P2PSIP) [1]. However, most proposals in research only focused on the design of P2PSIP protocols using one specific DHT overlay....
The peer-to-peer network has been widely used to share large files anonymously. Because of its open nature, nodes can join and leave peer-to-peer networks freely. But there are few limited methods to ensure their trust. Malicious nodes can expose great security threats to peer-to-peer networks such as spreading unauthentic data and viruses. But handling all the malicious nodes in the same way causes...
NAT (network address translation) are widely used to isolate the private networks from internet. Unfortunately, NATs block the data transmitted directly between two nodes under different private networks in many peer-to-peer applications. A protocol, STUN (simple traversal of UDP over NATs), has been proposed by IETF to solve the problem, but it costs great network bandwidth and transmission delays...
The critical issue that confronts peer-to-peer networks is the efficient location of the node that stores a desired data item. Chord is a successful resource location protocol based on distributed hash table. However, if the desired data item is stored on a node that is count-clockwise close to the query node on the chord ring, the lookup latency might be high because of its clockwise lookup strategy...
This paper has proposed DHCM (density-based hierarchical clustering multicast), a scalable application-level multicast model which has improved IHC arithmetic. DHCM divides the hosts into many hierarchies according to their density, and constructs a density tree to realize the shortest routing for single-source media streaming. The tree delivers the content of video server to each host in density...
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.