Routing Internet traffic in heterogeneous mesh networks: Analysis and algorithms

In practical wireless mesh networks (WMNs), gateways are subject to hard capacity limits on the aggregate number of flows (in terms of bit rate) that they can support. Thus, if traffic is routed in the mesh network without considering those constraints, as well as the traffic distribution, some gate...

Full description

Saved in:
Bibliographic Details
Published inPerformance evaluation Vol. 68; no. 9; pp. 841 - 858
Main Authors Bruno, Raffaele, Conti, Marco, Pinizzotto, Antonio
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.09.2011
Subjects
Online AccessGet full text
ISSN0166-5316
1872-745X
DOI10.1016/j.peva.2011.01.006

Cover

Abstract In practical wireless mesh networks (WMNs), gateways are subject to hard capacity limits on the aggregate number of flows (in terms of bit rate) that they can support. Thus, if traffic is routed in the mesh network without considering those constraints, as well as the traffic distribution, some gateways or intermediate mesh routers may rapidly get overloaded, and the network resources can be unevenly utilized. To address this problem, in this paper we firstly develop a multi-class queuing network model to analyze feasible throughput allocations, as well as average end-to-end delay, in heterogeneous WMNs. Guided by our analysis, we design a Capacity-Aware Route Selection algorithm ( CARS), which allocates network paths to downstream and upstream Internet flows so as to ensure a more balanced utilization of wireless network resources and gateways’ fixed connections. Through simulations in a number of different network scenarios we show that the CARS scheme significantly outperforms conventional shortest path routing, as well as an alternative routing method that distributes the traffic load on the gateway nodes to minimize its variance.
AbstractList In practical wireless mesh networks (WMNs), gateways are subject to hard capacity limits on the aggregate number of flows (in terms of bit rate) that they can support. Thus, if traffic is routed in the mesh network without considering those constraints, as well as the traffic distribution, some gateways or intermediate mesh routers may rapidly get overloaded, and the network resources can be unevenly utilized. To address this problem, in this paper we firstly develop a multi-class queuing network model to analyze feasible throughput allocations, as well as average end-to-end delay, in heterogeneous WMNs. Guided by our analysis, we design a Capacity-Aware Route Selection algorithm (CARS), which allocates network paths to downstream and upstream Internet flows so as to ensure a more balanced utilization of wireless network resources and gateways' fixed connections. Through simulations in a number of different network scenarios we show that the CARS scheme significantly outperforms conventional shortest path routing, as well as an alternative routing method that distributes the traffic load on the gateway nodes to minimize its variance.
In practical wireless mesh networks (WMNs), gateways are subject to hard capacity limits on the aggregate number of flows (in terms of bit rate) that they can support. Thus, if traffic is routed in the mesh network without considering those constraints, as well as the traffic distribution, some gateways or intermediate mesh routers may rapidly get overloaded, and the network resources can be unevenly utilized. To address this problem, in this paper we firstly develop a multi-class queuing network model to analyze feasible throughput allocations, as well as average end-to-end delay, in heterogeneous WMNs. Guided by our analysis, we design a Capacity-Aware Route Selection algorithm ( CARS), which allocates network paths to downstream and upstream Internet flows so as to ensure a more balanced utilization of wireless network resources and gateways’ fixed connections. Through simulations in a number of different network scenarios we show that the CARS scheme significantly outperforms conventional shortest path routing, as well as an alternative routing method that distributes the traffic load on the gateway nodes to minimize its variance.
Author Pinizzotto, Antonio
Conti, Marco
Bruno, Raffaele
Author_xml – sequence: 1
  givenname: Raffaele
  surname: Bruno
  fullname: Bruno, Raffaele
  email: r.bruno@iit.cnr.it, raffaele.bruno@iit.cnr.it
– sequence: 2
  givenname: Marco
  surname: Conti
  fullname: Conti, Marco
  email: m.conti@iit.cnr.it
– sequence: 3
  givenname: Antonio
  surname: Pinizzotto
  fullname: Pinizzotto, Antonio
  email: a.pinizzotto@iit.cnr.it
