The Experts below are selected from a list of 1386 Experts worldwide ranked by ideXlab platform

Jennifer Rexford - One of the best experts on this subject based on the ideXlab platform.

  • Wide-area route control for distributed services
    2010
    Co-Authors: Vytautas Valancius, Nick Feamster, Jennifer Rexford, Akihiro Nakao
    Abstract:

    Many distributed services would benefit from control over the flow of traffic to and from their users, to offer better performance and higher reliability at a reasonable cost. Unfortunately, although today’s cloud-computing platforms offer elastic computing and bandwidth resources, they do not give services control over wide-area routing. We propose replacing the data center’s Border Router with a Transit Portal (TP) that gives each service the illusion of direct connectivity to upstream ISPs, without requiring each service to deploy hardware, acquire IP address space, or negotiate contracts with ISPs. Our TP prototype supports many layer-two connectivity mechanisms, amortizes memory and message overhead over multiple services, and protects the rest of the Internet from misconfigured and malicious applications. Our implementation extends and synthesizes open-source software components such as the Linux kernel and the Quagga routing daemon. We also implement a management plane based on the GENI control framework and couple this with our four-site TP deployment and Amazon EC2 facilities. Experiments with an anycast DNS application demonstrate the benefits the TP offers to distributed services. 1

  • TIE breaking: Tunable interdomain egress selection
    2005
    Co-Authors: Renata Teixeira, Tim Griffin, Mauricio G. C. Resende, Jennifer Rexford
    Abstract:

    The separation of intradomain and interdomain routing has been a key feature of the Internet's routing architecture from the early days of the ARPAnet. However, the appropriate "division of labor" between the two protocols becomes unclear when an Autonomous System (AS) has interdomain routes to a destination prefix through multiple Border Routers—a situation that is extremely common to-day because neighboring domains often connect in several loca-tions. We believe that the current mechanism of early-exit or hot-potato routing—where each Router in an AS directs traffic to the "closest" Border Router based on the intradomain path costs—is convoluted, restrictive, and sometimes quite disruptive. In this pa-per, we propose a flexible mechanism for Routers to select the egress point for each destination prefix, allowing network administrators to satisfy diverse goals, such as traffic engineering and robustness to equipment failures. We present one example optimization prob-lem that uses integer-programming techniques to tune our mecha-nism to improve network robustness. Experiments with topology and routing data from two backbone networks demonstrate that our solution is both simple (for the Routers) and expressive (for the net-work administrators).

  • CoNEXT - TIE breaking: tunable interdomain egress selection
    Proceedings of the 2005 ACM conference on Emerging network experiment and technology - CoNEXT'05, 2005
    Co-Authors: Renata Teixeira, Timothy G. Griffin, Mauricio G. C. Resende, Jennifer Rexford
    Abstract:

    The separation of intradomain and interdomain routing has been a key feature of the Internet's routing architecture from the early days of the ARPAnet. However, the appropriate "division of labor" between the two protocols becomes unclear when an Autonomous System (AS) has interdomain routes to a destination prefix through multiple Border Routers---a situation that is extremely common today because neighboring domains often connect in several locations. We believe that the current mechanism of early-exit or hot-potato routing---where each Router in an AS directs traffic to the "closest" Border Router based on the intradomain path costs---is convoluted, restrictive, and sometimes quite disruptive. In this paper, we propose a flexible mechanism for Routers to select the egress point for each destination prefix, allowing network administrators to satisfy diverse goals, such as traffic engineering and robustness to equipment failures. We present one example optimization problem that uses integer-programming techniques to tune our mechanism to improve network robustness. Experiments with topology and routing data from two backbone networks demonstrate that our solution is both simple (for the Routers) and expressive (for the network administrators).

Renata Teixeira - One of the best experts on this subject based on the ideXlab platform.

  • TIE breaking: Tunable interdomain egress selection
    2005
    Co-Authors: Renata Teixeira, Tim Griffin, Mauricio G. C. Resende, Jennifer Rexford
    Abstract:

    The separation of intradomain and interdomain routing has been a key feature of the Internet's routing architecture from the early days of the ARPAnet. However, the appropriate "division of labor" between the two protocols becomes unclear when an Autonomous System (AS) has interdomain routes to a destination prefix through multiple Border Routers—a situation that is extremely common to-day because neighboring domains often connect in several loca-tions. We believe that the current mechanism of early-exit or hot-potato routing—where each Router in an AS directs traffic to the "closest" Border Router based on the intradomain path costs—is convoluted, restrictive, and sometimes quite disruptive. In this pa-per, we propose a flexible mechanism for Routers to select the egress point for each destination prefix, allowing network administrators to satisfy diverse goals, such as traffic engineering and robustness to equipment failures. We present one example optimization prob-lem that uses integer-programming techniques to tune our mecha-nism to improve network robustness. Experiments with topology and routing data from two backbone networks demonstrate that our solution is both simple (for the Routers) and expressive (for the net-work administrators).

  • CoNEXT - TIE breaking: tunable interdomain egress selection
    Proceedings of the 2005 ACM conference on Emerging network experiment and technology - CoNEXT'05, 2005
    Co-Authors: Renata Teixeira, Timothy G. Griffin, Mauricio G. C. Resende, Jennifer Rexford
    Abstract:

    The separation of intradomain and interdomain routing has been a key feature of the Internet's routing architecture from the early days of the ARPAnet. However, the appropriate "division of labor" between the two protocols becomes unclear when an Autonomous System (AS) has interdomain routes to a destination prefix through multiple Border Routers---a situation that is extremely common today because neighboring domains often connect in several locations. We believe that the current mechanism of early-exit or hot-potato routing---where each Router in an AS directs traffic to the "closest" Border Router based on the intradomain path costs---is convoluted, restrictive, and sometimes quite disruptive. In this paper, we propose a flexible mechanism for Routers to select the egress point for each destination prefix, allowing network administrators to satisfy diverse goals, such as traffic engineering and robustness to equipment failures. We present one example optimization problem that uses integer-programming techniques to tune our mechanism to improve network robustness. Experiments with topology and routing data from two backbone networks demonstrate that our solution is both simple (for the Routers) and expressive (for the network administrators).

