Дисертації з теми "Virtual networks and slicing"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Virtual networks and slicing".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Luu, Quang Trung. "Dynamic Control and Optimization of Wireless Virtual Networks." Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG039.
Network slicing is a key enabler for 5G networks. With network slicing, Mobile Network Operators (MNO) create various slices for Service Providers (SP) to accommodate customized services. As network slices are operated on a common network infrastructure owned by some Infrastructure Provider (InP), efficiently sharing the resources across various slices is very important. In this thesis, taking the InP perspective, we propose several methods for provisioning resources for network slices. Previous best-effort approaches deploy the various Service Function Chains (SFCs) of a given slice sequentially in the infrastructure network. In this thesis, we provision aggregate resources to accommodate slice demands. Once provisioning is successful, the SFCs of the slice are ensured to get enough resources to be properly operated. This facilitates the satisfaction of the slice quality of service requirements. The proposed provisioning solutions also yield a reduction of the computational resources needed to deploy the SFCs
Elkael, Maxime. "Reinforcement learning and optimization for energy efficient 5G slicing with Quality of Service guarantees." Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAS015.
This thesis addresses resource allocation problems in 5G networks. Our objective is to leverage network slicing (e.g. the set of techniques based on virtualization and network softwarization which allows the network operator to provide different amounts of resources to different tenants) in order to to improve the energy-efficiency and resource consumption of 5G networks, while guaranteeing Quality of Service constraints. To do so, we formulate and solve optimization problems at the different domains of the network: We are first concerned with the placement of slices in the core network. To solve the problem, a new approach combining Monte Carlo Search and Neighborhood Search is formulated. We show it accepts more core slices than state-of-the-art approaches for the core network placement problem. Then we shift the focus to energy efficiency in resource allocation in 5G networks shared between Physical Network Operators (PNOs) and Mobile Virtual Network Operators (MVNOs). This framework jointly considers software component placement, user request routing, and resource dimensioning while meeting Service Level Agreements (SLAs) based on latency and reliability constraints. Through Column Generation, we obtain exact solutions, demonstrating energy savings of up to 50% in real networks compared to existing placement or resource minimization algorithms. Finally, we delve into the realm of energy optimization in Integrated Access and Backhaul (IAB) networks, a key component of dense 5G deployments. Leveraging the Open Radio Access Network (O-RAN) framework, our model minimizes active IAB nodes while ensuring a minimum capacity for User Equipment (UE). Formulated as a binary nonlinear program, this approach reduces RAN energy consumption by 47%, while maintaining Quality-Of-Service for UEs. Overall, this thesis provides novel algorithms for improving resource and energy efficiency of 5G network slicing. Such improvement is studied in different parts of the network, from the core up to the access network
Dawaliby, Samir. "Machine-to-Machine (M2M) Communications in Next Generation Networks : Spectrum management and energy efficiency." Thesis, Poitiers, 2019. http://www.theses.fr/2019POIT2280.
This thesis deals with the problem of guaranteeing heterogeneous quality of service (QoS) requirements for Internet of Things (IoT) communications in terms of urgency and reliability. Various solutions are proposed towards achieving this goal in LoRa Wide Area Networks (LoRaWAN). First, we implement network slicing over LoRa standard architecture and evaluate its impact using various static and dynamic strategies. Simulation Results performed over NS3 proved the efficiency of network slicing in isolating physical resources for each slice and serving delay critical communications. Motivated by these results, a slice-based optimization is proposed next to improve the dynamic slicing strategy by investigating more LoRa parameters at the physical layer. The proposed method finds for each device the best parameters configuration that potentially improves the performance of its slice in terms of QoS, reliability and energy efficiency. Moreover, we also looked towards meeting upcoming challenges in future IoT networks that comes from the increasing number of IoT devices. Even with network slicing, LoRa scalability remained as a big challenge that should be carefully considered especially due to the lack of flexibility in managing current wireless networks. Therefore, to meet the global objective in guaranteeing QoS in large scale IoT deployments, software defined networking (SDN) and network slicing are adopted as backbone technologies for a distributed virtualized architecture and slicing strategy. The latter proposition is based on game theory and adapts faster to the changes in a congested IoT environment by leveraging slicing decision making closer to the edge
Nerini, Matteo. "Network Slicing for IEEE 802.11 Wireless Networks." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/21149/.
Bakri, Sihem. "Towards enforcing network slicing in 5G networks." Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS067.
The current architecture “one size fits all” of 4G network cannot support the next-generation 5G heterogeneous services criteria. Therefore, research around 5G aims to provide more adequate architectures and mechanisms to deal with this purpose. The 5G architecture is envisioned to accommodate the diverse and conflicting demands of services in terms of latency, bandwidth, and reliability, which cannot be sustained by the same network infrastructure. In this context, network slicing provided by network virtualization allows the infrastructure to be divided into different slices. Each slice is tailored to meet specific service requirements allowing different services (such as automotive, Internet of Things, etc.) to be provided by different network slice instances. Each of these instances consists of a set of virtual network functions that run on the same infrastructure with specially adapted orchestration. Three main service classes of network slicing have been defined by the researchers as follows: Enhanced Mobile Broadband (eMBB), massive Machine Type Communication (mMTC), and ultra-Reliable and Low-Latency Communication (uRLLC). One of the main challenges when it comes to deploying Network Slices is slicing the Radio Access Network (RAN). Indeed, managing RAN resources and sharing them among Network Slices is an increasingly difficult task, which needs to be properly designed. This thesis proposes solutions that aim to improve network performance, and introduce flexibility and greater utilization of network resources by accurately and dynamically provisioning the activated network slices with the appropriate amounts of resources to meet their diverse requirements
Biallach, Hanane. "Optimization of VNF reconfiguration problem for 5G network slicing." Electronic Thesis or Diss., Compiègne, 2022. http://www.theses.fr/2022COMP2707.
In recent years, because of the unprecedented growth in the number of connected devices and mobile data, and the ongoing developments in technologies to address this enormous data demand, the fifth generation (5G) network has emerged. The forthcoming 5G architecture will be essentially based on Network Slicing (NS), which enables provide a flexible approach to realize the 5G vision. Thanks to the emerging Network Function Virtualization (NFV) concept, the network functions are decoupled from dedicated hardware devices and realized in the form of software. This offers more flexibility and agility in business operations. Despite the advantages it brings, NFV raises some technical challenges, the reconfiguration problem is one of them. This problem, which is NP-Hard, consists in reallocating the Virtual Network Functions (VNFs) to fit the network changes, by transforming the current state of deployed services, e.g., the current placement of Virtual Machines (VM) that host VNFs, to another state that updates providers’ objectives. This PhD thesis investigates how to reconfigure the VNFs by migrating them to an optimal state that could be computed in advance or free placement. In this thesis, we studied both cases while minimizing the service interruption duration and the VNF migration duration. We have proposed exact and approximate methods. Among the exact methods, we cite two ILP models. We also proposed two heuristic approaches, one based on column generation and the second using the concept of “arc set feedback”. The overall objective of this work is therefore to define and study the problem of VNF reconfiguration problem in the context of 5G network slicing, and propose mathematical models and efficient algorithms to solve the underlying optimization problems
Sun, Shaobo. "Applications of spectrum slicing in optical access networks." Thesis, University of Warwick, 2010. http://wrap.warwick.ac.uk/34617/.
Schmidt, Robert. "Slicing in heterogeneous software-defined radio access networks." Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS525.
5G networks are envisioned to be a paradigm shift towards service-oriented networks. In this thesis, we investigate how to efficiently combine slicing and SD-RAN to provide the required level of flexibility and programmability in the RAN infrastructure to realize service-oriented multi-tenant networks. First, we devise an abstraction of a base station to represent logical base stations and describe a virtualized network service. Second, we propose a novel standard-compliant SD-RAN platform, named FlexRIC, in the form of a software development kit (SDK). Third, we provide a modular design for a slice-aware MAC scheduling framework to efficiently manage and control the radio resources in a multi-service environment with quality-of-service (QoS) support. Finally, we present a dynamic SD-RAN virtualization layer based on the FlexRIC SDK and MAC scheduling framework to flexibly compose a multi-service SD-RAN infrastructure and provide programmability for multiple SD-RAN controllers
MOREIRA, André Luis Cavalcanti. "An adaptable storage slicing algorithm for content delivery networks." Universidade Federal de Pernambuco, 2015. https://repositorio.ufpe.br/handle/123456789/17331.
Made available in DSpace on 2016-07-12T12:20:38Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Thesis - André Luis Cavalcanti Moreira.pdf: 3666881 bytes, checksum: 956e0e6be2bd9f076c0d30eea9d3ea25 (MD5) Previous issue date: 2015-08-28
Several works study the performance of Content Delivery Networks (CDNs) under various network infrastructure and demand conditions. Many strategies have been proposed to deal with aspects inherent to the CDN distribution model. Though mostly very effective, a traditional CDN approach of statically positioned elements often fails to meet quality of experience (QoE) requirements when network conditions suddenly change. CDN adaptation is a key feature in this process and some studies go even further and try to also deal with demand elasticity by providing an elastic infrastructure (cloud computing) to such CDNs. Each Content Provider (CP) gets served only the amount of storage space and network throughput that it needs and pays only for what has been used. Some IaaS providers offer simple CDN services on top of their infrastructure. However, in general, there is a lack of PaaS tools to create rapidly a CDN. There is no standard or open source software able to deliver CDN as a service for each tenant through well-known managers. A PaaS CDN should be able to implement content delivery service in a cloud environment, provision and orchestrate each tenant, monitor usage and make decisions on planning and dimensioning of resources. This work introduces a framework for the allocation of resources of a CDN in a multi-tenant environment. The framework is able to provision and orchestrate multi-tenant virtual CDNs and can be seen as a step towards a PaaS CDN. A simple dot product based module for network change detection is presented and a more elaborate multi-tenant resource manager model is defined. We solve the resulting ILP problem using both branch and bound as well as an efficient cache slicing algorithm that employs a three phase heuristic for orchestration of multi-tenant virtual CDNs. We finally show that a distributed algorithm with limited local information may be also offer reasonable resource allocation while using limited coordination among the different nodes. A self-organization behavior emerges when some of the nodes reach consensus.
Vários trabalhos estudam o desempenho de Redes de Distribuição de Conteúdo (CDN) em diferentes condições e demanda e de infraestrutura. Muitas estratégias têm sido propostas para lidar com aspectos inerentes ao modelo de distribuição de CDN. Embora essas técnicas sejam bastante eficazes, uma abordagem tradicional de elementos estaticamente posicionados numa CDN muitas vezes não consegue atender os requisitos de qualidade de experiência (QoE) quando as condições da rede mudam repentinamente. Adaptação CDN é uma característica fundamental neste processo e alguns estudos vão ainda mais longe e tentam lidar com a elasticidade da demanda, proporcionando uma infraestrutura elástica (computação em nuvem) para a CDN. Cada provedor de conteúdo obtém apenas a quantidade de armazenamento e de rede necessários, pagando apenas pelo efetivo uso. Alguns provedores IaaS oferecem serviços de CDN sobre suas estruturas. No entanto, em geral, não existe padrão ou softwares de código aberto capazes de entregar serviços de CDN por meio de gerenciadores. Uma CDN PaaS deve ser capaz de fornecer um serviço de entrega de conteúdo em um ambiente de nuvem, provisionar e orquestrar cada tenant, monitorar uso e tomar decisões de planejamento e dimensionamento de recursos. Este trabalho apresenta um framework para alocação de recursos de uma CDN em ambiente multi-tenant. O framework é capaz de provisionar e orquestrar CDNs virtuais e pode ser visto como um passo em direção a uma PaaS CDN. Um módulo baseado em simples produto escalar para detecção de mudanças na rede é apresentado, bem como um modelo mais elaborado de gerenciamento de recursos. Resolvemos o problema ILP resultante dessa abordagem por meio de um algoritmo de divisão de cache que emprega uma heurística em três fases para a orquestração de CDN virtuais. Por fim, mostramos uma outra abordagem com algoritmo distribuído que usa informação local e que também oferece uma alocação razoável usando coordenação limitada entre os diferentes nós. Um comportamento de auto-organização surge quando alguns desses nós chegam a um consenso.
Suárez, Trujillo Luis Carlos. "Securing network slices in 5th generation mobile networks." Thesis, Brest, 2020. http://www.theses.fr/2020BRES0050.
Network slicing is a cornerstone in the conception and deployment of enriched communication services for the new use cases envisioned and supported by the new 5G architecture.This document makes emphasis on the challenge of the network slicing isolation and security management according to policy. First, a novel access control model was created, that secures the interactions between network functions that reside inside the 5G system. Then, the management of the interactions between network slices was addressed. We coin the concept of network slice chains, which are conceived after security constraint validation according to policy. Lastly, a method to quantify isolation was developed, permitting to find out how well isolated a communication service is, which is offered via network slices. This enables network operators and customers to measure the isolation level and improve the configuration of the network slices so the isolation level can be enhanced. These components establish a solid framework that contributes to secure, vertically, the communication services of a 5G network and assess how secure they are with respect to their interactions and isolation
Richart, Matías. "Resource allocation and management techniques for network slicing in WiFi networks." Doctoral thesis, Universitat Politècnica de Catalunya, 2019. http://hdl.handle.net/10803/668043.
Network slicing ha estat recentment proposat com un dels aspectes claus de les xarxes 5G i s'espera que permeti afrontar les creixents demandes de rendiment que tindran aquests sistemes. Fer slicing consisteix en fer particions d'una xarxa física compartida en diverses parts (slices) lògiques autocontenidas que poden ser adaptades per oferir diferents requeriments funcionals o de rendiment. Més encara, una característica clau del paradigma de slicing és el de proveir aïllament dels recursos així com permetre un ús eficient dels mateixos. En aquest context, una slice es pot considerar com una xarxa virtual d'extrem a extrem que permet als operadors d'infraestructura arrendar els seus recursos a proveïdors de servei (arrendatari) mitjançant el desplegament dinàmic i sota demanda de slices. Els arrendataris poden tenir control complet sobre els recursos i funcions de la slice i utilitzar-los per satisfer les demandes dels seus clients. Treballs recents sobre slicing en xarxes d'accés sense fil s'han enfocat en arquitectures generals i esquemes de gestió per al desplegament de slicing. En aquest sentit, no s'ha aprofundit en detalls de com s'implementen i controlen les slices en els dispositius sense fils. A més, encara hi ha algunes tècniques per al control de slices, la majoria es concentren en tecnologies per a xarxes mòbils i no tenen en compte les xarxes WiFi malgrat la seva creixent rellevància i omnipresència. En aquest escenari, aquesta tesi contribueix al problema de slicing en xarxes WiFi proposant una solució per implementar i controlar slices en punts d'accés WiFi. El treball es concentra en slicing amb qualitat de servei (QoS Slicing), una variant complexa del problema on les slices tenen requeriments de rendiment específics. Les principals contribucions de la tesi es divideixen en tres: (1) una detallada anàlisi del problema de network slicing en xarxes d'accés sense fil i en particular en WiFi, així com un estudi i definició dels problemes de QoS Slicing, (2) un model i mecanisme per a l'assignació de recursos en dispositius WiFi, i (3) una solució per QoS Slicing que implementa i controla slices amb requeriments de rendiment en punts d'accés WiFi. Donada la novetat del concepte de slicing i la complexitat del problema, es va realitzar un estudi detallat del problema de slicing on es proveeix una definició completa del concepte de slicing. A més, s'introdueixen els dos principals problemes del slicing: l'assignació de recursos i l'aïllament. En aquest sentit, aquesta tesi contribueix amb una estratègia original on el problema d'assignació de recursos es divideix en dues tasques: l'assignació dinàmica de recursos i el control de l'assignació. Com un pas previ a la construcció d'una solució per QoS Slicing, es proposa un mètode original per a la distribució proporcional de recursos en xarxes WiFi mitjançant el control del temps de transmissió. El mecanisme proposat (anomenat ATERR) es basa en considerar el temps de transmissió com el recurs a ser compartit i assignat. També es va desenvolupar un model analític de l'algoritme ATERR del qual es poden obtenir les capacitats i limitacions del mecanisme. La validesa del model proposat és estudiada mitjançant una avaluació basada en simulacions sobre l'entorn NS-3. Finalment, pel que fa al problema de QoS Slicing, es van considerar dos requeriments diferents: una garantia de taxa de transmissió mínima i un màxim de latència permès. El problema d'assignació de recursos per a les diferents slices es va formular com un problema d'optimització estocàstica on els requeriments de cada slice es modelen com una restricció. Es va elaborar una solució al problema anterior utilitzant la teoria d'optimització de Lyapunov per obtenir un problema determinista aproximat. Amb aquesta solució, es va desenvolupar un algoritme d'assignació del temps de transmissió per a dispositius WiFi.
Alfoudi, A. S. D. "Slicing-based resource allocation and mobility management for emerging wireless networks." Thesis, Liverpool John Moores University, 2018. http://researchonline.ljmu.ac.uk/9587/.
Boutiba, Karim. "On enforcing Network Slicing in the new generation of Radio Access Networks." Electronic Thesis or Diss., Sorbonne université, 2024. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2024SORUS003.pdf.
The emerging 5G networks and beyond promise to support novel use cases such as immersive holographic communication, Internet of Skills, and 4D Interactive mapping [usecases]. These use cases require stringent requirements in terms of Quality of Service (QoS), such as low latency, high Downlink (DL)/Uplink (UL) throughput and low energy consumption. The 3rd Generation Partnership Project (3GPP) specifications introduced many features in 5G New Radio (NR) to improve the physical efficiency of 5G to meet the stringent and heterogeneous requirements of beyond 5G services. Among the key 5G NR features, we can mention the numerology, BandWidth Part (BWP), dynamic Time Duplex Division (TDD) and Connected-mode Discontinuous Reception (C-DRX). However, the specifications do not provide how to configure the next Generation Node B (gNB)/User Equipment (UE) in order to optimize the usage of the 5G NR features. We enforce the 5G NR features by applying Machine Learning (ML), particularly Deep Reinforcement Learning (DRL), to fill this gap. Indeed, Artificial Intelligence (AI)/ML is playing a vital role in communications and networking [1] thanks to its ability to provide a self-configuring and self-optimizing network.In this thesis, different solutions are proposed to enable intelligent configuration of the Radio Access Network (RAN). We divided the solutions into three different parts. The first part concerns RAN slicing leveraging numerology and BWPs. In contrast, the second part tackles dynamic TDD, and the last part goes through different RAN optimizations to support Ultra-Reliable and Low-Latency Communication (URLLC) services.In the first part, we propose two contributions. First, we introduce NRflex, a RAN slicing framework aligned with Open RAN (O-RAN) architecture. NRflex dynamically assigns BWPs to the running slices and their associated User Equipment (UE) to fulfill the slices' required QoS. Then, we model the RAN slicing problem as a Mixed-Integer Linear Programming (MILP) problem. To our best knowledge, this is the first MILP modeling of the radio resource management featuring network slicing, taking into account (i) Mixed-numerology, (ii) both latency and throughput requirements (iii) multiple slices attach per UE (iv) Inter-Numerology Interference (INI). After showing that solving the problem takes an exponential time, we consider a new approach in a polynomial time, which is highly required when scheduling radio resources. The new approach consists of formalizing this problem using a DRL-based solver.In the second part of this thesis, we propose a DRL-based solution to enable dynamic TDD in a single 5G NR cell. The solution is implemented in OAI and tested using real UEs. Then, we extend the solution by leveraging Multi-Agent Deep Reinforcement Learning (MADRL) to support multiple cells, considering cross-link interference between cells.In the last part, we propose three solutions to optimize the RAN to support URLLC services. First, we propose a two-step ML-based solution to predict Radio Link Failure (RLF). We combine Long Short-Term Memory (LSTM) and Support Vector Machine (SVM) to find the correlation between radio measurements and RLF. The RLF prediction model was trained with real data obtained from a 5G testbed. In the second contribution, we propose a DRL-based solution to reduce UL latency. Our solution dynamically allocates the future UL grant by learning from the dynamic traffic pattern. In the last contribution, we introduce a DRL-based solution to balance latency and energy consumption by jointly deriving the C-DRX parameters and the BWP configuration
Hasan, Rasha. "Hybrid synchrony virtual networks." Pontif?cia Universidade Cat?lica do Rio Grande do Sul, 2017. http://tede2.pucrs.br/tede2/handle/tede/7344.
Made available in DSpace on 2017-06-08T18:15:48Z (GMT). No. of bitstreams: 1 TES_RASHA_HASAN_COMPLETO.pdf: 5197991 bytes, checksum: bfd855e20678be1fe11d1731c4cbc317 (MD5) Previous issue date: 2017-01-16
Nas ?ltimas tr?s d?cadas de pesquisa em Sistemas Distribu?dos (SDs), um aspecto central discutido ? o de sincronia. Com um sistema ass?ncrono, n?o fazemos suposi??es sobre velocidades de execu??o de processos e / ou atrasos de entrega de mensagens; Com um sistema s?ncrono, fazemos suposi??es sobre esses par?metros [Sch93b]. Sincronismo em SDs impacta diretamente a complexidade e funcionalidade de algoritmos tolerantes a falhas. Uma infra-estrutura s?ncrona contribui para o desenvolvimento de sistemas mais simples e fi?veis, mas tal infra-estrutura ? muito cara e ?s vezes nem sequer vi?vel de implementar. Uma infra-estrutura totalmente ass?ncrona ? mais realista, mas alguns problemas foram mostrados como insol?veis em tal ambiente atrav?s do resultado de impossibilidade por Fischer, Lynch e Paterson [FLP85]. As limita?es tanto em ambientes totalmente s?ncronos como totalmente ass?ncronos levaram ao desenvolvimento de sistemas distribu?dos como s?ncronia parcial [CF99, Ver06]. Em um estudo de funcionalidade de sistemas distribu?dos s?ncronos parciais e de propriedades de Redes Virtuais (RVs), descobrimos que existem v?rios desafios para este tipo de sistemas que podem ser resolvidos com RVs devido ?s propriedades que a virtualiza??o traz. Por exemplo a) partilha de recursos fornecida por RVs permite diminuir o custo ao partilhar a parte s?ncrona da infra-estrutura f?sica, b) isolamento fornecido por a natureza da RVs, isso pode beneficiar os SDs coexistentes na mesma infra-estrutura f?sica que exigem certo n?vel de isolamento,c) resili?ncia garantido atrav?s do processo de aloca??o de recursos de Redes Virtuais, isso permite alocar recursos de reposi??o ao lado dos prim?rios para redes virtuais que exigem garantias de disponibilidade, por exemplo, SDs tolerantes a falhas. Em nosso trabalho, argumentamos que as RVs e um adequado processo de aloca??o de recursos das RVs oferecem um ambiente adequado para executar aplicativos distribu?dos com sincronia parcial. Isto levou ? abstra??o de um novo tipo de RVs: As Redes Virtuais com sincronia h?brida (RVSHs). Nesta tese, apresentamos a id?ia geral das Redes Virtuais com sincronia h?brida motivado pelos SDs com s?ncronia h?brida, e dividimos nosso trabalho em duas partes: a) Espa?oRVSHs propostos pelo SDs com sincronia h?brida em espa?o, e b) Tempo-RVSHs propostos pelo SDs com sincronia h?brida em tempo. No SDs com s?ncronia h?brida em espa?o, a infraestrutura ? composta de subconjuntos de componentes s?ncronos e ass?ncronos, e cada um desses subconjuntos mant?m seu status de sincronia atrav?s do tempo (i.e., os subconjuntos s?ncronos permanecem s?ncronos e os ass?ncronos permanecem ass?ncronos). No SDs com s?ncronia h?brida em tempo, a infra-estrutura ? composta de subconjuntos de n?s e la?os que podem alternar seu status de sincronia atrav?s do tempo (i.e., os componentes se comportam de forma s?ncrona durante os intervalos de tempo e de forma ass?ncrona durante outros intervalos de tempo). As principais contribui??es desta tese s?o: a) caracterizam os RVSHs em seus dois tipos Espa?o-RVSHs e Tempo-RVSHs para refletir tanto a natureza de sincronia em espa?o e em tempo; b) propor uma estrutura adequada para o processo de aloca??o de recursos para ambos Espa?o-RVSHs e Tempo-RVSHs, e c) fornecer uma avalia??o dos modelos propostos para RVSHs.
In the last three decades of research in Distributed Systems (DSs), one core aspect discussed is the one of synchrony. \Vith an asynchronous system, we make no assumptions about process execution speeds andj or message delivery delays; with a synchronous system, we do make assumptions about these parameters [Sch93b]. Synchrony in DSs impacts directly the complexity and functionality of fault-tolerant algorithms. Although a synchronous infrastructure contributes towards the development of simpler and reliable systems, yet such an infrastructure is too expensive and sometimes even not feasible to implemento On the other hand, a fully asynchronous infrastructure is more realistic, but some problems were shown to be unsolvable in such an environment through the impossibility result by Fischer, Lynch and Paterson [FLP85]. The limitations in both fully synchronous or fully asynchronous environments have led to the development of partial synchronous distributed systems [CF99, Ver06]. In a study of partial synchronous distributed systems functionality, and of Virtual Networks (VNs) properties, we found that there are several challenges for this kind of systems that can be solved with VNs due to the properties that virtualization brings. For example a) resources sharing provided by VNs allows decreasing the cost when sharing the synchronous portion of the physical infrastructure, b) isolation provided by the VNs nature can benefit the coexistent DSs on same physical infrastructure that demand certain leveI of isolation, c) resilience guaranteed through the Virtual Networks Embedding (VNE) process that allows allocating spare resources beside the primary ones for virtual networks that require availability guarantees, for example fault tolerant DSs. In our work, we argue that VNs and a suitable VN embedding process offer suitable environment for running distributed applications with partial synchrony. This has led to the abstraction of new type of VNs: The Hybrid Synchrony Virtual Networks (HSVNs). In this thesis, we introduce the general idea of Hybrid Synchrony Virtual Networks (HSVNs) motivated by the hybrid synchronous DSs, and we branch our work into two branches: a) Space-HSVNs addressed to spatial hybrid synchronous DSs, and b) TimeHSVNs addressed to the time hybrid synchronous DSs. In spatial hybrid synchronous DSs, the hybrid synchronous physical infrastructure is composed of subsets of synchronous and asynchronous components, and each of these subsets maintains its synchrony status through time (i.e., synchronous subsets remain synchronous and asynchronous ones remain asynchronous). In time hybrid synchronous DSs, the hybrid synchronous physical infrastructure is composed of subsets of nodes and links that can alternate their synchrony status through time (i.e., the components behave synchronously during time intervals, and asynchronously during other time intervals). The main contributions of this thesis are: a) characterize the HSVNs in its two types Space-HSVNs and Time-HSVNs to reflect both the synchrony space-variant and time-variant nature ofDSs; b) propose a suitable embedding framework for both Space-HSVNs and TimeHSVNs, and c) provide an evaluation of the embedding mo deIs addressed to the HSVNs.
謝啓良 and Kai-leung Tse. "Actual business networks behind the virtual networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31269357.
Tse, Kai-leung. "Actual business networks behind the virtual networks /." Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19878382.
Teague, Kory Alan. "Approaches to Joint Base Station Selection and Adaptive Slicing in Virtualized Wireless Networks." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/85966.
Master of Science
5G, the next generation cellular network standard, promises to provide significant improvements over current generation standards. For 5G to be successful, this must be accompanied by similarly significant efficiency improvements. Wireless network virtualization is a promising technology that has been shown to improve the cost efficiency of current generation cellular networks. By abstracting the physical resource—such as cell tower base stations— from the use of the resource, virtual resources are formed. This work investigates the problem of selecting virtual resources (e.g., base stations) to construct virtual wireless networks with minimal cost and slicing the selected resources to individual networks to optimally satisfy individual network demands. This problem is framed in a stochastic optimization framework and two approaches are presented for approximation. The first approach converts the framework into a deterministic equivalent and reduces it to a tractable form. The second approach uses a genetic algorithm to approximate resource selection. Approaches are simulated and evaluated utilizing a demand model constructed to emulate the statistics of an observed real world urban network. Simulations indicate that the first approach can provide a reasonably tight solution with significant time expense, and that the second approach provides a solution in significantly less time with the introduction of marginal error.
Harris, B. A. "Firewalls and virtual private networks." Thesis, University of Canterbury. Computer Science, 1998. http://hdl.handle.net/10092/8413.
Randall, Keith H. (Keith Harold). "Virtual networks--implementation and analysis." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/35969.
Ögren, Niklas. "Selecting/realization of Virtual Private Networks with Multiprotocol Label Switching or Virtual Local Area Networks." Thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-93211.
BALIEIRO, Andson Marreiros. "Cognitive radio virtual networks environment: definition, modeling and mapping of secondary virtual networks onto wireless substrate." Universidade Federal de Pernambuco, 2015. https://repositorio.ufpe.br/handle/123456789/16360.
Made available in DSpace on 2016-04-06T17:23:43Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Andson_M_Balieiro_PhDThesis_ComputerScience_2015.pdf: 2709720 bytes, checksum: 2432ca198603426dffdf0ce2f34f3162 (MD5) Previous issue date: 2015-08-28
FACEPE
The wireless technologies are progressing at a rapid pace such that the future of digital communication will be dominated by a dense, ubiquitous and heterogeneous wireless network. Along with this, there is a growing demand for wireless services with different requirements. In this respect, the management of this complex wireless ecosystem becomes challenging, and the wireless virtualization is pointed as an efficient solution to perform it, where different virtual wireless networks can be created, sharing and running on the same wireless infrastructure, and providing differentiated services to users. However, to satisfy the high demand for mobile communications, it is necessary the availability of a natural and scarce resource, the electromagnetic spectrum. Although the insertion of virtualization in wireless networks provides better resources utilization, the current approaches to employ the wireless virtualization can cause resource underutilization. To overcome this underutilization and enable that new wireless virtual networks can be deployed, the wireless virtualization can be combined with the cognitive radio technology and dynamic spectrum access (DSA) techniques in order to achieve the deepest level of wireless virtualization and to improve the resource utilization through the deployment of opportunistic resource sharing. Thus, virtual wireless networks with different access priorities to the resources (e.g. primary and secondary) can be deployed in an overlay form, sharing the same substrate wireless network, where the secondary virtual network (SVN) accesses the resources only when the primary one (PVN) is not using them. However, this new scenario brings new challenges: from the mapping to operation of these networks. The SVN mapping is a NP-hard problem and presents some constraints and objectives related to both PVNs and SVNs. Achieving all objectives simultaneously is a challenging process. This thesis addresses the SVNs mapping problem onto substrate network considering the existence of the PVNs on the same substrate network. It discloses the environment composed by these networks, denoted as cognitive radio virtual network environment (CRVNE), models this environment by using a M/M/N/N queue with preemptive and priority service, and delineates a multi-objective problem formulation for the SVNs mapping. Moreover, a scheme based on Genetic Algorithms to solve the SVNs mapping problem is proposed and evaluated in terms of collision, secondary user (SU) dropping, and SU blocking probabilities, and joint utilization, achieving better results than other based on the First-Fit strategy.
Recentemente, as tecnologias sem fio estão progredindo rapidamente de modo que o futuro da comunicação digital será dominado por uma rede sem fio densa, ubíqua e heterogênea. Adicionado a isso, existe uma demanda crescente por serviços sem fio com diferentes requisitos. Neste aspecto, o gerenciamento deste ecossistema complexo se tona desafiador e a virtualização sem fio é apontada como uma solução eficiente para realizá-lo, onde redes virtuais sem fio diferentes podem ser criadas, compartilhando e executando sobre a mesma infraestrutura de rede sem fio e provendo serviços diferenciados aos usuários. Entretanto, para satisfazer à alta demanda por comunicação móvel é necessária a disponibilidade de um recurso natural e escasso, o espectro eletromagnético. Embora a inserção de virtualização em redes sem fio forneça maior utilização dos recursos, as abordagens atuais para empregar a virtualização sem fio podem causar subutilização de recursos. Para superar esta subutilização, a virtualização sem fio pode ser combinada com a tecnologia de rádio cognitivo e técnicas de acesso dinâmico ao espectro (DSA) para alcançar o mais profundo nível de virtualização sem fio e melhorar a utilização de recursos através do compartilhamento oportunista deles. Assim, redes virtuais sem fio com diferentes prioridades de acesso aos recursos (ex. primária e secundária) podem ser implantadas sobrepostas, compartilhando a mesma infraestrutura de rede sem fio, onde as redes virtuais secundárias (SVNs) acessam os recursos somente quando as redes virtuais primárias (PVNs) não os estiverem utilizando. Entretanto, este novo cenário traz novos desafios, desde o mapeamento até a operação destas redes. O mapeamento de SVNs é um problema NP-difícil e apresenta restrições e objetivos relacionados tanto às PVNs quanto às SVNs. Alcançar todos os objetivos simultaneamente é um processo desafiador. Esta tese aborda o problema de mapeamento de SVNs em redes de substrato considerando a existência de PVNs na mesma rede de substrato. Ela apresenta o ambiente de redes virtuais de rádio cognitivo (CRVNE), modela este ambiente utilizando uma fila M/M/N/N preemptiva e com prioridade e delineia uma formulação multiobjetivo para o mapeamento de SVNs. Além disso, um esquema baseado em Algoritmos Genéticos (GA) para resolver o problema de mapeamento de SVNs é proposto e avaliado em termos das probabilidades de colisão, descarte de usuário secundário (US), bloqueio de US e utilização conjunta, alcançando melhores resultados do que um esquema baseado na estratégia First-Fit.
Youssef, Mina Nabil. "Optimal topology design for virtual networks." Thesis, Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/560.
Söderström, Gustav. "Virtual networks in the cellular domain." Thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-93117.
Datakonnektivitet mellan cellulära terminaler kan uppnås på olika sätt. Ett sätt är att utrusta de cellulära näten med full IP konnektivitet. Detta medför dock en del problem såsom säkerhetsfrågor och problem med att antalet IPv4 addresser kanske inte kan täcka framtidens behov. På grund av detta använder många operatörer såkallad nätverksadressöversättning i sina paketdatanät vilket hindrar användare i olika paketdatanät från att kunna kontakta varandra. Även om en framtida övergång till IPv6 löser problemen med för liten adressrymd så är det inte troligt att operatörerna kommer att lämna sina paketdatanät öppna mot resten av Internet. Ett alternativ till att lösa problemet på IP-nivån är att istället använda overlaynätverk. I ett sådant nätverk identifierar applikationer sig själva på applikationsnivån istället för på IP-nivån. Medans ren IP-konnektivitet innebär effektivast möjliga routing av data så erbjuder ett overlaynätverk möjlighet till tjänster som är svåra att implementera på IP-nivå. Bland annat kan applikationsnät som traverserar nätverksadressöversatta nätverk skapas utan att en mobil terminal behöver exponeras helt och hållet mot Internet. Dessa overlaynätverk kan också skapas dynamiskt och tillfälligt vilket ger användare möjlighet att skapa privata nätverk och grupper med med enheter de litar på, endast dessa får då tillgång till terminalen. Overlaynätverken kan också erbjuda multicast funktionalitet inom grupperna utan de problem som hör ihop med traditionell IP-multicast. De relativt begränsade bandbredderna i GSM och UMTS nätverken tillåter routing av data på applikationsnivån om overlaynätverket är tillräckligt väl distribuerat och effektivt mappat mot det underliggande nätverket. En av fördelarna med att använda overlaynätverk är att även om den eftersökta funktionaliteten kanske kan implementeras på IP-nivå i framtiden med hjälp av ny teknik så kan overlaynätverk implementeras i nuvarande IPv4-nätverk till relativt låga kostnader då de endast består av mjukvara som körs på existerande hårdvara. Ett distribuerat overlaynätverk erbjuder inte bara realtidstjänster såsom instant messaging vilket redan är möjligt och fungerar bra med en central serverlösning. Det distribuerade nätverket kan dessutom hantera routing av högre bandbredder mellan terminaler, såsom videokonferenser, Voice over IP etc. som inte är möjligt i stor skala med en centraliserad lösning. Overlaynätverk kan implementeras av en tredjepart utan operatörers samarbete. Detta kan innebära att gratisnätverk skapas för vad som skulle kunna kallas omvänd fildelning, dvs. nätverk där användare laddar upp information till varandra snarare än laddar ner vilket är fallet i de flesta existerande fildelningsnätverk. Dessa nätverk skulle kunna bli direkta konkurrenter till SMS, MMS och andra operatörsägda tjänster. Examensarbetet undersöker de nämnda möjligheterna och potentiella hoten i dessa nätverk. Utöver detta skapas även en implementation av ett overlaynätverk som är helt oberoende av operatörens nätverk.
Bainbridge, Christopher James. "Digital control networks for virtual creatures." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4812.
Lukaszewski, Daniel. "Multipath transport for virtual private networks." Thesis, Monterey, California: Naval Postgraduate School, 2017. http://hdl.handle.net/10945/53013.
Virtual Private Networks (VPNs) are designed to use the Transmission Control Protocol (TCP) or User Datagram Protocol (UDP) to establish secure communication tunnels over public Internet. Multipath TCP (MPTCP) extends TCP to allow data to be delivered over multiple network paths simultaneously. This thesis first builds a testbed and investigates the potential of using MPTCP tunnels to increase the goodput of VPN communications and support seamless mobility. Based on the empirical results and an analysis of the MPTCP design in Linux kernels, we further introduce a full-multipath kernel, implementing a basic Multipath UDP (MPUDP) protocol into an existing Linux MPTCP kernel.We demonstrate the MPUDP protocol provides performance improvements over single path UDP tunnels and in some cases MPTCP tunnels. The MPUDP kernel should be further developed to include more efficient scheduling algorithms and path managers to allow better performance and mobility benefits seen with MPTCP.
Outstanding Thesis
Lieutenant, United States Navy
Evlogimenou, Anna. "Programmable accounting management for Virtual Private Networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ62962.pdf.
Müller, Christoph H. P. "Similarity-based virtual screening using inference networks." Thesis, University of Sheffield, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531182.
JUNIOR, ALEXANDRE SHEREMETIEFF. "VIRTUAL ORGANIZATIONAL NETWORKS: CHARACTERIZATION, FORMATION AND MANAGEMENT." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4323@1.
A Virtual Organizational Network is an inter-organizational cooperation organization, based in Communication and Information Technology, typical of the global environment. The objective of this dissertation is to characterize this network and propose appropriate management tools for its adequate functioning. The term Virtual Organizational Network is introduced based on the characteristics and taxonomy of Cooperation Networks and Virtual Organizations. To form, consolidate and plan this network, the Reticulation Methodology is proposed. The necessity of coordination, governance and performance evaluation tools for these networks is made explicit. This constitutes the basis for the analysis of the Gas Turbine Development and Project Network- RTG. Its characteristics are identified and methodologies for its planning, coordination and governance are proposed, as well as an Information System, as instrument for reticulation.
Gilbert, Seth 1976. "Virtual infrastructure for wireless ad hoc networks." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/42228.
Includes bibliographical references (v. 2, p. 585-591) and index.
One of the most significant challenges introduced by ad hoc networks is coping with the unpredictable deployment, uncertain reliability, and erratic communication exhibited by emerging wireless networks and devices. The goal of this thesis is to develop a set of algorithms that address these challenges and simplify the design of algorithms for ad hoc networks. In the first part of this thesis, I introduce the idea of virtual infrastructure, an abstraction that provides reliable and predictable components in an unreliable and unpredictable environment. This part assumes reliable communication, focusing primarily on the problems created by unpredictable motion and fault-prone devices. I introduce several types of virtual infrastructure, and present new algorithms based on the replicated-state-machine paradigm to implement these infrastructural components. In the second part of this thesis, I focus on the problem of developing virtual infrastructure for more realistic networks, in particular coping with the problem of unreliable communication. I introduce a new framework for modeling wireless networks based on the ability to detect collisions. I then present a new algorithm for implementing replicated state machines in wireless networks, and show how to use replicated state machines to implement virtual infrastructure even in an environment with unreliable communication.
by Seth Gilbert.
Ph.D.
Nolte, Tina Ann 1979. "Virtual stationary timed automata for mobile networks." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/47745.
Includes bibliographical references (p. 339-347).
In this thesis, we formally define a programming abstraction for mobile networks called the Virtual Stationary Automata programming layer, consisting of real mobile clients, virtual timed I/O automata called virtual stationary automata (VSAs), and a communication service connecting VSAs and client nodes. The VSAs are located at prespecified regions that tile the plane, defining a static virtual infrastructure. We present a theory of self-stabilizing emulation and use this theory to prove correct a self-stabilizing algorithm to emulate a timed VSA using the real mobile nodes that are currently residing in the VSA's region. We also specify two important services for mobile networks: motion coordination and end-to-end routing. We split the implementation of the end-to-end routing service into three smaller pieces, consisting of geographic routing and location management services with an end-to-end routing service built on top of them. We provide stabilizing implementations of each of these services using the VSA abstraction, and provide formal correctness analyses for each implementation.
by Tina Ann Nolte.
Ph.D.
Bays, Leonardo Richter. "Virtual network embedding in software-defined networks." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/178658.
Research on network virtualization has been active for a number of years, during which a number of virtual network embedding (VNE) approaches have been proposed. These approaches, however, neglect important operational requirements imposed by the underlying virtualization platforms. In the case of SDN/OpenFlow-based virtualization, a crucial example of an operational requirement is the availability of enough memory space for storing flow rules in OpenFlow devices. Due to these circumstances, we advocate that VNE must be performed with some degree of knowledge of the underlying physical networks, otherwise the deployment may suffer from unpredictable or even unsatisfactory performance. Considering SDN/OpenFlow-based physical networks as an important virtualization scenario, we propose a framework based on VNE and OpenFlow coordination for proper deployment of virtual networks (VNs). The proposed approach unfolds in the following main contributions a virtual infrastructure abstraction that allows a service provider to represent the details of his/her VN requirements in a comprehensive manner; a privacy-aware compiler that is able to preprocess this detailed VN request in order to obfuscate sensitive information and derive computable operational requirements; a model for embedding requested VNs that aims at maximizing their feasibility at the physical level. Results obtained through an evaluation of our framework demonstrate that taking such operational requirements into account, as well as accurately assessing them, is of paramount importance to ensure the “health” of VNs hosted on top of the virtualization platform.
Balasubramanian, Ashok. "Protected virtual private networks in the hose model." Thesis, University of Hawaii at Manoa, 2003. http://hdl.handle.net/10125/7018.
vii, 52 leaves
Avellana, Pardina Albert. "Comparison of Virtual Networks Solutions for Community Clouds." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177017.
Ho, Ai Hua. "Virtual router approach for wireless ad hoc networks." Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4781.
ID: 030646255; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Thesis (Ph.D.)--University of Central Florida, 2011.; Includes bibliographical references (p. 110-122).
Ph.D.
Doctorate
Computer Science
Engineering and Computer Science
Computer Science
PITASSI, CLAUDIO. "VIRTUAL STRATEGIC ALLIANCES AND NETWORKS: AN EXPLORATORY RESEARCH." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2004. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5876@1.
Esta pesquisa procurou responder ao seguinte problema: Que fatores os executivos devem levar em conta nas suas decisões relativas à avaliação das implicações estratégicas pertinentes à virtualização das alianças e redes de relacionamento estabelecidas entre as empresas e seus parceiros de negócio? Como o fenômeno estava em formação no ambiente empresarial a pesquisa foi necessariamente exploratória. A metodologia aplicada foi pós-positivista, utilizando-se simultaneamente dos métodos hipotético- dedutivo e indutivo. A partir do referencial teórico estudado, desenvolveu-se um arcabouço de trabalho contendo os aspectos relativos à virtualização dos relacionamentos com parceiros de negócio, a saber, os direcionadores e atributos da virtualidade, e a tipologia de redes estratégicas virtuais - REVs. Este arcabouço foi aplicado previamente em dois estudos de caso pilotos nas empresas Neoris e GM-Fiat WWP e, após os ajustes nos instrumentos de coleta, em três outros estudos de caso: Construtora Norberto Odebrecht, Telemar e AmBev. Nas etapas subseqüentes da pesquisa, múltiplos métodos foram adotados para a captura de dados: investigação documental e telematizada, levantamento das percepções (survey) com os diretores das diferentes empresas. Os resultados obtidos por meio dos estudos de caso evidenciaram que, de fato, o arcabouço teórico proposto na pesquisa tinha o potencial de contribuir ao fornecimento de subsídios para a tomada de decisão estratégica de empresas que integram redes de relacionamentos, ao ajudá-las, não só a identificar, mas principalmente a influenciar as condições que permitam estabelecer uma participação mais efetiva nos diferentes tipos de REVs possíveis.
The research portrayed in this Doctoral Dissertation was designed to search an answer for the following problem: What factors and dimensions should the executives take into consideration on their decisions regarding the strategic implications related to the virtualization of strategic alliances and networks? Since the study`s object of analysis was a new phenomenon in the business environment that does not yet have an accepted theoretical tradition in the academic world, the research was, necessarily, an exploratory one. The methodology applied was post-positivist, using simultaneously the hypotheticdeductive and inductive methods. Based on the literature investigated, a working framework was developed containing the aspects regarding the virtualization of the relationships with business partners: the virtualization drivers and attributes, and a typology of virtual strategic networks (VSNs). This framework was previously tested in two pilot cases studies: Neoris and GM- Fiat WWP. After the necessary adjustments on the data collections instruments, the framework was applied on the other three research case studies: Construtora Norberto Odebrecht, Telemar e AmBev. On the subsequent research steps, multiple methods were adopted for the data collection. The results obtained by way of the case studies showed that, indeed, the working framework had the potential to contribute with subsidies for the strategic decisions involved, not only in the identification, but mainly in the creation of conditions that influence a more effective participation of firms on the different types of VSNs.
Hurley-Smith, Darren. "Virtual closed networks : optimised security for autonomous MANETs." Thesis, University of Greenwich, 2015. http://gala.gre.ac.uk/20953/.
Pandey, Shakti Raj, and Vijaya Praveen Prakash Tamadapalle. "AN ANALYSIS OF SECURITY PROBLEMS IN VIRTUAL NETWORKS." Thesis, Högskolan i Borås, Institutionen Handels- och IT-högskolan, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-20453.
Program: Magisterutbildning i informatik
Cohen, Alain Jerome. "Simulating virtual circuits in mobile packet radio networks." Thesis, Massachusetts Institute of Technology, 1986. http://hdl.handle.net/1721.1/14904.
MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING
Bibliography: leaf 39.
by Alain Jerome Cohen.
B.S.
Flodin, Carl, and Pontus Lantz. "Studenters användning och syn på Virtual Private Networks." Thesis, Uppsala universitet, Institutionen för informatik och media, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-414714.
Ben, Houidi Zied. "Scalable routing in provider provisoned virtual private networks." Paris 6, 2010. http://www.theses.fr/2010PA066611.
Kinniburgh, James B. "Who networks? The social psychology of virtual communities." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Jun%5FKinniburgh.pdf.
Celestino, Pedro. "Private virtual network." Universidade de Taubaté, 2005. http://www.bdtd.unitau.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=264.
Com as redes de computadores, surge também a possibilidade de administrar remotamente as organizações inteligentes, no entanto a troca de informações segura tornou-se um problema para as instituições que trafegam dados estruturados através das redes de computadores. Um dos maiores desafios é a busca de soluções economicamente viáveis e ao mesmo tempo seguras. Protocolos de segurança, algoritmos criptográficos meios de comunicação seguros, são itens essenciais para que a informação possa trafegar em ambientes livres de interferências externas. Uma das soluções é a Rede Virtual Privada. Neste trabalho, serão apresentados os principais destaques desta tecnologia, utilizando o protocolo IPSec, com o propósito de apresentar mais uma solução atrativa para as organizações, pois trata-se de uma solução economicamente viável e segura.
Chagdali, Abdellatif. "Multi-connectivity and resource allocation for slices in 5G networks." Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPAST052.
Future mobile networks envision unprecedented innovation opportunities and disruptive use cases. As a matter of fact, the 5G and beyond networks' pledge to deliver mission-critical applications mandates a versatile, scalable, efficient, and cost-effective network capable of accommodating its resource allocation to meet the services' heterogeneous requirements. To face these challenges, network slicing has emerged as one of the fundamental concepts proposed to raise the 5G mobile networks' efficiency and provide the required plasticity. The idea is to provide resources for different vertical industries by building multiple end-to-end logical networks over a shared virtualized infrastructure. Each network slice is customized to deliver a specific service and adapts its architecture and radio access technologies.Precisely, applications such as industrial automation or vehicular communications pose stringent latency and reliability requirements on cellular networks. Given that the current mobile network cannot meet these requirements, ultra-reliable low-latency communications (URLLC) embodies a vital research topic that has gathered substantial momentum from academia and industrial alliances. To reach URLLC requirements, employing multi-connectivity (MC), i.e., exploiting multiple radio links as communication paths at once, is a promising approach.Therefore, the objective of the present manuscript is to investigate dynamic scheduling techniques, exploiting redundant coverage of users, guaranteed in numerous 5G radio access network scenarios. We first review the evolution of mobile networks and discuss various considerations for network slicing architecture and its impact on resource allocation design. Then, we use tools from queuing theory to model a system in which a set of URLLC users are connected simultaneously to two base stations having the same bandwidth; we refer to this scenario as the homogenous case. We introduce suitable scheduling policies and evaluate their respective performances by assessing their reliability. Next, we extend the homogenous case's results to a more general setting where the physical interfaces manage different bandwidths, referred to as the heterogeneous case. Finally, we merge the above elements to validate the choice of resource allocation schemes considering the deployed architecture
Al-Amoudi, Ahmed. "Evaluation of virtual routing appliances as routers in a virtual environment /." Online version of thesis, 2008. http://hdl.handle.net/1850/7544.
Rodriguez, Brljevich Esteban 1984. "Energy-aware virtual network mapping." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275512.
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-25T09:43:36Z (GMT). No. of bitstreams: 1 RodriguezBrljevich_Esteban_M.pdf: 2281259 bytes, checksum: 12557ac80a34c2bff2547f1f2aff1eaa (MD5) Previous issue date: 2013
Resumo: A virtualização de redes é uma tecnologia promissora para a Internet do futuro, já que facilita a implementação de novos protocolos e aplicações sem a necessidade de alterar o núcleo da rede. Um passo chave para instanciar redes virtuais é a alocação de recursos físicos para elementos virtuais (roteadores e enlaces). A fim de contribuir para o esforço global de poupança de energia, a escolha de recursos físicos para instanciar uma rede virtual deveria minimizar o consumo de energia rede. No entanto, esta não é uma tarefa trivial, já que requerimentos de QoS devem ser atingidos. A busca da solução ótima deste problema é NP-difícil. O mapeamento de redes virtuais em substratos de rede físicos em cenários de alocaç?o e desalocaç?o de redes virtuais pode não levar a um consumo mínimo de energia devido à dinâmica das atribuições dos elementos virtuais previamente alocados. Tal dinâmica pode levar à subutilização da rede substrato. Para reduzir os efeitos negativos desta dinâmica, técnicas tais como a migração de redes virtuais em tempo real podem ser empregadas para rearranjar as redes virtuais previamente mapeadas para poupar energia. Esta dissertação apresenta um conjunto de novos algoritmos para o mapeamento de redes virtuais em substratos de rede com o objetivo de reduzir o consumo de energia. Além disso, dois novos algoritmos são propostos para a migração dos roteadores e enlaces virtuais para reduzir o número de roteadores e amplificadores ópticos requeridos. Os resultados obtidos por simulação mostram a eficácia dos algoritmos propostos
Abstract: Network virtualization is a promising technology for the Internet of the Future since it facilitates the deployment of new protocols and applications without the need of changing the core of the network. A key step to instantiate virtual networks is the allocation of physical resources to virtual elements (routers and links). In order to contribute to the global effort of saving energy, choice of physical resources to instantiate a virtual network needs to minimize the network energy consumption. However, this is not a trivial task, since the QoS of the application requirements has to be supported. Indeed, the search for the optimal solution of this problem is NP-hard. The mapping of virtual networks on network substrates at the arrival time of requests to the establishment of virtual networks may not lead to a global minimum energy consumption of energy due to the dynamic allocations and deallocations of virtual networks. Actually, such dynamics can lead to the underutilization of the network substrate. To mitigate the negative effect of this dynamics, techniques such as live migration can be employed to rearrange already mapped virtual networks to achieve energy savings. This dissertation presents a set of new algorithms for the mapping of virtual networks on network substrates aiming to reduce energy consumption. Additionally, two new algorithms are proposed for the migration of virtual routers and links to reduce the number of powered routers and optical amplifiers. Results derived by simulation show the efficacy of the proposed algorithms
Mestrado
Ciência da Computação
Mestre em Ciência da Computação
Jia, Yuxiao. "Dynamic quality of service support in virtual private networks." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26667.
Dutta, Rudra. "VIRTUAL TOPOLOGY DESIGN FOR TRAFFIC GROOMING IN WDM NETWORKS." NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20010801-114312.
Wavelength division multiplexing (WDM) in optical fiber networks iswidely viewed as the technology with the potential to satisfy theever-increasing bandwidth needs of network users effectively and on asustained basis.In WDM networks, nodes are equipped with optical cross-connects(OXCs), devices which can optically switch a signal on any givenwavelength from any input port to any output port.This makes it possible to establish lightpaths between any pair of network nodes.A lightpath is a clear channel in which the signal remainsin optical form throughout the physical path between the two endnodes.The set of lightpaths established over the fiberlinks defines a .Consequently, the problem arises of designing virtual topologies tooptimize a performance measure of interest for a set of trafficdemands.
With the deployment of commercial WDM systems, it has become apparentthat the cost of network components, especially line terminatingequipment (LTE) is the dominant cost in building optical networks, andis a more meaningful metric to optimize than, say, the number ofwavelengths.Furthermore, since the data rates at which each individual wavelengthoperates continue to increase (to OC-192 and beyond), it becomes clearthat a number of independent traffic components must be multiplexed inorder to efficiently utilize the wavelength capacity.These observations give rise to the concept of ,which refers to the techniques used to combine lower speed componentsonto available wavelengths in order to meet network design goals suchas cost minimization. Traffic grooming is a hard problem in generalwhich remains computationally intractable even for simple networks.
We consider the problem of traffic grooming in ring, star andtree topologies. We provide theoretical results regarding achievabilitybounds for these networks as well as practical frameworks to obtainincreasingly better feasible solutions with the expenditure of morecomputational power.
Veitch, Paul A. "Virtual path restoration techniques for asyncronous transfer mode networks." Thesis, University of Strathclyde, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.336417.
Haddad, Don Derek. "Resynthesizing reality : driving vivid virtual environments from sensor networks." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/115728.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 89-95).
The rise of ubiquitous sensing enables the harvesting of massive amounts of data from the physical world. This data is often used to drive the behavior of devices, but when presented to users, it is most commonly visualized quantitatively, as graphs and charts. Another approach for the representation of sensor network data presents the data within a rich, virtual environment. This thesis introduces the concept of Resynthesizing Reality through the construction of Doppelmarsh, the virtual counterpart of a real marsh located in Plymouth Massachusetts, where the Responsive Environments Group has deployed and maintained a network of environmental sensors. By freely exploring such environments, users gain a vivid, multi-modal, and experiential perspective into large, multi-dimensional datasets. We present a variety of approaches to manifesting data in "avatar landscape", including landscapes generated off live video, tinting frames in correspondence with temperature, or representing sensor history in the appearance and behavior of animals. The concept of virtual lenses is also introduced, which makes it easy to dynamically switch sensor-to-reality mapping from within virtual environments. In this thesis, we describe the implementation and design of Doppelmarsh, present techniques to visualize sensor data within virtual environments, and discuss potential applications for Resynthesizing Reality.
by Don Derek Haddad.
S.M.
Sherry, Zaida. "Governance of virtual private networks using COBIT as framework." Thesis, Stellenbosch : University of Stellenbosch, 2007. http://hdl.handle.net/10019.1/3389.
The purpose of this assignment is to ascertain whether the COBIT framework is an adequate framework to assist in the governance of virtual private networks. The assignment focuses on whether the framework can ensure the identification of virtual private network-related risks and address IT compliance with policies and statutory regulations. A brief summary of the risks and issues pertaining to the pre-implementation, implementation and post-implementation phases of virtual private networks is included in the assignment. These risks and issues are then individually mapped onto a relevant COBIT control objective. The scope of the assignment does not include the intricacies of how these networks operate, the different types of network topologies or the different technologies used in virtual private networks. It was found that the COBIT framework can be implemented to manage and/or mitigate virtual private network risks.