A Distributed Routing Algorithm for Internet-wide Geocast

Bernd Meijerink, Mitra Baratchi, Geert Heijenk

    Research output: Working paper

    7 Downloads (Pure)

    Abstract

    Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based on path data. In our evaluation, we show that our purely distance vector based algorithm can come close to shortest path tree performance when a small number of routers are present in the destination area. We also show that our path based algorithm can come close to the performance of a shortest path tree in almost all geocast situations.
    Original languageEnglish
    Publication statusPublished - 4 May 2018

    Fingerprint

    Routing algorithms
    Parallel algorithms
    Internet
    Routers

    Keywords

    • cs.NI

    Cite this

    @techreport{fce95f3d965649ebb30c32fee04b1285,
    title = "A Distributed Routing Algorithm for Internet-wide Geocast",
    abstract = "Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based on path data. In our evaluation, we show that our purely distance vector based algorithm can come close to shortest path tree performance when a small number of routers are present in the destination area. We also show that our path based algorithm can come close to the performance of a shortest path tree in almost all geocast situations.",
    keywords = "cs.NI",
    author = "Bernd Meijerink and Mitra Baratchi and Geert Heijenk",
    year = "2018",
    month = "5",
    day = "4",
    language = "English",
    type = "WorkingPaper",

    }

    A Distributed Routing Algorithm for Internet-wide Geocast. / Meijerink, Bernd; Baratchi, Mitra; Heijenk, Geert.

    2018.

    Research output: Working paper

    TY - UNPB

    T1 - A Distributed Routing Algorithm for Internet-wide Geocast

    AU - Meijerink, Bernd

    AU - Baratchi, Mitra

    AU - Heijenk, Geert

    PY - 2018/5/4

    Y1 - 2018/5/4

    N2 - Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based on path data. In our evaluation, we show that our purely distance vector based algorithm can come close to shortest path tree performance when a small number of routers are present in the destination area. We also show that our path based algorithm can come close to the performance of a shortest path tree in almost all geocast situations.

    AB - Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based on path data. In our evaluation, we show that our purely distance vector based algorithm can come close to shortest path tree performance when a small number of routers are present in the destination area. We also show that our path based algorithm can come close to the performance of a shortest path tree in almost all geocast situations.

    KW - cs.NI

    M3 - Working paper

    BT - A Distributed Routing Algorithm for Internet-wide Geocast

    ER -