BookMark eNp9kE1rGzEQQEVxoE7SP9CTbullnZH2S1t6MaH5gEBCSCA3IUuztpy15Eqyi_995DinHAwDguE9MbxTMnLeISE_GUwYsOZyOVnjVk04MDaBPNB8I2MmWl60Vf06IuMMNUVdsuY7OY1xCQB1W8KYPD75TbJuTu9cwuAw0RRU31tNraMLzDs_R4d-E-kK44Jm4r8Pb_E3nTo17KKNVDlD1TD3wabFKp6Tk14NEX98vmfk5frv89Vtcf9wc3c1vS902dSpELoyXa-MwZkSpVbCVAq1RgEl1_Ws5_WMd6CQdXUvjKirFrhmlRAzYThXVXlGLg7_roP_t8GY5MpGjcOgPq6VHeu6Ejhjmfx1lGRNKwAqziCj4oDq4GMM2Ettk0rWu1zFDpKB3OeWS7nPLfe5JeSBJqv8i7oOdqXC7rj05yBhLrW1GGTUFp1GYwPqJI23x_R3yImc2g
CitedBy_id crossref_primary_10_1016_j_comcom_2013_09_004
crossref_primary_10_1016_j_comcom_2011_09_001
crossref_primary_10_1007_s11107_014_0471_1
crossref_primary_10_1109_MCOM_2014_6710069
crossref_primary_10_3390_s17071678
Cites_doi 10.1109/TMC.2007.70778
10.1109/ICN.2009.21
10.1145/972374.972380
10.1145/1023720.1023732
10.1016/j.comnet.2006.09.018
10.1145/1023756.1023776
10.1109/MAHSS.2008.4660098
10.1109/TNET.2007.904010
10.1109/ICC.2006.255550
10.1145/1140103.1140284
10.1109/WOWMOM.2009.5282474
10.1109/TNET.2007.893091
10.1145/1364654.1364679
10.1109/SAHCN.2008.38
10.1016/j.adhoc.2007.12.001
10.1109/MCOM.2005.1404606
10.1109/AINAW.2007.50
10.1145/938985.939000
10.1109/INFCOM.2007.236
10.1145/1641804.1641819
ContentType Journal Article
Copyright 2011 Elsevier B.V.
Copyright_xml – notice: 2011 Elsevier B.V.
DBID AAYXX
CITATION
7TA
8FD
JG9
DOI 10.1016/j.peva.2011.01.006
DatabaseName CrossRef
Materials Business File
Technology Research Database
Materials Research Database
DatabaseTitle CrossRef
Materials Research Database
Technology Research Database
Materials Business File
DatabaseTitleList Materials Research Database
Materials Research Database

DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-745X
EndPage 858
ExternalDocumentID 10_1016_j_peva_2011_01_006
S0166531611000174
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1~.
1~5
29O
4.4
457
4G.
5VS
6OB
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
ABAOU
ABBOA
ABFNM
ABJNI
ABMAC
ABTAH
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADEZE
ADGUI
ADJOM
ADMUD
AEBSH
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
AXJTR
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HAMUX
HLZ
HVGLF
HX~
HZ~
IHE
J1W
KOM
LG9
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
TN5
WUQ
ZY4
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AFXIZ
AGCQF
AGQPQ
AGRNS
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
BNPGV
CITATION
EFKBS
7TA
8FD
JG9
ID FETCH-LOGICAL-c365t-8c4d9faddeba83ca8d4aecce8032c5bf25b290ae195f8d854702c1488b8d22a43
IEDL.DBID AIKHN
ISSN 0166-5316
IngestDate Fri Sep 05 06:14:12 EDT 2025
Thu Sep 04 22:04:50 EDT 2025
Tue Aug 05 12:02:26 EDT 2025
Thu Apr 24 22:54:59 EDT 2025
Fri Feb 23 02:31:02 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 9
Keywords Performance evaluation
Routing
Load balancing
Wireless mesh networks
Capacity modeling
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c365t-8c4d9faddeba83ca8d4aecce8032c5bf25b290ae195f8d854702c1488b8d22a43
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
PQID 1678004210
PQPubID 23500
PageCount 18
ParticipantIDs proquest_miscellaneous_919930211
proquest_miscellaneous_1678004210
crossref_citationtrail_10_1016_j_peva_2011_01_006
crossref_primary_10_1016_j_peva_2011_01_006
elsevier_sciencedirect_doi_10_1016_j_peva_2011_01_006
PublicationCentury 2000
PublicationDate 2011-09-01
PublicationDateYYYYMMDD 2011-09-01
PublicationDate_xml – month: 09
  year: 2011
  text: 2011-09-01
  day: 01
