Sharing Network Resources (Record no. 84715)

000 -LEADER
fixed length control field 03914nam a22005415i 4500
001 - CONTROL NUMBER
control field 978-3-031-79266-3
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730163532.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2014 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031792663
-- 978-3-031-79266-3
082 04 - CLASSIFICATION NUMBER
Call Number 006.3
100 1# - AUTHOR NAME
Author Parekh, Abhey.
245 10 - TITLE STATEMENT
Title Sharing Network Resources
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2014.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XVIII, 132 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Learning, Networks, and Algorithms,
520 ## - SUMMARY, ETC.
Summary, etc Resource Allocation lies at the heart of network control. In the early days of the Internet the scarcest resource was bandwidth, but as the network has evolved to become an essential utility in the lives of billions, the nature of the resource allocation problem has changed. This book attempts to describe the facets of resource allocation that are most relevant to modern networks. It is targeted at graduate students and researchers who have an introductory background in networking and who desire to internalize core concepts before designing new protocols and applications. We start from the fundamental question: what problem does network resource allocation solve? This leads us, in Chapter 1, to examine what it means to satisfy a set of user applications that have different requirements of the network, and to problems in Social Choice Theory. We find that while capturing these preferences in terms of utility is clean and rigorous, there are significant limitations to this choice. Chapter 2 focuses on sharing divisible resources such as links and spectrum. Both of these resources are somewhat atypical -- a link is most accurately modeled as a queue in our context, but this leads to the analytical intractability of queueing theory, and spectrum allocation methods involve dealing with interference, a poorly understood phenomenon. Chapters 3 and 4 are introductions to two allocation workhorses: auctions and matching. In these chapters we allow the users to game the system (i.e., to be strategic), but don't allow them to collude. In Chapter 5, we relax this restriction and focus on collaboration. Finally, in Chapter 6, we discuss the theoretical yet fundamental issue of stability. Here, our contribution is mostly on making a mathematically abstruse subdiscipline more accessible without losing too much generality.
700 1# - AUTHOR 2
Author 2 Walrand, Jean.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-79266-3
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2014.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial intelligence.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Cooperating objects (Computer systems).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Programming languages (Electronic computers).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Telecommunication.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial Intelligence.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Cyber-Physical Systems.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Programming Language.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Communications Engineering, Networks.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2690-4314
912 ## -
-- ZDB-2-SXSC

No items available.