Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 9
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

A semi-dynamic, game based and interference aware channel assignment for multi-radio multi-channel wireless mesh networks

  • Amiri Nezhad, Maryam
  • Cerdà Alabern, Llorenç
  • Bellalta, Boris
  • Guerrero Zapata, Manel
Channel assignment (CA) has been extensively researched for multi-radio wireless mesh networks (WMNs), but it is still very challenging when it comes to its implementation. In this paper we propose a semi-dynamic and distributed CA mechanism called semi-dynamic interference aware channel assignment (SICA) based on game theory formulation. SICA is an interference aware, distributed CA which preserves the network connectivity without relying on a common channel nor central node for coordination between mesh routers. SICA applies a real time learner algorithm which assumes that nodes do not have perfect information about the network topology. To the best of our knowledge this is the first game formulation of CA which takes the co-channel interference into account. We have simulated SICA and compared against other channel assignment mechanisms proposed in the literature. Simulation results show that SICA outperforms other mechanisms., This work was supported by the Spanish government and Generalitat de Catalunya through projects TIN2010-21378-C02-01 and 2009-SGR-1167, respectively, and by the European Commission through the NoE EuroNF.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Performance Assessment of Fragmentation Mechanisms for Vehicular Delay-Tolerant Networks

  • Dias, Joao A. F. F.
  • Rodrigues, Joel J. P. C.
  • Isento, Joao N.
  • Pereira, Paulo R. B. A.
  • Lloret, Jaime|||0000-0002-0862-0533
[EN] Vehicular Delay-Tolerant Networks (VDTNs) are a new approach for vehicular communications where vehicles cooperate with each other, acting as the communication infrastructure, to provide low-cost asynchronous opportunistic communications. These communication technologies assume variable delays and bandwidth constraints characterized by a non-transmission control protocol/internet protocol architecture but interacting with it at the edge of the network. VDTNs are based on the principle of asynchronous communications, bundle-oriented communication from the DTN architecture, employing a store-carry-and-forward routing paradigm. In this sense, VDTNs should use the tight network resources optimizing each opportunistic contact among nodes. Given the limited contact times among nodes, fragmentation appears as a possible solution to improve the overall network performance, increasing the bundle delivery probability. This article proposes the use of several fragmentation approaches (proactive, source, reactive, and toilet paper) for VDTNs. They are discussed and evaluated through a laboratory testbed. Reactive and toilet paper approaches present the best results. It was also shown that only the source fragmentation approach presents worst results when compared with non-fragmentation approaches., This study was partially supported by the Instituto de Telecomunicacoes, Next Generation Networks and Applications Group (NetGNA), Portugal, by the Euro-NF Network of Excellence of the Seventh Framework Programme of EU, in the framework of the Specific Joint Research Project VDTN, and by the INESC-ID multiannual funding through the PIDDAC program funds and National Funding from the FCT - Fundacao para a Ciencia e a Tecnologia through the PEst-OE/EEI/LA0008/2011 and PTDC/EEA-TEL/099074/2008 (MPSat) Projects.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Optimal mapping of virtual networks with hidden hops

  • Botero Vega, Juan Felipe
  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
  • Fischer, Andreas
  • de Meer, Hermann
Network virtualization has emerged as a solution for the Internet inability to address the required challenges caused by the lack of coordination among Internet service providers for the deployment of new services. The allocation of resources is one of the main problems in network virtualization, mainly in the mapping of virtual nodes and links to specific substrate nodes and paths, also known as the virtual network embedding problem. This paper proposes an algorithm based on optimization theory, to map the virtual links and nodes requiring a specific demand, looking for the maximization of the spare bandwidth and spare CPU in the substrate network, taking into account the CPU demanded by the hidden hops when a virtual link is mapped. The components of the virtual networks (nodes and links) that do not ask for an specific demand are then allocated following a fairness criteria, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Energy efficient virtual network embedding

  • Botero Vega, Juan Felipe
  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
  • Duelli, Michael
  • Schlosser, Daniel
  • Fischer, A.
  • de Meer, Hermann
