scholarly journals Service Provisioning through Opportunistic Computing in Mobile Clouds

2014 ◽  
Vol 40 ◽  
pp. 143-150 ◽  
Author(s):  
Davide Mascitti ◽  
Marco Conti ◽  
Andrea Passarella ◽  
Laura Ricci
Keyword(s):  
Service Provisioning ◽  
Opportunistic Computing

Service Provisioning in Mobile Environments through Opportunistic Computing

2018 ◽  
Vol 17 (12) ◽  
pp. 2898-2911 ◽  
Author(s):  
Davide Mascitti ◽  
Marco Conti ◽  
Andrea Passarella ◽  
Laura Ricci ◽  
Sajal K. Das
Keyword(s):  
Service Provisioning ◽  
Mobile Environments ◽  
Opportunistic Computing

Limitation of Erlang B Traffic Model in Elastic Optical Network for Blocking Probability Estimation

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Ujjwal ◽  
Jaisingh Thangaraj
Keyword(s):  
Blocking Probability ◽  
Optical Network ◽  
Constant Load ◽  
Traffic Model ◽  
Service Rate ◽  
Service Provisioning ◽  
Connection Request ◽  
Elastic Optical Network ◽  
Simulation Results ◽  
Single Path

Abstract In this paper, an algorithm for multipath connection provisioning in elastic optical network (EON) has been proposed. Initially, the algorithm prefers the single-path routing for service provisioning. But when single-path routing is not adequate to serve a dynamic connection, the algorithm switches to the connection request fragmentation. Its computation is based on the parameters such as capacity_constant and capacity_allowed to fragment the connection request on disjoint paths. Simulation results clearly state that the proposed algorithm performs well in service provisioning as compared to the traditional single-path routing algorithms and improves the average network throughput. Thereafter, we have investigated the limitation of Erlang B traffic model in EON for calculation of link blocking probability using routing and spectrum assignment (RSA) algorithm. It is verified by the following two ways: (i) effect on the blocking probability in case of constant load and (ii) effect of slot width on the blocking probability. Our simulation results indicate that in EON due to dynamic RSA, blocking probability is not constant in case of proportionate varying of call arrival and service rate giving constant load and blocking probability depends on the number of slots per link, but in Erlang B traffic model blocking probability is always constant in case of constant load and it considers wavelength per link instead of slots per link. This is attributed to the fact that Erlang B traffic model fails to calculate blocking probability accurately in EON. We have computed the carried traffic on 14 nodes, 21-link National Science Foundation Network (NSFNET) topology.

Resilient Service Provisioning for Edge Computing

2021 ◽  
pp. 1-1
Author(s):  
Yuben Qu ◽  
Dongyu Lu ◽  
Haipeng Dai ◽  
Haisheng Tan ◽  
Shaojie Tang ◽  
...  
Keyword(s):  
Edge Computing ◽  
Service Provisioning
Sign in / Sign up

Export Citation Format

Share Document