The Experts below are selected from a list of 183 Experts worldwide ranked by ideXlab platform

Mugen Peng - One of the best experts on this subject based on the ideXlab platform.

  • Network Slicing in Fog Radio Access Networks: Issues and Challenges
    arXiv: Information Theory, 2017
    Co-Authors: Hongyu Xiang, Mahmoud Daneshmand, Wenan Zhou, Mugen Peng
    Abstract:

    Network slicing has been advocated by both academia and industry as a cost-efficient way to enable operators to provide networks on an as-a-service basis and meet the wide range of use cases that the fifth generation wireless network will serve. The existing works on network slicing are mainly targeted at the partition of the core network, and the prospect of network slicing in radio access networks should be jointly exploited. To solve this challenge, an enhanced network slicing in fog radio access networks (F-RANs), termed as access slicing, is proposed. This article comprehensively presents a novel architecture and related key techniques for access slicing in F-RANs. The proposed hierarchical architecture of access slicing consists of centralized Orchestration Layer and slice instance Layer, which makes the access slicing adaptively implement in an convenient way. Meanwhile, key techniques and their corresponding solutions, including the radio and cache resource management, as well as the social-aware slicing, are presented. Open issues in terms of standardization developments and field trials are identified.

  • Network Slicing in Fog Radio Access Networks: Issues and Challenges
    IEEE Communications Magazine, 2017
    Co-Authors: Hongyu Xiang, Mahmoud Daneshmand, Wenan Zhou, Mugen Peng
    Abstract:

    Network slicing has been advocated by both academia and industry as a cost-efficient way to enable operators to provide networks on an as-a-service basis and meet the wide range of use cases that the fifth generation wireless network will serve. The existing works on network slicing are mainly targeted at the partition of the core network, and the prospect of network slicing in radio access networks should be jointly exploited. To solve this challenge, enhanced network slicing in F-RANs, called access slicing, is proposed. This article comprehensively presents a novel architecture and related key techniques for access slicing in F-RANs. The proposed hierarchical architecture of access slicing consists of a centralized Orchestration Layer and a slice instance Layer, which makes access slicing adaptively implementable in a convenient way. Meanwhile, key techniques and their corresponding solutions, including radio and cache resource management as well as social-aware slicing, are presented. Open issues in terms of standardization developments and field trials are identified.

Hongyu Xiang - One of the best experts on this subject based on the ideXlab platform.

  • Network Slicing in Fog Radio Access Networks: Issues and Challenges
    arXiv: Information Theory, 2017
    Co-Authors: Hongyu Xiang, Mahmoud Daneshmand, Wenan Zhou, Mugen Peng
    Abstract:

    Network slicing has been advocated by both academia and industry as a cost-efficient way to enable operators to provide networks on an as-a-service basis and meet the wide range of use cases that the fifth generation wireless network will serve. The existing works on network slicing are mainly targeted at the partition of the core network, and the prospect of network slicing in radio access networks should be jointly exploited. To solve this challenge, an enhanced network slicing in fog radio access networks (F-RANs), termed as access slicing, is proposed. This article comprehensively presents a novel architecture and related key techniques for access slicing in F-RANs. The proposed hierarchical architecture of access slicing consists of centralized Orchestration Layer and slice instance Layer, which makes the access slicing adaptively implement in an convenient way. Meanwhile, key techniques and their corresponding solutions, including the radio and cache resource management, as well as the social-aware slicing, are presented. Open issues in terms of standardization developments and field trials are identified.

  • Network Slicing in Fog Radio Access Networks: Issues and Challenges
    IEEE Communications Magazine, 2017
    Co-Authors: Hongyu Xiang, Mahmoud Daneshmand, Wenan Zhou, Mugen Peng
    Abstract:

    Network slicing has been advocated by both academia and industry as a cost-efficient way to enable operators to provide networks on an as-a-service basis and meet the wide range of use cases that the fifth generation wireless network will serve. The existing works on network slicing are mainly targeted at the partition of the core network, and the prospect of network slicing in radio access networks should be jointly exploited. To solve this challenge, enhanced network slicing in F-RANs, called access slicing, is proposed. This article comprehensively presents a novel architecture and related key techniques for access slicing in F-RANs. The proposed hierarchical architecture of access slicing consists of a centralized Orchestration Layer and a slice instance Layer, which makes access slicing adaptively implementable in a convenient way. Meanwhile, key techniques and their corresponding solutions, including radio and cache resource management as well as social-aware slicing, are presented. Open issues in terms of standardization developments and field trials are identified.

