@prefix prodottidellaricerca: . @prefix istituto: . @prefix prodotto: . istituto:CDS044 prodottidellaricerca:prodotto prodotto:ID83678 . @prefix pubblicazioni: . @prefix unitaDiPersonaleInterno: . unitaDiPersonaleInterno:MATRICOLA9553 pubblicazioni:autoreCNRDi prodotto:ID83678 . unitaDiPersonaleInterno:MATRICOLA29416 pubblicazioni:autoreCNRDi prodotto:ID83678 . unitaDiPersonaleInterno:MATRICOLA5357 pubblicazioni:autoreCNRDi prodotto:ID83678 . @prefix modulo: . modulo:ID4182 prodottidellaricerca:prodotto prodotto:ID83678 . @prefix rdf: . prodotto:ID83678 rdf:type prodotto:TIPO1301 . @prefix retescientifica: . prodotto:ID83678 rdf:type retescientifica:ProdottoDellaRicerca . @prefix rdfs: . prodotto:ID83678 rdfs:label "Capacity-Aware Routing in Heterogeneous Mesh Networks: An Analytical Approach (Contributo in atti di convegno)"@en . @prefix xsd: . prodotto:ID83678 pubblicazioni:anno "2009-01-01T00:00:00+01:00"^^xsd:gYear ; pubblicazioni:doi "10.1145/1641804.1641819"^^xsd:string . @prefix skos: . prodotto:ID83678 skos:altLabel "
Bruno R.; Conti M.; Pinizzotto A. (2009)
Capacity-Aware Routing in Heterogeneous Mesh Networks: An Analytical Approach
in 12th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Tenerife, SPAIN, OCT 26-29, 2009
"^^rdf:HTML ; pubblicazioni:autori "Bruno R.; Conti M.; Pinizzotto A."^^xsd:string ; pubblicazioni:paginaInizio "73"^^xsd:string ; pubblicazioni:paginaFine "81"^^xsd:string ; pubblicazioni:titoloVolume "MSWIM09; PROCEEDINGS OF THE 12TH ACM INTERNATIONAL CONFERENCE ON MODELING, ANALYSIS, AND SYSTEMS"^^xsd:string ; pubblicazioni:note "In: MWSIM 2009 - 12th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (Canaries (Islands), 29-30 2009). Proceedings, pp. 73 - 81. ACM, 2009."^^xsd:string ; pubblicazioni:descrizioneSinteticaDelProdotto "ABSTRACT: In wireless mesh networks (WMNs), gateway nodes may become a severe bottleneck for Internet flows. Indeed, if traffic is routed in the mesh without considering traffic distribution, as well as link capacities, some gateways or intermediate mesh routers may rapidly get overloaded due to unevenly utilization of network resources. To address this issue, in this paper we firstly develop a multi-class queuing network model to analyze feasible throughput allocations in heterogeneous WMNs, as well as to predict the residual capacity of network paths. 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' Internet connections. Through simulations in a number of different network scenarios we show that CARS significantly outperforms shortest path routing using routing metrics that capture only inte"^^xsd:string ; skos:note "Scopu"^^xsd:string , "ISI Web of Science (WOS)"^^xsd:string ; pubblicazioni:affiliazioni "CNR-IIT, Pisa"^^xsd:string ; pubblicazioni:titolo "Capacity-Aware Routing in Heterogeneous Mesh Networks: An Analytical Approach"^^xsd:string ; pubblicazioni:isbn "978-1-60558-616-8"^^xsd:string ; prodottidellaricerca:abstract "In wireless mesh networks (WMNs), gateway nodes may become a severe bottleneck for Internet flows. Indeed, if traffic is routed in the mesh without considering traffic distribution, as well as link capacities, some gateways or intermediate mesh routers may rapidly get overloaded due to unevenly utilization of network resources. To address this issue, in this paper we firstly develop a multi-class queuing network model to analyze feasible throughput allocations in heterogeneous WMNs, as well as to predict the residual capacity of network paths. 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' Internet connections. Through simulations in a number of different network scenarios we show that CARS significantly outperforms shortest path routing using routing metrics that capture only inter-flow interference."@en ; prodottidellaricerca:prodottoDi istituto:CDS044 , modulo:ID4182 ; pubblicazioni:autoreCNR unitaDiPersonaleInterno:MATRICOLA5357 , unitaDiPersonaleInterno:MATRICOLA9553 , unitaDiPersonaleInterno:MATRICOLA29416 . @prefix parolechiave: . prodotto:ID83678 parolechiave:insiemeDiParoleChiave . parolechiave:insiemeDiParoleChiaveDi prodotto:ID83678 .