ഇംഗ്ലീഷ് [en], .epub, 🚀/lgli/lgrs/upload/zlib, 30.0MB, 📘 പുസ്തകം (നോൺ-ഫിക്ഷൻ), upload/bibliotik/M/Mathematical Foundations of Computer Networking.epub

Addison-Wesley Professional, Addison-Wesley Professional Computing Series, 1, 2012

വിവരണം

“To design future networks that are worthy of society’s trust, we must put the ‘discipline’ of computer networking on a much stronger foundation. This book rises above the considerable minutiae of today’s networking technologies to emphasize the long-standing mathematical underpinnings of the field.”

–Professor Jennifer Rexford, Department of Computer Science, Princeton University

“This book is exactly the one I have been waiting for the last couple of years. Recently, I decided most students were already very familiar with the way the net works but were not being taught the fundamentals – the math. This book contains the knowledge for people who will create and understand future communications systems."

–Professor Jon Crowcroft, The Computer Laboratory, University of Cambridge

The Essential Mathematical Principles Required to Design, Implement, or Evaluate Advanced Computer Networks

Students, researchers, and professionals in computer networking require a firm conceptual understanding of its foundations. Mathematical Foundations of Computer Networking provides an intuitive yet rigorous introduction to these essential mathematical principles and techniques.

Assuming a basic grasp of calculus, this book offers sufficient detail to serve as the only reference many readers will need. Each concept is described in four ways: intuitively; using appropriate mathematical notation; with a numerical example carefully chosen for its relevance to networking; and with a numerical exercise for the reader.

The first part of the text presents basic concepts, and the second part introduces four theories in a progression that has been designed to gradually deepen readers’ understanding. Within each part, chapters are as self-contained as possible.

The first part covers probability; statistics; linear algebra; optimization; and signals, systems, and transforms. Topics range from Bayesian networks to hypothesis testing, and eigenvalue computation to Fourier transforms.

These preliminary chapters establish a basis for the four theories covered in the second part of the book: queueing theory, game theory, control theory, and information theory. The second part also demonstrates how mathematical concepts can be applied to issues such as contention for limited resources, and the optimization of network responsiveness, stability, and throughput.

മെറ്റാഡാറ്റാ അഭിപ്രായങ്ങൾ

Includes index.

മെറ്റാഡാറ്റാ അഭിപ്രായങ്ങൾ

lg855632

മെറ്റാഡാറ്റാ അഭിപ്രായങ്ങൾ

പര്യായ ശീർഷകം

Mathematical Foundations of Computer Networking (Addison-Wesley Professional Computing Series)

പര്യായ എഴുത്തുകാരൻ

Keshav, Srinivasan

പര്യായ പ്രസാധകൻ

Pearson Education, Limited

പര്യായ പ്രസാധകൻ

Addison Wesley

പര്യായ പതിപ്പ്

Addison-Wesley professional computing series, Upper Saddle River, NJ, ©2012

പര്യായ പതിപ്പ്

Addison-Wesley Professional Computing Ser, Hoboken, 2012

പര്യായ പതിപ്പ്

Addison-Wesley Professional Computing Ser, Sydney, 2012

പര്യായ പതിപ്പ്

Upper Saddle River, NJ, New Jersey, 2012

പര്യായ വിവരണം

