Probabilistic Analysis of a Network Resource Allocation Algorithm

Probabilistic Analysis of a Network Resource Allocation Algorithm
Author: Nancy Ann Lynch
Publisher:
Total Pages: 70
Release: 1983
Genre: Computer networks
ISBN:

Download Probabilistic Analysis of a Network Resource Allocation Algorithm Book in PDF, Epub and Kindle

A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, once allocated, are never returned. The algorithm searches sequentially, exhausting certain neighborhoods of the request origin before proceeding to search at greater distances. Choice of search direction is made nondeterministically. Analysis of expected response time is simplified by assuming that the search direction is chosen probabilistically, that messages require constant time, that the network is a tree with all leaves at the same distance from the root, and that requests and resources occur only at leaves. It is shown that the response time is approximated by the number of messages of one that are sent during the execution of the algorithm, and that this number of message is a nondecreasing function of the interarrival time for requests. Therefore, the worst case occurs when requests come in so far apart that they are processed sequentially. The expected time for the sequential case of the algorithm is analyzed by standard techniques. This time is shown to be bounded by a constant, independent of the size of the network. It follows that the expected response time for the algorithm is bounded in the same way. (Author).

Probabilistic Analysis of a Network Resource Allocation Algorithm. Revision

Probabilistic Analysis of a Network Resource Allocation Algorithm. Revision
Author: N. A. Lynch
Publisher:
Total Pages: 47
Release: 1985
Genre:
ISBN:

Download Probabilistic Analysis of a Network Resource Allocation Algorithm. Revision Book in PDF, Epub and Kindle

A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, once allocated, are never returned. The algorithm searches sequentially, exhausting certain neighborhoods of the request origin before proceeding to search at greater distances. Choice of search direction is made nondeterministically. Analysis of expected response time is simplified by assuming that the search direction is chosen probabilistically, that messages require constant time, that the network is a tree with all leaves at the same distance from the root, and that requests and resources occur only at leaves. It is shown that the response time is approximated by the number of messages of one that are sent during the execution of the algorithm, and that this number of messages is a nondecreasing function of the interarrival time for requests. Therefore, the worst case occurs when requests come in so far apart that they are processed sequentially. The expected time for the sequential case of the algorithm is analyzed by standard techniques. This time is shown to be bounded by a constant, independent of the size of the network. It follows that the expected response time for the algorithm is bounded in the same way. (Author).

Resource Allocation in Network Function Virtualization

Resource Allocation in Network Function Virtualization
Author: Song Yang
Publisher: Springer Nature
Total Pages: 143
Release: 2022-08-29
Genre: Technology & Engineering
ISBN: 9811948151

Download Resource Allocation in Network Function Virtualization Book in PDF, Epub and Kindle

Network Function Virtualization (NFV) has recently attracted considerable attention from both research and industrial communities. Numerous papers have been published regarding solving the resource- allocation problems in NFV, from various perspectives, considering different constraints, and adopting a range of techniques. However, it is difficult to get a clear impression of how to understand and classify different kinds of resource allocation problems in NFV and how to design solutions to solve these problems efficiently. This book addresses these concerns by offering a comprehensive overview and explanation of different resource allocation problems in NFV and presenting efficient solutions to solve them. It covers resource allocation problems in NFV, including an introduction to NFV and QoS parameters modelling as well as related problem definition, formulation and the respective state-of-the-art algorithms. This book allows readers to gain a comprehensive understanding of and deep insights into the resource allocation problems in NFV. It does so by exploring (1) the working principle and architecture of NFV, (2) how to model the Quality of Service (QoS) parameters in NFV services, (3) definition, formulation and analysis of different kinds of resource allocation problems in various NFV scenarios, (4) solutions for solving the resource allocation problem in NFV, and (5) possible future work in the respective area.

Laboratory for Computer Science Progress Report

Laboratory for Computer Science Progress Report
Author: Massachusetts Institute of Technology. Laboratory for Computer Science
Publisher:
Total Pages: 354
Release: 1997
Genre: Artificial intelligence
ISBN:

Download Laboratory for Computer Science Progress Report Book in PDF, Epub and Kindle

Advances in Artificial Intelligence and Security

Advances in Artificial Intelligence and Security
Author: Xingming Sun
Publisher: Springer Nature
Total Pages: 751
Release: 2022-07-08
Genre: Computers
ISBN: 3031067649

Download Advances in Artificial Intelligence and Security Book in PDF, Epub and Kindle

The 3-volume set CCIS 1586, CCIS 1587 and CCIS 1588 constitutes the refereed proceedings of the 8th International Conference on Artificial Intelligence and Security, ICAIS 2022, which was held in Qinghai, China, in July 2022. The total of 115 full papers and 53 short papers presented in this 3-volume proceedings was carefully reviewed and selected from 1124 submissions. The papers were organized in topical sections as follows: Part I: artificial intelligence; Part II: artificial intelligence; big data; cloud computing and security; multimedia forensics; Part III: encryption and cybersecurity; information hiding; IoT security.

Integer Programming and Related Areas

Integer Programming and Related Areas
Author: R.v. Randow
Publisher: Springer Science & Business Media
Total Pages: 349
Release: 2012-12-06
Genre: Business & Economics
ISBN: 3642464491

Download Integer Programming and Related Areas Book in PDF, Epub and Kindle