PublicationDecade 2010
PublicationTitle Performance evaluation
PublicationYear 2011
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References M. Özdemir, A. McDonald, An M/MMGI/1/K queuing model for IEEE 802.11 ad hoc networks, in: Proc. IEEE PE-WASUN’04, Venice, Italy, 2004, pp. 107–111.
Bejerano, Han, Kumar (br000040) 2007; 51
F. Alizadeh-Shabdiz, S. Subramaniam, A finite load analytical model for IEEE 802.11 distributed coordination fucntion MAC, in: Proc. ACM WiOpt’03, Sophia-Antipolis, France, 2003.
J. He, J. Chen, S.-H. Chan, Extending WLAN coverage using infrastructureless access points, in: Proc. of IEEE HPSR 2005, 2005, pp. 162–166.
Zou, Wang, Rao (br000030) 2008; 7
Gao, Chiu, Lui (br000115) 2006; 34
Kumar, Altman, Miorandi, Goyal (br000120) 2007; 15
H. Tokito, M. Sasabe, G. Hasegawa, H. Nakano, Routing method for gateway load balancing in wireless mesh networks, in: Proc. IEEE ICN’09, Dresden, Germany, 2009, pp. 127–132.
Meraki Networks Inc., Residential & MDU Case Studies.
D. De Couto, D. Aguayo, J. Bicket, R. Morris, A high-throughput path metric for multi-hop wireless routing, in: Proc. of ACM MobiCom, San Diego, CA, USA, 2003, pp. 134–146.
L. Ma, M. Denko, A routing metric for load-balancing in wireless mesh networks, in: Proc. of IEEE AINAW’07, Vol. 2, 2007, pp. 21–23.
R. Bruno, M. Conti, A. Pinizzotto, A queuing modeling approach for load-aware route selection in heterogenous mesh networks, in: Proc. of IEEE WoWMoM’09, Kos, Greece, 2009.
V. Mhatre, F. Baccelli, H. Lundgren, C. Diot, Joint MAC-aware routing and load balancing in mesh networks, in: Proc. ACM CoNEXT’07, New York, USA, 2007, pp. 1–12.
Y. Yang, J. Wang, R. Kravets, Load-balanced routing for mesh networks, ACM Mobile Comp. Comm. Rev. (M2CR) 1.
Y. Yang, J. Wang, R. Kravets, Designing routing metrics for mesh networks, in: Proc. of IEEE WiMesh, 2005, Santa Clara, CA, USA, 2005.
A. Kashyap, S. Ganguly, A. Das, S. Banerjee, VoIP on wireless meshes: models, algorithms and evaluation, in: Proc. IEEE INFOCOM’07, Anchorage, USA, 2007, pp. 2036–2044.
.
Siris, Askoxylakis, Conti, Bruno (br000025) 2008; 73
Bruno, Conti, Gregori (br000010) 2005; 43
Tickoo, Sikdar (br000090) 2008; 16
S. Waharte, R. Boutaba, Totally disjoint multipath routing in multihop wireless networks, in: Proc. IEEE ICC’06, Istanbul, Turkey, 2006.
R. Bruno, M. Conti, A. Pinizzotto, Capacity-aware routing in heterogeneous mesh networks: an analytical approach, in: Proc. of IEEE MsWiM’09, Tenerife, Canary Islands, Spain, 2009.
Ozone, French Wireless ISP.
R. Draves, J. Padhye, B. Zill, Routing in multi-radio, multi-hop wireless mesh networks, in: Proc. of ACM MobiCom’04, 2004, pp. 114–128.
Bisnik, Abouzeid (br000095) 2009; 7
H. Aiache, L. Lebrun, V. Conan, S. Rousseau, A load dependent metric for balancing internet traffic in wireless mesh networks, in: Proc. IEEE MeshTech’08, Atlanta, GA, USA, September 29, 2008, pp. 629–634.
Bolch, Greiner, de Meer, Trivedi (br000110) 2006
Karrer, Sabharwal, Knightly (br000005) 2004; 34
M. Genetzakis, V. Siris, A contention-aware routing metric for multi-rate multi-radio mesh networks, in: Proc. IEEE SECON’08, San Francisco, CA, USA, June 16–20, 2008, pp. 242–250.
10.1016/j.peva.2011.01.006_br000135
10.1016/j.peva.2011.01.006_br000035
10.1016/j.peva.2011.01.006_br000055
10.1016/j.peva.2011.01.006_br000075
10.1016/j.peva.2011.01.006_br000130
Bisnik (10.1016/j.peva.2011.01.006_br000095) 2009; 7
10.1016/j.peva.2011.01.006_br000015
Tickoo (10.1016/j.peva.2011.01.006_br000090) 2008; 16
Kumar (10.1016/j.peva.2011.01.006_br000120) 2007; 15
Gao (10.1016/j.peva.2011.01.006_br000115) 2006; 34
10.1016/j.peva.2011.01.006_br000060
10.1016/j.peva.2011.01.006_br000080
10.1016/j.peva.2011.01.006_br000045
10.1016/j.peva.2011.01.006_br000100
10.1016/j.peva.2011.01.006_br000065
Bruno (10.1016/j.peva.2011.01.006_br000010) 2005; 43
10.1016/j.peva.2011.01.006_br000020
10.1016/j.peva.2011.01.006_br000085
10.1016/j.peva.2011.01.006_br000140
10.1016/j.peva.2011.01.006_br000105
Bejerano (10.1016/j.peva.2011.01.006_br000040) 2007; 51
10.1016/j.peva.2011.01.006_br000125
Siris (10.1016/j.peva.2011.01.006_br000025) 2008; 73
10.1016/j.peva.2011.01.006_br000050
Bolch (10.1016/j.peva.2011.01.006_br000110) 2006
Karrer (10.1016/j.peva.2011.01.006_br000005) 2004; 34
10.1016/j.peva.2011.01.006_br000070
Zou (10.1016/j.peva.2011.01.006_br000030) 2008; 7
References_xml – volume: 73
  start-page: 50
  year: 2008
  end-page: 51
  ident: br000025
  article-title: Enhanced, ubiquitous and dependable broadband access using MESH networks
  publication-title: ERCIM News
