+612 9045 4394
 
CHECKOUT
Building Scalable Network Services : Theory and Practice - Cheng Jin

Building Scalable Network Services

Theory and Practice

Hardcover

Published: 30th November 2003
Ships: 7 to 10 business days
7 to 10 business days
RRP $399.99
$276.50
31%
OFF
or 4 easy payments of $69.13 with Learn more

Other Available Formats (Hide)

  • Paperback View Product Published: 30th September 2012
    $142.43

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.

Dedicationp. v
List of Figuresp. xi
List of Tablesp. xv
Prefacep. xvii
Acknowledgmentsp. xix
Network Servicesp. 1
Introductionp. 1
Network Services Architecturep. 3
Summaryp. 4
The Idmaps Measurement Infrastructurep. 5
Design Goals of IDMapsp. 5
On Providing Latency Informationp. 7
IDMaps Architecturep. 8
A Scalable Design of IDMapsp. 9
Components of the Distance Mapp. 10
Tracer-Tracer Virtual Linksp. 10
Tracer-AP Virtual Linksp. 12
The Operations of IDMapsp. 13
Discovering APsp. 13
Distance Information Disseminationp. 14
Feasibility Studyp. 15
Latency Estimationp. 15
Server Selection Based on Latencyp. 18
Existing Placement Algorithms and Heuristicsp. 19
Simulating the Internet Topologyp. 23
Simulating IDMaps Infrastructurep. 24
Performance Metric Computationp. 25
Simulation Resultsp. 26
Summaryp. 29
Computing Logical Network Topologiesp. 31
Introductionp. 31
Problem Statementp. 32
Assumptionsp. 32
Problem Definitionp. 33
Line Topologyp. 35
Tree Topologyp. 36
General Topologyp. 40
TraP on General Topology Is NP-Completep. 40
Randomized Placement Algorithmsp. 40
Algorithms Based on the Sufficient Conditionp. 41
Two-Phase TraP Frameworkp. 42
[epsilon]-stretcher and Vertex Coverp. 43
[epsilon]*-stretcher and Vertex Coverp. 45
Computation and Storage Overheadp. 47
Open Problemp. 49
Summaryp. 49
Building Network Distance Maps in Practicep. 51
Introductionp. 51
Simulating the IDMaps Setupp. 52
Baseline Performancep. 53
Using Multiple Tracers for Each End-Hostp. 55
Maintaining Accurate TTVLsp. 60
Impact of Policy Routingp. 61
[epsilon]-treep. 63
Summaryp. 65
The Cache Location Problemp. 67
Introductionp. 67
Related Workp. 69
Model and Definitionsp. 70
Formal Modelp. 71
Hardness Resultsp. 73
Regular topologiesp. 74
Homogeneous Line with A Single Sourcep. 74
Homogeneous Line with Multiple Sourcesp. 76
General Linep. 76
Ring Networksp. 78
The Single Web Server Casep. 79
A Simple Greedy Algorithmp. 80
Motivating the Optimal Algorithmp. 81
Optimal Dynamic-Programming Algorithmp. 81
Experiments and Resultsp. 83
Data Collection and Methodologyp. 83
Resultsp. 84
Traffic Reductionp. 84
Comparison with Common Practicep. 86
Comparing the Algorithms' Performancep. 88
Stabilityp. 90
Discussionp. 94
Stability Statisticsp. 96
Constrained Mirror Placementp. 99
Introductionp. 99
Related Workp. 100
Constrained Mirror Placementp. 101
Optimization Condition OC(M, p)p. 102
Mirror Placement Algorithms and Heuristicsp. 103
Min K-centerp. 104
l-Greedyp. 104
Cost-adjustable Set Coverp. 105
Heuristicsp. 108
Performance Evaluationp. 108
Simulation Setupp. 108
Internet Experimentsp. 109
Candidate Host Setp. 110
Client Setp. 111
Experiment Resultsp. 113
Optimization Condition OC(M, p)p. 114
Effect of [vertical bar]M[vertical bar] and P(M) on OC(M, p)p. 116
Mirror Load Distributionp. 117
Effect of [vertical bar]H[vertical bar] on OC(M, p)p. 119
Effect of Redirection Methodsp. 120
Further Internet Experiment Resultsp. 120
Summaryp. 120
Appendicesp. 125
Graph Theory Basicsp. 125
Basic Properties of Graphsp. 126
Algorithms on Graphsp. 126
Approximation Algorithmsp. 127
Referencesp. 129
Indexp. 135
Table of Contents provided by Ingram. All Rights Reserved.

ISBN: 9781402076565
ISBN-10: 1402076568
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 139
Published: 30th November 2003
Publisher: Springer-Verlag New York Inc.
Country of Publication: US
Dimensions (cm): 23.5 x 15.5  x 0.53
Weight (kg): 0.91