Skip to Content
Optimization of Computer Networks
book

Optimization of Computer Networks

by Pablo Pavón Mariño
May 2016
Intermediate to advanced
420 pages
12h 48m
English
Wiley
Content preview from Optimization of Computer Networks

Index

  1. ABR (Available Bit Rate)
  2. absorbing states
  3. ACK
    1. delayed
  4. acknowledgement segment. See ACK
  5. ACO (ant-colony optimization)
    1. pheromones
  6. Active Queue Management. See AQM
  7. adaptive routing
    1. blocking probability
    2. dual algorithm
    3. non-bifurcated instability
    4. primal algorithm
  8. admissible directions
  9. admissible path
  10. AIMD (Additive Increase Multiplicative Decrease)
  11. algorithm complexity
    1. asymptotic
    2. cubic
    3. deterministic algorithm
    4. non-deterministic algorithm
    5. notations
    6. quadratic
    7. space
    8. sub-polynomial
    9. types
    10. worst-case
  12. algorithmic problem
  13. algorithms
    1. centralized
    2. distributed
    3. stop condition
  14. Aloha-type algorithm
  15. anycast
    1. demands
    2. routing
  16. approximation ratio
  17. AQM (Active Queue Management)
  18. aspiration criterion. See TS (tabu search), aspiration criterion
  19. asynchronous algorithm. See partially asynchronous algorithm
  20. ATM
  21. availability
    1. five nines
    2. general model
    3. simplified model
    4. typical values
  22. Available Bit Rate (ABR)
  23.  
  24. backlog
  25. back-off time (CSMA)
    1. Binary Exponential Backoff (BEB)
    2. IEEE
    3. optimization. See CSMA (Carrier Sense Multiple Access), backoff optimization
    4. simplified model
  26. back-pressure routing
    1. in cross-layer congestion control
    2. pressure difference threshold
  27. ball
  28. bandwidth, unused
  29. bandwidth assignment problem. See congestion control
  30. bandwidth-delay product
  31. barrier functions
  32. barrier method. See interior penalty method
  33. base stations. See BS
  34. BGP Link-State (BGP-LS)
  35. Binary Exponential Backoff (BEB)
  36. binary programs
  37. blocking probability
    1. complete sharing
    2. link model
    3. load sharing
    4. multicast
    5. multiclass ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

AirBnbBlueOriginElectronic ArtsHomeDepotNasdaqRakutenTata Consultancy Services

QuotationMarkO’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
QuotationMarkI wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
QuotationMarkI’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
QuotationMarkI'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Mark W.
Embedded Software Engineer

You might also like

Computer and Communication Networks

Computer and Communication Networks

Nader F. Mir
Complex Networks

Complex Networks

Kayhan Erciyes

Publisher Resources

ISBN: 9781119013358Purchase book