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.
Survivable MPLS technologies are crucial in ensuring reliable communication services. The fast reroute (FRR) mechanism has been standardized to achieve fast local repair of label switched paths (LSPs). We present a hybrid survivability scheme for MPLS networks that combines the well-known p-cycle method with FRR technology. While with pure FRR backup paths are planned individually for each link, the...
The power grid network is a complex network which is subjected to attacks and cascading failures. In this paper, we study the vulnerabilities of power grid in terms of cascading failures caused by node failures. Specifically, we define three metrics, the percentage-of-failure, Required Redundancy (RED), and Risk if Failure (RIF), to represent the critical level for each node. Based on these metrics,...
In this paper, we study information propagation in a 2D mobile ad-hoc network, where mobile nodes are randomly and independently distributed on a torus following a homogeneous Poisson process with a given density. Nodes in the network move following a random direction mobility model. A piece of information is broadcast from a source node to all other nodes in the network, using a Susceptible-Infectious-Recovered...
Peer-to-Peer (P2P) storage systems are cost-effective and reliable platforms that enable users to share their storage to support variant emerging applications, such as peer-to-peer social networks and distributed backup systems. Because different users have heterogeneous online characteristics and bandwidth capabilities, how to replicate data at suitable peers has become an important issue to ensure...
We present a lightweight algorithm for the estimation of the node achievable throughput and available bandwidth in IEEE 802.11 wireless networks. We consider a multirate WLAN with access point (AP), where there may be both elastic and inelastic traffic flows. Through our algorithm and leveraging previous theoretical results, the AP can estimate: (i) the available bandwidth that a new station wishing...
In this paper we consider the problem of maximizing information propagation in social networks. To solve it, we introduce a probabilistic maximum coverage problem, and further purpose a cluster-based heuristic and a neighborhood-removal heuristic for two basic diffusion models, namely, the Linear Threshold Model and the Independent Cascade Model, respectively. Our proposed strategies are compared...
In this paper we have implemented the Hash technique to provide security in HWMP (Hybrid Wireless Mesh Protocol). Then after, we compared the Hash based HWMP against IBC (Identity Based Cryptography) based HWMP. This study has been carried out to show the great benefits of the IBC technique in securing HWMP. Results have shown that, IBC-HWMP outperforms the hash-based HWMP in terms of overhead and...
The extremely widespread adoption of Online Social Networks (OSNs) raises many questions on privacy and access control. Regardless of the particular centralized or de-centralized nature of the OSN, the achievable security and privacy degree strongly depends on the graph-theoretical properties of the social graph representing the real friendship relations between the users. In this paper, we analyze...
In this paper, we investigate the cost-constrained incremental network planning problem in multi-hop wireless networks. Given an existing wireless network, we study the problem of how to add new wireless links to improve the network performance under the deployment cost constraint. After formulating the problem as COst-constrained Incremental Network ($COIN$) problem, we introduce a performance metric,...
In this paper we address the problem of virtual network reconfiguration. In our previous work on virtual network embedding strategies, we found that most virtual network rejections were caused by bottlenecked substrate links while peak resource use is equal to 18%. These observations lead us to propose a new greedy Virtual Network Reconfiguration algorithm, VNR. The main aim of our proposal is to...
Application relays can be used to reduce end-to-end latency to provide shorter paths than IP default paths. To fit the large-scale and distributed features of Internet, the nodes can cooperate to form a latency-reducing routing overlay by acting as relays for each other in peer-to-peer paradigms. In this paper, we utilize the triangle inequality violations (TIV) in delay space to model the relays...
In today's Internet, many peer-to-peer (P2P) applications deploy their distributed networks based on Kademlia, a robust distributed hash table (DHT) protocol. Since Kademlia has no mechanism to defend ID fraud, Sybil attack becomes a great threat on these P2P networks. However, to our best knowledge, Sybil attacks in real Kademlia-based networks has never been measured. In this paper, based on our...
Compact routing schemes address the fundamental tradeoff between the memory space required to store the routing table entries and the length of the routing paths that these schemes produce. This paper introduces the first known nameindependent, leaf-initiated dynamic compact routing scheme that allows the distribution of traffic from any source to any set of leaf nodes along a multicast routing path...
Opportunistic selection is a practically appealing technique that is used in multi-node wireless systems to maximize throughput, implement proportional fairness, etc. However, selection is challenging since the information about a node's channel gains is often available only locally at each node and not centrally. We propose a novel multiple access-based distributed selection scheme that generalizes...
Random access techniques have traditionally been used for the design of efficient medium access control protocols for wireless networks where the entire bandwidth is provided to the users as a single channel to be accessed for communication. In this paper we analyze the broadcast performance of several random access techniques in a multi channel system, where users can dynamically access portions...
In this paper, we propose the use of network decomposition under an optimal resource allocation framework. We develop a methodology where recursive formulas can be utilized for calculating the desired end-to-end performance bounds (i.e., backlog bound violation probability) of flows traversing tandem, acyclic queueing networks. We use those performance metrics in an optimization framework that allocates...
Current network architectures and solutions are about to reach the limits of sustainable developments. Research with respect to a Future Internet tackles many different aspects of networking. On one hand, with the evolution of virtualization techniques, a machine can be connected to several networks concurrently and on the other hand, the number of existing applications never stops increasing. Therefore,...
Legacy utility meters for electricity, water and gas are rapidly being replaced by highly automated and networked smart meters. The network of smart meters, collector devices and head-end systems constitute an Advanced Metering Infrastructure (AMI). The purpose of deploying an AMI is to increase the granularity of utility consumption data for demand-response applications. A data routing protocol is...
In this paper we propose new strategies for computing virtual geometric node coordinates in peer-to-peer overlays. The main goal is to obtain a decentralized network where each peer has a set of (multidimensional) coordinates and the distance between two peers is proportional to the round-trip time (RTT) between the peers. We consider methods based on the Euclidean distance and the Linfinity norm...
Dynamic networks require adaptive strategies for information dissemination, as the topology constantly changes. This work presents an event-based bio-inspired dissemination approach that employs ants, which correspond to mobile agents, to spread information throughout the network. An event is defined as a state transition of a node or link. A node which detects an event in its neighborhood triggers...
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.