The Experts below are selected from a list of 141 Experts worldwide ranked by ideXlab platform
Antonio A F Loureiro - One of the best experts on this subject based on the ideXlab platform.
-
matrix multihop address allocation and dynamic any to any Routing for 6lowpan
Computer Networks, 2018Co-Authors: Bruna Soares Peres, Bruno P Santos, Otavio Augusto De Oliveira Souza, Olga Goussevskaia, Marcos A M Vieira, Luiz F M Vieira, Antonio A F LoureiroAbstract:Abstract Standard Routing protocols for IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) are mainly designed for data collection applications and work by establishing a tree-based network topology, enables packets to be sent upwards, from the leaves to the root, adapting to dynamics of low-power communication links. In this work, we propose Matrix, a platform-independent Routing protocol that utilizes the existing tree structure of the network to enable reliable and efficient any-to-any data traffic in 6LoWPAN. Matrix uses hierarchical IPv6 address assignment to optimize Routing Table Size while preserving bidirectional Routing. Moreover, it uses a local broadcast mechanism to forward messages to the right subtree when a persistent node or link failures occur. We implemented Matrix on TinyOS and evaluated its performance both analytically and through simulations on TOSSIM. Our results showed that the proposed protocol is superior to available protocols for 6LoWPAN when it comes to any-to-any data communication, concerning reliability, message efficiency, and memory footprint.
-
matrix multihop address allocation and dynamic any to any Routing for 6lowpan
Modeling Analysis and Simulation of Wireless and Mobile Systems, 2016Co-Authors: Bruna Soares Peres, Bruno P Santos, Otavio Augusto De Oliveira Souza, Olga Goussevskaia, Marcos A M Vieira, Luiz F M Vieira, Edson Roteia Araujo, Antonio A F LoureiroAbstract:Standard Routing protocols for IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) are mainly designed for data collection applications and work by establishing a tree-based network topology, which enables packets to be sent upwards, from the leaves to the root, adapting to dynamics of low-power communication links. The Routing Tables in such unidirectional networks are very simple and small since each node just needs to maintain the address of its parent in the tree, providing the best-quality route at every moment. In this work, we propose Matrix, a platform-independent Routing protocol that utilizes the existing tree structure of the network to enable reliable and efficient any-to-any data traffic. Matrix uses hierarchical IPv6 address assignment in order to optimize Routing Table Size, while preserving bidirectional Routing. Moreover, it uses a local broadcast mechanism to forward messages to the right subtree when persistent node or link failures occur. We implemented Matrix on TinyOS and evaluated its performance both analytically and through simulations on TOSSIM. Our results show that the proposed protocol is superior to available protocols for 6LoWPAN, when it comes to any-to-any data communication, in terms of reliability, message efficiency, and memory footprint.
Abhishek Kumar - One of the best experts on this subject based on the ideXlab platform.
-
ulysses a robust low diameter low latency peer to peer network
European Transactions on Telecommunications, 2004Co-Authors: Abhishek Kumar, Shashidhar Merugu, Ellen Zegura, Jun Xu, Xingxing YuAbstract:A number of distributed hash Table (DHT)-based protocols have been proposed to address the issue of scalability in peer-to-peer networks. In this paper, we present Ulysses, a peer-to-peer network based on the butterfly topology that achieves the theoretical lower bound of log n/ log log n on network diameter when the average Routing Table Size at nodes is no more than log n. Compared to existing DHT-based schemes with similar Routing Table Size, Ulysses reduces the network diameter by a factor of log log n, which is 2–4 for typical configurations. This translates into the same amount of reduction on query latency and average traffic per link/node. In addition, Ulysses maintains the same level of robustness in terms of Routing in the face of faults and recovering from graceful/ungraceful joins and departures, as provided by existing DHT-based schemes. The performance of the protocol has been evaluated using both analysis and simulation. Copyright © 2004 AEI
-
on the fundamental tradeoffs between Routing Table Size and network diameter in peer to peer networks
IEEE Journal on Selected Areas in Communications, 2004Co-Authors: Abhishek KumarAbstract:We study a fundamental tradeoff issue in designing a distributed hash Table (DHT) in peer-to-peer (P2P) networks: the Size of the Routing Table versus the network diameter. Observing that existing DHT schemes have either 1) a Routing Table Size and network diameter both of O(log/sub 2/n), or 2) a Routing Table of Size d and network diameter of O(n/sup 1/d/), S. Ratnasamy et al. (2001) asked whether this represents the best asymptotic "state-efficiency" tradeoffs. We show that some straightforward Routing algorithms achieve better asymptotic tradeoffs. However, such algorithms all cause severe congestion on certain network nodes, which is undesirable in a P2P network. We rigorously define the notion of "congestion" and conjecture that the above tradeoffs are asymptotically optimal for a congestion-free network. The answer to this conjecture is negative in the strict sense. However, it becomes positive if the Routing algorithm is required to eliminate congestion in a "natural" way by being uniform. We also prove that the tradeoffs are asymptotically optimal for uniform algorithms. Furthermore, for uniform algorithms, we find that the Routing Table Size of O(log/sub 2/n) is a magic threshold point that separates two different "state-efficiency" regions. Our third result is to study the exact (instead of asymptotic) optimal tradeoffs for uniform algorithms. We propose a new Routing algorithm that reduces the Routing Table Size and the network diameter of Chord both by 21.4% without introducing any other protocol overhead, based on a novel number-theory technique. Our final result is to present Ulysses, a congestion-free nonuniform algorithm that achieves a better asymptotic "state-efficiency" tradeoff than existing schemes in the probabilistic sense, even under dynamic node joins/leaves.
Bruna Soares Peres - One of the best experts on this subject based on the ideXlab platform.
-
matrix multihop address allocation and dynamic any to any Routing for 6lowpan
Computer Networks, 2018Co-Authors: Bruna Soares Peres, Bruno P Santos, Otavio Augusto De Oliveira Souza, Olga Goussevskaia, Marcos A M Vieira, Luiz F M Vieira, Antonio A F LoureiroAbstract:Abstract Standard Routing protocols for IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) are mainly designed for data collection applications and work by establishing a tree-based network topology, enables packets to be sent upwards, from the leaves to the root, adapting to dynamics of low-power communication links. In this work, we propose Matrix, a platform-independent Routing protocol that utilizes the existing tree structure of the network to enable reliable and efficient any-to-any data traffic in 6LoWPAN. Matrix uses hierarchical IPv6 address assignment to optimize Routing Table Size while preserving bidirectional Routing. Moreover, it uses a local broadcast mechanism to forward messages to the right subtree when a persistent node or link failures occur. We implemented Matrix on TinyOS and evaluated its performance both analytically and through simulations on TOSSIM. Our results showed that the proposed protocol is superior to available protocols for 6LoWPAN when it comes to any-to-any data communication, concerning reliability, message efficiency, and memory footprint.
-
matrix multihop address allocation and dynamic any to any Routing for 6lowpan
Modeling Analysis and Simulation of Wireless and Mobile Systems, 2016Co-Authors: Bruna Soares Peres, Bruno P Santos, Otavio Augusto De Oliveira Souza, Olga Goussevskaia, Marcos A M Vieira, Luiz F M Vieira, Edson Roteia Araujo, Antonio A F LoureiroAbstract:Standard Routing protocols for IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) are mainly designed for data collection applications and work by establishing a tree-based network topology, which enables packets to be sent upwards, from the leaves to the root, adapting to dynamics of low-power communication links. The Routing Tables in such unidirectional networks are very simple and small since each node just needs to maintain the address of its parent in the tree, providing the best-quality route at every moment. In this work, we propose Matrix, a platform-independent Routing protocol that utilizes the existing tree structure of the network to enable reliable and efficient any-to-any data traffic. Matrix uses hierarchical IPv6 address assignment in order to optimize Routing Table Size, while preserving bidirectional Routing. Moreover, it uses a local broadcast mechanism to forward messages to the right subtree when persistent node or link failures occur. We implemented Matrix on TinyOS and evaluated its performance both analytically and through simulations on TOSSIM. Our results show that the proposed protocol is superior to available protocols for 6LoWPAN, when it comes to any-to-any data communication, in terms of reliability, message efficiency, and memory footprint.
Bijan Jabbari - One of the best experts on this subject based on the ideXlab platform.
-
Resilient Traffic Engineering in a Transit-Edge Separated Internet Routing
2011Co-Authors: Stefano Secci, Bijan JabbariAbstract:The significant growth in the global Internet traffic and Routing Table Size requires solutions to address Internet scalability and resiliency. A number of proposals have considered moving away from the flat legacy Internet Routing to a two-level hierarchical Routing, separating edge networks from transit carrier networks. In this paper, we study the extended inter-domain traffic engineering capabilities arising in a transit-edge separated Internet Routing, focusing on those multi-homed edge networks (e.g., small ISPs, content providers, large corporations) that aim at increasing their Internet resiliency experience. We model using game theory the interaction between distant independent edge networks exchanging large traffic volumes, with the goal of seeking efficient edge-to-edge load-balancing Routing solutions. The proposed traffic engineering framework relies on a non-cooperative potential game, built upon path prepending- and path diversity- dependent costs, that indicates efficient equilibrium solution for the edge-to-edge load-balancing coordination problem. Simulations on real instances show that, in comparison with the alternative multipath BGP and normal LISP, we can achieve significantly higher resiliency and stability. In particular, our simulation for an illustrating case shows four-times more sTable multipath Routing solutions with a five-times larger path diversity.
Bruno P Santos - One of the best experts on this subject based on the ideXlab platform.
-
matrix multihop address allocation and dynamic any to any Routing for 6lowpan
Computer Networks, 2018Co-Authors: Bruna Soares Peres, Bruno P Santos, Otavio Augusto De Oliveira Souza, Olga Goussevskaia, Marcos A M Vieira, Luiz F M Vieira, Antonio A F LoureiroAbstract:Abstract Standard Routing protocols for IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) are mainly designed for data collection applications and work by establishing a tree-based network topology, enables packets to be sent upwards, from the leaves to the root, adapting to dynamics of low-power communication links. In this work, we propose Matrix, a platform-independent Routing protocol that utilizes the existing tree structure of the network to enable reliable and efficient any-to-any data traffic in 6LoWPAN. Matrix uses hierarchical IPv6 address assignment to optimize Routing Table Size while preserving bidirectional Routing. Moreover, it uses a local broadcast mechanism to forward messages to the right subtree when a persistent node or link failures occur. We implemented Matrix on TinyOS and evaluated its performance both analytically and through simulations on TOSSIM. Our results showed that the proposed protocol is superior to available protocols for 6LoWPAN when it comes to any-to-any data communication, concerning reliability, message efficiency, and memory footprint.
-
matrix multihop address allocation and dynamic any to any Routing for 6lowpan
Modeling Analysis and Simulation of Wireless and Mobile Systems, 2016Co-Authors: Bruna Soares Peres, Bruno P Santos, Otavio Augusto De Oliveira Souza, Olga Goussevskaia, Marcos A M Vieira, Luiz F M Vieira, Edson Roteia Araujo, Antonio A F LoureiroAbstract:Standard Routing protocols for IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) are mainly designed for data collection applications and work by establishing a tree-based network topology, which enables packets to be sent upwards, from the leaves to the root, adapting to dynamics of low-power communication links. The Routing Tables in such unidirectional networks are very simple and small since each node just needs to maintain the address of its parent in the tree, providing the best-quality route at every moment. In this work, we propose Matrix, a platform-independent Routing protocol that utilizes the existing tree structure of the network to enable reliable and efficient any-to-any data traffic. Matrix uses hierarchical IPv6 address assignment in order to optimize Routing Table Size, while preserving bidirectional Routing. Moreover, it uses a local broadcast mechanism to forward messages to the right subtree when persistent node or link failures occur. We implemented Matrix on TinyOS and evaluated its performance both analytically and through simulations on TOSSIM. Our results show that the proposed protocol is superior to available protocols for 6LoWPAN, when it comes to any-to-any data communication, in terms of reliability, message efficiency, and memory footprint.
