Advanced Tensor Solution to the Problem of Inter-Domain Routing with Normalized Quality of Service

The advanced tensor solution to the problem of inter-domain routing with normalized Quality of Service under hierarchical coordination in a communication network is proposed in the paper. The novelty of the method based on the tensor model lies in the more flexible load balancing over the network due to the presence of requirements to average end-to-end delay of packets. The framework of the method comprises a decomposed flow-based routing model that includes the inter-domain routing interaction conditions and ensures the normalized Quality of Service derived from the tensor model. Considering the mentioned above, the advanced inter-domain Quality of Service routing task was formulated in the optimization form, using the quadratic optimality criterion. The conducted analysis of the numerical research results confirmed the efficiency and adequacy of the proposed method when the desired solutions were obtained during the finite number of iterations under a provision of the normalized Quality of Service. It should be noted that the reduced number of such iterations during the operation of the method will decrease the amount of service traffic transmitted over the network needed for obtaining the final solution in the process of inter-domain routing with normalized Quality of Service.

Multi-Objective Optimisation in Multi-QoS Routing Strategy for Software-Defined Satellite Network

The satellite network plays an increasingly important role in the global communication. With the development of communication technology, quality of service requirements have become more and more complex and diverse and the quality of service routing strategy of software-defined satellite network has become a more and more hot and difficult issue. In this paper, an interval-type-2 fuzzy set routing algorithm is proposed. Firstly, the multi- quality of service routing problem in software-defined satellite network is modeled. Then, the interval-type-2 fuzzy set routing algorithm is proposed to make fuzzy decisions. A series of experiments conducted in Network Simulator (Version 2.35) have proved that the proposed interval type-2 fuzzy set routing algorithm can reduce average delay, increase total throughput and reduce packet drop rate.

Analisis Quality of Service Routing MPLS OSPF Terhadap Gangguan Link Failure

Penerapan metode routing dalam kegiatan yang menggunakan jaringan komputer dalam lingkup besar diperlukan oleh administrator jaringan, agar dapat melakukan pengoptimalan lauyanan jaringan. Pemilihan metode routing akan membantu dalam mewujudkan perkembangan jaringan yang baik, namun dibutuhkan metode routing yang memiliki kinerja bagus tidak hanya dalam kondisi jaringan yang baik tapi juga pada kondisi jaringan yang mengalami gangguan.Salah satu metode yang memiliki kemampuan yang baik dalam jaringan yang semakin besar adalah Multiprotocol Lable Switching (MPLS), dan dapat dikombinasikan dengan protokol Open Shortest Path First (OSPF). Tujuan penerapan metode MPLS OSPF adalah untuk melihat bagaimana metode tersebut melakukan pengiriman data dalam berbagai kondisi. Tentunya agar membuat jaringan menjadi lebih baik kinerjanya dalam mengirimkan paket data, dengan mencari rute atau jalur yang terbaik pada topologi jaringanPenelitian ini akan mengimplementasikan metode routing MPLS OSPF kedalam beberapa bentuk topologi jaringan berupa prototipe, dengan memberikan skenario pengujian berupa gangguan pemutusan link atau link failure. Pengujian dianalisa menggunakan tools Wireshark.Hasil yang didapat pada penelitian ini menunjukkan bahwa metode routting MPLS OSPF menunjukkan hasil yang baik dalam menangani gangguan, dengan nilai parameter QoS yang tergolong dalam kategori baik. Nilai throughput didapat mengalami penurunan besar nilai pada kondisi gangguan link failure.

An Improved AODV Routing Security Algorithm Based on Blockchain in Ad Hoc Network

Ad Hoc network is a special network with no center and dynamic topology changes. Due to the free mobility of nodes, routing security has always been a bottleneck problem that plagues network development. Therefore, this paper proposes a multi-path QoS (Quality of Service) routing security algorithm based on blockchain by improving the traditional AODV (Ad hoc On-Demand Distance Vector) protocol (AODV-MQS). The algorithm first establishes a blockchain network and saves the state of all nodes by making the intermediate nodes on the chain. Then the smart contract in the blockchain is set to filter out the nodes that meet the QoS constraints. Finally, two largest unrelated communication paths are found in the blockchain network through smart contract, one of which is the main path and the other is the standby path. Simulation experiments show that this algorithm has better performance than other algorithms in an unsafe environment.

Ant Colony Optimization Based Qos Routing Protocol (ACORP) for Vanets

Vehicular Ad Hoc Network (VANET ) is a special type of communication network that promises wide applications ranging from road safety to driving comfort. The rich applications enhance the safety and comfort of travelers by establishing a cooperative communication among the vehicles. To increase communication efficiency this work proposes an Ant Colony Optimization based Quality of Service Routing protocol(ACORP) for VANETs that aims to enhance the road safety and travel convenience in VANETs.

CDCS: Cluster-Based Distributed Compressed Sensing to Facilitate QoS Routing in Cognitive Video Sensor Networks

Compressed sensing based in-network compression methods which minimize data redundancy are critical to cognitive video sensor networks. However, most existing methods require a large number of sensors for each measurement, resulting in significant performance degradation in energy efficiency and quality-of-service satisfaction. In this paper, a cluster-based distributed compressed sensing scheme working together with a quality-of-service aware routing framework is proposed to deliver visual information in cognitive video sensor networks efficiently. First, the correlation among adjacent video sensors determines the member nodes that participate in a cluster. On this basis, a sequential compressed sensing approach is applied to determine whether enough measurements are obtained to limit the reconstruction error between decoded signals and original signals under a specified reconstruction threshold. The goal is to maximize the removal of unnecessary traffic without sacrificing video quality. Lastly, the compressed data is transmitted via a distributed spectrum-aware quality-of-service routing scheme, with an objective of minimizing energy consumption subject to delay and reliability constraints. Simulation results demonstrate that the proposed approach can achieve energy-efficient data delivery and reconstruction accuracy of visual information compared with existing quality-of-service routing schemes.