scholarly journals A Hierarchical Reputation Evidence Decision System in VANETs

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Yang Yang ◽  
Zhipeng Gao ◽  
Xuesong Qiu ◽  
Qian Liu ◽  
Yuwen Hao ◽  
...  
Keyword(s):  
Large Scale ◽  
Network Performance ◽  
Reputation Management ◽  
Selfish Nodes ◽  
Management Mechanism ◽  
Integration Mechanism ◽  
Evidence Gathering ◽  
Reputation Mechanisms ◽  
Energy Consumptions ◽  
Evidence Integration

In VANETs, users are rational, independent, and selfish. Stimulation-based reputation management system is critical for them to avoid selfishness and promote network performance in large-scale VANETs. The current reputation mechanisms produce some problems, for example, overfull energy consumptions, confused collusion, and misreport. In order to detect selfish and collusive behaviors accurately and quickly, we propose a dynamic three-layer reputation evidence decision and management mechanism, which combine with Dempster-Shafer evidence integration mechanism to distinguish selfish nodes. In particular, the system helps in collusion avoidance through reporting falsified reputation evidences of colluders. In addition, we borrow ideas from Weber-Fechner’s law and design an adaptive reputation evidence gathering cycle for prolonging the lifetime of detector and overwhelming frequent polling for reputation evidences. The simulation results demonstrate that REDS has higher detection speed for selfish nodes and collusive observers and less network traffic of gathering reputations.

scholarly journals HTPC: heterogeneous traffic-aware partition coding for random packet spraying in data center networks

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Jiawei Huang ◽  
Shiqi Wang ◽  
Shuping Li ◽  
Shaojun Zou ◽  
Jinbin Hu ◽  
...  
Keyword(s):  
Data Center ◽  
Large Scale ◽  
Network Performance ◽  
Rooted Tree ◽  
Heterogeneous Traffic ◽  
Data Center Networks ◽  
Packet Reordering ◽  
Traffic Characteristics ◽  
Network Utilization ◽  
The Impact

AbstractModern data center networks typically adopt multi-rooted tree topologies such leaf-spine and fat-tree to provide high bisection bandwidth. Load balancing is critical to achieve low latency and high throughput. Although the per-packet schemes such as Random Packet Spraying (RPS) can achieve high network utilization and near-optimal tail latency in symmetric topologies, they are prone to cause significant packet reordering and degrade the network performance. Moreover, some coding-based schemes are proposed to alleviate the problem of packet reordering and loss. Unfortunately, these schemes ignore the traffic characteristics of data center network and cannot achieve good network performance. In this paper, we propose a Heterogeneous Traffic-aware Partition Coding named HTPC to eliminate the impact of packet reordering and improve the performance of short and long flows. HTPC smoothly adjusts the number of redundant packets based on the multi-path congestion information and the traffic characteristics so that the tailing probability of short flows and the timeout probability of long flows can be reduced. Through a series of large-scale NS2 simulations, we demonstrate that HTPC reduces average flow completion time by up to 60% compared with the state-of-the-art mechanisms.

scholarly journals Relationship-Oriented Software Defined AS-Level Fast Rerouting for Multiple Link Failures

2015 ◽  
Vol 2015 ◽  
pp. 1-15 ◽  
Author(s):  
Chunxiu Li ◽  
Xin Li ◽  
Ke Li ◽  
Jiafu Huang ◽  
Zhansheng Feng ◽  
...  
Keyword(s):  
Distributed Control ◽  
Large Scale ◽  
Network Performance ◽  
Failure Recovery ◽  
Internet Routing ◽  
Link Failures ◽  
Significant Control ◽  
Control Overhead ◽  
Fast Reroute ◽  
Multiple Link Failures

