1,024 research outputs found

    Analysis of Node Router Performance with Babel and OLSR Protocol on MANET in Disaster Area

    Get PDF
    Natural disasters are events caused by nature, including earthquakes, tsunamis, volcanic eruptions, droughts, hurricanes, and landslides. Natural disasters can cause telecommunications infrastructure to become damaged or malfunction. Therefore, flexible network technology is needed and does not depend on infrastructure, so that when the existing infrastructure is not functioning, humans can still communicate. One of the network technologies that is flexible and has infrastructureless characteristics, or basically does not require infrastructure, is Mobile Ad-hoc Network (MANET) technology. So that MANET technology becomes an option that can be a solution to existing problems, namely when a natural disaster occurs and the existing telecommunications infrastructure doesn't function. In the MANET network to communicate data between nodes that are far apart, it takes hops to a node in order to communicate, when a node is selected as a hop, the node will automatically act as a router node, the role of the router node is as a successor or communication liaison from a node to other nodes. In a router node, the parameters that are considered are CPU usage and RAM usage, because with increasing communication the router will process more data so it will take time to process the data, this will cause delay process. In this study, the performance of router nodes on Babel and OLSR will be discussed on the performance of router nodes on a fixed network with a stationary, moving and swapping node testing scheme. The parameters used in this study are CPU usage, RAM usage, and delay process

    Segment Routing based Traffic Engineering

    Get PDF
    In modern networks, the increasing volume of network traffic and the diverse range of services with varying requirements necessitate the implementation of more advanced routing decisions and traffic engineering. This academic study proposes a QoS adaptive mechanism called ”Sepitto”, which utilizes Segment routing protocols, specifically SRv6, to address network-traffic control and congestion avoidance. Sepitto leverages data-plane traffic to convey Linux Qdisc statistics, such as queue size, packet drops, and buffer occupancy, in each Linux-based virtual router. By incorporating this information, edge routers become aware of the current network status, enabling them to make informed decisions regarding traffic paths based on QoS classes. SRv6 is employed to direct traffic along desired paths, avoiding congested links and minimizing queuing delays and overall latency. Moreover, Sepitto offers network administrators an interface to customize decision-making processes based on their policies, assigning costs to network graph edges by associating the provided statistics to a certain cost. To incorporate these costs, the implementation employs the Dijkstra algorithm to determine the path with the lowest cost. Performance analysis of Sepitto reveals minimal overhead compared to traditional routing methods, while effectively mitigating network congestion. The results demonstrate that Sepitto reduces traffic round-trip time during congestion while maintaining differentiated treatment for various QoS classes

    Modelo de aplicación de QoS para redes inalámbricas en base al protocolo IEEE 802.11e aplicado en la WLAN de la Universidad Técnica del Norte apoyado en las buenas prácticas ITILv4

    Get PDF
    Diseñar un modelo de aplicación de QoS en redes inalámbricas con base al protocolo IEEE 802.11e apoyado en las buenas prácticas ITILv4 para mejorar el rendimiento de la WLAN unificada de la UTN.El presente proyecto trata sobre la aplicación de Políticas de Calidad de Servicio en las redes inalámbricas, en este caso específico a la EDUROAM de la Universidad Técnica del Norte con la intención de brindar prioridad al tráfico sensible. Para tal efecto, se inicia con la definición de varios conceptos teóricos como: terminología, tipos de WLAN, normativa IEEE, tramas de datos, Calidad de Servicio, etc. La guía en la que se ampara el proyecto es la Metodología ITILv4, de la cual se extrae una de sus 34 Prácticas de Gestión, la denominada Gestión de la Arquitectura, que facilita la ruta de desarrollo. Con esta guía, se toman datos de la Situación Actual de la red EDUROAM con la ayuda del monitoreo de la red, realizado con software DNA propietario de CISCO. El monitoreo muestra el tráfico de red circulante. Más adelante, esta información permite dar forma al Modelo de Aplicación de Calidad de Servicio. Este Modelo contiene las Políticas de Calidad de Servicio propuestas para lograr que la WLAN mejore su rendimiento basándose en el estándar IEEE 802.11e. Finalmente, se realizan pruebas de verificación de la funcionalidad de las Políticas. Se plantean cuatro pruebas: descarga de archivos, vídeollamada por Microsoft Teams, marcado de paquetes y reducción de Jitter. Adicional a esto, se incluyen conclusiones y recomendaciones sobre la experiencia en el desarrollo del proyecto.Ingenierí

    Performance Modeling of Vehicular Clouds Under Different Service Strategies

    Get PDF
    The amount of data being generated at the edge of the Internet is rapidly rising as a result of the Internet of Things (IoT). Vehicles themselves are contributing enormously to data generation with their advanced sensor systems. This data contains contextual information; it's temporal and needs to be processed in real-time to be of any value. Transferring this data to the cloud is not feasible due to high cost and latency. This has led to the introduction of edge computing for processing of data close to the source. However, edge servers may not have the computing capacity to process all the data. Future vehicles will have significant computing power, which may be underutilized, and they may have a stake in the processing of the data. This led to the introduction of a new computing paradigm called vehicular cloud (VC), which consists of interconnected vehicles that can share resources and communicate with each other. The VCs may process the data by themselves or in cooperation with edge servers. Performance modeling of VCs is important, as it will help to determine whether it can provide adequate service to users. It will enable determining appropriate service strategies and the type of jobs that may be served by the VC such that Quality of service (QoS) requirements are met. Job completion time and throughput of VCs are important performance metrics. However, performance modeling of VCs is difficult because of the volatility of resources. As vehicles join and leave the VC, available resources vary in time. Performance evaluation results in the literature are lacking, and available results mostly pertain to stationary VCs formed from parked vehicles. This thesis proposes novel stochastic models for the performance evaluation of vehicular cloud systems that take into account resource volatility, composition of jobs from multiple tasks that can execute concurrently under different service strategies. First, we developed a stochastic model to analyze the job completion time in a VC system deployed on a highway with service interruption. Next, we developed a model to analyze the job completion time in a VC system with a service interruption avoidance strategy. This strategy aims to prevent disruptions in task service by only assigning tasks to vehicles that can complete the tasks’ execution before they leave the VC. In addition to analyzing job completion time, we evaluated the computing capacity of VC systems with a service interruption avoidance strategy, determining the number of jobs a VC system can complete during its lifetime. Finally, we studied the computing capacity of a robotaxi fleet, analyzing the average number of tasks that a robotaxi fleet can serve to completion during a cycle. By developing these models, conducting various analyses, and comparing the numerical results of the analyses to extensive Monte Carlo simulation results, we gained insights into job completion time, computing capacity, and overall performance of VC systems deployed in different contexts

    Network selection based on chi-square distance and reputation for internet of things

    Get PDF
    The internet of things (IoT) has become one of the most important technologies of the 21st century. The IoT environment is composed of heterogeneous IoT communication networks. These technologies are complementary and need to be integrated to meet the requirements of different types of IoT applications that require the mobility of the IoT device under different IoT communication networks. In this paper, the vertical handover decision method is considered to select the appropriate network among different IoT technologies. So, IoT devices, equipped with several radio technologies, can select the most suitable network based on several criteria like quality of service (QoS), cost, power, and security. In this work, a multi-attribute decision-making algorithm (MADM) based on techniques for order preference by similarity to an ideal solution (TOPSIS) that uses chi-square distance instead of Euclidean distance is proposed. The network reputation is added to reduce the average number of handoffs. The proposed algorithm was implemented to select the best technology depending on the requirements of the different IoT traffic classes. The obtained results showed that our proposition outperforms the traditional MADM algorithms

    Improving the technology for processing the aggregated data flow of a secure corporate multiservice communication network

    Get PDF
    This paper considers the process of dynamic reservation of the channel resource of a secure corporate multi-service communication network. It has been established that the processes of building and functioning of the schemes of a secure corporate multi-service communication network and improving the quality of the implementation of its main work processes involve the evaluation and dynamic reservation of channel resources for incoming aggregated data flows of the network. The model of dynamic reservation of the channel resource of the aggregated data stream of the secure corporate multi-service communication network was built and proposed. The proposed model makes it possible to set the quantitative values of the reserved channel resource for different service methods depending on the number of component flows in the total aggregated data flow of the VPN tunnel. It was established that an increase in the density of the aggregated data stream requires an increase in the reserved channel resource. At the same time, its value is influenced by the way of servicing the aggregated data flow in the VPN tunnel of the secure corporate multi-service communication network. Application of the isolated service method gives a gain in the allocated resource for the channel reserve from 10 to 20 percent compared to the group service method for IR and video telephony. This is due to the more flexible management process of the border router's incoming data storage buffer under the isolated service mode. The model of dynamic reservation of the channel resource of the secure corporate multi-service communication network reported in this paper could be used in the improvement of existing and development of new structures of the secure corporate multi-service communication network. The consequence of such an improvement is a reduction in the delay time for the processing of incoming data packets in the specified networ

    Analysis of Node Router Performance with Babel and OLSR Protocol on MANET in Disaster Area

    Get PDF
    Natural disasters are events caused by nature, including earthquakes, tsunamis, volcanic eruptions, droughts, hurricanes, and landslides. Natural disasters can cause telecommunications infrastructure to become damaged or malfunction. Therefore, flexible network technology is needed and does not depend on infrastructure, so that when the existing infrastructure is not functioning, humans can still communicate. One of the network technologies that is flexible and has infrastructureless characteristics, or basically does not require infrastructure, is Mobile Ad-hoc Network (MANET) technology. So that MANET technology becomes an option that can be a solution to existing problems, namely when a natural disaster occurs and the existing telecommunications infrastructure doesn't function. In the MANET network to communicate data between nodes that are far apart, it takes hops to a node in order to communicate, when a node is selected as a hop, the node will automatically act as a router node, the role of the router node is as a successor or communication liaison from a node to other nodes. In a router node, the parameters that are considered are CPU usage and RAM usage, because with increasing communication the router will process more data so it will take time to process the data, this will cause delay process. In this study, the performance of router nodes on Babel and OLSR will be discussed on the performance of router nodes on a fixed network with a stationary, moving and swapping node testing scheme. The parameters used in this study are CPU usage, RAM usage, and delay process

    Scalable Schedule-Aware Bundle Routing

    Get PDF
    This thesis introduces approaches providing scalable delay-/disruption-tolerant routing capabilities in scheduled space topologies. The solution is developed for the requirements derived from use cases built according to predictions for future space topology, like the future Mars communications architecture report from the interagency operations advisory group. A novel routing algorithm is depicted to provide optimized networking performance that discards the scalability issues inherent to state-of-the-art approaches. This thesis also proposes a new recommendation to render volume management concerns generic and easily exchangeable, including a new simple management technique increasing volume awareness accuracy while being adaptable to more particular use cases. Additionally, this thesis introduces a more robust and scalable approach for internetworking between subnetworks to increase the throughput, reduce delays, and ease configuration thanks to its high flexibility.:1 Introduction 1.1 Motivation 1.2 Problem statement 1.3 Objectives 1.4 Outline 2 Requirements 2.1 Use cases 2.2 Requirements 2.2.1 Requirement analysis 2.2.2 Requirements relative to the routing algorithm 2.2.3 Requirements relative to the volume management 2.2.4 Requirements relative to interregional routing 3 Fundamentals 3.1 Delay-/disruption-tolerant networking 3.1.1 Architecture 3.1.2 Opportunistic and deterministic DTNs 3.1.3 DTN routing 3.1.4 Contact plans 3.1.5 Volume management 3.1.6 Regions 3.2 Contact graph routing 3.2.1 A non-replication routing scheme 3.2.2 Route construction 3.2.3 Route selection 3.2.4 Enhancements and main features 3.3 Graph theory and DTN routing 3.3.1 Mapping with DTN objects 3.3.2 Shortest path algorithm 3.3.3 Edge and vertex contraction 3.4 Algorithmic determinism and predictability 4 Preliminary analysis 4.1 Node and contact graphs 4.2 Scenario 4.3 Route construction in ION-CGR 4.4 Alternative route search 4.4.1 Yen’s algorithm scalability 4.4.2 Blocking issues with Yen 4.4.3 Limiting contact approaches 4.5 CGR-multicast and shortest-path tree search 4.6 Volume management 4.6.1 Volume obstruction 4.6.2 Contact sink 4.6.3 Ghost queue 4.6.4 Data rate variations 4.7 Hierarchical interregional routing 4.8 Other potential issues 5 State-of-the-art and related work 5.1 Taxonomy 5.2 Opportunistic and probabilistic approaches 5.2.1 Flooding approaches 5.2.2 PROPHET 5.2.3 MaxProp 5.2.4 Issues 5.3 Deterministic approaches 5.3.1 Movement-aware routing over interplanetary networks 5.3.2 Delay-tolerant link state routing 5.3.3 DTN routing for quasi-deterministic networks 5.3.4 Issues 5.4 CGR variants and enhancements 5.4.1 CGR alternative routing table computation 5.4.2 CGR-multicast 5.4.3 CGR extensions 5.4.4 RUCoP and CGR-hop 5.4.5 Issues 5.5 Interregional routing 5.5.1 Border gateway protocol 5.5.2 Hierarchical interregional routing 5.5.3 Issues 5.6 Further approaches 5.6.1 Machine learning approaches 5.6.2 Tropical geometry 6 Scalable schedule-aware bundle routing 6.1 Overview 6.2 Shortest-path tree routing for space networks 6.2.1 Structure 6.2.2 Tree construction 6.2.3 Tree management 6.2.4 Tree caching 6.3 Contact segmentation 6.3.1 Volume management interface 6.3.2 Simple volume manager 6.3.3 Enhanced volume manager 6.4 Contact passageways 6.4.1 Regional border definition 6.4.2 Virtual nodes 6.4.3 Pathfinding and administration 7 Evaluation 7.1 Methodology 7.1.1 Simulation tools 7.1.2 Simulator extensions 7.1.3 Algorithms and scenarios 7.2 Offline analysis 7.3 Eliminatory processing pressures 7.4 Networking performance 7.4.1 Intraregional unicast routing tests 7.4.2 Intraregional multicast tests 7.4.3 Interregional routing tests 7.4.4 Behavior with congestion 7.5 Requirement fulfillment 8 Summary and Outlook 8.1 Conclusion 8.2 Future works 8.2.1 Next development steps 8.2.2 Contact graph routin
    corecore