The Experts below are selected from a list of 22605 Experts worldwide ranked by ideXlab platform
William R. Rice - One of the best experts on this subject based on the ideXlab platform.
-
REQUISITE MUTATIONAL Load, PATHWAY EPISTASIS, AND DETERMINISTIC MUTATION ACCUMULATION IN SEXUAL VERSUS ASEXUAL POPULATIONS
Mutation and Evolution, 1998Co-Authors: William R. RiceAbstract:A measure of the Equilibrium Load of deleterious mutations is developed that explicitly incorporates the level of genome-wide linkage disEquilibrium. This measure, called the requisite mutational Load, is based on the minimal net reproductive rate of the least mutated class necessary to prevent deterministic mutation accumulation. If this minimal net reproductive rate is larger than ecological or physiological constraints allow, then: a) the population is driven to extinction via deterministic mutation accumulation, or b) a mutational Red-Queen ensues with adaptation counterbalancing mutation accumulation. Two population parameters determine the requisite mutational Load: a) the Equilibrium strength of selection, measured as a selection gradient, and b) the Equilibrium opportunity for selection, measured as the variance in number of mutations per genome. The opportunity for selection is decomposed into the accumulation of mutations (average number per genome) and the level of genome-wide linkage disEquilibrium. Recombination can substantially reduce the requisite mutational Load, compared to clonal reproduction, when there is buffering and/or reinforcing epistasis and also when there is positive assortative mating for fitness. Recombination is advantageous because it reduces the negative (variance reducing) linkage disEquilibrium induced by beneficial epistasis. The functional form of the expression for requisite mutational Load illustrates why epistasis within pathways, i.e., among closely interacting genes, is a powerful alternative to genome-wide truncation selection, as a means of reducing mutational Load.
Mondal Sourav - One of the best experts on this subject based on the ideXlab platform.
-
Strategic Deployment of Artificial Intelligence-Enhanced Cloudlets for Low-latency Human-to-Machine Applications
2020Co-Authors: Mondal SouravAbstract:© 2020 Sourav MondalThe genesis of mobile cloud computing technology is one of the most significant technical advents of the last decade which can be seen as a marriage between cloud computing and mobile computing technologies. This technical paradigm brings mobile users, telecommunication network operators, and cloud service providers to a common playground, thus providing business opportunities for network operators and cloud service providers. The extension of this facility towards access networks by aggregation of edge-intelligence nodes like cloudlets is one more step forward. A cloudlet is a ``data centre in a box" with enhanced mobility support to bring the cloud closer to mobile users and uses virtual machine abstraction for dynamic resource allocation to trusted mobile users, isolate untrusted mobile users, and support a wide variety of applications without being limited by their process structures, programming languages, or operating systems. To fulfil the ravenous demand for computational resources entangled with the crisp latency requirements of various computationally intensive and mission-critical applications related to augmented reality, autonomous transport, cognitive assistance, and Tactile Internet, installation of cloudlets near access seems to be a very promising solution because of its support for wide geographical network distribution, low latency, mobility and heterogeneity. Finding the optimal cost of cloudlet deployment over urban, suburban, and rural deployment areas with an existing access network, essentially implies finding the optimal placement locations of the cloudlets over the entire deployment area and the optimal amount of computational and storage resources per cloudlet. Technically, this research question leads to an assignment problem, where we need to find the optimal interconnections between mobile devices and cloudlets. In this research, we propose a hybrid cost-optimal cloudlet placement framework over existing fibre-wireless access networks based on mixed-integer non-linear programming. We primarily focus on static cloudlet network planning and placement, i.e., identification of exact optimal cloudlet placement locations over urban, suburban and rural deployment scenarios to provide guidance on the installation cost and assess the workLoad distribution among different cloudlets and the percentage of incremental energy arising from the presence of cloudlets in the fibre-wireless access networks. Howbeit, we observed that mixed-integer programming based frameworks suffer from scalability issues with large networks and become completely useless when the network data is unavailable. Thus, to overcome this issue, we design analytical frameworks that can provide a quick first-hand estimation of cloudlet deployment cost depending on mobile user density, network architecture, and QoS requirements. We verify that the results produced by this method can be considered as tight lower bounds to that produced by integer programming based frameworks for most practical scenarios. We further perform a parametric analysis to understand the dependence of cloudlet deployment cost on various network parameters. However, depending on the mobility pattern and dynamically varying computational requirements of associated mobile devices, cloudlets at different parts of the network become either overLoaded or under-Loaded. Thus, we propose an economic and non-cooperative Load balancing game for low-latency applications among neighbouring cloudlets, from same as well as different service providers. While addressing Load balancing problems, most authors usually stress on minimising the end-to-end latency and do not consider the heterogeneity of neighbouring cloudlets. Nonetheless, in practice, if the job requests are processed within their requested QoS latency target, mobile users should be satisfied. Therefore, instead of formulating a conventional latency minimisation game, we propose a novel utility maximisation game to capture the multi-party economic interaction among heterogeneous neighbouring cloudlets. In this Load balancing game, the participating cloudlets achieve their maximum utility when the end-to-end latency is equal to the QoS latency target. With this game formulation, each cloudlet is always interested in receiving some extra job requests and the associated incentives from their neighbouring cloudlets to push their utility towards the maximum point. To implement this game-theoretic Load balancing framework, firstly, we propose a centralised mechanism where all the competing cloudlets send their predicted job request arrival rates to a neutral mediator. The mediator computes the Nash Equilibrium Load balancing strategies for the cloudlets and broadcasts to them before the actual job request arrival. This centralised mechanism also ensures that competing cloudlets are truthful while revealing private information e.g., total incoming job requests. Secondly, we propose a continuous-action reinforcement learning automata-based scheme, which allows each cloudlet to independently compute the Nash Equilibrium in a completely distributed network setting. We critically study the convergence properties of the designed learning algorithm, scaffolding our understanding of the underlying Load balancing game for faster convergence, and study the impacts of exploration and exploitation on learning accuracy. After investigating the cloudlet placement and Load balancing problems, we investigate the role of edge-intelligence servers like cloudlets in deploying low-latency human-to-machine applications like teleoperation, immersive virtual/augmented reality, and industrial automotive control over long-distance access networks. Such applications are being realised through Tactile Internet that allows users to control remote things and involve the bi-directional transmission of video, audio, and haptic data. However, the end-to-end propagation latency presents a stubborn bottleneck, which can be alleviated by using various artificial intelligence-based application layer and network layer prediction algorithms, e.g., forecasting and preempting haptic feedback transmission. To gain proper insights, we study the experimental data on traffic characteristics of control signals and haptic feedback samples obtained through virtual reality-based human-to-machine teleoperation. Moreover, we propose the installation of edge-intelligence servers between master and slave devices to implement the preemption of haptic feedback from control signals. Harnessing virtual reality-based teleoperation experiments, we further propose a two-stage artificial intelligence-based module for forecasting haptic feedback samples. The first-stage unit is a supervised binary classifier that detects if haptic sample forecasting is necessary and the second-stage unit is a guided reinforcement learning unit that ensures haptic feedback samples are forecasted accurately when different types of material are present. Furthermore, by evaluating analytical expressions, we show the feasibility of deploying remote human-to-machine teleoperation over fibre backhaul by using our proposed artificial intelligence-based module, even under heavy traffic intensity
-
Centralized and Decentralized Non-Cooperative Load-Balancing Games among Competing Cloudlets
2020Co-Authors: Mondal Sourav, Das Goutam, Wong ElaineAbstract:Edge computing servers like cloudlets from different service providers that compensate scarce computational, memory, and energy resources of mobile devices, are distributed across access networks. However, depending on the mobility pattern and dynamically varying computational requirements of associated mobile devices, cloudlets at different parts of the network become either overLoaded or under-Loaded. Hence, Load balancing among neighboring cloudlets appears to be an essential research problem. Nonetheless, the existing Load balancing frameworks are unsuitable for low-latency applications. Thus, in this paper, we propose an economic and non-cooperative Load balancing game for low-latency applications among neighboring cloudlets, from same as well as different service providers. Firstly, we propose a centralized incentive mechanism to compute the unique Nash Equilibrium Load balancing strategies of the cloudlets under the supervision of a neutral mediator. With this mechanism, we ensure that the truthful revelation of private information to the mediator is a weakly-dominant strategy for both the under-Loaded and overLoaded cloudlets. Secondly, we propose a continuous-action reinforcement learning automata-based algorithm, which allows each cloudlet to independently compute the Nash Equilibrium in a completely distributed network setting. We critically study the convergence properties of the designed learning algorithm, scaffolding our understanding of the underlying Load balancing game for faster convergence. Furthermore, through extensive simulations, we study the impacts of exploration and exploitation on learning accuracy. This is the first study to show the effectiveness of reinforcement learning algorithms for Load balancing games among neighboring cloudlets
Wong Elaine - One of the best experts on this subject based on the ideXlab platform.
-
Centralized and Decentralized Non-Cooperative Load-Balancing Games among Competing Cloudlets
2020Co-Authors: Mondal Sourav, Das Goutam, Wong ElaineAbstract:Edge computing servers like cloudlets from different service providers that compensate scarce computational, memory, and energy resources of mobile devices, are distributed across access networks. However, depending on the mobility pattern and dynamically varying computational requirements of associated mobile devices, cloudlets at different parts of the network become either overLoaded or under-Loaded. Hence, Load balancing among neighboring cloudlets appears to be an essential research problem. Nonetheless, the existing Load balancing frameworks are unsuitable for low-latency applications. Thus, in this paper, we propose an economic and non-cooperative Load balancing game for low-latency applications among neighboring cloudlets, from same as well as different service providers. Firstly, we propose a centralized incentive mechanism to compute the unique Nash Equilibrium Load balancing strategies of the cloudlets under the supervision of a neutral mediator. With this mechanism, we ensure that the truthful revelation of private information to the mediator is a weakly-dominant strategy for both the under-Loaded and overLoaded cloudlets. Secondly, we propose a continuous-action reinforcement learning automata-based algorithm, which allows each cloudlet to independently compute the Nash Equilibrium in a completely distributed network setting. We critically study the convergence properties of the designed learning algorithm, scaffolding our understanding of the underlying Load balancing game for faster convergence. Furthermore, through extensive simulations, we study the impacts of exploration and exploitation on learning accuracy. This is the first study to show the effectiveness of reinforcement learning algorithms for Load balancing games among neighboring cloudlets
Das Goutam - One of the best experts on this subject based on the ideXlab platform.
-
Centralized and Decentralized Non-Cooperative Load-Balancing Games among Competing Cloudlets
2020Co-Authors: Mondal Sourav, Das Goutam, Wong ElaineAbstract:Edge computing servers like cloudlets from different service providers that compensate scarce computational, memory, and energy resources of mobile devices, are distributed across access networks. However, depending on the mobility pattern and dynamically varying computational requirements of associated mobile devices, cloudlets at different parts of the network become either overLoaded or under-Loaded. Hence, Load balancing among neighboring cloudlets appears to be an essential research problem. Nonetheless, the existing Load balancing frameworks are unsuitable for low-latency applications. Thus, in this paper, we propose an economic and non-cooperative Load balancing game for low-latency applications among neighboring cloudlets, from same as well as different service providers. Firstly, we propose a centralized incentive mechanism to compute the unique Nash Equilibrium Load balancing strategies of the cloudlets under the supervision of a neutral mediator. With this mechanism, we ensure that the truthful revelation of private information to the mediator is a weakly-dominant strategy for both the under-Loaded and overLoaded cloudlets. Secondly, we propose a continuous-action reinforcement learning automata-based algorithm, which allows each cloudlet to independently compute the Nash Equilibrium in a completely distributed network setting. We critically study the convergence properties of the designed learning algorithm, scaffolding our understanding of the underlying Load balancing game for faster convergence. Furthermore, through extensive simulations, we study the impacts of exploration and exploitation on learning accuracy. This is the first study to show the effectiveness of reinforcement learning algorithms for Load balancing games among neighboring cloudlets
Hengqing Tong - One of the best experts on this subject based on the ideXlab platform.
-
url assignment algorithm of crawler in distributed system based on hash
International Conference on Networking Sensing and Control, 2008Co-Authors: Yuan Wan, Hengqing TongAbstract:Web crawlers are the key component of services running on Internet and providing searching and indexing support for the entire Web, for corporate Intranets and large portal sites. More recently, crawlers have also been used as tools to conduct focused Web searches and to gather data about the characteristics of the WWW. In this paper, we research on the gathering model of crawler in the distributed circumstance. We describe the function of every module and establish some rules which crawlers must follow to maintain the Equilibrium Load and robustness of system when they are searching on the Web simultaneously. Then we design and implement a new URL assignment algorithm based on hash for partitioning the domain to crawl, and more in general discuss the complete decentralization of every task.