Li Wenxion - One of the best experts on this subject based on the ideXlab platform.

Fabrice Theoleyre - One of the best experts on this subject based on the ideXlab platform.

  • LDSF: Low-latency Distributed Scheduling Function for Industrial Internet of Things
    IEEE internet of things journal, 2020
    Co-Authors: Vasileios Kotsiou, Georgios Papadopoulos, Periklis Chatzimisios, Fabrice Theoleyre
    Abstract:

    The Industrial Internet of Things (IIoT) is expected to be a key enabler for the Industry 4.0. However, networked control automation often requires high reliability and a bounded latency to react properly. Thus, modern wireless protocols for industrial networks, such as IEEE 802.15.4-2015 Time Slotted Channel Hopping (TSCH), rely on a strict schedule of the transmissions to avoid collisions and to make the end-to-end traffic deterministic. Unfortunately, guaranteeing a bounded end-to-end latency is particularly challenging since transmissions have to be temporally chained. Even worse, potential degradation of the link quality may result in reconstructing the whole TSCH schedule along the path. In this article, we propose the Low-latency Distributed Scheduling Function (LDSF) that relies on the organization of the slotframe in smaller parts, called blocks. Each transmitter selects the right set of blocks, depending on its hop distance from the Border Router, so that retransmission opportunities are automatically scheduled. To save energy, a node can still turn off its radio as soon as its packet is correctly acknowledged. Our mathematical analysis as well as our simulation evaluation show the efficiency of the proposed LDSF algorithm compared to three state-of-the-art scheduling functions, the Minimal Scheduling Function (MSF), Low Latency Scheduling Function (LLSF) and Stratum.

  • Passive Link Quality Estimation for Accurate and Stable Parent Selection in Dense 6TiSCH Networks
    2018
    Co-Authors: Rodrigo Teles Hermeto, Antoine Gallais, Kristof Laerhoven, Fabrice Theoleyre
    Abstract:

    Industrial applications are increasingly demanding more low-power operations, deterministic communications and end-to-end reliability that approaches 100%. By keeping nodes time-synchronized and by employing a channel hop- ping approach, IEEE 802.15.4-TSCH (Time-Slotted Channel Hoping) aims at providing high-level network reliability. For this, however, we need to construct an accurate schedule, able to exploit reliable paths. In particular, radio links with high Packet Error Rate should not be exploited since they are less energy-efficient (more retransmissions are required) and they negatively impact the reliability. In this work, we take advantage of the continuously advertisement packets transmitted by the nodes to identify neighbors with a good link quality. We argue that when a node ranks its neighbors through their rate of broadcast packets received, it can identify stable parents, even when the data packets use different, collision-free transmission opportunities. Our experiments on a large-scale platform highlight that our approach improves the convergence delay, identifying the best routes to the Border Router during the bootstrapping (or re- converging) phase without adding any extra control packet.

Timothy G. Griffin - One of the best experts on this subject based on the ideXlab platform.

  • CoNEXT - TIE breaking: tunable interdomain egress selection
    Proceedings of the 2005 ACM conference on Emerging network experiment and technology - CoNEXT'05, 2005
    Co-Authors: Renata Teixeira, Timothy G. Griffin, Mauricio G. C. Resende, Jennifer Rexford
    Abstract:

    The separation of intradomain and interdomain routing has been a key feature of the Internet's routing architecture from the early days of the ARPAnet. However, the appropriate "division of labor" between the two protocols becomes unclear when an Autonomous System (AS) has interdomain routes to a destination prefix through multiple Border Routers---a situation that is extremely common today because neighboring domains often connect in several locations. We believe that the current mechanism of early-exit or hot-potato routing---where each Router in an AS directs traffic to the "closest" Border Router based on the intradomain path costs---is convoluted, restrictive, and sometimes quite disruptive. In this paper, we propose a flexible mechanism for Routers to select the egress point for each destination prefix, allowing network administrators to satisfy diverse goals, such as traffic engineering and robustness to equipment failures. We present one example optimization problem that uses integer-programming techniques to tune our mechanism to improve network robustness. Experiments with topology and routing data from two backbone networks demonstrate that our solution is both simple (for the Routers) and expressive (for the network administrators).