Waste of energy due to over-provisioning and overdimensioning of network infrastructures has recently stimulated the interest on energy consumption reduction by Internet Service Providers (ISPs). By means of resource consolidation, network virtualization based architectures will enable energy saving. In this letter, we extend the well-known virtual network embedding problem (VNE) to energy awareness and propose a mixed integer program (MIP) which provides optimal energy efficient embeddings. Simulation results show the energy gains of the proposed MIP over the existing cost-based VNE approach., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Virtual network embedding: a survey

  • Fischer, Andreas
  • Botero Vega, Juan Felipe
  • Beck, Michael Till
  • de Meer, Hermann
  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
Network virtualization is recognized as an enabling technology for the future Internet. It aims to overcome the resistance of the current Internet to architectural change. Application of this technology relies on algorithms that can instantiate virtualized networks on a substrate infrastructure, optimizing the layout for service-relevant metrics. This class of algorithms is commonly known as "Virtual Network Embedding (VNE)" algorithms. This paper presents a survey of current research in the VNE area. Based upon a novel classification scheme for VNE algorithms a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Energy efficient virtual network embedding

  • Botero Vega, Juan Felipe
  • Hesselbach Serra, Xavier
  • Duelli, Michael
  • Schlosser, Daniel
  • Fischer, A.
  • de Meer, Hermann
Waste of energy due to over-provisioning and overdimensioning of network infrastructures has recently stimulated the interest on energy consumption reduction by Internet Service Providers (ISPs). By means of resource consolidation, network virtualization based architectures will enable energy saving. In this letter, we extend the well-known virtual network embedding problem (VNE) to energy awareness and propose a mixed integer program (MIP) which provides optimal energy efficient embeddings. Simulation results show the energy gains of the proposed MIP over the existing cost-based VNE approach., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A semi-dynamic, game based and interference aware channel assignment for multi-radio multi-channel wireless mesh networks

  • Amiri Nezhad, Maryam
  • Cerdà Alabern, Llorenç
  • Bellalta, Boris
  • Guerrero Zapata, Manel
Channel assignment (CA) has been extensively researched for multi-radio wireless mesh networks (WMNs), but it is still very challenging when it comes to its implementation. In this paper we propose a semi-dynamic and distributed CA mechanism called semi-dynamic interference aware channel assignment (SICA) based on game theory formulation. SICA is an interference aware, distributed CA which preserves the network connectivity without relying on a common channel nor central node for coordination between mesh routers. SICA applies a real time learner algorithm which assumes that nodes do not have perfect information about the network topology. To the best of our knowledge this is the first game formulation of CA which takes the co-channel interference into account. We have simulated SICA and compared against other channel assignment mechanisms proposed in the literature. Simulation results show that SICA outperforms other mechanisms., This work was supported by the Spanish government and Generalitat de Catalunya through projects TIN2010-21378-C02-01 and 2009-SGR-1167, respectively, and by the European Commission through the NoE EuroNF.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Optimal mapping of virtual networks with hidden hops

  • Botero Vega, Juan Felipe
  • Hesselbach Serra, Xavier
  • Fischer, Andreas
  • de Meer, Hermann
Network virtualization has emerged as a solution for the Internet inability to address the required challenges caused by the lack of coordination among Internet service providers for the deployment of new services. The allocation of resources is one of the main problems in network virtualization, mainly in the mapping of virtual nodes and links to specific substrate nodes and paths, also known as the virtual network embedding problem. This paper proposes an algorithm based on optimization theory, to map the virtual links and nodes requiring a specific demand, looking for the maximization of the spare bandwidth and spare CPU in the substrate network, taking into account the CPU demanded by the hidden hops when a virtual link is mapped. The components of the virtual networks (nodes and links) that do not ask for an specific demand are then allocated following a fairness criteria, Peer Reviewed, Postprint (author’s final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Virtual network embedding: a survey

  • Fischer, Andreas
  • Botero Vega, Juan Felipe
  • Beck, Michael Till
  • de Meer, Hermann
  • Hesselbach Serra, Xavier
Network virtualization is recognized as an enabling technology for the future Internet. It aims to overcome the resistance of the current Internet to architectural change. Application of this technology relies on algorithms that can instantiate virtualized networks on a substrate infrastructure, optimizing the layout for service-relevant metrics. This class of algorithms is commonly known as "Virtual Network Embedding (VNE)" algorithms. This paper presents a survey of current research in the VNE area. Based upon a novel classification scheme for VNE algorithms a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed., Peer Reviewed, Postprint (published version)