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.
Traffic models play an important role in nowadays' network, such as engineering, designing and evaluating the network and its performance. But performance predictions from wireless networking laboratory experiments seem to dismatch what is really deployed in future cognitive heterogeneous networks. To generate an appropriate traffic model is one of the major factors hampering researchers' ability...
We present the effects of different churn models on the performance of structured peer-to-peer (P2P) networks in this paper. Specifically, Exponential distribution (ED), Pareto distribution (PD), and Weibull distribution (WD) are evaluated to provide a comparative analysis. Kademlia-based Peer-to-Peer Protocol (P2PP) is utilized as the underlying signaling protocol. Through simulations, we conclude...
The Gnutella protocol requires peers to broadcast messages to their neighbors when they search files. The message passing generates a lot of traffic in the network, which degrades the quality of service. We propose the new method to optimize the speed of search and to improve the quality of service in a Gnutella based peer-to-peer environment with using semantic routing and priority of nodes. Once...
GMPLS protocol was designed in order to apply label-switching techniques to different network technologies, such as time division multiplexing (TDM), wavelength routing and packet switching networks. Resource reservations are performed all along label switched paths (LSP). This paper proposes a novel constraint-based routing (CBR) algorithm for GMPLS networks. Our solution includes path computation...
In this paper we propose a set of different configurations of failure recovery schemes, developed for network-on-chip (NoC) based systems. These configurations exploit the fact that communication in NoCs tends to be partitioned and eventually localized. The failure recovery approach is based on checkpoint and rollback and is aimed towards fast recovery from system or application level failures. The...
A principal factor in sensor network design is energy efficiency. In this work, we propose to extend the lifetime of sensor networks using appropriate choice of sensor node distribution. The key idea of our scheme is to deploy more nodes in areas of extensive energy usage. Using this scheme of sensor node distribution, we use probabilistic angular routing to route data packets from the sensor nodes...
This paper describes a new path computation model in Multi-protocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks. It introduces a path computation element (PCE), which is functionally separate from label switching routers (LSRs). The Path Computation Element (PCE) is an entity that is capable of computing a network path or route based on a network graph, and applying computational...
In this paper, we propose an adaptive pacing scheme at the link layer for IEEE 802.11 based multihop wireless networks. Our objective is to improve the performance of higher layer protocols without any modifications to them. Our adaptive pacing scheme estimates the four-hop transmission delay in the network path without incurring any additional overheads, and accordingly paces the packets to reduce...
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.