pande sohan kumar (8 resultados)

Condición: New.

Taschenbuch. Condición: Neu. Design of Scheduling Algorithms for Vehicular Cloud Computing | Sohan Kumar Pande (u. a.) | Taschenbuch | Englisch | 2023 | LAP LAMBERT Academic Publishing | EAN 9786205514955 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book's elementary focuses are addressing the various challenges of the vehicular cloud environment and developing scheduling and migration algorithms. Here, we consider various influencing factors like speed, parking time, mobility pattern, vehicles' energy source, resource utilization, energy consumption, and cost in the algorithms' development process to achieve better performance. In the beginning, we propose a dynamic service migration (DSM) algorithm for vehicular clouds. The algorithm consists of three phases, estimation, assignment and migration. The performance analysis is carried out through simulationusing two scenarios of six datasets, and compared with three well-known algorithms, namely vehicular VM migration-uniform (VVMM-U), round robin and mobility and destination workload aware migration (MDWLAM) using four performance measures. The comparison results followed by statistical validation using T test show the superiority of the proposed algorithm over the existing algorithms. 192 pp. Englisch.

Condición: New. Print on Demand.

Condición: New. PRINT ON DEMAND.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book s elementary focuses are addressing the various challenges of the vehicular cloud environment and developing scheduling and migration algorithms. Here, we consider various influencing factors like speed, parking time, mobility pattern, vehicles e.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book's elementary focuses are addressing the various challenges of the vehicular cloud environment and developing scheduling and migration algorithms. Here, we consider various influencing factors like speed, parking time, mobility pattern, vehicles¿ energy source, resource utilization, energy consumption, and cost in the algorithms¿ development process to achieve better performance. In the beginning, we propose a dynamic service migration (DSM) algorithm for vehicular clouds. The algorithm consists of three phases, estimation, assignment and migration. The performance analysis is carried out through simulationusing two scenarios of six datasets, and compared with three well-known algorithms, namely vehicular VM migration-uniform (VVMM-U), round robin and mobility and destination workload aware migration (MDWLAM) using four performance measures. The comparison results followed by statistical validation using T test show the superiority of the proposed algorithm over the existing algorithms.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 192 pp. Englisch.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book's elementary focuses are addressing the various challenges of the vehicular cloud environment and developing scheduling and migration algorithms. Here, we consider various influencing factors like speed, parking time, mobility pattern, vehicles' energy source, resource utilization, energy consumption, and cost in the algorithms' development process to achieve better performance. In the beginning, we propose a dynamic service migration (DSM) algorithm for vehicular clouds. The algorithm consists of three phases, estimation, assignment and migration. The performance analysis is carried out through simulationusing two scenarios of six datasets, and compared with three well-known algorithms, namely vehicular VM migration-uniform (VVMM-U), round robin and mobility and destination workload aware migration (MDWLAM) using four performance measures. The comparison results followed by statistical validation using T test show the superiority of the proposed algorithm over the existing algorithms.