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 propose an OpenFlow-assisted framework for P2P (peer-to-peer) live streaming, which incorporates an OpenFlow-assisted architecture and an OpenFlow-assisted algorithm. The architecture combines the characteristics and advantages of both BitTorrent system and OpenFlow network. The algorithm can dynamically calculate the path and corresponding available bandwidth for each flow according...
In Mobile Peer-to-Peer networks (MP2P), the network state information is difficult to measure accurately, and application requirement on quality of service (QoS) and trust is also hard to exactly express. Therefore, trust QoS routing scheme should be based on the fuzzy information. In this paper, we propose a trust QoS routing scheme based on interval matching. It applies the interval form to denote...
Motivated by the problem of limited bandwidth in peer-to-peer (P2P) multi-party video conferencing systems, in this paper we propose a non-intrusive adaptive multi-media routing algorithm that effectively calculates stream routing to achieve a maximum number of receiving streams. The technique is non-intrusive in that it makes use of current streaming status to infer link bottlenecks rather than sending...
Distributed hash tables (DHTs) with O(1) lookup performance strive to propagate membership changes through efficient distribution mechanism to allow each node in the peer-to-peer network maintains accurate routing tables with complete membership information. We present UnoHop, an efficient DHT algorithm with O(1) lookup performance. UnoHop uses an efficient algorithm to propagate membership events...
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.