– reference: D. De Couto, D. Aguayo, J. Bicket, R. Morris, A high-throughput path metric for multi-hop wireless routing, in: Proc. of ACM MobiCom, San Diego, CA, USA, 2003, pp. 134–146.
– reference: H. Tokito, M. Sasabe, G. Hasegawa, H. Nakano, Routing method for gateway load balancing in wireless mesh networks, in: Proc. IEEE ICN’09, Dresden, Germany, 2009, pp. 127–132.
– reference: M. Özdemir, A. McDonald, An M/MMGI/1/K queuing model for IEEE 802.11 ad hoc networks, in: Proc. IEEE PE-WASUN’04, Venice, Italy, 2004, pp. 107–111.
– reference: Y. Yang, J. Wang, R. Kravets, Designing routing metrics for mesh networks, in: Proc. of IEEE WiMesh, 2005, Santa Clara, CA, USA, 2005.
– reference: S. Waharte, R. Boutaba, Totally disjoint multipath routing in multihop wireless networks, in: Proc. IEEE ICC’06, Istanbul, Turkey, 2006.
– reference: Ozone, French Wireless ISP.
– reference: R. Bruno, M. Conti, A. Pinizzotto, Capacity-aware routing in heterogeneous mesh networks: an analytical approach, in: Proc. of IEEE MsWiM’09, Tenerife, Canary Islands, Spain, 2009.
– volume: 34
  start-page: 39
  year: 2006
  end-page: 50
  ident: br000115
  article-title: Determining the end-to-end throughput capacity in multi-hop networks: methodology and applications
  publication-title: SIGMETRICS Perform. Eval. Rev.
– volume: 34
  start-page: 27
  year: 2004
  end-page: 34
  ident: br000005
  article-title: Enabling large-scale wireless broadband: the case for TAPs
  publication-title: ACM SIGMOBILE Comput. Commun. Rev.
