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 and evaluate an overlay distribution algorithm for P2P, chunk-based, streaming systems over forest-based topologies. In such systems, the stream is divided in chunks; chunks are delivered by each node in a store-and-forward way. A relaying node starts distributing a chunk only when it has completed its reception from another node. Peers are logically organized in a forest...
Performance of wireless sensor networks (WSNs) can be affected when the network is deployed under different topologies. In this paper we present a performance study of congestion control algorithms in WSNs when nodes are deployed under different topologies. To perform our research we have employed algorithms SenTCP, directed diffusion, and HTAP. The choice of these algorithms is based on the fact...
An alarming trend for the global routing table's growth factor in the interdomain IP backbone shows that Internet inter-domain routing scalability becomes an issue again. It is widely agreed upon that the rapid global routing table size growth is mainly due to the growth in the number of ASs and the wide deployments of multihoming and traffic engineering. These popular commercial practices deaggregate...
In this paper, we propose a new network topology for P2P overlay. The proposed topology is a contracted graph of an n-star, which realizes a short diameter with a small degree compared with conventional hyper cubic networks such as Chord and skip graph.
In an unstructured peer-to-peer (P2P) network (e.g., Gnutella), participating peers choose their neighbors randomly such that the resultant P2P network mismatches its underlying physical network, resulting in the lengthy communication between the peers and redundant network traffics generated in the underlying network. Previous solutions to the topology-mismatch problem in the literature are far from...
The WiMAX (IEEE 802.16) technology is widely deployed to provide users with wireless network connectivity in easy way. Propagation measurements at the frequency of 3.5 GHz for the WiMAX technology have been taken from different places in the world with different topologies. This paper deals with path loss calculation and analysis in order to fined the best methodology for calculating upper and lower...
Traceroute-like method is of foundation for inferring forward IP paths that in succession are often used for generating different level Internet topologies. Based on Paris traceroute method of avoiding traceroute anomalies, this paper examines the practical feasibility of inferring forward IP paths by sending mixed TCP packets with other control bit(s) instead of SYN to a set of well-known Web sites...
A new physical layer network discovery approach is proposed based on tree-model which manages to solve the multi-subnet problem. According to the theory of maximum set and a set of formula, the method transforms the multi-subnet problem to single-subnet and simplifies the difficulty of the problem. The paper also figures out the critical value of the lost ratio which presents the completeness of the...
In operational P2P networks, an overlay topology needs to be constructed on the top of IP networks. Existing methods for the construction have limited self organizing behavior and some security problems. In this paper, we propose an algorithm of two parameters to construct a scale free topology for P2P networks in a self organizing manner. The emergence of scale free topologies from the algorithm...
Multicast join delay is an important metric to evaluate the performance of multicast services. However, there is little analytic study of this metric. In this paper, we convert the multicast join delay into the average node-tree distance problem in the graph, and propose an area-overlay method to analyze the multicast join delay against the different topology sizes and multicast densities. We set...
One of the challenges of P2P systems is to perform load balancing efficiently. A distributed hash table (DHT) abstraction, heterogeneous nodes, and non uniform distribution of objects cause load imbalance in structured P2P overlay networks. Several solutions are suggested to solve this problem but they have some restrictions. They assume the homogeneous capabilities of nodes, unawareness of the link...
This paper illustrated the characteristics of UTP-5 and Hub-spoken topology, and presented the concept of margin motion coefficient and reliability coefficient based on graph theory and relation matrix and made thorough analysis and comparison. Suggestions are made on resolution of topology problems on cabling infrastructure of intelligent buildings.
We propose an efficient way of constructing the wireless mesh structure associated with molecular MAC, a multichannel access method designed for efficient packet forwarding. We base our role assignment on a restricted weakly connected dominating set structure. After presenting a formal definition of the role assignment problem, we prove its NP-completeness. Then, we propose a centralized 2-approximation...
We propose a novel view on efficient packet forwarding in wireless mesh networks based on a molecular analogy in which mesh routers are either nuclei or electrons in an atom that corresponds to a 802.11 cell. In this view, a mesh network appears as a collection of spatially distributed 802.11 cells operating on different channels. We define molecular MAC that uses dynamic channel switching at neighbor...
DHT-based P2P networks have a problem of topology mismatch which causes high latency for message routing. This paper focuses on improving the latency of routing process for chord, which is a typical DHT-based P2P network protocol. We propose a simple method to build a chord network based on the proximity of nodes in the underlying physical network. The idea of our method is the combination of two...
Knowledge of topology in wireless sensor networks is significant for network management and maintenance. In this paper, a conditional probability of data loss theorem is proposed for wireless sensor networks based on the data aggregation paradigm.al probability of data loss theorem. It reveals the relationship between conditional probabilities of sensor data loss given different conditions. Based...
Wireless sensor networks (WSN) can increase the efficiency of many real-life applications through the collaboration of thousands of miniaturized sensors which can be deployed unattended in inhospitable environments. Due to the harsh surroundings and violent nature of the applications, the network sometimes suffers a large scale damage that involves many nodes and would thus create multiple disjoint...
The design of an IP link topology (i.e., deciding which set of router-to-router communication links to establish) is an important factor in determining both the cost and performance of an IP network. In an IP-over-WDM architecture, these router-to-router links consist of wavelengths carried over an optical network. Each physical link in the optical network can carry multiple router-to-router wavelengths...
The performance of multi-radio multi-channel wireless mesh networks (WMNs) based on the IEEE 802.11 technology depends significantly on how the channels are assigned to the radios and how traffic is routed between the access points and the gateways. In this paper we propose an algorithmic approach to this problem, for which no conclusive solution has been put forward in the literature so far. The...
Survivability becomes an important issue in optical networks due to the huge bandwidth offered by optical technology. Many works have studied network survivability. The majority of these works are typically destined to single-domain. In this work we address the survivability in multidomain optical networks. This paper provides a classification of the existing protection solutions proposed for multi-domain...
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.