Large-scale deployments of mission-critical services have led to stringent demands on Internet routing, but frequently occurring network failures can dramatically degrade the network performance. However, Border Gateway Protocol (BGP) can not react quickly to recover from them. Although extensive research has been conducted to deal with the problem, the multiple failure scenarios have never been properly addressed due to the limit of distributed control plane. In this paper, we propose a local fast reroute approach to effectively recover from multiple link failures in one administrative domain. The principle of Software Defined Networking (SDN) is used to achieve the software defined AS-level fast rerouting. Considering AS relationships, efficient algorithms are proposed to automatically and dynamically find protection paths for multiple link failures; then OpenFlow forwarding rules are installed on routers to provide data forwarding continuity. Our approach is able to ensure applicability to ASes with flexibility and adaptability to multiple link failures, contributing toward improving the network performance. Through experimental results, we show that our proposal provides effective failure recovery and does not introduce significant control overhead to the network.

scholarly journals A comprehensive evaluation of cache utilization characteristics in large scale WSN considering network driven cache replacement techniques

2018 ◽  
Vol 188 ◽  
pp. 05004
Author(s):  
Christos Panagiotou ◽  
Christos Antonopoulos ◽  
Stavros Koubias
Keyword(s):  
Smart City ◽  
Large Scale ◽  
Network Performance ◽  
Comprehensive Evaluation ◽  
Resource Conservation ◽  
Data Sources ◽  
Data Cache ◽  
Cache Replacement ◽  
Large Scale Networks ◽  
Result Analysis

WSNs as adopted in current smart city deployments, must address demanding traffic factors and resilience in failures. Furthermore, caching of data in WSN can significantly benefit resource conservation and network performance. However, data sources generate data volumes that could not fit in the restricted data cache resources of the caching nodes. This unavoidably leads to data items been evicted and replaced. This paper aims to experimentally evaluate the prominent caching techniques in large scale networks that resemble the Smart city paradigm regarding network performance with respect to critical application and network parameters. Through respective result analysis valuable insights are provided concerning the behaviour of caching in typical large scale WSN scenarios.

scholarly journals A scheme for stimulating message relaying cooperation

2020 ◽  
Vol 16 (2) ◽  
pp. 155014772090703 ◽  
Author(s):  
Haifeng Lin ◽  
Fuquan Zhang
Keyword(s):  
Private Information ◽  
Network Performance ◽  
Threshold Value ◽  
Selfish Nodes ◽  
Relay Nodes ◽  
Selfish Behavior ◽  
Estimation Scheme ◽  
Memory Power ◽  
Intermittent Connection ◽  
Store And Forward

It is expected that all the nodes try their best to store and forward the messages in the intermittent connection network. However, due to the limited resources, such as memory, power, and transient communication chance, selfish nodes may relay the messages without responsibility. Stimulating selfish to behave normally could improve network performance. However, usually, it is difficult to distinguish the selfish behavior from the inability to relaying the message. By monitoring the behavior of relay nodes that messages are forwarding through, this article proposes a scheme that relays messages according to the reputation of intermediate nodes. The proposed reputation estimation scheme combines selfish behavior and inability behavior, and reveals very little private information for the protocol practice. There is a trade-off between the threshold and the performance. Too low value may not distinguish the selfish nodes. On the contrary, some normal nodes may excluded and cannot join the relaying and processing. Simulation effectively demonstrates that the reputation affects the node’s performance, and an appropriate reputation threshold value is useful for improving the network performance.

scholarly journals Software Defined Networking Flow Table Management of OpenFlow Switches Performance and Security Challenges: A Survey

2020 ◽  
Vol 12 (9) ◽  
pp. 147 ◽  
Author(s):  
Babangida Isyaku ◽  
Mohd Soperi Mohd Zahid ◽  
Maznah Bte Kamat ◽  
Kamalrulnizam Abu Bakar ◽  
Fuad A. Ghaleb
Keyword(s):  
Large Scale ◽  
Network Performance ◽  
Software Defined Networking ◽  
Cloud Services ◽  
Future Research ◽  
Control Plane ◽  
Processing Load ◽  
Flow Table ◽  
Data Plane ◽  
Large Scale Networks