– reference: R. Draves, J. Padhye, B. Zill, Routing in multi-radio, multi-hop wireless mesh networks, in: Proc. of ACM MobiCom’04, 2004, pp. 114–128.
– reference: H. Aiache, L. Lebrun, V. Conan, S. Rousseau, A load dependent metric for balancing internet traffic in wireless mesh networks, in: Proc. IEEE MeshTech’08, Atlanta, GA, USA, September 29, 2008, pp. 629–634.
– reference: J. He, J. Chen, S.-H. Chan, Extending WLAN coverage using infrastructureless access points, in: Proc. of IEEE HPSR 2005, 2005, pp. 162–166.
– volume: 7
  start-page: 1011
  year: 2008
  end-page: 1024
  ident: br000030
  article-title: Asymptotic capacity of infrastructure wireless mesh networks
  publication-title: IEEE Trans. Mobile Comput.
– reference: Meraki Networks Inc., Residential & MDU Case Studies.
– reference: V. Mhatre, F. Baccelli, H. Lundgren, C. Diot, Joint MAC-aware routing and load balancing in mesh networks, in: Proc. ACM CoNEXT’07, New York, USA, 2007, pp. 1–12.
– volume: 51
  start-page: 2450
  year: 2007
  end-page: 2466
  ident: br000040
  article-title: Efficient load-balancing routing for wireless mesh networks
  publication-title: Comput. Netw.
– reference: F. Alizadeh-Shabdiz, S. Subramaniam, A finite load analytical model for IEEE 802.11 distributed coordination fucntion MAC, in: Proc. ACM WiOpt’03, Sophia-Antipolis, France, 2003.
– reference: Y. Yang, J. Wang, R. Kravets, Load-balanced routing for mesh networks, ACM Mobile Comp. Comm. Rev. (M2CR) 1.
– reference: R. Bruno, M. Conti, A. Pinizzotto, A queuing modeling approach for load-aware route selection in heterogenous mesh networks, in: Proc. of IEEE WoWMoM’09, Kos, Greece, 2009.
– reference: L. Ma, M. Denko, A routing metric for load-balancing in wireless mesh networks, in: Proc. of IEEE AINAW’07, Vol. 2, 2007, pp. 21–23.
– volume: 16
  start-page: 878
  year: 2008
  end-page: 891
  ident: br000090
  article-title: Modeling queueing and channel access delay in unsaturated IEEE 802.11 random access MAC based wireless networks
  publication-title: IEEE/ACM Trans. Netw.
– reference: M. Genetzakis, V. Siris, A contention-aware routing metric for multi-rate multi-radio mesh networks, in: Proc. IEEE SECON’08, San Francisco, CA, USA, June 16–20, 2008, pp. 242–250.
– year: 2006
  ident: br000110
  article-title: Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications
– volume: 15
  start-page: 588
  year: 2007
  end-page: 601
  ident: br000120
  article-title: New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs
  publication-title: IEEE/ACM Trans. Netw.
– volume: 43
  start-page: 123
  year: 2005
  end-page: 131
  ident: br000010
  article-title: Mesh networks: commodity multihop ad hoc networks
  publication-title: IEEE Commun. Mag.
– reference: A. Kashyap, S. Ganguly, A. Das, S. Banerjee, VoIP on wireless meshes: models, algorithms and evaluation, in: Proc. IEEE INFOCOM’07, Anchorage, USA, 2007, pp. 2036–2044.
– volume: 7
  start-page: 79
  year: 2009
  end-page: 97
  ident: br000095
  article-title: Queuing network models for delay analysis of multihop wireless ad hoc networks
  publication-title: Ad Hoc Netw.
– reference: .
– year: 2006
  ident: 10.1016/j.peva.2011.01.006_br000110
– volume: 7
  start-page: 1011
  issue: 8
  year: 2008
  ident: 10.1016/j.peva.2011.01.006_br000030
  article-title: Asymptotic capacity of infrastructure wireless mesh networks
  publication-title: IEEE Trans. Mobile Comput.
  doi: 10.1109/TMC.2007.70778
