Sciweavers

    JOIN
    2007
    96views more  JOIN 2007»
    Universal Routing and Performance Assurance for Distributed Networks
    13 years 5 months ago
    Universal Routing and Performance Assurance for Distributed Networks
    Download  www.utdallas.edu
    In this paper, we show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. W...
    Kevin F. Chen, Edwin Hsing-Mean Sha
    claim paper
    Read More »
    JNW
    2007
    78views more  JNW 2007»
    A Delay Constrained Minimum Hop Distributed Routing Algorithm using Adaptive Path Prediction
    13 years 5 months ago
    A Delay Constrained Minimum Hop Distributed Routing Algorithm using Adaptive Path Prediction
    Download  www.academypublisher.com
    Abstract— We propose a new delay-constrained minimumhop distributed routing algorithm (DCMH) for unicastrouting. DCMH uses a novel path feasibility prediction (PFP) model that is...
    Azizul R. Mohd. Shariff, Michael E. Woodward
    claim paper
    Read More »
    TON
    2008
    100views more  TON 2008»
    Impact of hot-potato routing changes in IP networks
    13 years 5 months ago
    Impact of hot-potato routing changes in IP networks
    Download  www.cs.princeton.edu
    Abstract-- Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Bo...
    Renata Teixeira, Aman Shaikh, Timothy G. Griffin, ...
    claim paper
    Read More »
    TON
    2008
    95views more  TON 2008»
    Integration of explicit effective-bandwidth-based QoS routing with best-effort routing
    13 years 5 months ago
    Integration of explicit effective-bandwidth-based QoS routing with best-effort routing
    Download  www.iust.ac.ir
    This paper presents a methodology for protecting low-priority best-effort (BE) traffic in a network domain that provides both virtual-circuit routing with bandwidth reservation for...
    Stephen L. Spitler, Daniel C. Lee
    claim paper
    Read More »
    TON
    2008
    133views more  TON 2008»
    Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
    13 years 5 months ago
    Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
    Download  www.ie.cuhk.edu.hk
    An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
    Cunqing Hua, Tak-Shing Peter Yum
    claim paper
    Read More »
    TON
    2008
    136views more  TON 2008»
    Density-based anycast: a robust routing strategy for wireless ad hoc networks
    13 years 5 months ago
    Density-based anycast: a robust routing strategy for wireless ad hoc networks
    Download  www.lenders.ch
    Abstract--Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing para...
    Vincent Lenders, Martin May, Bernhard Plattner
    claim paper
    Read More »
    TON
    2008
    99views more  TON 2008»
    On the computational complexity and effectiveness of N-hub shortest-path routing
    13 years 5 months ago
    On the computational complexity and effectiveness of N-hub shortest-path routing
    Download  www.ieee-infocom.org
    Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
    Reuven Cohen, Gabi Nakibly
    claim paper
    Read More »
    TON
    2008
    204views more  TON 2008»
    BRA: a bidirectional routing abstraction for asymmetric mobile ad hoc networks
    13 years 5 months ago
    BRA: a bidirectional routing abstraction for asymmetric mobile ad hoc networks
    Download  research.microsoft.com
    idirectional Routing Abstraction for Asymmetric Mobile Ad Hoc Networks Venugopalan Ramasubramanian and Daniel Moss
    Venugopalan Ramasubramanian, Daniel Mossé
    claim paper
    Read More »
    TON
    2008
    75views more  TON 2008»
    An algorithmic approach to geographic routing in ad hoc and sensor networks
    13 years 5 months ago
    An algorithmic approach to geographic routing in ad hoc and sensor networks
    Download  dcg.ethz.ch
    The one type of routing in ad hoc and sensor networks that currently appears to be most amenable to algorithmic analysis
    Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
    claim paper
    Read More »
    TON
    2008
    107views more  TON 2008»
    Efficient routing in intermittently connected mobile networks: the multiple-copy case
    13 years 5 months ago
    Efficient routing in intermittently connected mobile networks: the multiple-copy case
    Download  ee.usc.edu
    Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
    Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
    claim paper
    Read More »
    « first‹ previous…101112131415161718…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.