1st International ICST Conference on Autonomic Computing and Communication Systems

Research Article

End-to-end vs. Hop-by-hop Transport under Intermittent Connectivity

Download605 downloads
  • @INPROCEEDINGS{10.4108/ICST.AUTONOMICS2007.2225,
        author={Simon Heimlicher and Merkouris Karaliopoulos and Hanoch Levy and Martin May},
        title={End-to-end vs. Hop-by-hop Transport under Intermittent Connectivity},
        proceedings={1st International ICST Conference on Autonomic Computing and Communication Systems},
        publisher={ICST},
        proceedings_a={AUTONOMICS},
        year={2007},
        month={10},
        keywords={},
        doi={10.4108/ICST.AUTONOMICS2007.2225}
    }
    
  • Simon Heimlicher
    Merkouris Karaliopoulos
    Hanoch Levy
    Martin May
    Year: 2007
    End-to-end vs. Hop-by-hop Transport under Intermittent Connectivity
    AUTONOMICS
    ICST
    DOI: 10.4108/ICST.AUTONOMICS2007.2225
Simon Heimlicher1,*, Merkouris Karaliopoulos1,*, Hanoch Levy1,*, Martin May1,*
  • 1: Computer Engineering and Networks Laboratory ETH Zurich, Switzerland
*Contact email: heimlicher@tik.ee.ethz.ch, karaliopoulos@tik.ee.ethz.ch, hanoch@post.tau.ac.il, may@tik.ee.ethz.ch

Abstract

This paper revisits the fundamental trade-off between end- to-end and hop-by-hop transport control. The end-to-end principle has been one of the building blocks of the Internet; but in real-world wireless scenarios, end-to-end connectivity is often intermittent, limiting the performance of end-to-end transport protocols. We use a stochastic model that cap- tures both the availability ratio of links and the duration of link disruptions to represent intermittent connectivity. We compare the performance of end-to-end and hop-by-hop transport over an intermittently-connected path. End-to- end, perhaps surprisingly, may perform better than hop-by- hop transport under long disruption periods. We propose the spaced hop-by-hop policy which is found to dominate (in terms of delivery ratio) the end-to-end policy over the whole parameter range and the basic hop-by-hop policy over most of the relevant range.