– ident: 10.1016/j.peva.2011.01.006_br000105
– ident: 10.1016/j.peva.2011.01.006_br000135
  doi: 10.1109/ICN.2009.21
– ident: 10.1016/j.peva.2011.01.006_br000015
– volume: 73
  start-page: 50
  year: 2008
  ident: 10.1016/j.peva.2011.01.006_br000025
  article-title: Enhanced, ubiquitous and dependable broadband access using MESH networks
  publication-title: ERCIM News
– volume: 34
  start-page: 27
  issue: 1
  year: 2004
  ident: 10.1016/j.peva.2011.01.006_br000005
  article-title: Enabling large-scale wireless broadband: the case for TAPs
  publication-title: ACM SIGMOBILE Comput. Commun. Rev.
  doi: 10.1145/972374.972380
– ident: 10.1016/j.peva.2011.01.006_br000055
  doi: 10.1145/1023720.1023732
– volume: 51
  start-page: 2450
  issue: 10
  year: 2007
  ident: 10.1016/j.peva.2011.01.006_br000040
  article-title: Efficient load-balancing routing for wireless mesh networks
  publication-title: Comput. Netw.
  doi: 10.1016/j.comnet.2006.09.018
– ident: 10.1016/j.peva.2011.01.006_br000085
  doi: 10.1145/1023756.1023776
– ident: 10.1016/j.peva.2011.01.006_br000080
– ident: 10.1016/j.peva.2011.01.006_br000075
  doi: 10.1109/MAHSS.2008.4660098
– volume: 16
  start-page: 878
  issue: 4
  year: 2008
  ident: 10.1016/j.peva.2011.01.006_br000090
  article-title: Modeling queueing and channel access delay in unsaturated IEEE 802.11 random access MAC based wireless networks
  publication-title: IEEE/ACM Trans. Netw.
  doi: 10.1109/TNET.2007.904010
– ident: 10.1016/j.peva.2011.01.006_br000125
  doi: 10.1109/ICC.2006.255550
– volume: 34
  start-page: 39
  issue: 1
  year: 2006
  ident: 10.1016/j.peva.2011.01.006_br000115
  article-title: Determining the end-to-end throughput capacity in multi-hop networks: methodology and applications
  publication-title: SIGMETRICS Perform. Eval. Rev.
  doi: 10.1145/1140103.1140284
– ident: 10.1016/j.peva.2011.01.006_br000100
  doi: 10.1109/WOWMOM.2009.5282474
– volume: 15
  start-page: 588
  issue: 3
  year: 2007
  ident: 10.1016/j.peva.2011.01.006_br000120
  article-title: New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs
  publication-title: IEEE/ACM Trans. Netw.
  doi: 10.1109/TNET.2007.893091
– ident: 10.1016/j.peva.2011.01.006_br000045
  doi: 10.1145/1364654.1364679
– ident: 10.1016/j.peva.2011.01.006_br000065
  doi: 10.1109/SAHCN.2008.38
– volume: 7
  start-page: 79
  issue: 1
  year: 2009
  ident: 10.1016/j.peva.2011.01.006_br000095
  article-title: Queuing network models for delay analysis of multihop wireless ad hoc networks
  publication-title: Ad Hoc Netw.
  doi: 10.1016/j.adhoc.2007.12.001
– ident: 10.1016/j.peva.2011.01.006_br000020
– volume: 43
  start-page: 123
  issue: 3
  year: 2005
  ident: 10.1016/j.peva.2011.01.006_br000010
  article-title: Mesh networks: commodity multihop ad hoc networks
  publication-title: IEEE Commun. Mag.
  doi: 10.1109/MCOM.2005.1404606
– ident: 10.1016/j.peva.2011.01.006_br000070
  doi: 10.1109/AINAW.2007.50
– ident: 10.1016/j.peva.2011.01.006_br000035
– ident: 10.1016/j.peva.2011.01.006_br000050
  doi: 10.1145/938985.939000
– ident: 10.1016/j.peva.2011.01.006_br000130
  doi: 10.1109/INFCOM.2007.236
– ident: 10.1016/j.peva.2011.01.006_br000140
  doi: 10.1145/1641804.1641819
