scholarly journals On the Design of Efficient Hierarchic Architecture for Software Defined Vehicular Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1400
Author(s):  
Muhammad Adnan ◽  
Jawaid Iqbal ◽  
Abdul Waheed ◽  
Noor Ul Amin ◽  
Mahdi Zareei ◽  
...  

Modern vehicles are equipped with various sensors, onboard units, and devices such as Application Unit (AU) that support routing and communication. In VANETs, traffic management and Quality of Service (QoS) are the main research dimensions to be considered while designing VANETs architectures. To cope with the issues of QoS faced by the VANETs, we design an efficient SDN-based architecture where we focus on the QoS of VANETs. In this paper, QoS is achieved by a priority-based scheduling algorithm in which we prioritize traffic flow messages in the safety queue and non-safety queue. In the safety queue, the messages are prioritized based on deadline and size using the New Deadline and Size of data method (NDS) with constrained location and deadline. In contrast, the non-safety queue is prioritized based on First Come First Serve (FCFS) method. For the simulation of our proposed scheduling algorithm, we use a well-known cloud computing framework CloudSim toolkit. The simulation results of safety messages show better performance than non-safety messages in terms of execution time.

Author(s):  
Ge Weiqing ◽  
Cui Yanru

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.


2014 ◽  
Vol 538 ◽  
pp. 512-515
Author(s):  
Feng Song Li ◽  
Yuan Sheng Lou

For the issues of quality of service (QoS) in the cloud computing raised by users, this paper proposes a strategy for QoS classification and builds tasks' priority function modeling and through priority scheduling tasks, assigning tasks to the reasonable resources, and finally to complete the task efficiently, improve the utilization of resources.


Author(s):  
Manjunath Ramachandra ◽  
Pandit Pattabhirama

With the evolution of the paradigm of cloud computing in every field of application, the demand on the reusable resources while providing the service has increased substantially. Although it is transparent to the user through virtualization, that is also a strength of cloud computing, the runtime scalability of resources to cater for a variety of services is to be addressed to meet the critical factor of the agreed quality of service. In this work, an architecture based on information feedback is presented to address this issue. The findings have been supported by the simulation results. The scalable architecture makes use of a hierarchy of resources, each level capable of providing a different degree of services. The demand for resources at each level, which is also equivalent to contention for resources or service drops, is computed using Random Early Detection (RED) or similar algorithms and used as feedback signal. The effectiveness of this signal may be enhanced by predicting the same several steps ahead of time. The prediction ensures the availability of a breathing time for the allocation of the resources.


Author(s):  
Neeraj Arora ◽  
Rohitash Kumar Banyal

<p><span>Cloud computing is one of the emerging fields in computer science due to its several advancements like on-demand processing, resource sharing, and pay per use. There are several cloud computing issues like security, quality of service (QoS) management, data center energy consumption, and scaling. Scheduling is one of the several challenging problems in cloud computing, where several tasks need to be assigned to resources to optimize the quality of service parameters. Scheduling is a well-known NP-hard problem in cloud computing. This will require a suitable scheduling algorithm. Several heuristics and meta-heuristics algorithms were proposed for scheduling the user's task to the resources available in cloud computing in an optimal way. Hybrid scheduling algorithms have become popular in cloud computing. In this paper, we reviewed the hybrid algorithms, which are the combinations of two or more algorithms, used for scheduling in cloud computing. The basic idea behind the hybridization of the algorithm is to take useful features of the used algorithms. This article also classifies the hybrid algorithms and analyzes their objectives, quality of service (QoS) parameters, and future directions for hybrid scheduling algorithms.</span></p>


Author(s):  
Simar Preet Singh ◽  
Rajesh Kumar ◽  
Anju Sharma ◽  
S. Raji Reddy ◽  
Priyanka Vashisht

Background: Fog computing paradigm has recently emerged and gained higher attention in present era of Internet of Things. The growth of large number of devices all around, leads to the situation of flow of packets everywhere on the Internet. To overcome this situation and to provide computations at network edge, fog computing is the need of present time that enhances traffic management and avoids critical situations of jam, congestion etc. Methods: For research purposes, there are many methods to implement the scenarios of fog computing i.e. real-time implementation, implementation using emulators, implementation using simulators etc. The present study aims to describe the various simulation and emulation tools for implementing fog computing scenarios. Results: Review shows that iFogSim is the simulator that most of the researchers use in their research work. Among emulators, EmuFog is being used at higher pace than other available emulators. This might be due to ease of implementation and user-friendly nature of these tools and language these tools are based upon. The use of such tools enhance better research experience and leads to improved quality of service parameters (like bandwidth, network, security etc.). Conclusion: There are many fog computing simulators/emulators based on many different platforms that uses different programming languages. The paper concludes that the two main simulation and emulation tools in the area of fog computing are iFogSim and EmuFog. Accessibility of these simulation/emulation tools enhance better research experience and leads to improved quality of service parameters along with the ease of their usage.


Sign in / Sign up

Export Citation Format

Share Document