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.
Emergence of peer-to-peer (P2P) networks has provided a new dimension to overlay networks. People can help each other by sharing the contents of which other people may not have strength to purchase. Besides these generous peers, there are some other peers who always try to harm the network by providing harmful data or just block the activities with invalid responses and dropping lookup queries to...
The P2P environment with various types of participating devices requires services that allow efficient sharing and easy discovery of resources. Also, reliable contents distribution mechanisms that adapt well to dynamically changing peer status or performance are needed. In this paper, we propose new middleware service architecture based on a self-reconfiguring overlay network which is dynamically...
In this paper, we present the design of Social BitTorrent Agent (SBTA). Through SBTA, BitTorrent users can be organized into a friend group in which as one member start downloading files, it will multicast the corresponding torrent files to other members who are also interested. In this manner, torrent files can be quickly spread to a large number of BitTorrent clients, and BitTorrent Swarm will form...
With the popularity of the P2P applications in the Internet, the study of the P2P file-sharing system becomes more important. BitTorrent is a preliminary and the most successful P2P file-sharing application in the Internet, and has all the typical characteristics of the P2P file-sharing systems. In this paper, we propose a dynamic model of BitTorrent-like P2P File-Sharing System. The model describes...
Recently, Peer-to-Peer (P2P) IPTV applications represents a challenging trend of the Internet. IPTV refers to the delivery of live video streaming and Video on Demand (VoD). In this paper, the basic concepts and algorithms of some popular existing IPTV applications are presented based on the experience of a real system deployed by PPLive, CoolStreaming, Sopcast and UUSee. The performance and technological...
The peer-to-peer networking technologies and systems provide a rapid and scalable content distribution mechanism for the increasing client population to access an explosive volume of media files on the Internet. Whereas the BitTorrent protocol and its derivatives are the most popular peer-to-peer file sharing applications, this paper proposes the performance measurement and analysis of BitTorrent...
The distribution of video content over P2P systems has become a popular and cost-effective option in recent years due to the increasing online availability of content. Additionally, the diversity of end-user terminals used for consuming content demands the provisioning of content in different qualities. Both problems are addressed by distributing layered video content over P2P networks. A piece-picking...
Overlay networking has emerged as an alternative solution to solve many problems related to massive information distribution and processing tasks by providing enhanced services in application layer. For instance, overlay networks can improve data dissemination in P2P file sharing overlays and Content Distribution Networks (CDNs) in which delay is considered as a critical performance metric. A viable...
In this paper, we conduct a performance study on a game scenario that supports MMORPGs through structured P2P overlay, focusing on the churn aspect - the continuous process of peer arrival and departure. Through a discrete simulation, we show that a trade-off is necessary between the game features with respect to real-time stringency, and the churn performance. For instance, in the game scenario,...
The dimensioning of IP/MPLS-over-WDM network addresses the problems involved in the assessment of the electrical and optical resource requirements across the network to avoid any rejection of connection request through label switched paths (LSPs). This work deals with the design of an automated wavelength-routed optical network (WRON), extending services to its different clients using wavelength-division...
In this paper, we investigate the topology convergence problem for the gossip-based Gradient overlay network. In an overlay network where each node has a local utility value, a Gradient overlay network is characterized by the properties that each node has a set of neighbors containing higher utility values, such that paths of increasing utilities emerge in the network topology. The Gradient overlay...
In Peer-to-Peer (P2P) networks, file sharing application is popular among internet users due to its high scalability and anonymity. The increasing number of polluted or infected contents shared in the network leads to the wastage of peers' time, bandwidth, and other resources. In this paper, a model is proposed to identify and prevent the polluted or infected content propagation in the P2P network...
In this paper, we deal with possible data transmission congestion on the sink node in wireless sensor networks (WSNs). We consider a scenario in which all the sensor nodes have a certain amount of storage space and acquire data from the surroundings at heterogeneous speed. Because receiving bandwidth of the sink node is limited, a proper bandwidth allocation mechanism should be implemented to avoid...
Reducing the energy consumption of wired networks has become a key concern for manufacturers of network equipments and network providers. In this paper, we propose an energy-efficient data transfer framework that uses advance bandwidth provisioning and on/off algorithms to put unused nodes of wired networks into sleep mode. This ramework is termed as High-level Energy-awaRe Model for bandwidth reservation...
This paper introduces a statistical model that allows the users of a random access-based cognitive radio network sharing a single wireless channel to evaluate the quality-of-service (QoS) capability of the network. The model captures the variation of the channel service process taking into account the statistics of the channel availability in addition to the randomness of the data traffic of the cognitive...
In recent years P2P technology has gained great popularity not only in file sharing applications but also in the field of video distribution. This work proposes a simple model to assess the performance a P2P system designed for video streaming can achieve, measured in terms of average video delivery rate. The model allows to compute system efficiency in a simple but accurate way through the partition...
In this paper, we propose a novel asymmetric resource allocation (RA) scheme for the decode-and-forward (DF) multi-relay based Long Term Evolution Advanced (LTE-Advanced) system, with the orthogonal frequency division multiplexing (OFDM) modulation. Given a fixed total transmit time duration, the time slot durations for the two hops via each of the K relays are designed to be asymmetric, which increases...
Wireless sensor networks (WSNs) have a large number of applications, number of applications. Among them, the estimation of spatial processes from sparse sensing nodes is important for environmental monitoring. In this work we analyze the process estimation accuracy for a randomly deployed self-organizing WSN taking into account crucial aspects such as random sampling, nodes' connectivity, communications...
Network coding is known to be a promising technology to increase the bandwidth capacity in wireless networks. To our best knowledge, there is limited work on studying the available bandwidth for a given path with network coding. This paper presents a new method to estimate the available bandwidth of a path that considers network coding and wireless interference simultaneously. We show that our estimated...
Erasure codes have been employed to achieve persistent storage in distributed storage networks. Recent work has shown that, in addition to reduction in storage space requirements, the communication bandwidth in the data regeneration process can be further reduced by using Regenerating Codes. In this paper, we consider the issue of energy- efficient data regeneration in wireless sensor networks with...
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.