Software defined networking (SDN) is an emerging network paradigm that decouples the control plane from the data plane. The data plane is composed of forwarding elements called switches and the control plane is composed of controllers. SDN is gaining popularity from industry and academics due to its advantages such as centralized, flexible, and programmable network management. The increasing number of traffics due to the proliferation of the Internet of Thing (IoT) devices may result in two problems: (1) increased processing load of the controller, and (2) insufficient space in the switches’ flow table to accommodate the flow entries. These problems may cause undesired network behavior and unstable network performance, especially in large-scale networks. Many solutions have been proposed to improve the management of the flow table, reducing controller processing load, and mitigating security threats and vulnerabilities on the controllers and switches. This paper provides comprehensive surveys of existing schemes to ensure SDN meets the quality of service (QoS) demands of various applications and cloud services. Finally, potential future research directions are identified and discussed such as management of flow table using machine learning.

GradientFlow: Optimizing Network Performance for Large-Scale Distributed DNN Training

2019 ◽  
pp. 1-1 ◽  
Author(s):  
Peng Sun ◽  
Yonggang Wen ◽  
Ruobing Han ◽  
Wansen Feng ◽  
Shengen Yan
Keyword(s):  
Large Scale ◽  
Network Performance

scholarly journals Performance Evaluation of LoRaWAN Communication Scalability in Large-Scale Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Alexandru Lavric ◽  
Valentin Popa
Keyword(s):  
Wireless Sensor Networks ◽  
Performance Evaluation ◽  
Large Scale ◽  
Network Performance ◽  
Communication Channel ◽  
Communication Protocol ◽  
Geographical Area ◽  
Performance Level ◽  
Wireless Sensor ◽  
Case Scenario

The LoRaWAN communication protocol can be used for the implementation of the IoT (Internet of Things) concept. Currently, most of the information regarding the scalability of the LoRa technology is commercial and deals with the best-case scenario. Thus, we need realistic models, enabling the proper assessment of the performance level. Most of the time, the IoT concept entails a large number of nodes distributed over a wide geographical area, therefore forming a high density, large-scale architecture. It is important to determine the number of collisions so that we can assess the network performance. The present paper aims at assessing the performance level of the LoRaWAN technology by analyzing the number of packet collisions that can occur. Thus, this paper determines the maximum number of LoRa nodes that can communicate with a Gateway considering the LoRaWAN protocol specifications. Furthermore, we have proposed a series of solutions for reducing the number of collisions and increasing the capacity of the communication channel.

scholarly journals Routing Based Multi-Agent System for Network Reliability in the Smart Microgrid

Sensors ◽  
2020 ◽  
Vol 20 (10) ◽  
pp. 2992
Author(s):  
Niharika Singh ◽  
Irraivan Elamvazuthi ◽  
Perumal Nallagownden ◽  
Gobbi Ramasamy ◽  
Ajay Jangra
Keyword(s):  
Large Scale ◽  
Network Performance ◽  
Performance Metrics ◽  
Network Reliability ◽  
Operating Conditions ◽  
Multi Agent System ◽  
Agent System ◽  
Agent Based ◽  
Multi Agent ◽  
System Operating

Microgrids help to achieve power balance and energy allocation optimality for the defined load networks. One of the major challenges associated with microgrids is the design and implementation of a suitable communication-control architecture that can coordinate actions with system operating conditions. In this paper, the focus is to enhance the intelligence of microgrid networks using a multi-agent system while validation is carried out using network performance metrics i.e., delay, throughput, jitter, and queuing. Network performance is analyzed for the small, medium and large scale microgrid using Institute of Electrical and Electronics Engineers (IEEE) test systems. In this paper, multi-agent-based Bellman routing (MABR) is proposed where the Bellman–Ford algorithm serves the system operating conditions to command the actions of multiple agents installed over the overlay microgrid network. The proposed agent-based routing focuses on calculating the shortest path to a given destination to improve network quality and communication reliability. The algorithm is defined for the distributed nature of the microgrid for an ideal communication network and for two cases of fault injected to the network. From this model, up to 35%–43.3% improvement was achieved in the network delay performance based on the Constant Bit Rate (CBR) traffic model for microgrids.

Sign in / Sign up

Export Citation Format

Share Document