– ident: 10.1016/j.peva.2011.01.006_br000060
SSID ssj0005730
Score 1.9533372
Snippet In practical wireless mesh networks (WMNs), gateways are subject to hard capacity limits on the aggregate number of flows (in terms of bit rate) that they can...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 841
SubjectTerms Algorithms
Capacity modeling
Computer networks
Finite element method
Internet
Load balancing
Networks
Performance evaluation
Routing
Routing (telecommunications)
Traffic engineering
Traffic flow
Wireless mesh networks
Title Routing Internet traffic in heterogeneous mesh networks: Analysis and algorithms
URI https://dx.doi.org/10.1016/j.peva.2011.01.006
https://www.proquest.com/docview/1678004210
https://www.proquest.com/docview/919930211
Volume 68
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB50vXjxLa4vIniTuk2btqm3ZVFWRRFU8BaSNnVXtLvsVo_-dme2qaKgB6GnkqFlZjLzJfkyA3BoRCijQvh0wph4ojCBpy0PvQLhK_HFciHogvPVddy_FxcP0cMc9Jq7MESrdLG_jumzaO3edJw2O-PhsHOLYCVGD4qp6Bn6lZiHhSBM46gFC93zy_71F9MjmbUcofEeCbi7MzXNa2zftKvkyYnk9Vt--hGpZ-nnbAWWHG5k3frXVmHOlmuw3PRkYG6KrsMNUXwwHbF6q89WrJpoKhPBhiUbEPdlhC5jcb3PXux0wMqaBj49YU15EqbLnOnnx9FkWA1ephtwf3Z61-t7rmuCl4VxVHkyE3laUNgyWoaZlrnQaCcr_TDIIoNGMEHqo0HSqJC5jETiBxkuiqSReRBoEW5CqxyVdgtYIaj6PAJIyzNcxnGjRSGTJDSCC4vIpA280ZXKXElx6mzxrBru2JMi_SrSr_Lx8eM2HH3KjOuCGn-OjhoTqG9uoTDi_yl30NhL4XyhQxA9063imJ0pUnG_DeyXMSl5KYIfvv3Pz-_AYr33TFy0XWhVk1e7h-ClMvswf_zO952LfgAbye4f
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90PuiL3-L8jOCblDVt2ma-DVE2P4aggm8haVM30W5s1b_fuzVVFPRB6FNJaLm73P0u-eUO4NiIUEa58OmEMfFEbgJPWx56OcJX4otlQtAF55t-3H0Ql4_R4xyc1XdhiFbpfH_l02fe2r1pOWm2xsNh6w7BSowWFFPRM7QrMQ8LIsJsrwELnd5Vt__F9EhmLUdovEcT3N2ZiuY1tu_aVfLkRPL6LT798NSz8HOxCssON7JO9WtrMGeLdVipezIwt0Q34JYoPhiOWLXVZ0tWTjSViWDDgg2I-zJCk7GY77NXOx2woqKBT09ZXZ6E6SJj-uVpNBmWg9fpJjxcnN-fdT3XNcFLwzgqPZmKrJ2T2zJahqmWmdCoJyv9MEgjg0owQdtHhbSjXGYyEokfpJgUSSOzINAi3IJGMSrsNrBcUPV5BJCWp5jGcaNFLpMkNIILi8ikCbyWlUpdSXHqbPGiau7YsyL5KpKv8vHx4yacfM4ZVwU1_hwd1SpQ38xCocf_c95RrS-F64UOQfRMtopjdCZPxf0msF_GtMlKEfzwnX9-_hAWu_c31-q617_ahaVqH5p4aXvQKCdvdh-BTGkOnKF-ANHT8A4
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Routing+Internet+traffic+in+heterogeneous+mesh+networks%3A+Analysis+and+algorithms&rft.jtitle=Performance+evaluation&rft.au=Bruno%2C+Raffaele&rft.au=Conti%2C+Marco&rft.au=Pinizzotto%2C+Antonio&rft.date=2011-09-01&rft.issn=0166-5316&rft.volume=68&rft.issue=9&rft.spage=841&rft.epage=858&rft_id=info:doi/10.1016%2Fj.peva.2011.01.006&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-5316&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-5316&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-5316&client=summon