“To design future networks that are worthy of society’s trust, we must put the ‘discipline’ of computer networking on a much stronger foundation. This book rises above the considerable minutiae of today’s networking technologies to emphasize the long-standing mathematical underpinnings of the field.” –Professor Jennifer Rexford, Department of Computer Science, Princeton University “This book is exactly the one I have been waiting for the last couple of years. Recently, I decided most students were already very familiar with the way the net works but were not being taught the fundamentals–the math. This book contains the knowledge for people who will create and understand future communications systems." –Professor Jon Crowcroft, The Computer Laboratory, University of Cambridge The Essential Mathematical Principles Required to Design, Implement, or Evaluate Advanced Computer Networks Students, researchers, and professionals in computer networking require a firm conceptual understanding of its foundations. Mathematical Foundations of Computer Networking provides an intuitive yet rigorous introduction to these essential mathematical principles and techniques. Assuming a basic grasp of calculus, this book offers sufficient detail to serve as the only reference many readers will need. Each concept is described in four ways: intuitively; using appropriate mathematical notation; with a numerical example carefully chosen for its relevance to networking; and with a numerical exercise for the reader. The first part of the text presents basic concepts, and the second part introduces four theories in a progression that has been designed to gradually deepen readers’ understanding. Within each part, chapters are as self-contained as possible. The first part covers probability; statistics; linear algebra; optimization; and signals, systems, and transforms. Topics range from Bayesian networks to hypothesis testing, and eigenvalue computation to Fourier transforms. These preliminary chapters establish a basis for the four theories covered in the second part of the book: queueing theory, game theory, control theory, and information theory. The second part also demonstrates how mathematical concepts can be applied to issues such as contention for limited resources, and the optimization of network responsiveness, stability, and throughput.

പര്യായ വിവരണം

Mathematical techniques pervade current research in computer networking, yet are not taught to most computer science undergraduates. This self-contained, highly-accessible book bridges the gap, providing the mathematical grounding students and professionals need to successfully design or evaluate networking systems. The only book of its kind, it brings together information previously scattered amongst multiple texts. It first provides crucial background in basic mathematical tools, and then illuminates the specific theories that underlie computer networking. Coverage includes: <br>

• Basic probability: Bayes' rule, random variables, distributions, expectations, theorems, and Bayesian networks <br>

• Statistics: sampling, population parameters, comparing outcomes, fitting, dependence, and managing large data sets <br>

• Linear Algebra: vectors, matrices, matrix algebra, linear equations, Cramers theorem, linear transformations, and more <br>

• Optimization: linear, non-linear, Lagrangian, and many other techniques, including genetic algorithms <br>

• Signals, Systems, and Transforms, including Fourier series and transforms, Laplace transforms, DFT, FFT, and Z transforms <br>

• Queuing theory: stochastic and Markov processes; Markov analysis, M/M/1 queues <br>

• Game Theory: preferences, utilities, terminologies, solution concepts, mechanism design <br>

• Control theory: system modeling, digital control, design techniques, and stability <br>

• Information theory: information, entropy, channels, and more

പര്യായ വിവരണം

"Mathematical Foundations of Computer Networking" provides an intuitive yet rigorous introduction to these essential mathematical principles and techniques. Assuming a basic grasp of calculus, this book offers sufficient detail to serve as the only reference many readers will need. Each concept is described in four ways: intuitively; using appropriate mathematical notation; with a numerical example carefully chosen for its relevance to networking; and with a numerical exercise for the reader. The first part of the text presents basic concepts, and the second part introduces four theories in a progression that has been designed to gradually deepen readers' understanding. Within each part, chapters are as self-contained as possible. The first part covers probability; statistics; linear algebra; optimization; and signals, systems, and transforms. Topics range from Bayesian networks to hypothesis testing, and eigenvalue computation to Fourier transforms. These preliminary chapters establish a basis for the four theories covered in the second part of the book: queueing theory, game theory, control theory, and information theory. The second part also demonstrates how mathematical concepts can be applied to issues such as contention for limited resources, and the optimization of network responsiveness, stability, and throughput

പര്യായ ഫയൽനേം

lgrsnf/Addison.Wesley.Mathematical.Foundations.of.Computer.Networking.Apr.2012

പര്യായ ഫയൽനേം

lgli/Addison.Wesley.Mathematical.Foundations.of.Computer.Networking.Apr.2012

തുറന്ന സോഴ്സ് ചെയ്ത തീയതി

2012-08-02 — upload_record_date: 2024-06-28, oclc_scrape: 2023-10-01, ol_source: 2021-11-03, isbndb_scrape: 2022-09-01, lgli_source: 2012-08-02, zlib_source: 2019-04-09, lgrsnf_source: 2012-08-02