Eric J. Rozner - One of the best experts on this subject based on the ideXlab platform.

  • IEEE CLOUD - Making Serverless Computing More Serverless
    2018 IEEE 11th International Conference on Cloud Computing (CLOUD), 2018
    Co-Authors: Zaid Al-ali, Sepideh Goodarzy, Ethan Hunter, Richard Han, Eric Keller, Eric J. Rozner
    Abstract:

    In serverless computing, developers define a function to handle an event, and the serverless framework horizontally scales the application as needed. The downside of this function-based abstraction is it limits the type of application supported and places a bound on the function to be within the physical resource limitations of the server the function executes on. In this paper we propose a new abstraction for serverless computing: a developer supplies a process and the serverless framework seamlessly scales out the process's resource usage across the datacenter. This abstraction enables processing to not only be more general purpose, but also allows a process to break out of the limitations of a single server – making serverless computing more serverless. To realize this abstraction, we propose ServerlessOS, comprised of three key components: (i) a new disaggregation model, which leverages disaggregation for abstraction, but enables resources to move fluidly between servers for performance; (ii) a cloud Orchestration Layer which manages fine-grained resource allocation and placement throughout the application's lifetime via local and global decision making; and (iii) an isolation capability that enforces data and resource isolation across disaggregation, effectively extending Linux cgroup functionality to span servers.

Faramarz Safi Esfahani - One of the best experts on this subject based on the ideXlab platform.

  • Adaptable decentralized Orchestration engine for block structured non-transactional workflow in service oriented architecture.
    2011
    Co-Authors: Faramarz Safi Esfahani
    Abstract:

    In the Service Oriented Architecture (SOA), business processes are executed by nonscalable centralized Orchestration engines. Nonetheless proliferation of business process applications in organizations raises scalability requirements. Decentralized Orchestration engines are applied to address the scalability by decentralizing a process into design-time static fragments without considering runtime requirements. The fragments are then encapsulated into runtime components such as agents. The SOA Orchestration Layer suffers from the lack of adaptability with runtime environment in decentralization of business processes. Accordingly, three aspects of runtime adaptability in decentralization are studied in this thesis. The first aspect is frequent-path adaptability, which is equal to detecting closely-interrelated activities and encapsulating them in the same fragment. Another aspect is proportionalfragment adaptability, which is analogous to the proportionality of produced fragments with number of machines. The last aspect is available-bandwidth adaptability, which is process fragmentation based on current circumstances of communication media. An ever-changing runtime environment along with the mentioned adaptability aspects raises the following research problems: 1) there is no framework to support architectures, decentralization methods, and a feedback loop from runtime environment; 2) current decentralization methods do not consider the frequent-path and proportional-fragment adaptability aspects in creating fragments; 3) there is no algorithm to map runtime circumstances to a suitable decentralization method in order to satisfy the available-bandwidth adaptability. Accordingly, the following research objectives are considered: first, to propose a framework including architectures, decentralization methods, and a feedback loop from runtime environment; second, to improve response-time and throughput of decentralized business processes applying the frequent-path and proportional-fragment adaptability aspects; third, to improve bandwidth-usage of decentralized business processes applying the available-bandwidth adaptability. The contributions of this research are also as follows: i) An Adaptable and Decentralized Workflow Execution Framework (ADWEF) is introduced that proposes an abstraction of a runtime adaptable decentralization in the SOA Orchestration Layer; ii) two architectures Type-1 and Type-2 are presented for the ADWEF that are able to support the execution of dynamically created fragments; iii) three aspects of runtime adaptability in decentralization namely frequent-path, proportional-fragment and available-bandwidth are introduced; iv) two decentralization methods called Hierarchical Process Decentralization (HPD) and Hierarchical and Intelligent Process Decentralization (HIPD) are presented, which are capable of providing various fragments. The latter considers the frequent-path adaptability and both of them together satisfy both frequent-path and proportionalfragment adaptability aspects; v) A Fuzzy Decentralization Decision Making algorithm (FDDM) is presented based on the fuzzy logic to choose a suitable method of decentralization that satisfies the three adaptability aspects frequent-path,proportional- fragment and available-bandwidth; and, vi) an algorithm is introduced for wiring of dynamic fragments. Evaluations of the three adaptability aspects in the ADWEF demonstrate that the frequent-path adaptability greatly improves response-time, throughput, and bandwidth-usage of decentralized business processes. The proportional-fragment adaptability proves that number of fragments must be proportional to the number of workflow engines machines. The available-bandwidth adaptability which is realized by the FDDM algorithm unifies the mentioned adaptability aspects and reduces the number of exchanged messages compared to other methods.

  • Adaptable Decentralized Service Oriented Architecture
    Journal of Systems and Software, 2011
    Co-Authors: Faramarz Safi Esfahani, Masrah Azrifah Azmi Murad, Nasir Sulaiman, Nur Izura Udzir
    Abstract:

    In the Service Oriented Architecture (SOA), BPEL specified business processes are executed by non-scalable centralized Orchestration engines. In order to address the scalability issue, decentralized Orchestration engines are applied, which decentralize BPEL processes into static fragments at design time without considering runtime requirements. The fragments are then encapsulated into runtime components such as agents. There are a variety of attitudes towards workflow decentralization; however, only a few of them produce adaptable fragments with runtime environment. In this paper, producing runtime adaptable fragments is presented in two aspects. The first one is frequent-path adaptability that is equal to finding closely interrelated activities and encapsulating them in the same fragment to omit the communication cost of the activities. Another aspect is proportional-fragment adaptability, which is analogous to the proportionality of produced fragments with number of workflow engine machines. It extenuates the internal communication among the fragments on the same machine. An ever-changing runtime environment along with the mentioned adaptability aspects may result in producing a variety of process versions at runtime. Thus, an Adaptable and Decentralized Workflow Execution Framework (ADWEF) is introduced that proposes an abstraction of adaptable decentralization in the SOA Orchestration Layer. Furthermore, ADWEF architectures Type-1 and Type-2 are presented to support the execution of fragments created by two decentralization methods, which produce customized fragments known as Hierarchical Process Decentralization (HPD) and Hierarchical Intelligent Process Decentralization (HIPD). However, mapping the current system conditions to a suitable decentralization method is considered as future work. Evaluations of the ADWEF decentralization methods substantiate both adaptability aspects and demonstrate a range of improvements in response-time, throughput, and bandwidth-usage compared to previous methods.

  • Run-time Adaptable Business Process Decentralization
    2011
    Co-Authors: Faramarz Safi Esfahani, Masrah Azrifah, Azmi Murad
    Abstract:

    BPEL specified business processes in the Service Oriented Architecture (SOA) are executed by non-scalable centralized Orchestration engines. In order to resolve scalability issues, the centralized engines are clustered, which is not a final solution either. Alternatively, several decentralized Orchestration engines are being emerged with the purpose of decentralizing a BPEL process into fragments, statically. Fully decentralization of a process into its building activities is an example of static fragmentation methods. The fragments are then encapsulated into run-time components such as agents. There are a number of attitudes towards workflow decentralization; however, only a few of them consider the adaptability of produced fragments with a run-time environment. The run-time adaptability can be studied from different aspects such as the proportionality of workflow fragments with number of machines dedicated to a workflow engine or runtime circumstances such as available bandwidth. In our opinion, the SOA suffers from the lack of decentralization adaptability with run-time environments in the Orchestration Layer. It demands the mapping of run-time circumstances to a suitable fragmentation model. In this paper, a mapping algorithm is presented, which is based on the number of machines and available bandwidth. Evaluation of the presented algorithm for adaptable decentralization demonstrates an improvement of the bandwidth usage compared to a fully decentralized process. Keywords-Adaptive Systems; Service Oriented Architecture; Distributed Orchestrate Engine; Self-* Systems; BPEL; Mobile Agents; processes from different parties all together naturally result in creating thousands of concurrent executing instances. Such number of concurrent requests is a natural fit to this paper. In addition, new software paradigms introduced in the Cloud computing such as software as a service (SaaS), platform as a service (PaaS) and infrastructure as a service (IaaS) are targeted to receive a huge number of requests. Particularly, in the case of orchestrate engine as a service, a huge number of workflow instances might be deployed and requested from various clients all around the world. In order to handle the requests, different number of machines and also resources must be employed. This paper proposes an adaptable and distributed workflow engine, which tackles

