Issues in Wardrop routing in wireless networks
Traditionally, traffic in wireless networks is routed along minimum hop paths from sources to destinations. It can be theoretically shown that flow avoiding routing provides throughput gains over shortest path routing in random wireless networks by a factor of four when the sources are few enough. M...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 41 |
---|---|
container_issue | |
container_start_page | 34 |
container_title | |
container_volume | |
creator | Vivek Raghunathan Kumar, P.R. |
description | Traditionally, traffic in wireless networks is routed along minimum hop paths from sources to destinations. It can be theoretically shown that flow avoiding routing provides throughput gains over shortest path routing in random wireless networks by a factor of four when the sources are few enough. Motivated by this, an alternative approach to wireless routing using delay measurements to adaptively route packets in order to achieve a Wardrop equilibrium is presented. The proposed protocol is completely distributed and balances load along loop-free paths. An ns-2 simulation study indicates that the protocol is able to automatically route flows to "avoid" each other, improving over the performance of shortest-path protocols in a variety of scenarios. The architectural challenges in implementing such a multi-path, delay based, probabilistic algorithm are discussed. A user-space implementation of the protocol has been built on a modified Linux 2.4.20 kernel. Finally, a measurement study of the implementation on a six node testbed is discussed. |
doi_str_mv | 10.1109/WICON.2005.18 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1509635</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1509635</ieee_id><sourcerecordid>1509635</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-e392ce32c78608762a13c86b914ba28957b5175815d3d54ae77524c9a66b17e03</originalsourceid><addsrcrecordid>eNotjEtLw0AURgdEUGuXrrrJH0icOzd3HksJPgLFbpS6K5PkWqatSZlJKf57I3o2Hxw-jhB3IAsA6e7XdbV6LZSUVIC9EDfSaEcKrfq4EvOUdnIC3eTstSjqlE6cstBnax-7OByzOJzG0G9_1TlEPnBKWc_jeYj7dCsuP_0h8fx_Z-L96fGtesmXq-e6eljmAQyNOaNTLaNqjdXSGq08YGt146BsvLKOTEPT0QJ12FHp2RhSZeu81g0YljgTi79uYObNMYYvH783QNJpJPwBhjg_pw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Issues in Wardrop routing in wireless networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Vivek Raghunathan ; Kumar, P.R.</creator><creatorcontrib>Vivek Raghunathan ; Kumar, P.R.</creatorcontrib><description>Traditionally, traffic in wireless networks is routed along minimum hop paths from sources to destinations. It can be theoretically shown that flow avoiding routing provides throughput gains over shortest path routing in random wireless networks by a factor of four when the sources are few enough. Motivated by this, an alternative approach to wireless routing using delay measurements to adaptively route packets in order to achieve a Wardrop equilibrium is presented. The proposed protocol is completely distributed and balances load along loop-free paths. An ns-2 simulation study indicates that the protocol is able to automatically route flows to "avoid" each other, improving over the performance of shortest-path protocols in a variety of scenarios. The architectural challenges in implementing such a multi-path, delay based, probabilistic algorithm are discussed. A user-space implementation of the protocol has been built on a modified Linux 2.4.20 kernel. Finally, a measurement study of the implementation on a six node testbed is discussed.</description><identifier>ISBN: 076952382X</identifier><identifier>ISBN: 9780769523828</identifier><identifier>DOI: 10.1109/WICON.2005.18</identifier><language>eng</language><publisher>IEEE</publisher><subject>Contracts ; Delay ; Intelligent networks ; Kernel ; Linux ; Routing protocols ; Telecommunication traffic ; Throughput ; Wireless mesh networks ; Wireless networks</subject><ispartof>First International Conference on Wireless Internet (WICON'05), 2005, p.34-41</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1509635$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1509635$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Vivek Raghunathan</creatorcontrib><creatorcontrib>Kumar, P.R.</creatorcontrib><title>Issues in Wardrop routing in wireless networks</title><title>First International Conference on Wireless Internet (WICON'05)</title><addtitle>WICON</addtitle><description>Traditionally, traffic in wireless networks is routed along minimum hop paths from sources to destinations. It can be theoretically shown that flow avoiding routing provides throughput gains over shortest path routing in random wireless networks by a factor of four when the sources are few enough. Motivated by this, an alternative approach to wireless routing using delay measurements to adaptively route packets in order to achieve a Wardrop equilibrium is presented. The proposed protocol is completely distributed and balances load along loop-free paths. An ns-2 simulation study indicates that the protocol is able to automatically route flows to "avoid" each other, improving over the performance of shortest-path protocols in a variety of scenarios. The architectural challenges in implementing such a multi-path, delay based, probabilistic algorithm are discussed. A user-space implementation of the protocol has been built on a modified Linux 2.4.20 kernel. Finally, a measurement study of the implementation on a six node testbed is discussed.</description><subject>Contracts</subject><subject>Delay</subject><subject>Intelligent networks</subject><subject>Kernel</subject><subject>Linux</subject><subject>Routing protocols</subject><subject>Telecommunication traffic</subject><subject>Throughput</subject><subject>Wireless mesh networks</subject><subject>Wireless networks</subject><isbn>076952382X</isbn><isbn>9780769523828</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjEtLw0AURgdEUGuXrrrJH0icOzd3HksJPgLFbpS6K5PkWqatSZlJKf57I3o2Hxw-jhB3IAsA6e7XdbV6LZSUVIC9EDfSaEcKrfq4EvOUdnIC3eTstSjqlE6cstBnax-7OByzOJzG0G9_1TlEPnBKWc_jeYj7dCsuP_0h8fx_Z-L96fGtesmXq-e6eljmAQyNOaNTLaNqjdXSGq08YGt146BsvLKOTEPT0QJ12FHp2RhSZeu81g0YljgTi79uYObNMYYvH783QNJpJPwBhjg_pw</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Vivek Raghunathan</creator><creator>Kumar, P.R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>Issues in Wardrop routing in wireless networks</title><author>Vivek Raghunathan ; Kumar, P.R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-e392ce32c78608762a13c86b914ba28957b5175815d3d54ae77524c9a66b17e03</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Contracts</topic><topic>Delay</topic><topic>Intelligent networks</topic><topic>Kernel</topic><topic>Linux</topic><topic>Routing protocols</topic><topic>Telecommunication traffic</topic><topic>Throughput</topic><topic>Wireless mesh networks</topic><topic>Wireless networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Vivek Raghunathan</creatorcontrib><creatorcontrib>Kumar, P.R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Vivek Raghunathan</au><au>Kumar, P.R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Issues in Wardrop routing in wireless networks</atitle><btitle>First International Conference on Wireless Internet (WICON'05)</btitle><stitle>WICON</stitle><date>2005</date><risdate>2005</risdate><spage>34</spage><epage>41</epage><pages>34-41</pages><isbn>076952382X</isbn><isbn>9780769523828</isbn><abstract>Traditionally, traffic in wireless networks is routed along minimum hop paths from sources to destinations. It can be theoretically shown that flow avoiding routing provides throughput gains over shortest path routing in random wireless networks by a factor of four when the sources are few enough. Motivated by this, an alternative approach to wireless routing using delay measurements to adaptively route packets in order to achieve a Wardrop equilibrium is presented. The proposed protocol is completely distributed and balances load along loop-free paths. An ns-2 simulation study indicates that the protocol is able to automatically route flows to "avoid" each other, improving over the performance of shortest-path protocols in a variety of scenarios. The architectural challenges in implementing such a multi-path, delay based, probabilistic algorithm are discussed. A user-space implementation of the protocol has been built on a modified Linux 2.4.20 kernel. Finally, a measurement study of the implementation on a six node testbed is discussed.</abstract><pub>IEEE</pub><doi>10.1109/WICON.2005.18</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 076952382X |
ispartof | First International Conference on Wireless Internet (WICON'05), 2005, p.34-41 |
issn | |
language | eng |
recordid | cdi_ieee_primary_1509635 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Contracts Delay Intelligent networks Kernel Linux Routing protocols Telecommunication traffic Throughput Wireless mesh networks Wireless networks |
title | Issues in Wardrop routing in wireless networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T12%3A10%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Issues%20in%20Wardrop%20routing%20in%20wireless%20networks&rft.btitle=First%20International%20Conference%20on%20Wireless%20Internet%20(WICON'05)&rft.au=Vivek%20Raghunathan&rft.date=2005&rft.spage=34&rft.epage=41&rft.pages=34-41&rft.isbn=076952382X&rft.isbn_list=9780769523828&rft_id=info:doi/10.1109/WICON.2005.18&rft_dat=%3Cieee_6IE%3E1509635%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1509635&rfr_iscdi=true |