Building Scalable Network Services: Theory and Practice
Autor Cheng Jin, Sugih Jamin, Danny Raz, Yuval Shavitten Limba Engleză Hardback – 30 noi 2003
The book includes a number of theoretical results that are practical and applicable to real networks, such as building network-wide measurement, monitoring services, and strategies for building better P2P networks. Various issues in scalable system design and placement algorithms for service nodes are discussed. Using existing network services as well as potentially new but useful services as examples, the authors formalize the problem of placing service nodes and provide practical solutions for them.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 614.85 lei 6-8 săpt. | |
Springer Us – 30 sep 2012 | 614.85 lei 6-8 săpt. | |
Hardback (1) | 620.74 lei 6-8 săpt. | |
Springer Us – 30 noi 2003 | 620.74 lei 6-8 săpt. |
Preț: 620.74 lei
Preț vechi: 775.92 lei
-20% Nou
Puncte Express: 931
Preț estimativ în valută:
118.80€ • 125.33$ • 99.00£
118.80€ • 125.33$ • 99.00£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781402076565
ISBN-10: 1402076568
Pagini: 162
Ilustrații: XIX, 139 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:2004
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 1402076568
Pagini: 162
Ilustrații: XIX, 139 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:2004
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
1. Network Services.- 2. The Idmaps Measurement Infrastructure.- 3. Computing Logical Network Topologies.- 4. Building Network Distance Maps In Practice.- 5. The Cache Location Problem.- 6. Constrained Mirror Placement.- Appendices.- A Graph Theory Basics.- A.1 Basic Properties of Graphas.- A.2 Algorithms on Graphs.- A.3 Approximation Algorithms.- References.