Cantitate/Preț
Produs

Building Scalable Network Services: Theory and Practice

Autor Cheng Jin, Sugih Jamin, Danny Raz, Yuval Shavitt
en Limba Engleză Hardback – 30 noi 2003
Building Scalable Network Services: Theory and Practice is on building scalable network services on the Internet or in a network service provider's network. The focus is on network services that are provided through the use of a set of servers. The authors present a tiered scalable network service model and evaluate various services within this architecture. The service model simplifies design tasks by implementing only the most basic functionalities at lower tiers where the need for scalability dominates functionality.
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 61485 lei  6-8 săpt.
  Springer Us – 30 sep 2012 61485 lei  6-8 săpt.
Hardback (1) 62074 lei  6-8 săpt.
  Springer Us – 30 noi 2003 62074 lei  6-8 săpt.

Preț: 62074 lei

Preț vechi: 77592 lei
-20% Nou

Puncte Express: 931

Preț estimativ în valută:
11880 12533$ 9900£

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

Public țintă

Research

Cuprins

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.