Fog computing is an emerging technology to address computing and networking bottlenecks in large scale deployment of IoT applications. It is a promising complementary computing paradigm to cloud computing where computational, networking, storage and acceleration elements are deployed at the edge and network layers in a multi-tier, distributed and possibly cooperative manner. These elements may be virtualized computing functions placed at edge devices or network elements on demand, realizing the ''computing everywhere'' concept. To put the current research in perspective, this paper provides an inclusive taxonomy for architectural, algorithmic and technologic aspects of fog computing. The computing paradigms and their architectural distinctions, including cloud, edge, mobile edge and fog computing are subsequently reviewed. Practical deployment of fog computing includes a number of different aspects such as system design, application design, software implementation, security, computing resource management and networking. A comprehensive survey of all these aspects from the architectural point of view is covered. Current reference architectures and major application-specific architectures describing their salient features and distinctions in the context of fog computing are explored. Base architectures for application, software, security, computing resource management and networking are presented and are evaluated using a proposed maturity model. INDEX TERMS Cloud Computing, edge computing, fog computing, Internet of Things (IoT), advanced internet architecture.

Abstract-Over the past few years, many scientists have envisioned an Internet generation that will not only provide voice and data communications but can also support Haptic communications. This new Internet dimension can be beneficial for the society by facilitating the development of new technologies and applications that will improve our standards of living. In this study, we propose a novel traffic engineering policy that can satisfy the extremely strict requirements of the new traffic class associated with Haptic communications. Our proposed policy is based on Multi-Plane Routing (MPR) that consolidates various aspects in all-IP access infrastructures and enables networkwide path diversity. To this end, MPR has been remodeled and extended to facilitate Haptic communications. Our simulation results demonstrate that our proposed policy outperforms intradomain routing protocols namely Open Shortest Path First (OSPF) and performs near-optimally. It will also become apparent that shortest-path solutions such as OSPF can not be used in order to handle Haptic communications in typical Internet network topologies. Finally, we formulate a binary optimization problem for the selection of the optimal Routing Plane (RP) in terms of the network effects such as delay, jitter and packet loss.

If citing, it is advised that you check and use the publisher's definitive version for pagination, volume/issue, and date of publication details. And where the final published version is provided on the Research Portal, if citing you are again advised to check the publisher's website for any subsequent corrections.

There has been a rapid rise in the IP traffic throughout the Internet which takes advantage of the already established widespread IP infrastructure. Different suggestions are being explored to facilitate the next-generation access networks via IP mechanisms, with a growing trend towards a flat-IP structure and novel topological set-ups in the backhaul. Aligned with this evolution, there are increasingly more user applications flooding the Internet that calls for a consistent routing strategy to minimize loss in data transmission. In this paper, Multi-Plane Routing (MPR), which incorporates various aspects in all-IP infrastructure will be studied under the new access network structure. MPR is based on Multi-Topology Open Shortest Path First (MT-OSPF) principle and divides the physical network topology into several logical Routing Planes (RPs). The offline Traffic Engineering (TE) strategy for MPR has been optimized using a heuristic hop-constraint solution that suits the "flattened" network realized through the incorporation of direct communication between Aggregation Routers. With our approach, despite of a higher number of Ingress −Egress pairs for traffic in the access network, the number of RPs has been kept to the desirable level whilst the reliability indicator and the path diversity index ratio have increased up to 47% and 33% respectively. Our proposed MPR-based offline approach has also shown improvement compared with the Multi-Protocol Label Switching (MPLS) offline approach.

No abstract

No abstract

No abstract

No abstract