Wenan Zhou - One of the best experts on this subject based on the ideXlab platform.

  • Network Slicing in Fog Radio Access Networks: Issues and Challenges
    arXiv: Information Theory, 2017
    Co-Authors: Hongyu Xiang, Mahmoud Daneshmand, Wenan Zhou, Mugen Peng
    Abstract:

    Network slicing has been advocated by both academia and industry as a cost-efficient way to enable operators to provide networks on an as-a-service basis and meet the wide range of use cases that the fifth generation wireless network will serve. The existing works on network slicing are mainly targeted at the partition of the core network, and the prospect of network slicing in radio access networks should be jointly exploited. To solve this challenge, an enhanced network slicing in fog radio access networks (F-RANs), termed as access slicing, is proposed. This article comprehensively presents a novel architecture and related key techniques for access slicing in F-RANs. The proposed hierarchical architecture of access slicing consists of centralized Orchestration Layer and slice instance Layer, which makes the access slicing adaptively implement in an convenient way. Meanwhile, key techniques and their corresponding solutions, including the radio and cache resource management, as well as the social-aware slicing, are presented. Open issues in terms of standardization developments and field trials are identified.

  • Network Slicing in Fog Radio Access Networks: Issues and Challenges
    IEEE Communications Magazine, 2017
    Co-Authors: Hongyu Xiang, Mahmoud Daneshmand, Wenan Zhou, Mugen Peng
    Abstract:

    Network slicing has been advocated by both academia and industry as a cost-efficient way to enable operators to provide networks on an as-a-service basis and meet the wide range of use cases that the fifth generation wireless network will serve. The existing works on network slicing are mainly targeted at the partition of the core network, and the prospect of network slicing in radio access networks should be jointly exploited. To solve this challenge, enhanced network slicing in F-RANs, called access slicing, is proposed. This article comprehensively presents a novel architecture and related key techniques for access slicing in F-RANs. The proposed hierarchical architecture of access slicing consists of a centralized Orchestration Layer and a slice instance Layer, which makes access slicing adaptively implementable in a convenient way. Meanwhile, key techniques and their corresponding solutions, including radio and cache resource management as well as social-aware slicing, are presented. Open issues in terms of standardization developments and field trials are identified.