Computer networking and communications Books

1912 products


  • 7 in stock

    £46.74

  • Clio Wired

    Columbia University Press Clio Wired

    1 in stock

    Book SynopsisTrade ReviewFor the archivist, these essays ask provocative questions and point to some interesting opportunities, both for repositories and users. -- Christine D'Arpa Archival Issues teachers esepcially should welcome this collection Journal of American HistoryTable of ContentsIntroduction: Roy Rosenzweig: Scholarship as Community, by Anthony Grafton Note to Readers, by Deborah Kaplan Rethinking History in New Media 1. Scarcity or Abundance? Preserving the Past 2. Web of Lies? Historical Knowledge on the Internet, with Daniel J. Cohen 3. Wikipedia: Can History Be Open Source? Practicing History in New Media: Teaching, Researching, Presenting, Collecting 4. Historians and Hypertext: Is It More Than Hype?, with Steve Brier 5. Rewiring the History and Social Studies Classroom: Needs, Frameworks, Dangers, Proposals, with Randy Bass 6. The Riches of Hypertext for Scholarly Journals 7. Should Historical Scholarship Be Free? 8. Collecting History Online Surveying History in New Media 9. Brave New World or Blind Alley? American History on the World Wide Web, with Michael O'Malley 10. Wizards, Bureaucrats, Warriors, and Hackers: Writing the History of the Internet 11. The Road to Xanadu: Public and Private Pathways on the History Web Acknowledgments Notes Index

    1 in stock

    £83.60

  • Internet Measurement

    John Wiley & Sons Inc Internet Measurement

    Book SynopsisThis book provides all the ingredients necessary for a full understanding of the increasingly important discipline of Internet Measurement ranging from its role in the different layers of architecture to the various applications where it plays a critical role. This book and its subject help to build foundational knowledge for other areas of internet and computing courses particularly in regard to internet security, whose subject matter depend upon information derived from this source. Students studying courses that look at web applications or P2P file-sharingapplications will find this book provides crucial information for their subject areas. The experience of the authors, who are at the heart of the Internet Measurement community, and the emerging importance of the discipline make this the authoratitive and defining book of the field.Trade Review"The book will be a valuable resource for students and researchers starting to work on internet measurements." (IEEE Network Magazine, May/June 2007)Table of ContentsAcknowledgments xxi I Background 1 1 Introduction 3 1.1 Why Measure the Internet? 5 1.2 How to Read this Book 6 1.3 Resources for More Information 10 2 Internet Architecture 13 2.1 The Internet’s Architecture 13 2.1.1 The History of the Internet 14 2.1.2 The Organization of the Internet 17 2.1.3 Design Principles of the Internet 22 2.2 Details of Internet Operation 25 2.2.1 Endsystems, Links, and Routers 25 2.2.2 Autonomous Systems 26 2.2.3 Routing 26 2.3 Protocols 31 2.3.1 IP 32 2.3.2 TCP 33 2.3.3 UDP 34 2.3.4 Routing Protocols 35 2.3.5 ICMP 35 2.3.6 SNMP 36 2.3.7 IP Multicast 37 2.3.8 DNS 37 2.3.9 HTTP 39 2.3.10 P2P 40 2.4 Applications 42 3 Analytic Background 45 3.1 Linear Algebra 45 3.2 Probability 48 3.2.1 Background 49 3.2.2 Special Issues in the Internet 55 3.3 Statistics 58 3.3.1 Background 58 3.3.2 Special Issues in the Internet 61 3.4 Graphs 64 3.4.1 Background 64 3.4.2 Special Issues in the Internet 66 3.5 Metrics 70 3.6 Measurement and Modeling 73 3.6.1 Models in General 73 3.6.2 The Use of Probability Models 76 4 Practical Issues in Internet Measurement 79 4.1 Where can Measurements be Made? 80 4.1.1 Local Area Network 82 4.1.2 Inside a Backbone 82 4.1.3 Entry Points into a Network 84 4.1.4 Mirror Sites/Network Exchange Points 86 4.1.5 Wide Area Network 87 4.2 Role of Time 89 4.2.1 Background 90 4.2.2 Sources of Time Information 91 4.2.3 Synchronized Time 93 4.3 Role of Internet Directories and Databases 94 4.3.1 Internet Address and Routing Registries 95 4.3.2 Domain Name System 97 4.3.3 Measurement-related Issues in Dealing with Databases 98 4.4 Measurements Across Various Protocol Layers 99 4.4.1 Issues in Capturing Data 99 4.4.2 Changes to Infrastructure/Instrumentation 102 4.4.3 Local vs Remote vs Distributed Data Gathering 103 4.4.4 Measurement on Overlays 104 II In Depth 105 5 Infrastructure 107 5.1 Properties 107 5.1.1 Physical Device Properties 107 5.1.2 Topology Properties 111 5.1.3 Interaction of Traffic and Network 112 5.2 Challenges 115 5.2.1 Core Simplicity 115 5.2.2 Hidden Layers 116 5.2.3 Hidden Pieces 116 5.2.4 Administrative Barriers 117 5.3 Tools 117 5.3.1 Active Measurement 118 5.3.2 Passive Measurement 124 5.3.3 Fused Measurements 127 5.3.4 Bandwidth Measurement 127 5.3.5 Latency Measurement and Estimation 136 5.3.6 Geolocation 142 5.3.7 Inference 147 5.3.8 Other Tools 152 5.4 State of the Art 152 5.4.1 Equipment Properties 153 5.4.2 Topology Properties 154 5.4.3 Interaction of Traffic and Network 165 6 Traffic 171 6.1 Properties 172 6.1.1 The Basics: Packets and Bytes 172 6.1.2 Higher-level Structure 173 6.1.3 Flows 175 6.1.4 Semantically Distinct Traffic Types 176 6.2 Challenges 176 6.2.1 Practical Issues 177 6.2.2 Statistical Difficulties 179 6.3 Tools 188 6.3.1 Packet Capture 188 6.3.2 Data Management 191 6.3.3 Data Reduction 192 6.3.4 Inference 212 6.4 State of the Art 215 6.4.1 Packets and Bytes 216 6.4.2 Higher-level Structure 234 6.4.3 Flows 236 6.4.4 Control Traffic 238 6.4.5 Wireless 239 7 Applications 241 7.1 Application Mix 242 7.2 DNS 244 7.2.1 DNS Measurement Properties 245 7.2.2 DNS Measurement Challenges 248 7.2.3 DNS Measurement Tools 251 7.2.4 Use of DNS in Other Applications 256 7.2.5 State of the Art 258 7.3 Web 269 7.3.1 Web Measurement Properties 270 7.3.2 Web Measurement Challenges 273 7.3.3 Web Measurement Tools 278 7.3.4 State of the Art 286 7.4 P2P 309 7.4.1 P2P Measurement Properties 310 7.4.2 P2P Measurement Challenges 314 7.4.3 P2P Measurement Tools 317 7.4.4 State of the Art 321 7.5 Online Games 331 7.5.1 Games and Measurement Properties 332 7.5.2 Networked Games Measurement Challenges 337 7.5.3 State of the Art 340 7.6 Other Applications 346 7.6.1 Streaming Multimedia 346 III In Perspective 353 8 Anonymization 355 8.1 Definitions 356 8.2 General Motivation for Anonymizing Data 357 8.3 Obstacles and Risks in Sharing Data 358 8.4 What Should be Anonymized: Data Categorization 360 8.5 How Data is Anonymized: Process and Techniques 365 8.5.1 Anonymization Process 365 8.5.2 Anonymization Techniques 367 8.6 Anonymization Examples at Different Layers 369 8.6.1 Configuration Data 369 8.6.2 Router-level Data 370 8.6.3 Packet-level Traces 370 8.6.4 Application-level Data 373 8.7 Attacks Against Anonymized Data 374 8.8 Anonymizing Data: Metrics for Success 376 8.9 Alternatives to Anonymization 377 9 Security 379 9.1 Role of Internet Measurement in Security 380 9.2 Intranet Measurements in Aid of Security 382 9.3 Gateway Measurements in Aid of Security 384 9.4 Inter-domain Measurements Impact on Security 386 9.5 Wide-area Measurements in Aid of Security 387 9.6 Application-level Measurements of Attacks 394 10 Case Studies 395 10.1 Low-level Monitoring Tools 395 10.2 Individual Toolsets for Network Measurement 397 10.2.1 Windmill 398 10.2.2 Click 399 10.2.3 dss 400 10.2.4 Gigascope 403 10.3 Large-scale Measurement Projects 404 10.3.1 RIPE 405 10.3.2 High-energy Physics 407 10.3.3 CAIDA 410 10.3.4 PlanetLab 414 11 Conclusions and Prospects 419 11.1 Trends in Internet Measurement 419 11.2 Difficulties 424 11.3 Future Work 426 11.3.1 Research Challenges 426 11.3.2 Emerging Questions 428 Bibliography 431 Index 473

    £53.19

  • Web Engineering The Discipline of Systematic

    John Wiley & Sons Inc Web Engineering The Discipline of Systematic

    Book SynopsisThe World Wide Web has a massive and permanent influence on our lives. Economy, industry, education, healthcare, public administration, entertainment - there is hardly any part of our daily lives which has not been pervaded by the Internet.Table of ContentsPreface xv Foreword xvii 1 An Introduction to Web Engineering 1Gerti Kappel, Birgit Pröll, Siegfried Reich, Werner Retschitzegger 1.1 Motivation 1 1.2 Categories of Web Applications 4 1.3 Characteristics of Web Applications 7 1.3.1 Product-related Characteristics 8 1.3.2 Usage-related Characteristics 12 1.3.3 Development-related Characteristics 14 1.3.4 Evolution 16 1.4 Objectives and Structure of the Book 17 2 Requirements Engineering for Web Applications 23Paul Grünbacher 2.1 Introduction 23 2.2 Fundamentals 24 2.2.1 Where Do Requirements Come From? 24 2.2.2 Requirements Engineering Activities 25 2.3 RE Specifics in Web Engineering 26 2.4 Principles for RE of Web Applications 30 2.5 Adapting RE Methods to Web Application Development 32 2.5.1 Requirement Types 32 2.5.2 Notations 34 2.5.3 Tools 36 2.6 Outlook 37 3 Modeling Web Applications 39Wieland Schwinger, Nora Koch 3.1 Introduction 39 3.2 Fundamentals 40 3.3 Modeling Specifics in Web Engineering 41 3.3.1 Levels 41 3.3.2 Aspects 42 3.3.3 Phases 42 3.3.4 Customization 43 3.4 Modeling Requirements 43 3.5 Content Modeling 45 3.5.1 Objectives 45 3.5.2 Concepts 45 3.6 Hypertext Modeling 46 3.6.1 Objectives 47 3.6.2 Hypertext Structure Modeling Concepts 47 3.6.3 Access Modeling Concepts 49 3.6.4 Relation to Content Modeling 50 3.7 Presentation Modeling 51 3.7.1 Objectives 51 3.7.2 Concepts 51 3.7.3 Relation to Hypertext Modeling 52 3.8 Customization Modeling 53 3.8.1 Objectives 54 3.8.2 Concepts 54 3.8.3 Relation to Content, Hypertext, and Presentation Modeling 58 3.9 Methods and Tools 58 3.9.1 Modeling Methods: An Overview 58 3.9.2 Model-Driven Development 61 3.9.3 Tool Support 61 3.10 Outlook 63 4 Web Application Architectures 65Christian Eichinger 4.1 Introduction 65 4.2 Fundamentals 66 4.2.1 What is an Architecture? 66 4.2.2 Developing Architectures 67 4.2.3 Categorizing Architectures 69 4.3 Specifics of Web Application Architectures 70 4.4 Components of a Generic Web Application Architecture 71 4.5 Layered Architectures 72 4.5.1 2-Layer Architectures 72 4.5.2 N-Layer Architectures 73 4.6 Data-aspect Architectures 79 4.6.1 Database-centric Architectures 80 4.6.2 Architectures for Web Document Management 80 4.6.3 Architectures for Multimedia Data 81 4.7 Outlook 84 5 Technology-aware Web Application Design 85Gerhard Austaller, Andreas Hartl, Markus Lauff, Fernando Lyardet, Max Mühlhaüser 5.1 Introduction 86 5.2 Web Design from an Evolutionary Perspective 89 5.2.1 Background 89 5.2.2 Information Design: An Authoring Activity 90 5.2.3 Software Design: A Programming Activity 92 5.2.4 Merging Information Design and Software Design 93 5.2.5 Problems and Restrictions in Integrated Web Design 94 5.2.6 A Proposed Structural Approach 95 5.3 Presentation Design 95 5.3.1 Presentation of Nodes and Meshes 96 5.3.2 Device-independent Development Approaches 97 5.4 Interaction Design 98 5.4.1 User Interaction 98 5.4.2 User Interface Organization 100 5.4.3 Navigation Design 101 5.4.4 Designing a Link Representation: The Anchor 101 5.4.5 Designing Link Internals: The URL 102 5.4.6 Navigation and Orientation 102 5.4.7 Structured Dialog for Complex Activities 103 5.4.8 Interplay with Technology and Architecture 104 5.5 Functional Design 105 5.5.1 Integration 105 5.5.2 Communication Paradigms and Middleware 105 5.5.3 Distributed Cross-corporate Web Applications 106 5.6 Outlook 107 5.6.1 Context-aware Applications 107 5.6.2 Device-independent Applications 108 5.6.3 Reusability 109 5.7 Summary 110 6 Technologies for Web Applications 111Martin Nussbaumer, Martin Gaedke 6.1 Introduction 111 6.2 Fundamentals 112 6.2.1 Markup 112 6.2.2 Hypertext and Hypermedia 112 6.3 Client/Server Communication on the Web 113 6.3.1 SMTP – Simple Mail Transfer Protocol. 113 6.3.2 RTSP – Real Time Streaming Protocol 113 6.3.3 HTTP – HyperText Transfer Protocol 113 6.3.4 Session Tracking 114 6.4 Client-side Technologies 116 6.4.1 Helpers and Plug-ins 116 6.4.2 Java Applets 116 6.4.3 ActiveX Controls 116 6.5 Document-specific Technologies 117 6.5.1 HTML – Hypertext Markup Language 117 6.5.2 SVG – Scalable Vector Graphics 117 6.5.3 SMIL – Synchronized Multimedia Integration Language 118 6.5.4 XML – eXtensible Markup Language 118 6.5.5 XSL – eXtensible Stylesheet Language 122 6.6 Server-side Technologies 126 6.6.1 URI Handlers 126 6.6.2 Web Services 129 6.6.3 Middleware Technologies 130 6.7 Outlook 132 7 Testing Web Applications 133Christoph Steindl, Rudolf Ramler, Josef Altmann 7.1 Introduction 133 7.2 Fundamentals 134 7.2.1 Terminology 134 7.2.2 Quality Characteristics 135 7.2.3 Test Objectives 136 7.2.4 Test Levels 136 7.2.5 Role of the Tester 137 7.3 Test Specifics in Web Engineering 138 7.4 Test Approaches 140 7.4.1 Conventional Approaches 140 7.4.2 Agile Approaches 140 7.5 Test Scheme 142 7.5.1 Three Test Dimensions 142 7.5.2 Applying the Scheme to Web Applications 143 7.5.3 Examples of Using the Test Scheme 145 7.6 Test Methods and Techniques 145 7.6.1 Link Testing 147 7.6.2 Browser Testing 147 7.6.3 Usability Testing 148 7.6.4 Load, Stress, and Continuous Testing 148 7.6.5 Testing Security 149 7.6.6 Test-driven Development 150 7.7 Test Automation 150 7.7.1 Benefits and Drawbacks of Automated Tests 150 7.7.2 Test Tools 151 7.7.3 Selecting Test Tools 152 7.8 Outlook 152 8 Operation and Maintenance of Web Applications 155Arno Ebner, Birgit Pröll, Hannes Werthner 8.1 Introduction 155 8.2 Challenges Following the Launch of a Web Application 156 8.3 Promoting a Web Application 157 8.3.1 Newsletters 158 8.3.2 Affiliate Marketing 158 8.3.3 Search Engine Marketing 159 8.3.4 Content-related Marketing 162 8.3.5 Domain Management 162 8.4 Content Management 163 8.4.1 Content Update Rate and Demand on Currency 164 8.4.2 Content Syndication 165 8.5 Usage Analysis 165 8.5.1 Usage Analysis Techniques 165 8.5.2 Statistical Indicators 167 8.5.3 User Behavior Analysis 168 8.6 Outlook 169 9 Web Project Management 171Herwig Mayr 9.1 From Software Project Management to Web Project Management 171 9.1.1 Objectives of Software Project Management 171 9.1.2 The Tasks of Software Project Management 172 9.1.3 Conflicting Areas in Projects 173 9.1.4 Specifics of Web Project Management 173 9.2 Challenges in Web Project Management 175 9.2.1 General Challenges in Software Development 175 9.2.2 Development-related Challenges in Web Projects 176 9.2.3 Product-related Challenges in Web Projects 179 9.3 Managing Web Teams 182 9.3.1 Software Development: A Human-centered Task 182 9.3.2 The Web Project Team 183 9.3.3 The Web Project Manager 184 9.4 Managing the Development Process of a Web Application 185 9.4.1 Deploying the Tools 185 9.4.2 Measuring Progress 188 9.4.3 Project Risks 190 9.4.4 Risk Management 193 9.5 Outlook 194 10 The Web Application Development Process 197Gregor Engels, Marc Lohmann, Annika Wagner 10.1 Motivation 197 10.2 Fundamentals 198 10.3 Requirements for a Web Application Development Process 201 10.3.1 Handling Short Development Cycles 201 10.3.2 Handling Changing Requirements 201 10.3.3 Releases with Fixed Deadlines and Flexible Contents 203 10.3.4 Parallel Development of Different Releases 203 10.3.5 Reuse and Integration 204 10.3.6 Adapting to Web Application’s Complexity Level 204 10.3.7 Summary 205 10.4 Analysis of the Rational Unified Process 205 10.4.1 Introduction 205 10.4.2 General Suitability for Web Application Development 208 10.4.3 Does RUP meet the Requirements of Web Applications? 209 10.5 Analysis of Extreme Programming 211 10.5.1 Introduction 211 10.5.2 Does XP meet the Requirements of Web Application Development? 214 10.6 Outlook 216 11 Usability of Web Applications 219Martin Hitz, Gerhard Leitner, Rudolf Melcher 11.1 Motivation 219 11.2 What is Usability? 220 11.3 What Characterizes the Usability of Web Applications? 222 11.4 Design Guidelines 225 11.4.1 Response Times 225 11.4.2 Interaction Efficiency 225 11.4.3 Colors 226 11.4.4 Text Layout 227 11.4.5 Page Structure 228 11.4.6 Navigation Structure 228 11.4.7 Multiculturality 230 11.4.8 Confidence-generating Measures 231 11.4.9 Other Design Criteria 232 11.5 Web Usability Engineering Methods 232 11.5.1 Requirements Analysis 234 11.5.2 Design 237 11.5.3 Implementation 238 11.5.4 Operation 238 11.6 Web Usability Engineering Trends 239 11.6.1 Usability Patterns 239 11.6.2 Mobile Usability 241 11.6.3 Accessibility 243 11.7 Outlook 245 12 Performance of Web Applications 247Gabriele Kotsis 12.1 Introduction 247 12.2 What Is Performance? 248 12.3 What Characterizes the Performance of Web Applications? 250 12.4 System Definition and Indicators 251 12.5 Characterizing the Workload 252 12.6 Analytical Techniques 254 12.6.1 Operational Analysis 254 12.6.2 Queuing Networks and Simulation Models 255 12.6.3 Measuring Approaches 257 12.7 Representing and Interpreting Results 258 12.8 Performance Optimization Methods 259 12.8.1 Acceleration Within a Web Application 260 12.8.2 Reducing Transmission Time 261 12.8.3 Server Tuning 263 12.9 Outlook 263 13 Security for Web Applications 265Martin Wimmer, Alfons Kemper, Stefan Seltzsam 13.1 Introduction 265 13.2 Aspects of Security 266 13.3 Encryption, Digital Signatures and Certificates 268 13.3.1 Symmetric Cryptography 268 13.3.2 Asymmetric Cryptography 270 13.3.3 Digital Signatures 271 13.3.4 Certificates and Public Key Infrastructure 272 13.4 Secure Client/Server-Interaction 272 13.4.1 Point-to-Point Security 272 13.4.2 End-to-End Security 274 13.4.3 User Authentication and Authorization 276 13.4.4 Electronic Payment Systems 278 13.5 Client Security Issues 279 13.5.1 Preserving Privacy 279 13.5.2 Mobile Code Security 281 13.5.3 Phishing and Web Spoofing 282 13.5.4 Desktop Security 283 13.6 Service Provider Security Issues 285 13.6.1 Cross-Site Scripting 285 13.6.2 SQL Injection 287 13.6.3 Security of CGI Programs 289 13.6.4 Service Availability 290 13.6.5 Host Security 291 13.7 Outlook 292 14 The Semantic Web – The Network of Meanings in the Network of Documents 293Wernher Behrendt, Nitin Arora 14.1 Fundamentals of the Semantic Web 293 14.1.1 The Role of Software Agents 294 14.1.2 The Role of Semantic Markup 296 14.1.3 The Role of Ontologies 297 14.2 Technological Concepts 298 14.2.1 Agents According to the FIPA Standard 298 14.2.2 Ontologies 300 14.2.3 Semantic Markup on the Web 303 14.3 Specifics of Semantic Web Applications 308 14.3.1 Semantic Markup 308 14.3.2 Agents 309 14.3.3 Ontologies 309 14.3.4 Semantic Web Services 310 14.3.5 Integration into Web Engineering 313 14.4 Tools 314 14.5 Outlook 315 Glossary 317 Author Biographies 329 Bibliography 337 Credits 357 Index 359

    £48.44

  • Network Congestion Control Managing Internet

    John Wiley & Sons Inc Network Congestion Control Managing Internet

    Book SynopsisAs the Internet becomes increasingly heterogeneous, the issue of congestion control becomes ever more important. In order to maintain good network performance, mechanisms must be provided to prevent the network from being congested for any significant period of time.Trade Review"…a good supplement to the companion toolbox…" (Computing Reviews.com, May 19, 2006)Table of ContentsForeword. Preface. List of Tables. List of Figures. 1. Introduction . 1.1 Who should read this book? 1.2 Contents. 1.3 Structure. 2. Congestion control principles. 2.1 What is congestion? 2.2 Congestion collapse. 2.3 Controlling congestion: design considerations. 2.4 Implicit feedback. 2.5 Source behaviour with binary feedback. 2.6 Stability. 2.7 Rate-based versus window-based control. 2.8 RTT estimation. 2.9 Traffic phase effects. 2.10 Queue management. 2.11 Scalability. 2.12 Explicit feedback. 2.13 Special environments. 2.14 Congestion control and OSI layers. 2.15 Multicast congestion control. 2.16 Incentive issues. 2.17 Fairness. 2.18 Conclusion. 3. Present technology. 3.1 Introducing TCP. 3.2 TCP window management. 3.3 TCP RTO calculation. 3.4 TCP congestion control and reliability. 3.5 Concluding remarks about TCP. 3.6 The Stream Control Transmission Protocol (SCTP). 3.7 Random Early Detection (RED). 3.8 The ATM‘Available Bit Rate’ service. 4. Experimental enhancements. 4.1 Ensuring appropriate TCP behaviour. 4.2 Maintaining congestion state. 4.3 Transparent TCP improvements. 4.4 Enhancing active queue management. 4.5 Congestion control for multimedia applications. 4.6 Better-than-TCP congestion control. 4.7 Congestion control in special environments. 5. Internet traffic management – the ISP perspective. 5.1 The nature of Internet traffic. 5.2 Traffic engineering. 5.3 Quality of Service (QoS). 5.4 Putting it all together. 6. The future of Internet congestion control. 6.1 Small deltas or big ideas? 6.2 Incentive issues. 6.3 Tailor-made congestion control. Appendix A: Teaching congestion control with tools. A.1 CAVT. A.1.1 Writing script. A.1.2 Teaching with CAVT. A.1.3 Internals. A.2 ns. A.2.1 Using ns for teaching: the problem. A.2.2 Using ns for teaching: the solution. A.2.3 NSBM. A.2.4 Example exercises. Appendix B: Related IETF work. B.1 Overview. B.2 Working groups. B.3 Finding relevant documents. Appendix C: List of abbreviations. Bibliography. Index.

    £95.36

  • Ubiquitous Computing

    John Wiley & Sons Inc Ubiquitous Computing

    Book SynopsisThis book provides an introduction to the complex field of ubiquitous computing Ubiquitous Computing (also commonly referred to as Pervasive Computing) describes the ways in which current technological models, based upon three base designs: smart (mobile, wireless, service) devices, smart environments (of embedded system devices) and smart interaction (between devices), relate to and support a computing vision for a greater range of computer devices, used in a greater range of (human, ICT and physical) environments and activities. The author details the rich potential of ubiquitous computing, the challenges involved in making it a reality, and the prerequisite technological infrastructure. Additionally, the book discusses the application and convergence of several current major and future computing trends. Key Features: Provides an introduction to the complex field of ubiquitous computing Describes how current technology models based upon six different technology form factors which have varying degrees of mobility wireless connectivity and service volatility: tabs, pads, boards, dust, skins and clay, enable the vision of ubiquitous computing Describes and explores how the three core designs (smart devices, environments and interaction) based upon current technology models can be applied to, and can evolve to, support a vision of ubiquitous computing and computing for the future Covers the principles of the following current technology models, including mobile wireless networks, service-oriented computing, human computer interaction, artificial intelligence, context-awareness, autonomous systems, micro-electromechanical systems, sensors, embedded controllers and robots Covers a range of interactions, between two or more UbiCom devices, between devices and people (HCI), between devices and the physical world. Includes an accompanying website with PowerPoint slides, problems and solutions, exercises, bibliography and further reading Graduate students in computer science, electrical engineering and telecommunications courses will find this a fascinating and useful introduction to the subject. It will also be of interest to ICT professionals, software and network developers and others interested in future trends and models of computing and interaction over the next decades.Table of ContentsList of Figures xix List of Tables xxiii Preface xxv Acknowledgements xxvii 1 Ubiquitous Computing: Basics and Vision 1 1.1 Living in a Digital World 1 1.1.1 Chapter Overview 2 1.1.2 Illustrative Ubiquitous Computing Applications 2 1.1.2.1 Personal Memories 3 1.1.2.2 Adaptive Transport Scheduled Service 5 1.1.2.3 Foodstuff Management 5 1.1.2.4 Utility Regulation 6 1.1.3 Holistic Framework for UbiCom: Smart DEI 7 1.2 Modelling the Key Ubiquitous Computing Properties 8 1.2.1 Core Properties of UbiCom Systems 9 1.2.2 Distributed ICT Systems 9 1.2.2.1 Networked ICT Devices 10 1.2.2.2 Transparency and Openness 10 1.2.3 Implicit Human–Computer Interaction (iHCI) 11 1.2.3.1 The Calm Computer 11 1.2.3.2 Implicit Versus Explicit Human–Computer Interaction 12 1.2.3.3 Embodied Reality versus Virtual, Augmented and Mediated Reality 12 1.2.4 Context-Awareness 13 1.2.4.1 Three Main Types of Environment Context: Physical, User, Virtual 14 1.2.4.2 User-Awareness 14 1.2.4.3 Active Versus Passive Context-Awareness 15 1.2.5 Autonomy 15 1.2.5.1 Reducing Human Interaction 16 1.2.5.2 Easing System Maintenance Versus Self-Maintaining Systems 16 1.2.6 Intelligence 17 1.2.7 Taxonomy of UbiCom Properties 17 1.3 Ubiquitous System Environment Interaction 22 1.3.1 Human–ICT Device Interaction (HCI) 24 1.3.2 ICT Device to Physical World Interaction (CPI) 25 1.4 Architectural Design for UbiCom Systems: Smart DEI Model 26 1.4.1 Smart Devices 27 1.4.1.1 Weiser’s ICT Device Forms: Tabs, Pads and Boards 28 1.4.1.2 Extended Forms for ICT Devices: Dust, Skin and Clay 28 1.4.1.3 Mobility 29 1.4.1.4 Volatile Service Access 29 1.4.1.5 Situated and Self-Aware 30 1.4.2 Smart Environments 30 1.4.2.1 Tagging, Sensing and Controlling Environments 31 1.4.2.2 Embedded Versus Untethered 31 1.4.2.3 Device Sizes 32 1.4.3 Smart Interaction 32 1.4.3.1 Basic Interaction 32 1.4.3.2 Smart Interaction 33 1.5 Discussion 34 1.5.1 Interlinking System Properties, Environments and Designs 34 1.5.2 Common Myths about Ubiquitous Computing 35 1.5.3 Organisation of the Smart DEI Approach 37 Exercises 38 References 39 2 Applications and Requirements 41 2.1 Introduction 41 2.1.1 Overview 41 2.2 Example Early UbiCom Research Projects 41 2.2.1 Smart Devices: cci 42 2.2.1.1 Smart Boards, Pads and Tabs 42 2.2.1.2 Active Badge, Bat and Floor 42 2.2.2 Smart Environments: CPI and cci 43 2.2.2.1 Classroom 2000 43 2.2.2.2 Smart Space and Meeting Room 43 2.2.2.3 Interactive Workspaces and iRoom 44 2.2.2.4 Cooltown 44 2.2.2.5 EasyLiving and SPOT 45 2.2.2.6 HomeLab and Ambient Intelligence 46 2.2.3 Smart Devices: CPI 46 2.2.3.1 Unimate and MH-1 Robots 46 2.2.3.2 Smart Dust and TinyOS 47 2.2.4 Smart Devices: iHCI and HPI 48 2.2.4.1 Calm Computing 48 2.2.4.2 Things That Think and Tangible Bits 48 2.2.4.3 DataTiles 49 2.2.4.4 Ambient Wood 50 2.2.4.5 WearComp and WearCam 50 2.2.4.6 Cyborg 1.0 and 2.0 52 2.2.5 Other UbiCom Projects 52 2.3 Everyday Applications in the Virtual, Human and Physical World 53 2.3.1 Ubiquitous Networks of Devices: cci 53 2.3.2 Human–Computer Interaction 54 2.3.2.1 Ubiquitous Audio-Video Content Access 54 2.3.2.2 Ubiquitous Information Access and Ebooks 55 2.3.2.3 Universal Local Control of ICT Systems 56 2.3.2.4 User-Awareness and Personal Spaces 58 2.3.3 Human-to-Human Interaction (HHI) Applications 58 2.3.3.1 Transaction-based M-Commerce and U-Commerce Services 59 2.3.3.2 Enhancing the Productivity of Mobile Humans 59 2.3.3.3 Care in the Community 60 2.3.4 Human-Physical World-Computer Interaction (HPI) and (CPI) 61 2.3.4.1 Physical Environment Awareness 61 2.3.4.2 (Physical) Environment Control 61 2.3.4.3 Smart Utilities 62 2.3.4.4 Smart Buildings and Home Automation 62 2.3.4.5 Smart Living Environments and Smart Furniture 63 2.3.4.6 Smart Street Furniture 65 2.3.4.7 Smart Vehicles, Transport and Travel 65 2.3.4.8 Pervasive Games and Social Physical Spaces 66 2.4 Discussion 67 2.4.1 Achievements from Early Projects and Status Today 67 2.4.1.1 Smart Devices 67 2.4.1.2 Smart Physical World Environments 68 2.4.1.3 Context-Awareness and Service Discovery 69 2.4.1.4 Wearable Smart Devices and Implants 69 Exercises 71 References 71 3 Smart Devices and Services 75 3.1 Introduction 75 3.1.1 Chapter Overview 75 3.1.2 Smart Device and Service Characteristics 75 3.1.3 Distributed System Viewpoints 77 3.1.4 Abstraction Versus Virtualisation 78 3.2 Service Architecture Models 80 3.2.1 Partitioning and Distribution of Service Components 80 3.2.2 Multi-tier Client Service Models 81 3.2.2.1 Distributed Data Storage 82 3.2.2.2 Distributed Processing 82 3.2.2.3 Client–Server Design 83 3.2.2.4 Proxy-based Service Access 84 3.2.3 Middleware 85 3.2.4 Service Oriented Computing (SOC) 86 3.2.5 Grid Computing 87 3.2.6 Peer-to-Peer Systems 88 3.2.7 Device Models 91 3.3 Service Provision Life-Cycle 91 3.3.1 Network Discovery 92 3.3.2 Service Announcement, Discovery, Selection and Configuration 93 3.3.2.1 Web Service Discovery 95 3.3.2.2 Semantic Web and Semantic Resource Discovery 95 3.3.3 Service Invocation 95 3.3.3.1 Distributed Processes 96 3.3.3.2 Asynchronous (MOM) Versus Synchronous (RPC) Communication Models 97 3.3.3.3 Reliable versus Unreliable Communication 99 3.3.3.4 Caches, Read-Ahead and Delayed Writes 99 3.3.3.5 On-Demand Service Access 100 3.3.3.6 Event-Driven Architectures (EDA) 101 3.3.3.7 Shared Data Repository 103 3.3.3.8 Enterprise Service Bus (ESB) Model 103 3.3.3.9 Volatile Service Invocation 104 3.3.4 Service Composition 105 3.3.4.1 Service Interoperability 106 3.4 Virtual Machines and Operating Systems 106 3.4.1 Virtual Machines 106 3.4.2 Bios 107 3.4.3 Multi-Tasking Operating Systems (MTOS) 108 3.4.4 Process Control 109 3.4.5 Memory Management 110 3.4.6 Input and Output 111 Exercises 111 References 112 4 Smart Mobiles, Cards and Device Networks 115 4.1 Introduction 115 4.1.1 Chapter Overview 115 4.2 Smart Mobile Devices, Users, Resources and Code 115 4.2.1 Mobile Service Design 116 4.2.1.1 SMS and Mobile Web Services 117 4.2.1.2 Java VM and J2ME 119 4.2.1.3 .net Cf 120 4.2.2 Mobile Code 121 4.2.3 Mobile Devices and Mobile Users 122 4.3 Operating Systems for Mobile Computers and Communicator Devices 123 4.3.1 Microkernel Designs 123 4.3.2 Mobility Support 123 4.3.3 Resource-Constrained Devices 124 4.3.4 Power Management 125 4.3.4.1 Low Power CPUs 125 4.3.4.2 Application Support 126 4.4 Smart Card Devices 126 4.4.1 Smart Card OS 127 4.4.2 Smart Card Development 128 4.5 Device Networks 128 4.5.1 HAVi, HES and X 10 129 4.5.2 Device Discovery 129 4.5.3 OSGi 131 Exercises 132 References 133 5 Human–Computer Interaction 135 5.1 Introduction 135 5.1.1 Chapter Overview 135 5.1.2 Explicit HCI: Motivation and Characteristics 136 5.1.3 Complexity of Ubiquitous Explicit HCI 136 5.1.4 Implicit HCI: Motivation and Characteristics 137 5.2 User Interfaces and Interaction for Four Widely Used Devices 138 5.2.1 Diversity of ICT Device Interaction 138 5.2.2 Personal Computer Interface 139 5.2.3 Mobile Hand-Held Device Interfaces 140 5.2.3.1 Handling Limited Key Input: Multi-Tap, T9, Fastap, Soft keys and Soft Keyboard 140 5.2.3.2 Handling Limited Output 141 5.2.4 Games Console Interfaces and Interaction 142 5.2.5 Localised Remote Control: Video Devices 143 5.3 Hidden UI Via Basic Smart Devices 143 5.3.1 Multi-Modal Visual Interfaces 144 5.3.2 Gesture Interfaces 145 5.3.3 Reflective Versus Active Displays 147 5.3.4 Combining Input and Output User Interfaces 148 5.3.4.1 Touchscreens 149 5.3.4.2 Tangible Interfaces 149 5.3.4.3 Organic Interfaces 150 5.3.5 Auditory Interfaces 151 5.3.6 Natural Language Interfaces 151 5.4 Hidden UI Via Wearable and Implanted Devices 152 5.4.1 Posthuman Technology Model 152 5.4.2 Virtual Reality and Augmented Reality 152 5.4.3 Wearable Computer Interaction 153 5.4.3.1 Head(s)-Up Display (HUD) 154 5.4.3.2 Eyetap 154 5.4.3.3 Virtual Retinal Display (VRD) 154 5.4.3.4 Clothes as Computers 155 5.4.4 Computer Implants and Brain Computer Interfaces 155 5.4.5 Sense-of-Presence and Telepresence 157 5.5 Human-Centred Design (HCD) 157 5.5.1 Human-Centred Design Life-Cycle 158 5.5.2 Methods to Acquire User Input and to Build Used Models 159 5.5.3 Defining the Virtual and Physical Environment Use Context 160 5.5.4 Defining the Human Environment Use Context and Requirements 160 5.5.4.1 User Characteristics 160 5.5.5 Interaction Design 161 5.5.5.1 Conceptual Models and Mental Models 162 5.5.6 Evaluation 162 5.6 User Models: Acquisition and Representation 163 5.6.1 Indirect User Input and Modelling 164 5.6.2 Direct User Input and Modelling 164 5.6.3 User Stereotypes 165 5.6.4 Modelling Users’ Planned Tasks and Goals 165 5.6.5 Multiple User Tasks and Activity-Based Computing 166 5.6.6 Situation Action Versus Planned Action Models 167 5.7 iHCI Design 167 5.7.1 iHCI Model Characteristics 167 5.7.2 User Context-Awareness 168 5.7.3 More Intuitive and Customised Interaction 168 5.7.4 Personalisation 169 5.7.5 Affective Computing: Interactions Using Users’ Emotional Context 171 5.7.6 Design Heuristics and Patterns 171 Exercises 175 References 175 6 Tagging, Sensing and Controlling 179 6.1 Introduction 179 6.1.1 Chapter Overview 180 6.2 Tagging the Physical World 180 6.2.1 Life-Cycle for Tagging Physical Objects 181 6.2.2 Tags: Types and Characteristics 181 6.2.3 Physical and Virtual Tag Management 183 6.2.4 RFID Tags 183 6.2.4.1 Active RFID Tags 185 6.2.4.2 Passive RFID Tags 185 6.2.5 Personalised and Social Tags 186 6.2.6 Micro Versus Macro Tags 187 6.3 Sensors and Sensor Networks 187 6.3.1 Overview of Sensor Net Components and Processes 187 6.3.2 Sensor Electronics 189 6.3.3 Physical Network: Environment, Density and Transmission 191 6.3.4 Data Network: Addressing and Routing 192 6.3.4.1 Sensor Networks Versus Ad Hoc Networks 193 6.3.5 Data Processing: Distributed Data Storage and Data Queries 193 6.4 Micro Actuation and Sensing: MEMS 194 6.4.1 Fabrication 195 6.4.2 Micro-Actuators 195 6.4.3 Micro-Sensors 196 6.4.4 Smart Surfaces, Skin, Paint, Matter and Dust 197 6.4.5 Downsizing to Nanotechnology and Quantum Devices 198 6.5 Embedded Systems and Real-Time Systems 199 6.5.1 Application-Specific Operating Systems (ASOS) 200 6.5.2 Real-Time Operating Systems for Embedded Systems 201 6.6 Control Systems (for Physical World Tasks) 202 6.6.1 Programmable Controllers 202 6.6.2 Simple PID-Type Controllers 203 6.6.3 More Complex Controllers 203 6.7 Robots 204 6.7.1 Robot Manipulators 205 6.7.2 Mobile Robots 206 6.7.3 Biologically Inspired Robots 206 6.7.4 Nanobots 207 6.7.5 Developing UbiCom Robot Applications 207 Exercises 209 References 210 7 Context-Aware Systems 213 7.1 Introduction 213 7.1.1 Chapter Overview 214 7.1.2 Context-Aware Applications 214 7.2 Modelling Context-Aware Systems 216 7.2.1 Types of Context 216 7.2.2 Context Creation and Context Composition 218 7.2.3 Context-Aware Adaptation 219 7.2.4 Environment Modelling 221 7.2.5 Context Representation 221 7.2.6 A Basic Architecture 222 7.2.7 Challenges in Context-Awareness 225 7.3 Mobility Awareness 227 7.3.1 Call Routing for Mobile Users 227 7.3.2 Mobile Phone Location Determination 227 7.3.3 Mobile User Awareness as an Example of Composite Context-Awareness 228 7.3.4 Tourism Services for Mobile Users 228 7.4 Spatial Awareness 229 7.4.1 Spatial Context Creation 230 7.4.1.1 Spatial Acquisition 230 7.4.1.2 Location Acquisition 231 7.4.2 Location and Other Spatial Abstractions 233 7.4.3 User Context Creation and Context-Aware Adaptation 233 7.4.3.1 Cartography: Adapting Spatial Viewpoints to Different User Contexts 233 7.4.3.2 Geocoding: Mapping Location Contexts to User Contexts 234 7.4.4 Spatial Context Queries and Management: GIS 234 7.5 Temporal Awareness: Coordinating and Scheduling 235 7.5.1 Clock Synchronization: Temporal Context Creation 235 7.5.2 Temporal Models and Abstractions 236 7.5.3 Temporal Context Management and Adaptation to User Contexts 237 7.6 ICT System Awareness 238 7.6.1 Context-Aware Presentation and Interaction at the UI 238 7.6.1.1 Acquiring the UI Context 238 7.6.1.2 Content Adaptation 239 7.6.2 Network-Aware Service Adaptation 240 Exercises 242 References 242 8 Intelligent Systems (IS) 245 With Patricia Charlton 8.1 Introduction 245 8.1.1 Chapter Overview 246 8.2 Basic Concepts 246 8.2.1 Types of Intelligent Systems 246 8.2.2 Types of Environment for Intelligent Systems 247 8.2.3 Use of Intelligence in Ubiquitous Computing 248 8.3 IS Architectures 249 8.3.1 What a Model Knows Versus How it is Used 249 8.3.1.1 Types of Architecture Model 250 8.3.1.2 Unilateral Versus Bilateral System Environment Models 251 8.3.1.3 Model Representations 252 8.3.1.4 How System Models are Acquired and Adapt 252 8.3.2 Reactive IS Models 252 8.3.3 Environment Model-based IS 254 8.3.4 Goal-based IS 255 8.3.5 Utility-based IS 256 8.3.6 Learning-based IS 256 8.3.6.1 Machine Learning Design 257 8.3.7 Hybrid IS 258 8.3.8 Knowledge-based (KB) IS 260 8.3.8.1 Production or Rule-based KB System 260 8.3.8.2 Blackboard KB System 261 8.3.9 IS Models Applied to UbiCom Systems 261 8.4 Semantic KB IS 263 8.4.1 Knowledge Representation 263 8.4.2 Design Issues 265 8.4.2.1 Open World Versus Closed World Semantics 265 8.4.2.2 Knowledge Life-cycle and Knowledge Management 266 8.4.2.3 Creating Knowledge 266 8.4.2.4 Knowledge Deployment and Maintaining Knowledge 267 8.4.2.5 Design Issues for UbiCom Use 267 8.5 Classical Logic IS 268 8.5.1 Propositional and Predicate Logic 268 8.5.2 Reasoning 269 8.5.3 Design Issues 270 8.6 Soft Computing IS Models 271 8.6.1 Probabilistic Networks 271 8.6.2 Fuzzy Logic 272 8.7 IS System Operations 272 8.7.1 Searching 272 8.7.2 Classical (Deterministic) Planning 274 8.7.3 Non-Deterministic Planning 275 Exercises 276 References 276 9 Intelligent System Interaction 279 With Patricia Charlton 9.1 Introduction 279 9.1.1 Chapter Overview 279 9.2 Interaction Multiplicity 279 9.2.1 P2P Interaction Between Multiple Senders and Receivers 281 9.2.1.1 Unknown Sender and Malicious Senders 281 9.2.1.2 Unknown Receivers 282 9.2.1.3 Too Many Messages 282 9.2.2 Interaction Using Mediators 282 9.2.2.1 Shared Communication Resource Access 283 9.2.2.2 Shared Computation Resource Access 283 9.2.2.3 Mediating Between Requesters and Providers 284 9.2.3 Interaction Using Cooperative Participants 286 9.2.3.1 Coordination 287 9.2.3.2 Coordination Using Norms and Electronic Institutions 289 9.2.3.3 Hierarchical and Role-based Organisational Interaction 290 9.2.4 Interaction with Self-Interested Participants 291 9.2.4.1 Market-based Interaction and Auctions 292 9.2.4.2 Negotiation and Agreements 293 9.2.4.3 Consensus-based Agreements 295 9.3 Is Interaction Design 295 9.3.1 Designing System Interaction to be More Intelligent 296 9.3.2 Designing Interaction Between Individual Intelligent Systems 297 9.3.3 Interaction Protocol Design 297 9.3.3.1 Semantic or Knowledge-Sharing Protocols 298 9.3.3.2 Agent Communication Languages and Linguistic-based Protocols 300 9.3.4 Further Examples of the Use of Interaction Protocols 302 9.3.5 Multi-Agent Systems 303 9.3.5.1 ACL and Agent Platform Design 304 9.3.5.2 Multi-Agent System Application Design 305 9.4 Some Generic Intelligent Interaction Applications 306 9.4.1 Social Networking and Media Exchange 307 9.4.2 Recommender and Referral Systems 308 9.4.2.1 Recommender Systems 308 9.4.2.2 Content-based Recommendations 308 9.4.2.3 Collaborative Filtering 309 9.4.3 Pervasive Work Flow Management for People 309 9.4.4 Trust Management 309 Exercises 311 References 312 10 Autonomous Systems and Artificial Life 317 10.1 Introduction 317 10.1.1 Chapter Overview 317 10.2 Basic Autonomous Intra-Acting Systems 318 10.2.1 Types of Autonomous System 318 10.2.1.1 Autonomous Intelligent Systems 319 10.2.1.2 Limitation of Autonomous Systems 319 10.2.2 Self-* Properties of Intra-Action 320 10.3 Reflective and Self-Aware Systems 322 10.3.1 Self-Awareness 322 10.3.2 Self-Describing and Self-Explaining Systems 323 10.3.3 Self-Modifying Systems Based Upon Reflective Computation 325 10.4 Self-Management and Autonomic Computing 326 10.4.1 Autonomic Computing Design 328 10.4.2 Autonomic Computing Applications 330 10.4.3 Modelling and Management Self-Star Systems 331 10.5 Complex Systems 332 10.5.1 Self-Organization and Interaction 332 10.5.2 Self-Creation and Self-Replication 335 10.6 Artificial Life 336 10.6.1 Finite State Automata Models 336 10.6.2 Evolutionary Computing 337 Exercises 338 References 339 11 Ubiquitous Communication 343 11.1 Introduction 343 11.1.1 Chapter Overview 344 11.2 Audio Networks 344 11.2.1 PSTN Voice Networks 344 11.2.2 Intelligent Networks and IP Multimedia Subsystems 345 11.2.3 ADLS Broadband 346 11.2.4 Wireless Telecoms Networks 346 11.2.5 Audio Broadcast (Radio Entertainment) Networks 347 11.3 Data Networks 347 11.3.1 Network Protocol Suites 348 11.3.2 Addressing 348 11.3.3 Routing and Internetworking 349 11.4 Wireless Data Networks 350 11.4.1 Types of Wireless Network 350 11.4.2 WLAN and WiMAX 352 11.4.3 Bluetooth 353 11.4.4 ZigBee 353 11.4.5 Infrared 354 11.4.6 Uwb 354 11.4.7 Satellite and Microwave Communication 354 11.4.8 Roaming between Local Wireless LANs 355 11.5 Universal and Transparent Audio, Video and Alphanumeric Data Network Access 356 11.5.1 Combined Voice and Data Networks 357 11.5.2 Combined Audio-Video and Data Content Distribution Networks 358 11.5.3 On-demand, Interactive and Distributed Content 360 11.6 Ubiquitous Networks 360 11.6.1 Wireless Networks 360 11.6.2 Power Line Communication (PLC) 361 11.6.3 Personal Area Networks 362 11.6.4 Body Area Networks 362 11.6.5 Mobile Users Networks 363 11.6.5.1 Mobile Addresses 363 11.6.5.2 Single-Path Routing 364 11.6.5.3 Multi-Path Routing in Mobile Ad hoc Networks (MANETs) 364 11.7 Further Network Design Issues 365 11.7.1 Network Access Control 365 11.7.2 Ubiquitous Versus Localised Access 366 11.7.3 Controlling Network Access: Firewalls, NATs and VPNs 367 11.7.4 Group Communication: Transmissions for Multiple Receivers 368 11.7.5 Internetworking Heterogeneous Networks 368 11.7.6 Global Use: Low-Cost Access Networks for Rural Use 369 11.7.7 Separating Management and Control from Usage 369 11.7.8 Service-Oriented Networks 370 11.7.8.1 Service-Orientation at the Network Edge 371 11.7.8.2 Content-based Networks 372 11.7.8.3 Programmable Networks 372 11.7.8.4 Overlay Networks 372 11.7.8.5 Mesh Networks 373 11.7.8.6 Cooperative Networks 375 Exercises 375 References 376 12 Management of Smart Devices 379 12.1 Introduction 379 12.1.1 Chapter Overview 380 12.2 Managing Smart Devices in Virtual Environments 380 12.2.1 Process and Application Management 380 12.2.2 Network-Oriented Management 380 12.2.2.1 Fcaps 382 12.2.3 Monitoring and Accounting 383 12.2.3.1 Icmp 384 12.2.3.2 Snmp 384 12.2.4 Configuration Management 386 12.2.5 Security Management 386 12.2.5.1 Encryption Support for Confidentiality, Authentication and Authorisation 388 12.2.5.2 Securing the System and its Middleware 389 12.2.5.3 Securing Access Devices 391 12.2.5.4 Securing Information 392 12.2.6 Fault Management 393 12.2.7 Performance Management 394 12.2.8 Service-Oriented Computer Management 395 12.2.8.1 Metrics for Evaluating the Use of SOA 395 12.2.8.2 Distributed Resource Management and the Grid 396 12.2.8.3 SLA Management of Services 397 12.2.8.4 Policy-based Service Management 397 12.2.8.5 Pervasive Work Flow Management for Services 398 12.2.9 Information Management 399 12.2.9.1 Information Applications 399 12.2.9.2 Rich Versus Lean and Soft Versus Hard Information 399 12.2.9.3 Managing the Information Explosion 400 12.2.9.4 Managing Multimedia Content 401 12.2.9.5 Managing Lean and Hard Data Using RDBMSs 402 12.2.9.6 Managing Metadata 403 12.3 Managing Smart Devices in Human User-Centred Environments 404 12.3.1 Managing Richer and Softer Data 404 12.3.2 Service Management Models for Human User and Physical Environments 404 12.3.3 User Task and Activity-Based Management 407 12.3.4 Privacy Management 407 12.3.4.1 Biometric User Identification 408 12.3.4.2 Privacy-Invasive Technologies versus Privacy-Enhanced Technologies 410 12.3.4.3 Entrusted Regulation of User Privacy to Service Providers 411 12.3.4.4 Legislative Approaches to Privacy 412 12.4 Managing Smart Devices in Physical Environments 412 12.4.1 Context-Awareness 412 12.4.1.1 Context-Aware Management of Physical and Human Activities 413 12.4.1.2 Management of Contexts and Events 413 12.4.2 Micro and Nano-Sized Devices 415 12.4.3 Unattended Embedded Devices 415 Exercises 416 References 416 13 Ubiquitous System: Challenges and Outlook 421 13.1 Introduction 421 13.1.1 Chapter Overview 421 13.2 Overview of Challenges 422 13.2.1 Key Challenges 422 13.2.2 Multi-Level Support for UbiCom Properties 423 13.2.3 Evolution Versus Revolution 424 13.2.4 Future Technologies 424 13.3 Smart Devices 425 13.3.1 Smaller, More Functional Smart Devices 425 13.3.2 More Fluid Ensembles of Diverse Devices 426 13.3.3 Richer System Interaction and Interoperability 427 13.3.3.1 Migrating from Analogue to Digital Device Interaction 427 13.3.3.2 Richer Digital Device Interaction 428 13.4 Smart Interaction 428 13.4.1 Unexpected Connectivity: Accidentally Smart Environments 428 13.4.2 Impromptu Service Interoperability 429 13.5 Smart Physical Environment Device Interaction 430 13.5.1 Context-Awareness: Ill-Defined Contexts Versus a Context-Free World 430 13.5.2 Lower Power and Sustainable Energy Usage 431 13.5.3 ECO-Friendly UbiCom Devices 433 13.6 Smart Human–Device Interaction 436 13.6.1 More Diverse Human–Device Interaction 437 13.6.2 More Versus Less Natural HCI 439 13.6.3 Analogue to Digital and Digital Analogues 439 13.6.4 Form Follows Function 440 13.6.5 Forms for Multi-Function Devices 441 13.7 Human Intelligence Versus Machine Intelligence 441 13.7.1 Posthuman: ICT Augments Human Abilities Beyond Being Human 443 13.7.2 Blurring of Reality and Mediated Realities 444 13.8 Social Issues: Promise Versus Peril 444 13.8.1 Increased Virtual Social Interaction Versus Local Social Interaction 446 13.8.2 UbiCom Accessible by Everyone 446 13.8.3 UbiCom Affordable by Everyone 447 13.8.4 Legislation in the Digital World and Digitising Legislation 448 13.9 Final Remarks 450 Exercises 451 References 452 Index 455

    £79.75

  • Wireless Sensor Networks

    John Wiley & Sons Inc Wireless Sensor Networks

    Book SynopsisThis book presents an in-depth study on recent advances and research in Wireless Sensor Networks (WSNs). Existing WSN applications are described, followed by discussing the ongoing research efforts on some WSNs applications that show the usefulness of sensor networks. Theoretical analysis and factors influencing protocol design are highlighted.Trade Review"It is intended for advanced students but also would be useful for researchers, system and chip designers, and other professionals in related fields." (Booknews, 1 February 2011) "The book is written in an accessible, textbook style, and includes problems and solutions to assist learning." (Dark Fiber, 8 February 2011)Table of ContentsAbout the Series Editor xvii Preface xix 1 Introduction 1 1.1 Sensor Mote Platforms 2 1.2 WSN Architecture and Protocol Stack 10 References 15 2 WSN Applications 17 2.1 Military Applications 17 2.2 Environmental Applications 21 2.3 Health Applications 26 2.4 Home Applications 29 2.5 Industrial Applications 31 References 33 3 Factors Influencing WSN Design 37 3.1 Hardware Constraints 37 3.2 Fault Tolerance 39 3.3 Scalability 40 3.4 Production Costs 40 3.5 WSN Topology 40 3.6 Transmission Media 41 3.7 Power Consumption 43 References 49 4 Physical Layer 53 4.1 Physical Layer Technologies 53 4.2 Overview of RF Wireless Communication 57 4.3 Channel Coding (Error Control Coding) 59 4.4 Modulation 62 4.5 Wireless Channel Effects 66 4.6 PHY Layer Standards 72 References 75 5 Medium Access Control 77 5.1 Challenges for MAC 77 5.2 CSMA Mechanism 80 5.3 Contention-Based Medium Access 83 5.4 Reservation-Based Medium Access 103 5.5 Hybrid Medium Access 110 References 115 6 Error Control 117 6.1 Classification of Error Control Schemes 117 6.2 Error Control in WSNs 120 6.3 Cross-layer Analysis Model 123 6.4 Comparison of Error Control Schemes 131 References 137 7 Network Layer 139 7.1 Challenges for Routing 139 7.2 Data-centric and Flat-Architecture Protocols 141 7.3 Hierarchical Protocols 148 7.4 Geographical Routing Protocols 152 7.5 QoS-Based Protocols 159 References 163 8 Transport Layer 167 8.1 Challenges for Transport Layer 167 8.2 Reliable Multi-Segment Transport (RMST) Protocol 169 8.3 Pump Slowly, Fetch Quickly (PSFQ) Protocol 171 8.4 Congestion Detection and Avoidance (CODA) Protocol 175 8.5 Event-to-Sink Reliable Transport (ESRT) Protocol 177 8.6 GARUDA 180 8.7 Real-Time and Reliable Transport (RT)2 Protocol 185 References 189 9 Application Layer 191 9.1 Source Coding (Data Compression) 191 9.2 Query Processing 195 9.3 Network Management 212 References 218 10 Cross-layer Solutions 221 10.1 Interlayer Effects 222 10.2 Cross-layer Interactions 224 10.3 Cross-layer Module 229 References 240 11 Time Synchronization 243 11.1 Challenges for Time Synchronization 243 11.2 Network Time Protocol 245 11.3 Definitions 246 11.4 Timing-Sync Protocol for Sensor Networks (TPSN) 248 11.5 Reference-Broadcast Synchronization (RBS) 251 11.6 Adaptive Clock Synchronization (ACS) 253 11.7 Time Diffusion Synchronization Protocol (TDP) 254 11.8 Rate-Based Diffusion Protocol (RDP) 257 11.9 Tiny- and Mini-Sync Protocols 258 11.10 Other Protocols 260 References 262 12 Localization 265 12.1 Challenges in Localization 265 12.2 Ranging Techniques 268 12.3 Range-Based Localization Protocols 272 12.4 Range-Free Localization Protocols 280 References 284 13 Topology Management 287 13.1 Deployment 288 13.2 Power Control 289 13.3 Activity Scheduling 296 13.4 Clustering 308 References 317 14 Wireless Sensor and Actor Networks 319 14.1 Characteristics of WSANs 321 14.2 Sensor–Actor Coordination 325 14.3 Actor–Actor Coordination 337 14.4 WSAN Protocol Stack 345 References 348 15 Wireless Multimedia Sensor Networks 349 15.1 Design Challenges 350 15.2 Network Architecture 353 15.3 Multimedia Sensor Hardware 357 15.4 Physical Layer 365 15.5 MAC Layer 367 15.6 Error Control 371 15.7 Network Layer 374 15.8 Transport Layer 379 15.9 Application Layer 383 15.10 Cross-layer Design 388 15.11 Further Research Issues 392 References 394 16 Wireless Underwater Sensor Networks 399 16.1 Design Challenges 401 16.2 Underwater Sensor Network Components 402 16.3 Communication Architecture 405 16.4 Basics of Underwater Acoustic Propagation 409 16.5 Physical Layer 414 16.6 MAC Layer 416 16.7 Network Layer 426 16.8 Transport Layer 435 16.9 Application Layer 437 16.10 Cross-layer Design 437 References 440 17 Wireless Underground Sensor Networks 443 17.1 Applications 445 17.2 Design Challenges 447 17.3 Network Architecture 450 17.4 Underground Wireless Channel for EM Waves 453 17.5 Underground Wireless Channel for Magnetic Induction 463 17.6 Wireless Communication in Mines and Road/Subway Tunnels 466 17.7 Communication Architecture 474 References 480 18 Grand Challenges 483 18.1 Integration of Sensor Networks and the Internet 483 18.2 Real-Time and Multimedia Communication 484 18.3 Protocol Stack 485 18.4 Synchronization and Localization 485 18.5 WSNs in Challenging Environments 486 18.6 Practical Considerations 488 18.7 Wireless Nano-sensor Networks 488 References 489 Index 491

    £83.55

  • Skype For Dummies For Dummies S

    John Wiley & Sons Inc Skype For Dummies For Dummies S

    Book SynopsisSee how to use Skype for secure chats and connect SkypeOut and SkypeIN.Table of ContentsForeword. Introduction. Part I: Getting Started with Skype. Chapter 1: What’s All the Hoopla about Skype? Chapter 2: Hooking Up with Skype. Chapter 3: Getting Familiar with Skype’s Interface. Part II: As You Like It: Skype Your Way. Chapter 4: Customizing Skype Options to Suit Your Style. Chapter 5: Getting Personal. Chapter 6: The Mad Chatter. Chapter 7: Skyping Eye to Eye: Skype with Video. Chapter 8: The Ins and Outs of SkypeIn and SkypeOut. Part III: Calling All Seasoned Skypers. Chapter 9: Managing Your Messages. Chapter 10: Partying On — On the Conference Line! Chapter 11: Spicing Things Up with Great Gadgets and Add-Ons. Part IV: The Professional Skyper. Chapter 12: “Skypifying” Your Business. Chapter 13: Exploring Skype Communities. Chapter 14: Skypecasting. Part V: The Part of Tens. Chapter 15: Ten Reasons Your Mom (and Other Family) Will Love Skype. Chapter 16: (Almost) Ten Ways to Promote Your Business Using Skype. Chapter 17: Ten Ways to Use Skype at School. Appendix A: Skype Multilanguage Support. Appendix B: Skype Tips and Tricks Guide. Index.

    £19.54

  • High Performance Switches and Routers Wiley  IEEE

    John Wiley & Sons Inc High Performance Switches and Routers Wiley IEEE

    Book SynopsisLearn to Design High Performance Switches and Routers for Today's Ever Growing Internet Traffic As Internet traffic continues to grow, and demands for quality of service become more stringent, researchers and engineers can turn to High Performance Switches and Routers for tested and proven solutions.Trade Review"Unique in its approach and scope, and written in an easy-to-follow manner, I strongly recommend it to the interested reading community." (ComputingReviews.com, December 17, 2007)Table of ContentsPreface xv Acknowledgments xvii 1 Introduction 1 1.1 Architecture of the Internet: Present and Future 2 1.1.1 The Present 2 1.1.2 The Future 4 1.2 Router Architectures 5 1.3 Commercial Core Router Examples 9 1.3.1 T640 TX-Matrix 9 1.3.2 Carrier Routing System (CRS-1) 11 1.4 Design of Core Routers 13 1.5 IP Network Management 16 1.5.1 Network Management System Functionalities 16 1.5.2 NMS Architecture 17 1.5.3 Element Management System 18 1.6 Outline of the Book 19 2 IP Address Lookup 25 2.1 Overview 25 2.2 Trie-Based Algorithms 29 2.2.1 Binary Trie 29 2.2.2 Path-Compressed Trie 31 2.2.3 Multi-Bit Trie 33 2.2.4 Level Compression Trie 35 2.2.5 Lulea Algorithm 37 2.2.6 Tree Bitmap Algorithm 42 2.2.7 Tree-Based Pipelined Search 45 2.2.8 Binary Search on Prefix Lengths 47 2.2.9 Binary Search on Prefix Range 48 2.3 Hardware-Based Schemes 51 2.3.1 DIR-24-8-BASIC Scheme 51 2.3.2 DIR-Based Scheme with Bitmap Compression (BC-16-16) 53 2.3.3 Ternary CAM for Route Lookup 57 2.3.4 Two Algorithms for Reducing TCAM Entries 58 2.3.5 Reducing TCAM Power – CoolCAMs 60 2.3.6 TCAM-Based Distributed Parallel Lookup 64 2.4 IPv6 Lookup 67 2.4.1 Characteristics of IPv6 Lookup 67 2.4.2 A Folded Method for Saving TCAM Storage 67 2.4.3 IPv6 Lookup via Variable-Stride Path and Bitmap Compression 69 2.5 Comparison 73 3 Packet Classification 77 3.1 Introduction 77 3.2 Trie-Based Classifications 81 3.2.1 Hierarchical Tries 81 3.2.2 Set-Pruning Trie 82 3.2.3 Grid of Tries 83 3.2.4 Extending Two-Dimensional Schemes 84 3.2.5 Field-Level Trie Classification (FLTC) 85 3.3 Geometric Algorithms 90 3.3.1 Background 90 3.3.2 Cross-Producting Scheme 91 3.3.3 Bitmap-Intersection 92 3.3.4 Parallel Packet Classification (P2C) 93 3.3.5 Area-Based Quadtree 95 3.3.6 Hierarchical Intelligent Cuttings 97 3.3.7 HyperCuts 98 3.4 Heuristic Algorithms 103 3.4.1 Recursive Flow Classification 103 3.4.2 Tuple Space Search 107 3.5 TCAM-Based Algorithms 108 3.5.1 Range Matching in TCAM-Based Packet Classification 108 3.5.2 Range Mapping in TCAMs 110 4 Traffic Management 114 4.1 Quality of Service 114 4.1.1 QoS Parameters 115 4.1.2 Traffic Parameters 116 4.2 Integrated Services 117 4.2.1 Integrated Service Classes 117 4.2.2 IntServ Architecture 117 4.2.3 Resource ReSerVation Protocol (RSVP) 119 4.3 Differentiated Services 121 4.3.1 Service Level Agreement 122 4.3.2 Traffic Conditioning Agreement 123 4.3.3 Differentiated Services Network Architecture 123 4.3.4 Network Boundary Traffic Classification and Conditioning 124 4.3.5 Per Hop Behavior (PHB) 126 4.3.6 Differentiated Services Field 127 4.3.7 PHB Implementation with Packet Schedulers 128 4.4 Traffic Policing and Shaping 129 4.4.1 Location of Policing and Shaping Functions 130 4.4.2 ATM’s Leaky Bucket 131 4.4.3 IP’s Token Bucket 133 4.4.4 Traffic Policing 134 4.4.5 Traffic Shaping 135 4.5 Packet Scheduling 136 4.5.1 Max-Min Scheduling 136 4.5.2 Round-Robin Service 138 4.5.3 Weighted Round-Robin Service 139 4.5.4 Deficit Round-Robin Service 140 4.5.5 Generalized Processor Sharing (GPS) 141 4.5.6 Weighted Fair Queuing (WFQ) 146 4.5.7 Virtual Clock 150 4.5.8 Self-Clocked Fair Queuing 153 4.5.9 Worst-Case Fair Weighted Fair Queuing (WF2Q) 155 4.5.10 WF2Q+ 158 4.5.11 Comparison 159 4.5.12 Priorities Sorting Using a Sequencer 160 4.6 Buffer Management 163 4.6.1 Tail Drop 163 4.6.2 Drop on Full 164 4.6.3 Random Early Detection (RED) 164 4.6.4 Differential Dropping: RIO 167 4.6.5 Fair Random Early Detection (FRED) 168 4.6.6 Stabilized Random Early Detection (SRED) 170 4.6.7 Longest Queue Drop (LQD) 172 5 Basics of Packet Switching 176 5.1 Fundamental Switching Concept 177 5.2 Switch Fabric Classification 181 5.2.1 Time-Division Switching 181 5.2.2 Space-Division Switching 183 5.3 Buffering Strategy in Switching Fabrics 187 5.3.1 Shared-Memory Queuing 188 5.3.2 Output Queuing (OQ) 188 5.3.3 Input Queuing 189 5.3.4 Virtual Output Queuing (VOQ) 189 5.3.5 Combined Input and Output Queuing 190 5.3.6 Crosspoint Queuing 191 5.4 Multiplane Switching and Multistage Switching 191 5.5 Performance of Basic Switches 195 5.5.1 Traffic Model 196 5.5.2 Input-Buffered Switches 197 5.5.3 Output-Buffered Switches 199 5.5.4 Completely Shared-Buffered Switches 201 6 Shared-memory Switches 207 6.1 Linked List Approach 208 6.2 Content Addressable Memory Approach 213 6.3 Space-Time-Space Approach 215 6.4 Scaling the Shared-Memory Switches 217 6.4.1 Washington University Gigabit Switch 217 6.4.2 Concentrator-Based Growable Switch Architecture 218 6.4.3 Parallel Shared-Memory Switches 218 6.5 Multicast Shared-Memory Switches 220 6.5.1 Shared-Memory Switch with a Multicast Logical Queue 220 6.5.2 Shared-Memory Switch with Cell Copy 220 6.5.3 Shared-Memory Switch with Address Copy 222 7 Input-buffered Switches 225 7.1 Scheduling in VOQ-Based Switches 226 7.2 Maximum Matching 229 7.2.1 Maximum Weight Matching 229 7.2.2 Approximate MWM 229 7.2.3 Maximum Size Matching 230 7.3 Maximal Matching 231 7.3.1 Parallel Iterative Matching (PIM) 232 7.3.2 Iterative Round-Robin Matching (iRRM) 233 7.3.3 Iterative Round-Robin with SLIP (iSLIP) 234 7.3.4 Firm 241 7.3.5 Dual Round-Robin Matching (DRRM) 241 7.3.6 Pipelined Maximal Matching 245 7.3.7 Exhaustive Dual Round-Robin Matching (EDRRM) 248 7.4 Randomized Matching Algorithms 249 7.4.1 Randomized Algorithm with Memory 250 7.4.2 A Derandomized Algorithm with Memory 250 7.4.3 Variant Randomize Matching Algorithms 251 7.4.4 Polling Based Matching Algorithms 254 7.4.5 Simulated Performance 258 7.5 Frame-based Matching 262 7.5.1 Reducing the Reconfiguration Frequency 263 7.5.2 Fixed Size Synchronous Frame-Based Matching 267 7.5.3 Asynchronous Variable-Size Frame-Based Matching 270 7.6 Stable Matching with Speedup 273 7.6.1 Output-Queuing Emulation with Speedup of 4 274 7.6.2 Output-Queuing Emulation with Speedup of 2 275 7.6.3 Lowest Output Occupancy Cell First (LOOFA) 278 8 Banyan-based Switches 284 8.1 Banyan Networks 284 8.2 Batcher-Sorting Network 287 8.3 Output Contention Resolution Algorithms 288 8.3.1 Three-Phase Implementation 288 8.3.2 Ring Reservation 288 8.4 The Sunshine Switch 292 8.5 Deflection Routing 294 8.5.1 Tandem Banyan Switch 294 8.5.2 Shuffle-Exchange Network with Deflection Routing 296 8.5.3 Dual Shuffle-Exchange Network with Error-Correcting Routing 297 8.6 Multicast Copy Networks 303 8.6.1 Broadcast Banyan Network 304 8.6.2 Encoding Process 308 8.6.3 Concentration 309 8.6.4 Decoding Process 310 8.6.5 Overflow and Call Splitting 310 8.6.6 Overflow and Input Fairness 311 9 Knockout-based Switches 316 9.1 Single-Stage Knockout Switch 317 9.1.1 Basic Architecture 317 9.1.2 Knockout Concentration Principle 318 9.1.3 Construction of the Concentrator 320 9.2 Channel Grouping Principle 323 9.2.1 Maximum Throughput 324 9.2.2 Generalized Knockout Principle 325 9.3 Two-Stage Multicast Output-Buffered ATM Switch (MOBAS) 327 9.3.1 Two-Stage Configuration 327 9.3.2 Multicast Grouping Network (MGN) 330 9.4 Appendix 333 10 The Abacus Switch 336 10.1 Basic Architecture 337 10.2 Multicast Contention Resolution Algorithm 340 10.3 Implementation of Input Port Controller 342 10.4 Performance 344 10.4.1 Maximum Throughput 344 10.4.2 Average Delay 347 10.4.3 Cell Loss Probability 349 10.5 ATM Routing and Concentration (ARC) Chip 351 10.6 Enhanced Abacus Switch 354 10.6.1 Memoryless Multi-Stage Concentration Network 354 10.6.2 Buffered Multi-Stage Concentration Network 357 10.6.3 Resequencing Cells 359 10.6.4 Complexity Comparison 361 10.7 Abacus Switch for Packet Switching 362 10.7.1 Packet Interleaving 362 10.7.2 Cell Interleaving 364 11 Crosspoint Buffered Switches 367 11.1 Combined Input and Crosspoint Buffered Switches 368 11.2 Combined Input and Crosspoint Buffered Switches with VOQ 370 11.2.1 CIXB with One-Cell Crosspoint Buffers (CIXB-1) 371 11.2.2 Throughput and Delay Performance 371 11.2.3 Non-Negligible Round-Trip Times in CIXB-k 376 11.3 OCF_OCF: Oldest Cell First Scheduling 376 11.4 LQF_RR: Longest Queue First and Round-Robin Scheduling in CIXB-1 378 11.5 MCBF: Most Critical Buffer First Scheduling 379 12 Clos-network Switches 382 12.1 Routing Property of Clos Network Switches 383 12.2 Looping Algorithm 387 12.3 m-Matching Algorithm 388 12.4 Euler Partition Algorithm 388 12.5 Karol’s Algorithm 389 12.6 Frame-Based Matching Algorithm for Clos Network (f-MAC) 391 12.7 Concurrent Matching Algorithm for Clos Network (c-MAC) 392 12.8 Dual-Level Matching Algorithm for Clos Network (d-MAC) 395 12.9 The ATLANTA Switch 398 12.10 Concurrent Round-Robin Dispatching (CRRD) Scheme 400 12.11 The Path Switch 404 12.11.1 Homogeneous Capacity and Route Assignment 406 12.11.2 Heterogeneous Capacity Assignment 408 13 Multi-plane Multi-stage Buffered Switch 413 13.1 TrueWay Switch Architecture 414 13.1.1 Stages of the Switch 415 13.2 Packet Scheduling 417 13.2.1 Partial Packet Interleaving (PPI) 419 13.2.2 Dynamic Packet Interleaving (DPI) 419 13.2.3 Head-of-Line (HOL) Blocking 420 13.3 Stage-To-Stage Flow Control 420 13.3.1 Back-Pressure 421 13.3.2 Credit-Based Flow Control 421 13.3.3 The DQ Scheme 422 13.4 Port-To-Port Flow Control 424 13.4.1 Static Hashing 424 13.4.2 Dynamic Hashing 425 13.4.3 Time-Stamp-Based Resequence 428 13.4.4 Window-Based Resequence 428 13.5 Performance Analysis 431 13.5.1 Random Uniform Traffic 431 13.5.2 Hot-Spot Traffic 432 13.5.3 Bursty Traffic 432 13.5.4 Hashing Schemes 432 13.5.5 Window-Based Resequencing Scheme 434 13.6 Prototype 434 14 Load-balanced Switches 438 14.1 Birkhoff–Von Neumann Switch 438 14.2 Load-Balanced Birkhoff–von Neumann Switches 441 14.2.1 Load-Balanced Birkhoff–von Neumann Switch Architecture 441 14.2.2 Performance of Load-Balanced Birkhoff–von Neumann Switches 442 14.3 Load-Balanced Birkhoff–von Neumann Switches With FIFO Service 444 14.3.1 First Come First Served (FCFS) 446 14.3.2 Earliest Deadline First (EDF) and EDF-3DQ 450 14.3.3 Full Frames First (FFF) 451 14.3.4 Full Ordered Frames First (FOFF) 455 14.3.5 Mailbox Switch 456 14.3.6 Byte-Focal Switch 459 15 Optical Packet Switches 468 15.1 Opto-Electronic Packet Switches 469 15.1.1 Hypass 469 15.1.2 Star-Track 471 15.1.3 Cisneros and Brackett 472 15.1.4 BNR (Bell-North Research) Switch 473 15.1.5 Wave-Mux Switch 474 15.2 Optoelectronic Packet Switch Case Study I 475 15.2.1 Speedup 476 15.2.2 Data Packet Flow 477 15.2.3 Optical Interconnection Network (OIN) 477 15.2.4 Ping-Pong Arbitration Unit 482 15.3 Optoelectronic Packet Switch Case Study II 490 15.3.1 Petabit Photonic Packet Switch Architecture 490 15.3.2 Photonic Switch Fabric (PSF) 495 15.4 All Optical Packet Switches 503 15.4.1 The Staggering Switch 503 15.4.2 Atmos 504 15.4.3 Duan’s Switch 505 15.4.4 3M Switch 506 15.5 Optical Packet Switch with Shared Fiber Delay Lines Single-stage Case 509 15.5.1 Optical Cell Switch Architecture 509 15.5.2 Sequential FDL Assignment (SEFA) Algorithm 512 15.5.3 Multi-Cell FDL Assignment (MUFA) Algorithm 518 15.6 All Optical Packet Switch with Shared Fiber Delay Lines – Three Stage Case 524 15.6.1 Sequential FDL Assignment for Three-Stage OCNS (SEFAC) 526 15.6.2 Multi-Cell FDL Assignment for Three-Stage OCNS (MUFAC) 526 15.6.3 FDL Distribution in Three-Stage OCNS 528 15.6.4 Performance Analysis of SEFAC and MUFAC 530 15.6.5 Complexity Analysis of SEFAC and MUFAC 532 16 High-speed Router Chip Set 538 16.1 Network Processors (NPs) 538 16.1.1 Overview 538 16.1.2 Design Issues for Network Processors 539 16.1.3 Architecture of Network Processors 542 16.1.4 Examples of Network Processors – Dedicated Approach 543 16.2 Co-Processors for Packet Classification 554 16.2.1 LA-1 Bus 554 16.2.2 TCAM-Based Classification Co-Processor 556 16.2.3 Algorithm-Based Classification Co-Processor 562 16.3 Traffic Management Chips 567 16.3.1 Overview 567 16.3.2 Agere’s TM Chip Set 567 16.3.3 IDT TM Chip Set 573 16.3.4 Summary 579 16.4 Switching Fabric Chips 579 16.4.1 Overview 579 16.4.2 Switch Fabric Chip Set from Vitesse 580 16.4.3 Switch Fabric Chip Set from AMCC 589 16.4.4 Switch Fabric Chip Set from IBM (now of AMCC) 593 16.4.5 Switch Fabric Chip Set from Agere 597 Index 606

    £149.35

  • Asterisk For Dummies

    John Wiley & Sons Inc Asterisk For Dummies

    Book SynopsisBridge data and voice with Asterisk! Create and maintain an economical Asterisk phone system from scratch Asterisk is the open-source PBX software that offers you the chance to save real money on your voice communications.Table of ContentsForeword. Introduction. Part I: Introducing . . . ASTERISK! Chapter 1: Evaluating the Possibilities with Asterisk. Chapter 2: Installing Asterisk. Chapter 3: Installing AsteriskNOW. Chapter 4: Configuring the Hardware. Part II: Using Dialplans — the Building Blocks of Asterisk. Chapter 5: Comprehending Dialplan Syntax. Chapter 6: Adding Features to Dialplans. Chapter 7: Building Dialplan Infrastructure. Chapter 8: Operating the AsteriskNOW GUI. Chapter 9: Utilizing VoIP Codecs. Part III: Maintaining Your Phone Service with Asterisk. Chapter 10: Troubleshooting VoIP Calls with Packet Captures. Chapter 11: Maintaining Your Telecom Services. Chapter 12: Addressing Call-Quality Concerns and Completion Issues. Chapter 13: Handling Dedicated Digital Troubles. Chapter 14: Managing Asterisk for Peak Capacity. Chapter 15: Providing Long-Term Health for Your Asterisk Switch. Part IV: The Part of Tens. Chapter 16: Ten Things You Should Never Do with Asterisk. Chapter 17: Ten Fun Things to Do with Your Asterisk. Chapter 18: Ten Places to Go for Help. Part V: Appendixes. Appendix A: Visualizing the Dialplan. Appendix B: VoIP Basics. Appendix C: Understanding Basic Linux. Index.

    £22.94

  • Wiley Pathways Introduction to Database

    John Wiley & Sons Inc Wiley Pathways Introduction to Database

    Book SynopsisYou can get there Where do you want to go? You might already be working in the information technology field and may be looking to expand your skills. You might be setting out on a new career path. Or, you might want to learn more about exciting opportunities in database management.Table of Contents1 Introducing to Data and Data Management 1 Introduction 2 1.1 Understanding the Role of Data and Databases 2 1.1.1 A Practical Example 3 1.1.2 Understanding Data Management5 1.1.3 The Need for Data Management 5 Self-Check 7 1.2 Understanding Data Sources7 1.2.1 Picking a Starting Point 7 1.2.2 Identifying Primary Processes 8 1.2.3 Specific Data Sources 9 Self-Check 12 1.3 Potential Data Concerns 12 1.3.1 Managing Data Accuracy 13 1.3.2 Managing Data Security 13 1.3.3 Managing Data Organization 16 1.3.4 Managing Data Access 16 Self-Check 18 Summary 19 Key Terms 19 Assess Your Understanding 20 Summary Questions 20 Applying This Chapter 22 You Try It 23 2 Introducing Databases and Database Management Systems 24 Introduction 25 2.1Introduction to Key Database Concepts 25 2.1.1Database Approach to Data 25 2.1.2Understanding Basic Concepts 26 2.1.3Database Use 29 Self-Check31 2.2 Understanding Basic Database Models 31 2.2.1 The Hierarchical Database Model 32 2.2.2 The Network Database Model 33 2.2.3 The Relational Database Model 34 2.2.4 The Object-Oriented Database Model 35 2.2.5 The Object-Relational Database Model 36 Self-Check 37 2.3 Database Components 38 2.3.1 Hardware Components 40 2.3.2 Software Requirements 43 2.3.3 DBMS Components45 2.3.4 Understanding People and Procedures 50 Self-Check 53 Summary 54 Key Terms 54 Assess Your Understanding 55 Summary Questions 55 Applying This Chapter 57 You Try It 59 3 Data Modeling 60 Introduction 61 3.1 Understanding Database Design 61 3.1.1 Understanding the Design Process 61 3.1.2 Determining the Database Type 63 3.1.3 Understanding Modeling Goals 66 3.1.4 Understanding Business Rules 67 Self-Check 70 3.2 Understanding Relational Database Models 70 3.2.1 Entity-Relationship (E-R) Modeling Concepts 71 3.2.2 Introducing Basic Database Objects 75 Self-Check 79 3.3 Understanding Relationships 79 3.3.1 Binary Relationships 80 3.3.2 Unary Relationships 84 3.3.3 Ternary Relationships 86 3.3.4 Breaking Down Many-to-Many Relationships 87 Self-Check91 3.4 Comparing Data Models 91 3.4.1 Choosing a Modeling Tool 92 3.4.2 The General Hardware Company 93 3.4.3 Good Reading Bookstores 95 Self-Check 97 Summary 97 Key Terms 97 Assess Your Understanding 99 Summary Questions 99 Applying This Chapter 101 You Try It103 4 Designing a Database 104 Introduction 105 4.1Designing Relational Tables 105 4.1.1Converting a Single Entity 105 4.1.2Converting Binary Relationships 106 4.1.3Converting Unary Relationships 113 Self-Check 117 4.2 Comparing Relational Designs 117 4.2.1 Designing General Hardware 117 4.2.2 Designing Good Reading Bookstores 120 Self-Check 123 4.3 Normalizing Data 123 4.3.1 Using Normalization Techniques 123 4.3.2 Normalizing Data by the Numbers 125 4.3.3 Shortening the Process 134 4.3.4 Denormalizing Data 134 Self-Check 136 Summary 136 Key Terms 137 Assess Your Understanding 138 Summary Questions 138 Applying This Chapter 140 You Try It 142 5 Implementing a Database 146 Introduction 147 5.1 Physical Design and Implementation 147 5.1.1 Understanding Design Requirements 147 5.1.2 Business Environment Requirements 149 5.1.3 Data Characteristics 149 5.1.4 Application Characteristics 151 5.1.5 Operational Requirements 152 5.1.6 The Hardware and Software Environment 152 5.1.7 Evaluating Implementation Options 154 Self-Check 158 5.2 Adjusting Your Design to the Real World 158 5.2.1 Ensuring Data Integrity 159 5.2.2 Adjusting Factors Related to Performance 162 Self-Check 171 5.3 Implementing Database Objects 171 5.3.1 Implementing Your Final Table Design 171 5.3.2 Implementing Indexes 173 5.3.3 Implementing Views 175 Self-Check 177 Summary 177 Key Terms 177 Assess Your Understanding 178 Summary Questions 178 Applying This Chapter 180 You Try It182 6 Understanding the SQL Language 184 Introduction 185 6.1 Introducing the SQL Language 185 6.1.1 Understanding SQL Features 185 6.1.2 Using SQL 186 6.1.3 Understanding Command Basics 190 Self-Check 192 6.2 Understanding SELECT Fundamentals 192 6.2.1 Working with SELECT 192 6.2.2 Using Simple Data Retrieval 193 6.2.3 Retrieving Other Values 194 Self-Check 196 6.3 Understanding Operators and Functions 196 6.3.1 Arithmetic Operators 196 6.3.2 Comparison and Logical Operators 197 6.3.3 Standard SQL Functions 201 6.3.4 Function Variations 202 Self-Check 208 6.4 Understanding DML Commands 208 6.4.1 Using INSERT 208 6.4.2 Using UPDATE 209 6.4.3 Using DELETE 211 Self-Check213 6.5 Understanding DDL Commands 213 6.5.1 Using CREATE 214 6.5.2 Using ALTER 216 6.5.3 Using DROP 216 Self-Check 216 Summary 217 Key Terms 217 Assess Your Understanding 218 Summary Questions 218 Applying This Chapter 220 You Try It222 7 Data Access and Manipulation 223 Introduction224 7.1 Using SELECT Statement Advanced Syntax 224 7.1.1 Understanding SELECT Statement Syntax 224 7.1.2 Filtering Your Result 226 7.1.3 Managing Your Result Set 229 7.1.4 Sorting, Organizing, and Grouping Data 231 7.1.5 Understanding Operator Precedence 237 7.1.6 Combining Statement Results 239 7.1.7 Using SELECT with Other Commands 240 Self-Check 242 7.2 Using Joins and Subqueries 242 7.2.1 Understanding Joins 242 7.2.2 Using Different Join Syntaxes 244 7.2.3 Using Basic Subqueries 246 Self-Check 250 7.3 Using Batches and Scripts 250 7.3.1 Writing Batches and Scripts 251 7.3.2 Understanding Basic Programming Concepts 252 Self-Check 256 Summary 256 Key Terms 256 Assess Your Understanding 257 Summary Questions 257 Applying This Chapter 259 You Try It262 8 Improving Data Access 263 Introduction 264 8.1 Understanding Performance Roadblocks 264 8.1.1 Recognizing Potential Bottlenecks 265 8.1.2 Understanding Hardware Performance 265 8.1.3 Understanding Database Performance 270 8.1.4 Performance Monitoring 270 8.1.5 Knowing What to Use 274 Self-Check 275 8.2 Using Indexes and Views 275 8.2.1 Working with Indexes 276 8.2.2 Working with Views 280 Self-Check 283 8.3Using Programmable Objects 284 8.3.1Understanding Procedures 284 8.3.2Understanding Functions 287 Self-Check 292 Summary 292 Key Terms 292 Assess Your Understanding 294 Summary Questions 294 Applying This Chapter 296 You Try It298 9 Database Administration 300 Introduction 301 9.1 Understanding the Need for Administration 301 9.1.1 Identifying Administration Roles 302 9.1.2 Justifying the Need for Administration 302 Self-Check 306 9.2 Identifying Administration Responsibilities 307 9.2.1 Understanding Data Administration Responsibilities 308 9.2.2 Understanding Database Administration Responsibilities 313 Self-Check 318 9.3 Understanding Management Tasks 318 9.3.1 Considering “What” and “When” 319 9.3.2 Considering “When” and “How” 319 9.3.3 Ongoing Management Tasks 321 9.3.4 Considering Troubleshooting 324 Self-Check 326 Summary 326 Key Terms 326 Assess Your Understanding 327 Summary Questions 327 Applying This Chapter 329 You Try It 330 10 Transactions and Locking 332 Introduction333 10.1 Understanding Transaction Basics 333 10.1.1 Understanding Transaction Processing 333 10.1.2 Using Transaction Commands 336 10.1.3 Understanding Transaction Properties 341 10.1.4 Understanding Transaction Scope 341 10.1.5 Recognizing and Resolving Potential Problems 345 Self-Check 347 10.2 Managing Concurrency Control 347 10.2.1 The Need for Concurrency Management 348 10.2.2 Recognizing Concurrency Problems 348 10.2.3 Designing for Concurrency 352 10.2.4 Concurrency Methods 352 Self-Check 355 10.3 SQL Server Transaction Management 355 10.3.1 Understanding Transaction Processing 355 10.3.2 Managing Locks, Locking, and Transaction Isolation 356 10.3.3 Recognizing, Clearing, and Preventing Deadlocks 358 Self-Check 362 Summary 362 Key Terms 363 Assess Your Understanding 364 Summary Questions 364 Applying This Chapter 366 You Try It 367 11 Data Access and Security 368 Introduction369 11.1 Understanding Database Connections 369 11.1.1 Understanding Connectivity Concepts 369 11.1.2 Understanding Client/Server Connectivity 376 11.1.3 Understanding Multitier Connectivity 379 Self-Check 382 11.2 Managing Access Control 382 11.2.1 Controlling Server Access 383 11.2.2 Controlling Database Access 386 11.2.3 Understanding the Connection Process 387 Self-Check 392 11.3 Protecting Your Data 392 11.3.1 Implementing Data Permissions 393 11.3.2 Minimizing Table Access 397 11.3.3 Keeping Data Safe 397 11.3.4 Understanding RAID Configurations 397 11.3.5 Using Data Backups 400 11.3.6 Protecting Your Server 404 Self-Check 405 Summary 406 Key Terms 406 Assess Your Understanding 407 Summary Questions 407 Applying This Chapter 409 You Try It 411 12 Supporting Database Applications 412 Introduction 413 12.1 Supporting a Centralized Database 413 12.1.1 Understanding Local Area Networks (LANs) 413 12.1.2 Understanding Data Configurations 414 12.1.3 Understanding Server Configurations 416 12.1.4 Consolidating Data Sources 417 Self-Check 419 12.2 Supporting a Distributed Database 419 12.2.1 Understanding Distributed Data 419 12.2.2 Understanding Replicated Data 423 12.2.3 Understanding Partitioned Data 425 12.2.4 Distributed Data Support Issues 429 Self-Check 434 12.3 Understanding Internet Issues 434 12.3.1 Managing Performance Issues 435 12.3.2 Managing Availability Issues 436 12.3.3 Managing Security and Privacy Issues 438 Self-Check 441 Summary 442 Key Terms 442 Assess Your Understanding 443 Summary Questions 443 Applying This Chapter 445 You Try It 447 Glossary 448 Index 465

    £85.45

  • Home Networking For Dummies 4th Edition For

    John Wiley & Sons Inc Home Networking For Dummies 4th Edition For

    Book SynopsisHaving a network in your home increases work efficiency and minimizes confusion. If you want to set up a network in your home but you're not quite sure where to start, then Home Networking for Dummies makes it easy for you to become your household's network administrator.Table of ContentsIntroduction 1 Part I: Network Basics 7 Chapter 1: Planning the Lay of the LAN 9 Chapter 2: Installing Network Adapters 27 Chapter 3: Installing Ethernet Cable 35 Chapter 4: Using Wires That Are Already There 53 Chapter 5: Look Ma, No Wires 69 Part II: Configuring Computers for Networking 85 Chapter 6: Putting It All Together 87 Chapter 7: Configuring Computer Sharing 113 Chapter 8: Setting Up Users 127 Part III: Communicating Across the Network 139 Chapter 9: Printing Across the Network 141 Chapter 10: Getting Around the Neighborhood 165 Chapter 11: Using Files from Other Computers 183 Part IV: Network Security and Maintenance 203 Chapter 12: Making Your Network Secure 205 Chapter 13: Disaster Planning and Recovery 235 Chapter 14: Using Windows Maintenance Tools 257 Part V: The Part of Tens 283 Chapter 15: Ten Clever Things to Do on Your Network 285 Chapter 16: Ten Fun Things to Do on Your Network 301 Chapter 17: Ten Ways to Make the Internet Safe for Children 307 Index 321

    £16.99

  • Connections

    John Wiley & Sons Inc Connections

    1 in stock

    Book SynopsisIn their fascinating analysis of the recent history of information technology, H. Peter Alesso and Craig F. Smith reveal the patterns in discovery and innovation that have brought us to the present tipping point. . . . A generation from now, every individual will have personally tailored access to the whole of knowledge . . . the sooner we all begin to think about how we got here, and where we''re going, the better. This exciting book is an essential first step. From the Foreword by James Burke Many people envision scientists as dispassionate characters who slavishly repeat experiments until eurekasomething unexpected happens. Actually, there is a great deal more to the story of scientific discovery, but seeing the big picture is not easy. Connections: Patterns of Discovery uses the primary tools of forecasting and three archetypal patterns of discoverySerendipity, Proof of Principle, and 1% Inspiration and 99% Perspirationto discern relationships of past develoTable of ContentsForeword. Introduction. Acknowledgements. Organization of this Book. Chapter 1: Connecting Information. The Google Story. Information Revolution. Defining Information. Looking Good. Google Connects Information. Patterns of Discovery. Forecast for Connecting Information. Chapter 2: Connecting Circuits. The Moore' Law Story. Edison's Electric Light. The Vacuum Tube Diode. The First Programmable Computers. ENIAC. The Transistor. How Transistors Work. The Proof of Principle for the Transistor. The Microprocessor. How Microprocessors Work. Moore's law. Patterns of Discovery. Forecast for Connecting Circuits . Chapter 3: Connecting Chips. The Personal Computer Story. Vannevar Bush. Robert Taylor. J.C.R. Licklider. Alan Kay. Butler Lampson. Charles (Chuck) Thacker. Personal Computing. The Xerox Alto. Apple Computer. IBM PC. Patterns of Discovery. Forecast for Connecting Chips. Chapter 4: Connecting Processes. The Software Story. John Von Neumann. Claude Shannon. The Evolution of Programming Languages. Sir Charles Antony Richard (Tony) Hoare. Software as an Industry. Software Productivity. Fourth Generation Languages. Proprietary versus Open Standards. Emergent Fifth Generation Languages (5GLs). Charles Simonyi. William H. Gates. Linus Torvalds. Patterns of Discovery. Forecast for Connecting Processes. Chapter 5: Connecting Machines. The Ethernet Story. Xerox PARC and Ethernet. Robert Metcalf. Patterns of Discovery. Forecast for Connecting Machines. Chapter 6: Connecting Networks. The Internet Story. Vint Cerf. Transition to the World Wide Web. Berners-Lee. Patterns of Discovery. Forecast for Connecting Machines. Chapter 7: Connecting Devices. The Ubiquitous Computing Story. Ubiquitous Computing. Mark Weiser. Jeff Hawkins. Patterns of Discovery. Forecast for Connecting Devices. Chapter 8: Connecting the Web. The Ubiquitous Web Story. Michael Dertouzos. Project Oxygen. Perfect Search. Berners-Lee and the Semantic Web. Patterns of Discovery. Forecast for Connecting the Web. Chapter 9: Connecting the Intelligence. The Ubiquitous Intelligence Story. Kurt Gödel. Alan Turing. Marvin Minsky. Ubiquitous Intelligence . The Web 'Brain'. What is Web Intelligence? Patterns of Discovery. Forecast for Connecting Intelligence. Chapter 10: Connecting Patterns. Ray Kurzweil. Evolving Complex Intelligence. The Law of Accelerating Returns. Singularities. The Software of Intelligence. Patterns. Connecting Pattern. Patterns of Discovery. Forecasts for Connecting Patterns. Epilog. Bibliography. Glossary. Index.

    1 in stock

    £62.06

  • Wiley Pathways Network Security Fundamentals

    John Wiley & Sons Inc Wiley Pathways Network Security Fundamentals

    1 in stock

    Book SynopsisAs networks around the world have become more and more connected, an understanding of network security has become an integral part of a network administrator's job. People who design, implement, and manage networks on a day-to-day basis must understand the threats that exist and how to mitigate them to protect a company's assets.Table of Contents1. Computer and Network Security Principles 1.1. Identifying and Analyzing Risk 2 1.2. Installing Windows XP Professional 6 1.3. Installing Windows Server 2003 9 1.4. Using Microsoft Security Baseline Analyzer 13 1.5. Viewing Local Security Policy 18 1.6. Creating a Written Security Policy 24 2. Network and Server Security 2.1. Managing Server Roles 28 2.2. Managing Services and Ports 34 2.3. Using Network Monitor 38 2.4. Configuring Windows Firewall 42 2.5. Designing Border Security 45 3. Cryptography 3.1. Understanding Cryptography Concepts 48 3.2. Managing Driver Signing 49 3.3. Using Encrypting File System 53 3.4. Installing Certificate Services 57 3.5. Managing Certificate Authority Trusts 63 3.6. Requesting and Issuing Certificates 67 3.7. Revoking Certificates 70 4. Authentication 4.1. Comparing Credentials 75 4.2. Creating User Accounts 76 4.3. Configuring an Active Directory Domain Controller 82 4.4. Joining a Domain 89 4.5. Managing Password and Account Lockout Policies 93 4.6. Managing Authentication Protocols 101 4.7. Managing Logon Restrictions 103 5. Authorization and Access Control 5.1. Comparing Access Control Models 111 5.2. Managing Groups 112 5.3. Assigning Permissions 117 5.4. Troubleshooting Effective Permissions 125 5.5. Viewing User Right Assignments 129 6. Securing Network Transmission 6.1. Designing Network Perimeters 133 6.2. Implementing IP Address Filtering on IIS 135 6.3. Using IPsec Default Policies 139 6.4. Implementing Packet Filtering with IPsec 143 6.5. Implementing IPsec Encryption 150 7. Remote Access and Wireless Security 7.1. Understanding Remote Access Protocols and Wireless Security 156 7.2. Designing Remote Access and Wireless Access 158 7.3. Enabling Routing and Remote Access 160 7.4. Configuring a Dial-up Client 166 7.5. Configuring a VPN Client 171 7.6. Defining Remote Access Policies 176 8. Server Roles and Security 8.1. Using Default Templates 183 8.2. Creating and Applying a Baseline Template 188 8.3. Creating and Applying an Incremental Template 193 8.4. Securing DNS 197 8.5. Securing a File Server 203 8.6. Securing a Web and FTP Server 209 9. Protecting Against Malware 9.1. Identifying Malware 217 9.2. Comparing Antivirus, Anti-Spyware, and Anti-Malware Programs 218 9.3. Creating a Managed Computer 221 9.4. Securing Internet Explorer 224 9.5. Securing Outlook Express 232 10. Ongoing Security Management 10.1. Configuring Automatic Updates 237 10.2. Configuring Auditing 241 10.3. Using Event Viewer 245 10.4. Performing Remote Management with MMC 250 10.5. Using Telnet 256 10.6. Using Remote Desktop for Administration 260 11. Disaster Recovery and Fault Tolerance 11.1. Planning for the Worst 264 11.2. Responding to a Security Incident 270 11.3. Configuring Backups 272 11.4. Planning a RAID Configuration 282 11.5. Eliminating Single Points of Failure 284 12. Intrusion Detection and Forensics 12.1. Understanding Terminology 288 12.2. Comparing Intrusion Detection System Types 290 12.3. Investigating the Honeynet Project 292 12.4. Using Forensics Tools 294 12.5. Investigating an Attack 299

    1 in stock

    £40.38

  • Information Security Governance

    Wiley Information Security Governance

    Book SynopsisThis book provides an understanding of governance and its relevance to information security. It gives readers a clear, step-by-step approach to developing a sound security strategy aligned with their business objectives in order to ensure a predictable level of functionality and assurance.Table of ContentsINTRODUCTION. CHAPTER 1: GOVERNANCE OVERVIEW. 1.1 What Is It? 1.2 Back to Basics. 1.3 Origins of Governance. 1.4 Governance Definition. 1.5 Information Security Governance. 1.6 Six Outcomes of Effective Security Governance. 1.7 Defining Information, Data, Knowledge. 1.8 Value of Information. CHAPTER 2: WHY GOVERNANCE? 2.1 Benefits of Good Governance. 2.1.1 Aligning Security with Business Objectives. 2.1.2 Providing the structure and framework to optimize allocations of limited resources. 2.1.3 Providing assurance that critical decisions are not based on faulty information. 2.1.4 Ensuring accountability for safeguarding critical assets. 2.1.5 Increasing trust of customers and stakeholders. 2.1.6 Increasing the company’s worth. 2.1.7 Reducing liability for information inaccuracy or lack of due care in protection. 2.1.8 Increasing predictability and reducing uncertainty of business operations. 2.2 A Management Problem. CHAPTER 3: LEGAL AND REGULATORY REQUIREMENTS. 3.1 Security Governance and Regulation. CHAPTER 4: ROLES & RESPONSIBILITIES. 4.1 The Board of Directors. 4.2 Executive Management. 4.3 Security Steering Committee. 4.4 The CISCO. CHAPTER: STRATEGIC METRICS. 5.1 Governance Objectives. 5.1.1 Strategic Direction. 5.1.2 Ensuring Objectives are Achieved. 5.1.3. Risks Managed Appropriately. 5.1.4 Verifying Resources are Used Responsibly. CHAPTER 6: INFORMATION SECURITY OUTCOMES. 6.1 Defining Outcomes. 6.1.1 Strategic alignment. 6.1.2 Risk Management. 6.1.3 Business process assurance / convergence. 6.1.4 Value delivery. 6.1.5 Resource management. 6.1.6 Performance measurement. CHAPTER 7: SECURITY GOVERNANCE OBJECTIVES. 7.1 Security Architecture. 7.1.1 Managing Complexity. 7.1.2 Providing a Framework & Road Map. 7.1.3 Simplicity & Clarity through Layering & Modularisation. 7.1.4 Business Focus beyond the Technical Domain. 7.1.5 Objectives of Information Security Architectures. 7.1.6 SABSA Framework for Security Service Management. 7.1.7 SABSA Development Process. 7.1.8 SABSA Lifecycle. 7.1.9 SABSA Attributes. 7.2 COBIT. 7.3 Capability Maturity Model. 7.4 ISO/IEC 27001/ 27002. 7.4.1 ISO 27001. 7.4.2 ISO 27002. 7.5 Other Approaches. 7.5.1 National Cybersecurity Task Force. CHAPTER 8: RISK MANAGEMENT OBJECTIVES. Risk Management Responsibilities. Managing Risk Appropriately. 8.1 Determining Risk Management Objectives. 8.1.1 Recovery Time Objectives. CHAPTER 9: CURRENT STATE. 9.1 Current State of Security. 9.2 Current State of Risk Management. 9.3 Gap Analysis - Unmitigated Risk. 9.3.1 SABSA. 9.3.2 CMM. CHAPTER 10: DEVELOPING A SECURITY STRATEGY. 10.1 Failures of Strategy. 10.2 Attributes of A Good Security Strategy. 10.3 Strategy Resources. 10.3.1 Utilizing Architecture for Strategy Development. 10.3.2 Using Cobit for Strategy Development. 10.3.3 Using CMM for Strategy Development. 10.4 STRATEGY CONSTRAINTS. 10.4.1 Contextual constraints. 10.4.2 Operational constraints. CHAPTER 11: SAMPLE STRATEGY DEVELOPMENT. 11.1 The Process. CHAPTER 12: IMPLEMENTING STRATEGY. Action Plan Intermediate Goals. Action Plan Metrics. Re-engineering. Inadequate Performance. 12.1 Elements Of Strategy. 12.1.1 Policy Development. Attributes of Good Policies. Sample Policy Development. Other Policies. 12.1.2 Standards. Attributes of Good Standards. Sample Standards. Classifications. Standard Statement. CHAPTER 13: SECURITY PROGRAM DEVELOPMENT METRICS. 13.1 Information Security Program Development Metrics. 13.2 Program Development Operational Metrics. CHAPTER 14: INFORMATION SECURITY MANAGEMENT METRICS. 14.1 Management Metrics. 14.2 Security Management Decision Support Metrics. 14.4 CISO Decisions. 14.2.1 Strategic alignment. 14.2.2 Risk Management. 14.2.3 Metrics for Risk Management. 14.2.4 Assurance Process Integration. 14.2.5 Value Delivery. 14.2.6 Resource Management. 14.2.7 Performance Measurement. 14.7 Information Security Operational Metrics. 14.3.1 IT and Information Security Management. 14.3.2 Compliance Metrics. CHAPTER 15: INCIDENT MANAGEMENT AND RESPONSE METRICS. 15.1 Incident Management Decision Support Metrics. Conclusion. Appendix A. SABSA Business Attributes & Metrics. Appendix B. Cultural Worldviews. Heirarchists. Egalitarians. Individualists. Fatalists.

    £77.36

  • Analysis of DNA Microarrays

    Wiley Analysis of DNA Microarrays

    7 in stock

    Book SynopsisThe rapid uncontrolled growth of classification methods in DNA microarray studies has resulted in a body of information scattered throughout literature, numerous conference proceedings, and others. This book brings together many of the unsupervised and supervised classification methods now dispersed in the literature.

    7 in stock

    £83.66

  • Mastering UNIX Shell Scripting 2e Bash Bourne and

    John Wiley & Sons Inc Mastering UNIX Shell Scripting 2e Bash Bourne and

    Book SynopsisUNIX expert Randal K. Michael guides you through every detail of writing shell scripts to automate specific tasks. Each chapter begins with a typical, everyday UNIX challenge, then shows you how to take basic syntax and turn it into a shell scripting solution. Covering Bash, Bourne, and Korn shell scripting, this updated edition provides complete shell scripts plus detailed descriptions of each part. UNIX programmers and system administrators can tailor these to build tools that monitor for specific system events and situations, building solid UNIX shell scripting skills to solve real-world system administration problems.Table of ContentsAcknowledgments xxv Introduction xxvii Part One The Basics of Shell Scripting Chapter 1 Scripting Quick Start and Review 3 Chapter 2 24 Ways to Process a File Line-by-Line 67 Chapter 3 Automated Event Notification 131 Chapter 4 Progress Indicators Using a Series of Dots, a Rotating Line, or Elapsed Time 143 Part Two Scripts for Programmers, Testers, and Analysts Chapter 5 Working with Record Files 157 Chapter 6 Automated FTP Stuff 187 Chapter 7 Using rsync to Efficiently Replicate Data 219 Chapter 8 Automating Interactive Programs with Expect and Autoexpect 291 Chapter 9 Finding Large Files and Files of a Specific Type 325 Chapter 10 Process Monitoring and Enabling Pre-Processing, Startup, and Post-Processing Events 335 Chapter 11 Pseudo-Random Number and Data Generation 369 Chapter 12 Creating Pseudo-Random Passwords 401 Chapter 13 Floating-Point Math and the bc Utility 433 Chapter 14 Number Base Conversions 475 Chapter 15 hgrep: Highlighted grep Script 515 Chapter 16 Monitoring Processes and Applications 527 Part Three Scripts for Systems Administrators Chapter 17 Filesystem Monitoring 553 Chapter 18 Monitoring Paging and Swap Space 603 Chapter 19 Monitoring System Load 641 Chapter 20 Monitoring for Stale Disk Partitions (AIX-Specific) 677 Chapter 21 Turning On/Off SSA Identification Lights 697 Chapter 22 Automated Hosts Pinging with Notification of Failure 723 Chapter 23 Creating a System-Configuration Snapshot 741 Chapter 24 Compiling, Installing, Configuring, and Using sudo 777 Chapter 25 Print-Queue Hell: Keeping the Printers Printing 809 Chapter 26 Those Pesky Sarbanes-Oxley (SOX) Audits 851 Chapter 27 Using Dirvish with rsync to Create Snapshot-Type Backups 867 Chapter 28 Monitoring and Auditing User Keystrokes 935 Appendix A What’s on the Web Site 955 Index 977

    £54.62

  • Mastering Active Directory for Windows Server

    John Wiley & Sons Inc Mastering Active Directory for Windows Server

    Book SynopsisFind all the information you need to manage and maintain Active Directory in Mastering Active Directory for Windows Server(R) 2008 , an in-depth guide updated with over 300 pages of new material.Trade Review"The authors have compiled an incredibly useful list of web references...how to work effectively to get the maximum out of the new features" (IT Training, March 2009)Table of ContentsIntroduction xxv Part 1 • Active Directory Design 1 Chapter 1 • Active Directory Fundamentals 3 Chapter 2 • Domain Name System Design 17 Chapter 3 • Active Directory Domain Services Forest and Domain Design 43 Chapter 4 • Organizing the Physical and Logical Aspects of AD DS 79 Chapter 5 • Flexible Single Master Operations Design 119 Part 2 • Active Directory Object Management 127 Chapter 6 • Managing Accounts: User, Group, and Computer 129 Chapter 7 • Maintaining Organizational Units 179 Chapter 8 • Managing Group Policy 207 Chapter 9 • Managing Active Directory Security 245 Part 3 • Active Directory Service Management 265 Chapter 10 • Managing Access with Active Directory Services 267 Chapter 11 • Managing Active Directory Rights Management Services 297 Chapter 12 • Managing Active Directory Certificate Services 329 Chapter 13 • Managing the Flexible Single Master Operations Roles 365 Chapter 14 • Maintaining the Active Directory Database 387 Part 4 • Active Directory Best Practices and Troubleshooting 409 Chapter 15 • Microsoft’s Troubleshooting Methodology for Active Directory 411 Chapter 16 • Troubleshooting Problems Related to Network Infrastructure 425 Chapter 17 • Troubleshooting Problems Related to the Active Directory Database 451 Part 5 • Streamlining Management with Scripts 483 Chapter 18 • ADSI Primer 485 Chapter 19 • Active Directory Scripts 541 Chapter 20 • Monitoring Active Directory 615 Chapter 21 • Managing Active Directory with PowerShell 653 Appendix A • The Bottom Line 683 Index 709

    £52.25

  • John Wiley & Sons Inc Data Mining with Microsoft SQL Server 2008

    Out of stock

    Book SynopsisUnderstand how to use the new features of Microsoft SQL Server 2008 for data mining by using the tools in Data Mining with Microsoft SQL Server 2008 , which will show you how to use the SQL Server Data Mining Toolset with Office 2007 to mine and analyze data.Table of Contents1. Introduction to Data Mining. 2. Applied Data Mining Using Microsoft Excel 2007. 3. DMX and SQL Server Data Mining Concepts. 4. Using SQL Server Data Mining. 5. Implementing a Data Mining Process Using Office 2007. 6. Microsoft Naïve Bayes. 7. Microsoft Decision Trees Algorithm. 8. Microsoft Time Series Algorithm. 9. Microsoft Clustering. 10. Microsoft Sequence Clustering. 11. Microsoft Association Rules. 12. Microsoft Neural Network and Logistic Regression. 13. Mining OLAP Cubes. 14. Data Mining with SQL Server Integration Services. 15. SQL Server Data Mining Architecture. 16. Programming SQL Server Data Mining. 17. Extending SQL Server Data Mining. 18. Implementing a Web Cross-Selling Application. 19. Conclusion and Additional Resources. Appendix A. Datasets. Appendix B. Supported Functions. Index.

    Out of stock

    £999.99

  • Storage Area Networks For Dummies

    John Wiley & Sons Inc Storage Area Networks For Dummies

    Book SynopsisIf you've been charged with setting up storage area networks for your company, learning how SANs work and managing data storage problems might seem challenging. Storage Area Networks For Dummies, 2nd Edition comes to the rescue with just what you need to know. Whether you already a bit SAN savvy or you're a complete novice, here's the scoop on how SANs save money, how to implement new technologies like data de-duplication, iScsi, and Fibre Channel over Ethernet, how to develop SANs that will aid your company's disaster recovery plan, and much more. For example, you can: Understand what SANs are, whether you need one, and what you need to build one Learn to use loops, switches, and fabric, and design your SAN for peak performance Create a disaster recovery plan with the appropriate guidelines, remote site, and data copy techniques Discover how to connect or extend SANs and how compression can reduce costs CTable of ContentsIntroduction. Part I: SAN 101. Chapter 1: The Storage Area Network. Chapter 2: SAN Building Blocks. Chapter 3: What Makes a SAN Go. Chapter 4: What Makes a SAN Stop. Part II: Designing and Building a SAN. Chapter 5: Designing the SAN. Chapter 6: SANs and Disaster Recovery. Chapter 7: Putting It All Together. Part III: Using Advanced SAN Features. Chapter 8: Networking SANs. Chapter 9: SAN-Based Backup. Chapter 10: Mirror, Mirror: Point-in-Time Copies. Part IV: SAN Management and Troubleshooting. Chapter 11: Approaches to SAN Management. Chapter 12: Troubleshooting SANs. Part V: Understanding the Cool Stuff. Chapter 13: Using Data De-Duplication to Lighten the Load. Chapter 14: Continuous Data Protection. Chapter 15: Everything You Ever Wanted to Know about Virtualization. Part VI: The Par t of Tens. Chapter 16: Ten Reasons to Use a SAN. Chapter 17: Ten Reasons NOT to Use a SAN. Index.

    £19.54

  • MySQL Administrators Bible

    John Wiley & Sons Inc MySQL Administrators Bible

    Book SynopsisWith special focus on the next major release of MySQL, this resource provides a solid framework for anyone new to MySQL or transitioning from another database platform, as well as experience MySQL administrators. The high-profile author duo provides essential coverage of the fundamentals of MySQL database managementincluding MySQL's unique approach to basic database features and functionsas well as coverage of SQL queries, data and index types, stores procedure and functions, triggers and views, and transactions. They also present comprehensive coverage of such topics as MySQL server tuning, managing storage engines, caching, backup and recovery, managing users, index tuning, database and performance monitoring, security, and more.Table of ContentsIntroduction xxvii Part I First Steps with MySQL Chapter 1: Introduction to MySQL 3 MySQL Mission — Speed, Reliability, and Ease of Use 3 Company background 4 Community and Enterprise server versions 5 The MySQL Community 6 How to contribute 6 Reasons to contribute 7 Summary 7 Chapter 2: Installing and Upgrading MySQL Server 9 Before Installation 9 Choosing the MySQL version 11 MySQL support 12 Downloads 12 Installation 12 MySQL Server installations on Unix 13 MySQL Server Installation on Windows 20 Installing MySQL from a Noinstall Zip Archive 24 Starting and stopping MySQL from the Windows command line 25 Starting and stopping MySQL as a Windows service 26 Initial Configuration 29 Unix configuration file 31 Windows configuration file 31 MySQL Configuration Wizard on Windows 31 Detailed Configuration 32 The Server Type screen 33 Database Usage screen 33 InnoDB Tablespace screen 34 Concurrent Connections screen 34 Networking Options and Strict Mode Options screen 34 Character Set screen 35 Service Options screen 35 Security Options screen 35 Confirmation screen 36 MySQL Post-Install Configuration on Unix 36 Initializing the system tables 36 Setting initial passwords 37 Root user password assignment 37 Anonymous users 39 Securing Your System 40 Windows PATH Variable Configuration 42 Automated startup 42 Starting and stopping mysqld on System V-based Unix 42 System V run levels 43 Upgrading mysqld 45 The MySQL changelog 45 Upgrading MySQL on Windows 46 Troubleshooting 47 Summary 48 Chapter 3: Accessing MySQL 49 Accessing mysqld with Command-Line Tools 49 Frequently used options 50 Using the command-line mysql client 52 mysqladmin — Client for administering a server 62 GUI Tools 66 SQLyog 66 phpMyAdmin 69 MySQL Query Browser 71 MySQL Administrator 74 MySQL Workbench 80 Summary 83 Part II Developing with MySQL Chapter 4: How MySQL Extends and Deviates from SQL 87 Learning MySQL Language Structure 88 Comments and portability 88 Case-sensitivity 90 Escape characters 91 Naming limitations and quoting 93 Dot notation 95 Time zones 97 Character sets and collations 98 Understanding MySQL Deviations 105 Privileges and permissions 110 Transaction management 110 Check constraints 111 Upsert statements 112 Using MySQL Extensions 114 Aliases 115 Alter Table extensions 115 Create Extensions 118 DML Extensions 119 Drop Extensions 124 The LIMIT Extension 125 SELECT Extensions 126 Select Into Outfile/Select Into Dumpfile 126 Sql_Small_Result/Sql_Big_Result 127 Union Order By 127 Select For Update 127 Select Lock In Share Mode 128 Distinctrow 128 Sql_Buffer_Result 129 High_Priority/Low_Priority 129 Server maintenance extensions 129 The Set extension and user-defined variables 131 The Show extension 135 Table definition extensions 147 Table maintenance extensions 150 Transactional statement extensions 156 Summary 158 Chapter 5: MySQL Data Types 159 Looking at MySQL Data Types 159 Character String Types 160 Length 162 Character string type attributes 164 National Character String Types 166 Binary Large Object String Types 168 Blob values 169 Binary values 169 Binary length 169 Varbinary length 170 Numeric Types 170 Numeric data sizes and ranges 172 Numeric data type attributes 177 Boolean Types 180 Datetime Types 183 Allowed input values 185 Microsecond input 186 Automatic updates 187 Conversion issues 188 Numeric functions and Datetime types 188 Other conversion issues 190 Datetime data type attributes 191 The effect of time zones 192 Interval Types 193 ENUM and SET Types 195 Enumerations 195 ENUM and SET data type attributes 198 Choosing SQL Modes 201 Invalid data 201 SQL modes 203 Using NULL Values 211 Finding an Optimal Data Type for Existing Data 212 Small data samples and Procedure Analyse() 215 Summary 217 Chapter 6: MySQL Index Types 219 Looking at Keys and Indexes 219 Using Indexes to Speed Up Lookups 221 Creating and dropping indexes 223 Index order 225 Index length 226 Index types 228 Redundant indexes 230 Creating and Dropping Key Constraints 231 Creating and dropping unique key constraints 231 Creating and dropping foreign key constraints 232 Foreign key constraints and data changes 234 Requirements for foreign key constraints 235 Using FULLTEXT Indexes 237 Summary 239 Chapter 7: Stored Routines, Triggers, and Events 241 Comparing Stored Routines, Triggers, and Events 241 Using Triggers 242 Creating a trigger 243 Dropping a trigger 244 Multiple SQL statements in triggers 245 Changing a trigger 246 Triggers on views and temporary tables 247 Trigger runtime behavior 248 Finding all triggers 252 Trigger storage and backup 252 Triggers and replication 254 Trigger limitations 254 Using Stored Routines 255 Performance implications of stored routines 256 Stored procedures vs stored functions 256 Creating a stored routine 256 Invoking a stored procedure 259 Dropping a stored routine 261 Multiple SQL statements in stored routines 261 INOUT arguments to a stored procedure 261 Local variables 262 Stored routine runtime behavior 264 Options when creating routines 265 Creating a basic stored function 268 Full Create Function syntax 269 Invoking a stored function 269 Changing a stored routine 270 Naming: stored routines 271 Stored procedure result sets 273 Stored routine errors and warnings 274 Conditions and handlers 275 Stored routine flow control 282 Recursion 284 Stored routines and replication 285 Stored function limitations 285 Stored routine backup and storage 286 Using Cursors 287 Using Events 289 Turning on the event scheduler 289 Creating an event 291 Dropping an event 292 Multiple SQL statements in events 293 Start and end times for periodic events 293 Event status 294 Finding all events 295 Changing an event 295 After the last execution of an event 296 Event logging 297 Event runtime behavior 298 Event limitations 299 Event backup and storage 300 Summary 300 Chapter 8: MySQL Views 301 Defining Views 302 View definition limitations and unexpected behavior 304 Security and privacy 305 Specify a view’s definer 306 Abstraction and simplification 307 Performance 308 Updatable views 313 Changing a View Definition 317 Replication and Views 317 Summary 318 Chapter 9: Transactions in MySQL 319 Understanding ACID Compliance 320 Atomicity 321 Consistency 321 Isolation 321 Durability 321 Using Transactional Statements 322 Begin, Begin Work, and Start Transaction 322 Commit 322 Rollback 322 Savepoints 323 Autocommit 324 Using Isolation Levels 325 Read Uncommited 329 Read Committed 331 Repeatable Read 332 Serializable 334 Multi-version concurrency control 335 Explaining Locking and Deadlocks 336 Table-level locks 338 Page-level locks 341 Row-level locks 341 Recovering MySQL Transactions 343 Summary 344 Part III Core MySQL Administration Chapter 10: MySQL Server Tuning 349 Choosing Optimal Hardware 349 Tuning the Operating System 352 Operating system architecture 352 File systems and partitions 353 Buffers 356 Kernel parameters 357 Linux 357 Other daemons 360 Tuning MySQL Server 360 Status variables 360 System variables 361 Option file 361 Dynamic variables 371 Summary 373 Chapter 11: Storage Engines 375 Understanding Storage Engines 375 Storage engines as plugins 376 Storage engine comparison 376 Using Different Storage Engines 378 MyISAM storage engine 378 InnoDB storage engine 384 Memory storage engine 394 Maria storage engine 396 Falcon storage engine 401 PBXT storage engine 410 Federated storage engine 415 NDB storage engine 417 Archive storage engine 417 Blackhole storage engine 419 CSV storage engine 420 Working with Storage Engines 421 Create Table 421 Alter Table 421 Drop Table 422 Summary 422 Chapter 12: Caching with MySQL 423 Implementing Cache Tables 424 Working with the Query Cache 427 What gets stored in the query cache? 427 Query cache memory usage and tuning 429 Query cache fragmentation 433 Utilizing memcached 434 Summary 438 Chapter 13: Backups and Recovery 439 Backing Up MySQL 439 Uses for backups 441 Backup frequency 443 What to back up 445 Backup locations 445 Backup methods 445 Online backup 460 mysqlhotcopy 462 Commercial options 464 Copying Databases to Another Machine 467 Recovering from Crashes 468 Planning for Disasters 471 Summary 472 Chapter 14: User Management 473 Learning about MySQL Users 473 Access Control Lists 474 Wildcards 475 System tables 476 Managing User Accounts 478 Grant and Revoke commands 481 Show Grants and mk-show-grants 485 Resetting the Root Password 487 Windows server 488 Unix-based server 489 Debugging User Account Problems 490 Bad password 490 Access issues 491 Client does not support authentication protocol 491 Can’t connect to local mysqld through socket ‘/path/to/mysqld.sock’ 492 I do not have the right permissions! 493 Summary 494 Chapter 15: Partitioning 495 Learning about Partitioning 495 Partitioning Tables 496 RANGE partitioning 497 LIST partitioning 502 HASH partitioning 503 KEY partitioning 504 Composite partitioning 504 Partition management commands 507 Restrictions of partitioning 510 Merge Tables 510 Creating a Merge table 511 Changing a Merge table 512 Advantages of Merge tables 513 Partitioning with MySQL Cluster 513 Programmatic Partitioning 514 Summary 514 Chapter 16: Logging and Replication 517 Log Files 517 Error log 517 Binary logs 518 Relay logs 520 General and slow query logs 520 Rotating logs 522 Other methods of rotating 523 Replication 524 Setting up semisynchronous replication 525 Statement-based, row-based, and mixed-based replication 527 Replication Configurations 529 Simple replication 529 Change Master statement 534 More complex setups 534 Additional replication configuration options 539 Correcting Data Drift 540 mk-table-checksum overview 540 mk-table-sync overview 542 Putting this together 542 Summary 543 Chapter 17: Measuring Performance 545 Benchmarking 546 mysqlslap 547 SysBench 552 Benchmarking recommendations 565 Profiling 566 Show Global Status 566 mysqltuner 568 mysqlreport 572 mk-query-profiler 580 mysqldumpslow 583 Capacity Planning 585 Summary 585 Part IV Extending Your Skills Chapter 18: Query Analysis and Index Tuning 589 Using Explain 590 Explain plan basics 590 Data access strategy 596 Explain plan indexes 606 Rows 607 Extra 608 Subqueries and Explain 611 Explain Extended 612 Explain on Non-Select Statements 614 Other Query Analysis Tools 614 Optimizing Queries 615 Factors affecting key usage 615 Optimizer hints 616 Adding an Index 616 Optimizing away Using temporary 620 Using an index by eliminating functions 623 Non-index schema changes 626 Batching expensive operations 628 Optimizing frequent operations 629 Summary 631 Chapter 19: Monitoring Your Systems 633 Deciding What to Monitor 634 Examining Open Source Monitoring 636 Nagios 636 Cacti 637 Hyperic HQ 638 OpenNMS 640 Zenoss Core 641 Munin 642 Monit 643 Examining Commercial Monitoring 644 MySQL enterprise monitor 644 MONyog 645 Summary 646 Chapter 20: Securing MySQL 649 Access Control Lists 649 Wildcards and blank values 650 Privilege and privilege levels 651 Accessing the Operating System 654 Database access 654 Changing MySQL connectivity defaults 654 Operating system login 654 Securing Backups and Logs 656 Data Security 656 Data flow 657 Encrypted connectivity 659 Data security using MySQL objects 664 Creating Security Policies 665 Summary 666 Chapter 21: The MySQL Data Dictionary 667 Object Catalog 668 Schemata 668 Tables 670 Views 674 Columns 676 Statistics 679 Table_Constraints 681 Key_Column_Usage 682 Referential_Constraints 684 Triggers 685 Routines 686 Parameters 690 Events 691 Partitions 693 System Information 695 Character_Sets 695 Collations 696 Collation_Character_Set_Applicability 696 Engines 697 Plugins 697 Processlist 698 Profiling 709 Global_Variables 710 Session_Variables 710 Global_Status 711 Session_Status 711 Displaying Permissions 711 Column_Privileges 712 Table_Privileges 713 Schema_Privileges 714 User_Privileges 715 Storage Engine-Specific Metadata 716 Custom Metadata 716 Defining the plugin 716 Compiling the plugin 722 Installing the plugin 724 Summary 725 Chapter 22: Scaling and High Availability Architectures 727 Replication 728 One read slave 729 Promoting a new master 729 Many read slaves 734 Master/master replication 735 Circular replication 736 SAN 737 DRBD 738 MySQL and DRBD setup 738 MySQL Proxy 739 Scaling read queries 740 Automated failover 740 Read/write splitting 742 Sharding 742 Linux-HA Heartbeat 742 MySQL Cluster 744 Connection Pooling 746 memcached 747 Summary 748 Appendix A: MySQL Proxy 749 Appendix B: Functions and Operators 783 Appendix C: Resources 813 Index 821

    £45.12

  • Risk Centric Threat Modeling

    John Wiley & Sons Inc Risk Centric Threat Modeling

    Book SynopsisThis book introduces the Process for Attack Simulation & Threat Analysis (PASTA) threat modeling methodology. It provides an introduction to various types of application threat modeling and introduces a risk-centric methodology aimed at applying security countermeasures that are commensurate to the possible impact that could be sustained from defined threat models, vulnerabilities, weaknesses, and attack patterns. This book describes how to apply application threat modeling as an advanced preventive form of security. The authors discuss the methodologies, tools, and case studies of successful application threat modeling techniques. Chapter 1 provides an overview of threat modeling, while Chapter 2 describes the objectives and benefits of threat modeling. Chapter 3 focuses on existing threat modeling approaches, and Chapter 4 discusses integrating threat modeling within the different types of Software Development Lifecycles (SDLCs). Threat modeling and risk management is the fTable of ContentsForeword ix Preface xv List of Figures xvii List of Tables xxiii 1 Threat Modeling Overview 1 Definitions 1 Origins and Use 3 Summary 8 Rationale and Evolution of Security Analysis 9 Summary 19 Building A Better Risk Model 19 Summary 31 Threat Anatomy 33 Summary 48 Crowdsourcing Risk Analytics 48 2 Objectives and Benefits of Threat Modeling 63 Defining a Risk Mitigation Strategy 63 Improving Application Security 82 Building Security in the Software Development Life Cycle 92 Identifying Application Vulnerabilities and Design Flaws 104 Analyzing Application Security Risks 118 3 Existing Threat Modeling Approaches 137 Security Software Risk-Based Variants 137 4 Threat Modeling Within the SDLC 195 Building Security in SDLC with Threat Modeling 195 Integrating Threat Modeling Within The Different Types of SDLCs 205 5 Threat Modeling and Risk Management 235 Data Breach Incidents and Lessons for Risk Management 235 Threats and Risk Analysis 259 Risk-Based Threat Modeling 282 Threat Modeling in Information Security and Risk Management Processes 289 Threat Modeling Within Security Incident Response Processes 306 6 Intro to PASTA 317 Risk-Centric Threat Modeling 317 7 Diving Deeper into PASTA 343 Exploring the Seven Stages and Embedded Threat Modeling Activities 343 Chapter Summary 478 8 PASTA Use Case 479 PASTA Use Case Example Walk-Through 479 Glossary 633 References 653 Index 657

    £84.56

  • Network Security Bible

    John Wiley & Sons Inc Network Security Bible

    Book SynopsisThe comprehensive A-to-Z guide on network security, fully revised and updated Network security is constantly evolving, and this comprehensive guide has been thoroughly updated to cover the newest developments. If you are responsible for network security, this is the reference you need at your side.Table of ContentsIntroduction xxxv Part I: Network Security Landscape Chapter 1: State of Network Security 3 Cyber Security 3 Summary 7 Chapter 2: New Approaches to Cyber Security 9 General Trends 9 The Changing Face of Cyber Security 16 Summary 17 Chapter 3: Interfacing with the Organization 19 An Enterprise Security Methodology 19 Key Questions to Manage Risk 27 Summary 32 Part II: Security Principles and Practices Chapter 4: Information System Security Principles 35 Key Principles of Network Security 35 Formal Processes 37 Risk Management 60 Calculating and Managing Risk 70 Summary 71 Chapter 5: Information System Security Management 73 Security Policies 73 Security Awareness 77 Managing the Technical Effort 79 Configuration Management 87 Business Continuity and Disaster Recovery Planning 90 Physical Security 98 Legal and Liability Issues 105 Summary 107 Chapter 6: Access Control 109 Control Models 109 Types of Access Control Implementations 112 Identification and Authentication 115 Databases 121 Remote Access 123 Summary 125 Chapter 7: Attacks and Threats 127 Malicious Code 127 Review of Common Attacks 129 External Attack Methodologies Overview 136 Internal Threat Overview 140 Summary 142 Part III: Operating Systems and Applications Chapter 8: Windows Security 145 Windows Security at the Heart of the Defense 147 Out-of-the-Box Operating System Hardening 151 Installing Applications 171 Putting the Workstation on the Network 175 Operating Windows Safely 177 Upgrades and Patches 191 Maintain and Test the Security 194 Attacks Against the Windows Workstation 198 Summary 205 Chapter 9: UNIX and Linux Security 207 The Focus of UNIX/Linux Security 207 Physical Security 212 Controlling the Configuration 217 Operating UNIX Safely 224 Hardening UNIX 245 Summary 253 Chapter 10: Web Browser and Client Security 255 Web Browser and Client Risk 255 How a Web Browser Works 259 Web Browser Attacks 268 Operating Safely 271 Web Browser Configurations 276 Summary 286 Chapter 11: Web Security 287 What Is HTTP? 287 How Does HTTP Work? 289 Server Content 301 Client Content 303 State 309 Attacking Web Servers 315 Web Services 317 Summary 321 Chapter 12: Electronic mail (E-mail) Security 323 The E-mail Risk 323 The E-mail Protocols 340 E-mail Authentication 345 Operating Safely When Using E-mail 348 Summary 355 Chapter 13: Domain Name System 357 DNS Basics 358 Purpose of DNS 364 Setting Up DNS 375 Security Issues with DNS 377 DNS Attacks 384 Designing DNS 386 Master Slave DNS 388 Detailed DNS Architecture 388 DNS SEC 389 Summary 393 Chapter 14: Server Security 395 General Server Risks 395 Security by Design 396 Operating Servers Safely 413 Server Applications 417 Multi-Level Security and Digital Rights Management 421 Summary 427 Part IV: Network Security Fundamentals Chapter 15: Network Protocols 431 Protocols 431 The Open Systems Interconnect Model 432 The OSI Layers 433 The TCP/IP Model 439 TCP/IP Model Layers 441 Internet Protocol 442 VoIP 450 Summary 457 Chapter 16: Wireless Security 459 Electromagnetic Spectrum 459 The Cellular Phone Network 462 Placing a Cellular Telephone Call 464 Wireless Transmission Systems 469 Pervasive Wireless Data Network Technologies 473 IEEE Wireless LAN Specifications 478 IEEE 802.11 480 IEEE 802.11 Wireless Security 485 Bluetooth 503 Wireless Application Protocol 504 Future of Wireless 506 Summary 508 Chapter 17: Network Architecture Fundamentals 509 Network Segments 510 Perimeter Defense 511 Network Address Translation 511 Basic Architecture Issues 513 Subnetting, Switching, and VLANs 516 Address Resolution Protocol and Media Access Control 517 Dynamic Host Configuration Protocol and Addressing Control 518 Zero Configuration Networks 519 System Design and Architecture Against Insider Threats 525 Common Attacks 528 Summary 529 Chapter 18: Firewalls 531 Firewalls 531 Firewall Rules 537 The Use of Personal Firewalls 542 Summary 548 Chapter 19: Intrusion Detection/Prevention 549 Intrusion Detection Systems 549 Responses to Intrusion Detection 556 Emerging Technologies in Intrusion Detection Systems 556 Summary 567 Part V: Communication Chapter 20: Secret Communication 571 What is Cryptography? 572 General Terms 576 Principles of Cryptography 577 The Four Cryptographic Primitives 587 Putting These Primitives Together to Achieve CIA 602 The Difference Between Algorithm and Implementation 603 Proprietary Versus Open Source Algorithms 606 Attacks on Hash Functions 607 Quantum Cryptography 617 Summary 628 Chapter 21: Covert Communication 631 Where Hidden Data Hides 631 Where Did It Come From? 633 Where Is It Going? 633 Overview of Steganography 634 History of Steganography 639 Core Areas of Network Security and Their Relation to Steganography 641 Principles of Steganography 643 Steganography Compared to Cryptography 644 Types of Steganography 646 Products That Implement Steganography 654 Steganography Versus Digital Watermarking 673 Types of Digital Watermarking 675 Goals of Digital Watermarking 676 Digital Watermarking and Stego 676 Summary 679 Chapter 22: Applications of Secure/Covert Communication 681 E-mail 682 Authentication Servers 685 Working Model 686 Public Key Infrastructure 688 Virtual Private Networks 692 Secure Sockets Layer/Transport Layer Security 699 SSL Handshake 700 Summary 704 Part VI: The Security Threat and Response Chapter 23: Intrusion Detection and Response 707 Intrusion Detection Mechanisms 707 Honeypots 712 Incident Handling 716 Summary 727 Chapter 24: Digital Forensics 729 Computer Forensics Defined 730 Traditional Computer Forensics 730 Proactive Forensics 746 Future Research Areas 748 The Forensic Life Cycle 750 Summary 750 Chapter 25: Security Assessments, Testing, and Evaluation 751 Information Assurance Approaches and Methodologies 751 Certification and Accreditation 756 Diacap 760 Federal Information Processing Standard 102 763 OMB Circular A-130 764 The National Institute of Standards and Technology Assessment Guidelines 765 Penetration Testing 770 Auditing and Monitoring 772 Summary 774 Part VII: Integrated Cyber Security Chapter 26: Validating Your Security 777 Overview 777 Current State of Penetration Testing 780 Formal Penetration Testing Methodology 783 Steps to Exploiting a System 787 Summary 795 Chapter 27: Data Protection 797 Endpoint Security 799 Insider Threats and Data Protection 805 Summary 806 Chapter 28: Putting Everything Together 809 Critical Problems Facing Organizations 809 General Tips for Protecting a Site 815 Security Best Practices 819 Summary 834 Chapter 29: The Future 835 Approaching the Problem 835 Mission Resilience 837 Limiting Failure Points 844 Summary 847 Index 849

    £38.00

  • eDiscovery for Dummies

    John Wiley & Sons Inc eDiscovery for Dummies

    Book SynopsisDiscover the process of e-discovery and put good practices in place. Electronic information involved in a lawsuit requires a completely different process for management and archiving than paper information.Table of ContentsIntroduction 1 Who Should Read This Book? 1 About This Book 2 What You’re Not to Read 2 Foolish Assumptions 2 How This Book Is Organized 3 Part I: Examining e-Discovery and ESI Essentials 3 Part II: Guidelines for e-Discovery and Professional Competence 3 Part III: Identifying, Preserving, and Collecting ESI 4 Part IV: Processing, Protecting, and Producing ESI 4 Part V: Getting Litigation Ready 4 Part VI: Strategizing for e-Discovery Success 5 Part VII: The Part of Tens 5 Glossary 5 Icons Used in This Book 5 Where to Go from Here 6 Part I: Examining e-Discovery and ESI Essentials 7 Chapter 1: Knowing Why e-Discovery Is a Burning Issue 9 Getting Thrust into the Biggest Change in the Litigation 10 New rules put electronic documents under a microscope 11 New rules and case law expand professional responsibilities 12 Distinguishing Electronic Documents from Paper Documents 14 ESI has more volume 15 ESI is more complex 15 ESI is more fragile 16 ESI is harder to delete 17 ESI is more software and hardware dependent 18 Viewing the Litigation Process from 1,000 Feet 18 Examining e-Discovery Processes 20 Creating and retaining electronic records 20 Identifying, preserving, and collecting data relevant to a legal matter 21 Processing and filtering to remove the excess 22 Reviewing and analyzing for privilege 22 Producing what’s required 23 Clawing back what sneaked out 23 Presenting at trial 24 Chapter 2: Taking a Close Look at Electronically Stored Information (ESI) 25 Spotting the ESI in the Game Plan 26 Viewing the Life of Electronic Information 27 Accounting for age 27 Tracking the rise and fall of an e-mail 29 Understanding Zubulake I 30 Taking the two-tier test 34 Preserving the Digital Landscape 36 Facing Sticker Shock: What ESI Costs 37 Estimating hard and hidden costs 39 Looking at the costs of being surprised by a request 40 Chapter 3: Building e-Discovery Best Practices into Your Company 43 Setting Up a Reasonable Defensive Strategy 44 Heeding judicial advice 45 Keeping ESI intact and in-reach 46 Braking for Litigation Holds 48 Insuring a stronghold 48 Getting others to buy-in 49 Holding on tight to your ESI 50 Putting Best Practices into Place 51 Forming Response Teams 54 Putting Project Management into Practice 55 Tackling the triple constraints 56 Managing the critical path 57 Maintaining Ethical Conduct and Credibility 57 Part II: Guidelines for e-Discovery and Professional Competence 59 Chapter 4: The Playbook: Federal Rules and Advisory Guidelines 61 Knowing the Rules You Must Play By 62 Deciphering the FRCP 63 FRCP 1 63 FRCP 16 63 FRCP 26 65 FRCP 33 and 34 66 Applying the Rules to Criminal Cases 66 F.R. Crim. P. Rule 41 71 F. R. Crim. P. Rule 16 71 F. R. Crim. P. Rule 17 and 17.1 71 Learning about Admissibility 71 Lessening the Need for Judicial Intervention by Cooperation 73 Limiting e-Discovery 74 Finding Out About Sanctions 75 Rulings on Metadata 77 Getting Guidance but Not Authority from Sedona Think Tanks 79 Collecting the Wisdom of the Chief Justices and National Law Conference 79 Minding the e-Discovery Reference Model 80 Following the Federal Rules Advisory Committee 81 Chapter 5: Judging Professional Competence and Conduct 83 Making Sure Your Attorney Gives a Diligent Effort 84 Looking at what constitutes a diligent effort 84 Searching for evidence 85 Producing ESI 86 Providing a certification 86 Avoiding Being Sanctioned 87 FRCP sanctions 87 Inherent power sanctions 89 Knowing the Risks Introduced by Legal Counsel 91 Acting bad: Attorney e-discovery misconduct 91 Relying on the American Bar Association and state rules of professional conduct 93 Learning from Those Who Gambled Their Cases and Lost 94 Policing e-Discovery in Criminal Cases 96 Part III: Identifying, Preserving, and Collecting ESI 99 Chapter 6: Identifying Potentially Relevant ESI 101 Calling an e-Discovery Team into Action 102 Clarifying the Scope of e-Discovery 104 Reducing the Burden with the Proportionality Principle 107 Proportionality of scale 107 Negotiating with proportionality 108 Mapping the Information Architecture 108 Creating a data map 108 Overlooking ESI 111 Describing data retention policies and procedures 112 Proving the reasonable accessibility of ESI sources 113 Taking Lessons from the Mythical Member 113 Chapter 7: Complying with ESI Preservation and a Litigation Hold 115 Distinguishing Duty to Preserve from Preservation 116 Following The Sedona Conference 116 The Sedona Conference WG1 guidelines 117 Seeing the rules in the WG1 decision tree 119 Recognizing a Litigation Hold Order and Obligation 119 Knowing what triggers a litigation hold 120 Knowing when to issue a litigation hold 120 Knowing when a hold delay makes you eligible for sanctions 122 Accounting for downsizing and departing employees 122 Throwing a Wrench into Digital Recycling 123 Suspending destructive processes 123 Where do you put a terabyte? 124 Implementing the Litigation Hold 125 Documenting that custodians are in compliance 127 Rounding up what needs to be collected 127 Judging whether a forensics-level preservation is needed 130 Chapter 8: Managing e-Discovery Conferences and Protocols 133 Complying with the Meet-and-Confer Session 133 Preparing for the Meet-and-Confer Session 136 Preservation of evidence 136 Form of production 137 Privileged or protected ESI 138 Any other issues regarding ESI 139 Agreeing on a Timetable 139 Selecting a Rule 30(b)(6) Witness 140 Finding Out You and the Opposing Party May Have Mutual Interests 141 Part IV: Processing, Protecting, and Producing ESI 143 Chapter 9: Processing, Filtering, and Reviewing ESI 145 Planning, Tagging, and Bagging 146 Taking a finely tuned approach 147 Finding exactly what you need 147 Stop and identify yourself 149 Two wrongs and a right 150 Learning through Trial and Error 151 Doing Early Case Assessment 152 Vetting vendors 153 Breaking Out the ESI 154 Crafting the Hunt 156 Deciding on filters 156 Keyword or phrase searching 157 Deduping 157 Concept searching 158 Heeding the Grimm roadmap 158 Sampling to Validate 159 Testing the validity of the search 159 Documenting sampling efforts 160 Doing the Review 161 Choosing a review platform 161 How to perform a review 163 Chapter 10: Protecting Privilege, Privacy, and Work Product 165 Facing the Rising Tide of Electronic Information 166 Respecting the Rules of the e-Discovery Game 166 Targeting relevant information 167 Seeing where relevance and privilege intersect 168 Managing e-discovery of confidential information 170 Listening to the Masters 172 Getting or Avoiding a Waiver 172 Asserting a claim 173 Preparing a privilege log 173 Responding to ESI disclosure 175 Applying FRE 502 to disclosure 175 Leveling the Playing Field through Agreement 177 Checking out the types of agreements 177 Shoring up your agreements by court order 178 Chapter 11: Producing and Releasing Responsive ESI 181 Producing Data Sets 182 Packing bytes 183 Staging production 184 Being alert to native production motions 185 Redacting prior to disclosure 187 Providing Detailed Documentation 190 Showing an Unbroken Chain of Custody 192 Keeping Metadata Intact 193 Part V: Getting Litigation Ready 199 Chapter 12: Dealing with Evidentiary Issues and Challenges 201 Looking at the Roles of the Judge and Jury 202 Qualifying an Expert 202 Getting Through the Five Hurdles of Admissibility 204 Admitting Relevant ESI 204 Authenticating ESI 205 Self-authenticating ESI 206 Following the chain of custody 206 Authenticating specific types of ESI 207 Analyzing the Hearsay Rule 208 Providing the Best Evidence 210 Probing the Value of the ESI 210 Chapter 13: Bringing In Special Forces: Computer Forensics 211 Powering Up Computer Forensics 212 Knowing when to hire an expert 212 Knowing what to expect from an expert 214 Judging an expert like judges do 214 Doing a Scientific Forensic Search 215 Testing, Sampling, and Refining Searches for ESI 216 Applying C-Forensics to e-Discovery 218 Following procedure 219 Preparing for an investigation 220 Acquiring and preserving the image 222 Authenticating with hash 223 Recovering deleted ESI 224 Analyzing to broaden or limit 225 Expressing in Boolean 226 Producing and documenting in detail 228 Reinforcing E-Discovery 229 Fighting against forensic fishing attempts 229 Fighting with forensics on your team 230 Defending In-Depth 231 Part VI: Strategizing for e-Discovery Success 233 Chapter 14: Managing and Archiving Business Records 235 Ratcheting Up IT’s Role in Prelitigation 236 Laying the cornerstone of ERM 236 Pitching your tent before the storm 237 Telling Documents and Business Records Apart 238 Designing a Defensible ERM Program 240 Designing by committee 240 Starting with the basics 240 Getting management on board with your ERM program 242 Crafting a risk-reducing policy 244 Punching up your e-mail policy 245 Building an ERM Program 246 Kicking the keep-it-all habit 248 Doing what you say you are 248 Getting an A+ in Compliance 249 Chapter 15: Viewing e-Discovery Law from the Bench 251 Examining Unsettled and Unsettling Issues 252 Applying a reasonableness standard 252 Forcing cooperation 253 Looking at what’s reasonably accessible 254 Determining who committed misconduct 254 Exploring the Role of the Judge 258 Actively participating 258 Scheduling conferences 259 Appointing experts 259 Determining the scope of costs 262 Chapter 16: e-Discovery for Large-Scale and Complex Litigation 263 Preparing for Complex Litigation 263 Ensuring quality control 265 Getting a project management process in place 266 Proving the merits of a case by using ESI 266 Educating the Court about Your ESI 267 Using summary judgment and other tools 268 Employing an identification system 268 Form of production 269 Creating document depositories 269 Avoiding Judicial Resolution 270 Determining the Scope of Accessibility 271 Doing a good-cause inquiry 272 Cost-shifting 273 Getting Help 274 Partnering with vendors or service providers 274 Selecting experts or consulting companies 274 Chapter 17: e-Discovery for Small Cases 277 Defining Small Cases that Can Benefit from e-Discovery 278 Theft of proprietary data and breaches of contract 278 Marital matters 278 Defamation and Internet defamation 279 Characterizing Small Matters 280 Keeping ESI out of evidence 280 Shared characteristics with large cases 281 Unique characteristics and dynamics 282 Proceeding in Small Cases 283 Curbing e-Discovery with Proportionality 286 Sleuthing Personal Correspondence and Files 286 Part VII: The Part of Tens 289 Chapter 18: Ten Most Important e-Discovery Rules 291 FRCP 26(b)(2)(B) Specific Limitations on ESI 291 FRCP 26(b)(5)(B) Protecting Trial-Preparation Materials and Clawback 292 FRCP 26(a)(1)(C) Time for Pretrial Disclosures; Objections 293 FRCP 26(f) Conference of the Parties; Planning for Discovery 294 FRCP 26(g) Signing Disclosures and Discovery Requests, Responses, and Objections 294 FRCP 30(b)(6) Designation of a Witness 295 FRCP 34(b) Form of Production 296 FRCP 37(e) Safe Harbor from Sanctions for Loss of ESI 297 Federal Rules of Evidence 502(b) Inadvertent Disclosure 298 Federal Rule of Evidence 901 Requirement of Authentication or Identification 298 Chapter 19: Ten Ways to Keep an Edge on Your e-Discovery Expertise 301 The Sedona Conference and Working Group Series 302 Discovery Resources 303 Law Technology News 303 Electronic Discovery Law 304 E-Discovery Team Blog 304 LexisNexis Applied Discovery Online Law Library 305 American Bar Association Journal 305 Legal Technology’s Electronic Data Discovery 306 Supreme Court of the United States 306 Cornell Law School Legal Information Institute and Wex 307 Chapter 20: Ten e-Discovery Cases with Really Good Lessons 309 Zubulake v. UBS Warburg, 2003–2005; Employment Discrimination 309 Qualcomm v. Broadcom, 2008; Patent Dispute 310 Victor Stanley, Inc. v. Creative Pipe, Inc., 2008; Copyright Infringement 311 Doe v. Norwalk Community College, 2007; the Safe Harbor of FRCP Rule 37(e) 312 United States v. O’keefe, 2008; Criminal Case Involving e-discovery 313 Lorraine v. Markel American Insurance Co., 2007; Insurance Dispute 314 Mancia v. Mayflower Textile Services Co., et al., 2008; the Duty of Cooperate and FRCP Rule 26(g) 315 Mikron Industries Inc. v. Hurd Windows & Doors Inc., 2008; Duty to Confer 316 Gross Construction Associates, Inc., v. American Mfrs. Mutual Ins Co., 2009; Keyword Searches 317 Gutman v. Klein, 2008; Termination Sanction and Spoliation 318 Glossary 321 Index 333

    £20.39

  • SIP Security

    John Wiley & Sons Inc SIP Security

    10 in stock

    Book SynopsisInternet Telephony is one of the most important and fastest growing technologies for emerging mobile networks, as it provides a viable technical and economical alternative to current telecommunication networks. SIP is a standard protocol that has become the de-facto standard for VoIP and multimedia services.Table of ContentsForeword. About the Authors. Acknowledgment. 1 Introduction. 2 Introduction to Cryptographic Mechanisms. 2.1 Cryptographic Algorithms. 2.2 Secure Channel Establishment. 2.3 Authentication in 3GPP Networks. 2.4 Security Mechanisms Threats and Vulnerabilities. 3 Introduction to SIP. 3.1 What is SIP, Why Should we Bother About it and What are Competing Technologies? 3.2 SIP: the Common Scenarios. 3.3 Introduction to SIP Operation: the SIP Trapezoid. 3.4 SIP Components. 3.5 Addressing in SIP. 3.6 SIP Message Elements. 3.7 SIP Dialogs and Transactions. 3.8 SIP Request Routing. 3.9 Authentication, Authorization, Accounting. 3.10 SIP and Middleboxes. 3.11 Other Parts of the SIP Eco-system. 3.12 SIP Protocol Design and Lessons Learned. 4 Introduction to IMS. 4.1 SIP in IMS. 4.2 General Architecture. 4.3 Session Control and Establishment in IMS. 5 Secure Access and Interworking in IMS. 5.1 Access Security in IMS. 5.2 Network Security in IMS. 6 User Identity in SIP. 6.1 Identity Theft. 6.2 Identity Authentication using S/MIME. 6.3 Identity Authentication in Trusted Environments. 6.4 Strong Authenticated Identity. 6.5 Identity Theft Despite Strong Identity. 6.6 User Privacy and Anonymity. 6.7 Subscription Theft. 6.8 Fraud and SIP. 7 Media Security. 7.1 The Real-time Transport Protocol. 7.2 Secure RTP. 7.3 Key Exchange. 8 Denial-of-service Attacks on VoIP and IMS Services. 8.1 Introduction. 8.2 General Classification of Denial-of-service Attacks. 8.3 Bandwidth Consumption and Denial-of-service Attacks on SIP Services. 8.4 Bandwidth Depletion Attacks. 8.5 Memory Depletion Attacks. 8.6 CPU Depletion Attacks. 8.7 Misuse Attacks. 8.8 Distributed Denial-of-service Attacks. 8.9 Unintentional Attacks. 8.10 Address Resolution-related Attacks. 8.11 Attacking the VoIP Subscriber Database. 8.12 Denial-of-service Attacks in IMS Networks. 8.13 DoS Detection and Protection Mechanisms. 8.14 Detection of DoS Attacks. 8.15 Reacting to DoS Attacks. 8.16 Preventing DoS Attacks. 8.17 DDoS Signature Specification. 9 SPAM over IP Telephony. 9.1 Introduction. 9.2 Spam Over SIP: Types and Applicability. 9.3 Why is SIP Good for Spam? 9.4 Legal Side of Unsolicited Communication. 9.5 Fighting Unsolicited Communication. 9.6 General Antispam Framework. Bibliography. Index.

    10 in stock

    £85.45

  • Digital Forensics

    John Wiley and Sons Ltd Digital Forensics

    Book SynopsisThe vast majority of modern criminal investigations involve some element of digital evidence, from mobile phones, computers, CCTV and other devices. Digital Forensics: Digital Evidence in Criminal Investigations provides the reader with a better understanding of how digital evidence complements traditional scientific evidence and examines how it can be used more effectively and efficiently in a range of investigations. Taking a new approach to the topic, this book presents digital evidence as an adjunct to other types of evidence and discusses how it can be deployed effectively in support of investigations. The book provides investigators/SSMs/other managers with sufficient contextual and technical information to be able to make more effective use of digital evidence sources in support of a range of investigations. In particular, it considers the roles played by digital devices in society and hence in criminal activities. From this, it examines the role and nature of evidentTrade Review?This book presents digital evidence as an adjunct to other types of evidence and discusses how it can be deployed effectively in support of investigations.? (Reviews, May 2009)Table of ContentsPreface vii Acknowledgments xi List of Tables xii List of Figures xiii 1 Introduction 1 1.1 Key developments 1 1.2 Digital devices in society 5 1.3 Technology and culture 6 1.4 Comment 7 2 Evidential Potential of Digital Devices 9 2.1 Closed vs. open systems 10 2.2 Evaluating digital evidence potential 17 3 Device Handling 19 3.1 Seizure issues 21 3.2 Device identification 31 3.3 Networked devices 36 3.4 Contamination 40 4 Examination Principles 43 4.1 Previewing 43 4.2 Imaging 47 4.3 Continuity and hashing 48 4.4 Evidence locations 49 5 Evidence Creation 55 5.1 A seven-element security model 56 5.2 A developmental model of digital systems 60 5.3 Knowing 61 5.4 Unknowing 63 5.5 Audit and logs 68 6 Evidence Interpretation 69 6.1 Data content 69 6.2 Data context 83 7 Internet Activity 85 7.1 A little bit of history 85 7.2 The ISO/OSI model 86 7.3 The internet protocol suite 90 7.4 DNS 94 7.5 Internet applications 96 8 Mobile Devices 109 8.1 Mobile phones and PDAs 109 8.2 GPS 116 8.3 Other personal technology 118 9 Intelligence 119 9.1 Device usage 119 9.2 Profiling and cyberprofiling 121 9.3 Evaluating online crime: automating the model 124 9.4 Application of the formula to case studies 126 9.5 From success estimates to profiling 129 9.6 Comments 129 10 Case Studies and Examples 131 10.1 Introduction 131 10.2 Copyright violation 131 10.3 Missing person and murder 133 10.4 The view of a defence witness 137 Appendix A The “Aircraft Carrier” PC 141 Appendix B Additional Resources 145 B.1 Hard disc and storage laboratory tools 145 B.2 Mobile phone/PDA tools 146 B.3 Live CDs 146 B.4 Recommended reading 146 Appendix C SIM Card Data Report 149 References 157 Index 161

    £48.40

  • Pentaho Kettle Solutions

    John Wiley & Sons Inc Pentaho Kettle Solutions

    Book SynopsisA complete guide to Pentaho Kettle, the Pentaho Data lntegration toolset for ETL This practical book is a complete guide to installing, configuring, and managing Pentaho Kettle. If you're a database administrator or developer, you'll first get up to speed on Kettle basics and how to apply Kettle to create ETL solutionsbefore progressing to specialized concepts such as clustering, extensibility, and data vault models. Learn how to design and build every phase of an ETL solution. Shows developers and database administrators how to use the open-source Pentaho Kettle for enterprise-level ETL processes (Extracting, Transforming, and Loading data) Assumes no prior knowledge of Kettle or ETL, and brings beginners thoroughly up to speed at their own pace Explains how to get Kettle solutions up and running, then follows the 34 ETL subsystems model, as created by the Kimball Group, to explore the entire ETL lifecycle, including all aspects of data warehoTable of ContentsIntroduction xxxi Part I Getting Started 1 Chapter 1 ETL Primer 3 OLTP versus Data Warehousing 3 What Is ETL? 5 The Evolution of ETL Solutions 5 ETL Building Blocks 7 ETL, ELT, and EII 8 ELT 9 EII: Virtual Data Integration 10 Data Integration Challenges 11 Methodology: Agile BI 12 ETL Design 14 Data Acquisition 14 Beware of Spreadsheets 15 Design for Failure 15 Change Data Capture 16 Data Quality 16 Data Profiling 16 Data Validation 17 ETL Tool Requirements 17 Connectivity 17 Platform Independence 18 Scalability 18 Design Flexibility 19 Reuse 19 Extensibility 19 Data Transformations 20 Testing and Debugging 21 Lineage and Impact Analysis 21 Logging and Auditing 22 Summary 22 Chapter 2 Kettle Concepts 23 Design Principles 23 The Building Blocks of Kettle Design 25 Transformations 25 Steps 26 Transformation Hops 26 Parallelism 27 Rows of Data 27 Data Conversion 29 Jobs 30 Job Entries 31 Job Hops 31 Multiple Paths and Backtracking 32 Parallel Execution 33 Job Entry Results 34 Transformation or Job Metadata 36 Database Connections 37 Special Options 38 The Power of the Relational Database 39 Connections and Transactions 39 Database Clustering 40 Tools and Utilities 41 Repositories 41 Virtual File Systems 42 Parameters and Variables 43 Defining Variables 43 Named Parameters 44 Using Variables 44 Visual Programming 45 Getting Started 46 Creating New Steps 47 Putting It All Together 49 Summary 51 Chapter 3 Installation and Configuration 53 Kettle Software Overview 53 Integrated Development Environment: Spoon 55 Command-Line Launchers: Kitchen and Pan 57 Job Server: Carte 57 Encr.bat and encr.sh 58 Installation 58 Java Environment 58 Installing Java Manually 58 Using Your Linux Package Management System 59 Installing Kettle 59 Versions and Releases 59 Archive Names and Formats 60 Downloading and Uncompressing 60 Running Kettle Programs 61 Creating a Shortcut Icon or Launcher for Spoon 62 Configuration 63 Configuration Files and the .kettle Directory 63 The Kettle Shell Scripts 69 General Structure of the Startup Scripts 70 Adding an Entry to the Classpath 70 Changing the Maximum Heap Size 71 Managing JDBC Drivers 72 Summary 72 Chapter 4 An Example ETL Solution—Sakila 73 Sakila 73 The Sakila Sample Database 74 DVD Rental Business Process 74 Sakila Database Schema Diagram 75 Sakila Database Subject Areas 75 General Design Considerations 77 Installing the Sakila Sample Database 77 The Rental Star Schema 78 Rental Star Schema Diagram 78 Rental Fact Table 79 Dimension Tables 79 Keys and Change Data Capture 80 Installing the Rental Star Schema 81 Prerequisites and Some Basic Spoon Skills 81 Setting Up the ETL Solution 82 Creating Database Accounts 82 Working with Spoon 82 Opening Transformation and Job Files 82 Opening the Step’s Configuration Dialog 83 Examining Streams 83 Running Jobs and Transformations 83 The Sample ETL Solution 84 Static, Generated Dimensions 84 Loading the dim_date Dimension Table 84 Loading the dim_time Dimension Table 86 Recurring Load 87 The load_rentals Job 88 The load_dim_staff Transformation 91 Database Connections 91 The load_dim_customer Transformation 95 The load_dim_store Transformation 98 The fetch_address Subtransformation 99 The load_dim_actor Transformation 101 The load_dim_film Transformation 102 The load_fact_rental Transformation 107 Summary 109 Part II ETL 111 Chapter 5 ETL Subsystems 113 Introduction to the 34 Subsystems 114 Extraction 114 Subsystems 1–3: Data Profiling, Change Data Capture, and Extraction 115 Cleaning and Conforming Data 116 Subsystem 4: Data Cleaning and Quality Screen Handler System 116 Subsystem 5: Error Event Handler 117 Subsystem 6: Audit Dimension Assembler 117 Subsystem 7: Deduplication System 117 Subsystem 8: Data Conformer 118 Data Delivery 118 Subsystem 9: Slowly Changing Dimension Processor 118 Subsystem 10: Surrogate Key Creation System 119 Subsystem 11: Hierarchy Dimension Builder 119 Subsystem 12: Special Dimension Builder 120 Subsystem 13: Fact Table Loader 121 Subsystem 14: Surrogate Key Pipeline 121 Subsystem 15: Multi-Valued Dimension Bridge Table Builder 121 Subsystem 16: Late-Arriving Data Handler 122 Subsystem 17: Dimension Manager System 122 Subsystem 18: Fact Table Provider System 122 Subsystem 19: Aggregate Builder 123 Subsystem 20: Multidimensional (OLAP) Cube Builder 123 Subsystem 21: Data Integration Manager 123 Managing the ETL Environment 123 Summary 126 Chapter 6 Data Extraction 127 Kettle Data Extraction Overview 128 File-Based Extraction 128 Working with Text Files 128 Working with XML files 133 Special File Types 134 Database-Based Extraction 134 Web-Based Extraction 137 Text-Based Web Extraction 137 HTTP Client 137 Using SOAP 138 Stream-Based and Real-Time Extraction 138 Working with ERP and CRM Systems 138 ERP Challenges 139 Kettle ERP Plugins 140 Working with SAP Data 140 ERP and CDC Issues 146 Data Profiling 146 Using eobjects.org DataCleaner 147 Adding Profile Tasks 149 Adding Database Connections 149 Doing an Initial Profile 151 Working with Regular Expressions 151 Profiling and Exploring Results 152 Validating and Comparing Data 153 Using a Dictionary for Column Dependency Checks 153 Alternative Solutions 154 Text Profiling with Kettle 154 CDC: Change Data Capture 154 Source Data–Based CDC 155 Trigger-Based CDC 157 Snapshot-Based CDC 158 Log-Based CDC 162 Which CDC Alternative Should You Choose? 163 Delivering Data 164 Summary 164 Chapter 7 Cleansing and Conforming 167 Data Cleansing 168 Data-Cleansing Steps 169 Using Reference Tables 172 Conforming Data Using Lookup Tables 172 Conforming Data Using Reference Tables 175 Data Validation 179 Applying Validation Rules 180 Validating Dependency Constraints 183 Error Handling 183 Handling Process Errors 184 Transformation Errors 186 Handling Data (Validation) Errors 187 Auditing Data and Process Quality 191 Deduplicating Data 192 Handling Exact Duplicates 193 The Problem of Non-Exact Duplicates 194 Building Deduplication Transforms 195 Step 1: Fuzzy Match 197 Step 2: Select Suspects 198 Step 3: Lookup Validation Value 198 Step 4: Filter Duplicates 199 Scripting 200 Formula 201 JavaScript 202 User-Defined Java Expressions 202 Regular Expressions 203 Summary 205 Chapter 8 Handling Dimension Tables 207 Managing Keys 208 Managing Business Keys 209 Keys in the Source System 209 Keys in the Data Warehouse 209 Business Keys 209 Storing Business Keys 210 Looking Up Keys with Kettle 210 Generating Surrogate Keys 210 The “Add sequence” Step 211 Working with auto_increment or IDENTITY Columns 217 Keys for Slowly Changing Dimensions 217 Loading Dimension Tables 218 Snowflaked Dimension Tables 218 Top-Down Level-Wise Loading 219 Sakila Snowflake Example 219 Sample Transformation 221 Database Lookup Configuration 222 Sample Job 225 Star Schema Dimension Tables 226 Denormalization 226 Denormalizing to 1NF with the “Database lookup” Step 226 Change Data Capture 227 Slowly Changing Dimensions 228 Types of Slowly Changing Dimensions 228 Type 1 Slowly Changing Dimensions 229 The Insert / Update Step 229 Type 2 Slowly Changing Dimensions 232 The “Dimension lookup / update” Step 232 Other Types of Slowly Changing Dimensions 237 Type 3 Slowly Changing Dimensions 237 Hybrid Slowly Changing Dimensions 238 More Dimensions 239 Generated Dimensions 239 Date and Time Dimensions 239 Generated Mini-Dimensions 239 Junk Dimensions 241 Recursive Hierarchies 242 Summary 243 Chapter 9 Loading Fact Tables 245 Loading in Bulk 246 STDIN and FIFO 247 Kettle Bulk Loaders 248 MySQL Bulk Loading 249 LucidDB Bulk Loader 249 Oracle Bulk Loader 249 PostgreSQL Bulk Loader 250 Table Output Step 250 General Bulk Load Considerations 250 Dimension Lookups 251 Maintaining Referential Integrity 251 The Surrogate Key Pipeline 252 Using In-Memory Lookups 253 Stream Lookups 253 Late-Arriving Data 255 Late-Arriving Facts 256 Late-Arriving Dimensions 256 Fact Table Handling 260 Periodic and Accumulating Snapshots 260 Introducing State-Oriented Fact Tables 261 Loading Periodic Snapshots 263 Loading Accumulating Snapshots 264 Loading State-Oriented Fact Tables 265 Loading Aggregate Tables 266 Summary 267 Chapter 10 Working with OLAP Data 269 OLAP Benefits and Challenges 270 OLAP Storage Types 272 Positioning OLAP 272 Kettle OLAP Options 273 Working with Mondrian 274 Working with XML/A Servers 277 Working with Palo 282 Setting Up the Palo Connection 283 Palo Architecture 284 Reading Palo Data 285 Writing Palo Data 289 Summary 291 Part III Management and Deployment 293 Chapter 11 ETL Development Lifecycle 295 Solution Design 295 Best and Bad Practices 296 Data Mapping 297 Naming and Commentary Conventions 298 Common Pitfalls 299 ETL Flow Design 300 Reusability and Maintainability 300 Agile Development 301 Testing and Debugging 306 Test Activities 307 ETL Testing 308 Test Data Requirements 308 Testing for Completeness 309 Testing Data Transformations 311 Test Automation and Continuous Integration 311 Upgrade Tests 312 Debugging 312 Documenting the Solution 315 Why Isn’t There Any Documentation? 316 Myth 1: My Software Is Self-Explanatory 316 Myth 2: Documentation Is Always Outdated 316 Myth 3: Who Reads Documentation Anyway? 317 Kettle Documentation Features 317 Generating Documentation 319 Summary 320 Chapter 12 Scheduling and Monitoring 321 Scheduling 321 Operating System–Level Scheduling 322 Executing Kettle Jobs and Transformations from the Command Line 322 UNIX-Based Systems: cron 326 Windows: The at utility and the Task Scheduler 327 Using Pentaho’s Built-in Scheduler 327 Creating an Action Sequence to Run Kettle Jobs and Transformations 328 Kettle Transformations in Action Sequences 329 Creating and Maintaining Schedules with the Administration Console 330 Attaching an Action Sequence to a Schedule 333 Monitoring 333 Logging 333 Inspecting the Log 333 Logging Levels 335 Writing Custom Messages to the Log 336 E‑mail Notifications 336 Configuring the Mail Job Entry 337 Summary 340 Chapter 13 Versioning and Migration 341 Version Control Systems 341 File-Based Version Control Systems 342 Organization 342 Leading File-Based VCSs 343 Content Management Systems 344 Kettle Metadata 344 Kettle XML Metadata 345 Transformation XML 345 Job XML 346 Global Replace 347 Kettle Repository Metadata 348 The Kettle Database Repository Type 348 The Kettle File Repository Type 349 The Kettle Enterprise Repository Type 350 Managing Repositories 350 Exporting and Importing Repositories 350 Upgrading Your Repository 351 Version Migration System 352 Managing XML Files 352 Managing Repositories 352 Parameterizing Your Solution 353 Summary 356 Chapter 14 Lineage and Auditing 357 Batch-Level Lineage Extraction 358 Lineage 359 Lineage Information 359 Impact Analysis Information 361 Logging and Operational Metadata 363 Logging Basics 363 Logging Architecture 364 Setting a Maximum Buffer Size 365 Setting a Maximum Log Line Age 365 Log Channels 366 Log Text Capturing in a Job 366 Logging Tables 367 Transformation Logging Tables 367 Job Logging Tables 373 Summary 374 Part IV Performance and Scalability 375 Chapter 15 Performance Tuning 377 Transformation Performance: Finding the Weakest Link 377 Finding Bottlenecks by Simplifying 379 Finding Bottlenecks by Measuring 380 Copying Rows of Data 382 Improving Transformation Performance 384 Improving Performance in Reading Text Files 384 Using Lazy Conversion for Reading Text Files 385 Single-File Parallel Reading 385 Multi-File Parallel Reading 386 Configuring the NIO Block Size 386 Changing Disks and Reading Text Files 386 Improving Performance in Writing Text Files 387 Using Lazy Conversion for Writing Text Files 387 Parallel Files Writing 387 Changing Disks and Writing Text Files 387 Improving Database Performance 388 Avoiding Dynamic SQL 388 Handling Roundtrips 388 Handling Relational Databases 390 Sorting Data 392 Sorting on the Database 393 Sorting in Parallel 393 Reducing CPU Usage 394 Optimizing the Use of JavaScript 394 Launching Multiple Copies of a Step 396 Selecting and Removing Values 397 Managing Thread Priorities 397 Adding Static Data to Rows of Data 397 Limiting the Number of Step Copies 398 Avoiding Excessive Logging 398 Improving Job Performance 399 Loops in Jobs 399 Database Connection Pools 400 Summary 401 Chapter 16 Parallelization, Clustering, and Partitioning 403 Multi-Threading 403 Row Distribution 404 Row Merging 405 Row Redistribution 406 Data Pipelining 407 Consequences of Multi-Threading 408 Database Connections 408 Order of Execution 409 Parallel Execution in a Job 411 Using Carte as a Slave Server 411 The Configuration File 411 Defining Slave Servers 412 Remote Execution 413 Monitoring Slave Servers 413 Carte Security 414 Services 414 Clustering Transformations 417 Defining a Cluster Schema 417 Designing Clustered Transformations 418 Execution and Monitoring 420 Metadata Transformations 421 Rules 422 Data Pipelining 425 Partitioning 425 Defining a Partitioning Schema 425 Objectives of Partitioning 427 Implementing Partitioning 428 Internal Variables 428 Database Partitions 429 Partitioning in a Clustered Transformation 430 Summary 430 Chapter 17 Dynamic Clustering in the Cloud 433 Dynamic Clustering 433 Setting Up a Dynamic Cluster 434 Using the Dynamic Cluster 436 Cloud Computing 437 EC2 438 Getting Started with EC2 438 Costs 438 Customizing an AMI 439 Packaging a New AMI 442 Terminating an AMI 442 Running a Master 442 Running the Slaves 443 Using the EC2 Cluster 444 Monitoring 445 The Lightweight Principle and Persistence Options 446 Summary 447 Chapter 18 Real-Time Data Integration 449 Introduction to Real-Time ETL 449 Real-Time Challenges 450 Requirements 451 Transformation Streaming 452 A Practical Example of Transformation Streaming 454 Debugging 457 Third-Party Software and Real-Time Integration 458 Java Message Service 459 Creating a JMS Connection and Session 459 Consuming Messages 460 Producing Messages 460 Closing Shop 460 Summary 461 Part V Advanced Topics 463 Chapter 19 Data Vault Management 465 Introduction to Data Vault Modeling 466 Do You Need a Data Vault? 466 Data Vault Building Blocks 467 Hubs 467 Links 468 Satellites 469 Data Vault Characteristics 471 Building a Data Vault 471 Transforming Sakila to the Data Vault Model 472 Sakila Hubs 472 Sakila Links 473 Sakila Satellites 474 Loading the Data Vault: A Sample ETL Solution 477 Installing the Sakila Data Vault 477 Setting Up the ETL Solution 477 Creating a Database Account 477 The Sample ETL Data Vault Solution 478 Sample Hub: hub_actor 478 Sample Link: link_customer_store 480 Sample Satellite: sat_actor 483 Loading the Data Vault Tables 485 Updating a Data Mart from a Data Vault 486 The Sample ETL Solution 486 The dim_actor Transformation 486 The dim_customer Transformation 488 The dim_film Transformation 492 The dim_film_actor_bridge Transformation 492 The fact_rental Transformation 493 Loading the Star Schema Tables 495 Summary 495 Chapter 20 Handling Complex Data Formats 497 Non-Relational and Non-Tabular Data Formats 498 Non-Relational Tabular Formats 498 Handling Multi-Valued Attributes 498 Using the Split Field to Rows Step 499 Handling Repeating Groups 500 Using the Row Normaliser Step 500 Semi- and Unstructured Data 501 Kettle Regular Expression Example 503 Configuring the Regex Evaluation Step 504 Verifying the Match 507 Key/Value Pairs 508 Kettle Key/Value Pairs Example 509 Text File Input 509 Regex Evaluation 510 Grouping Lines into Records 511 Denormaliser: Turning Rows into Columns 512 Summary 513 Chapter 21 Web Services 515 Web Pages and Web Services 515 Kettle Web Features 516 General HTTP Steps 516 Simple Object Access Protocol 517 Really Simple Syndication 517 Apache Virtual File System Integration 517 Data Formats 517 XML 518 Kettle Steps for Working with XML 518 Kettle Job Entries for XML 519 HTML 520 JavaScript Object Notation 520 Syntax 521 JSON, Kettle, and ETL/DI 522 XML Examples 523 Example XML Document 523 XML Document Structure 523 Mapping to the Sakila Sample Database 524 Extracting Data from XML 525 Overall Design: The import_xml_into_db Transformation 526 Using the XSD Validator Step 528 Using the “Get Data from XML” Step 530 Generating XML Documents 537 Overall Design: The export_xml_from_db Transformation 537 Generating XML with the Add XML Step 538 Using the XML Join Step 541 SOAP Examples 544 Using the “Web services lookup” Step 544 Configuring the “Web services lookup” Step 544 Accessing SOAP Services Directly 546 JSON Example 549 The Freebase Project 549 Freebase Versus Wikipedia 549 Freebase Web Services 550 The Freebase Read Service 550 The Metaweb Query Language 551 Extracting Freebase Data with Kettle 553 Generate Rows 554 Issuing a Freebase Read Request 555 Processing the Freebase Result Envelope 556 Filtering Out the Original Row 557 Storing to File 558 RSS 558 RSS Structure 558 Channel 558 Item 559 RSS Support in Kettle 560 RSS Input 561 RSS Output 562 Summary 567 Chapter 22 Kettle Integration 569 The Kettle API 569 The LGPL License 569 The Kettle Java API 570 Source Code 570 Building Kettle 571 Building javadoc 571 Libraries and the Class Path 571 Executing Existing Transformations and Jobs 571 Executing a Transformation 572 Executing a Job 573 Embedding Kettle 574 Pentaho Reporting 574 Putting Data into a Transformation 576 Dynamic Transformations 580 Dynamic Template 583 Dynamic Jobs 584 Executing Dynamic ETL in Kettle 586 Result 587 Replacing Metadata 588 Direct Changes with the API 589 Using a Shared Objects File 589 OEM Versions and Forks 590 Creating an OEM Version of PDI 590 Forking Kettle 591 Summary 592 Chapter 23 Extending Kettle 593 Plugin Architecture Overview 593 Plugin Types 594 Architecture 595 Prerequisites 596 Kettle API Documentation 596 Libraries 596 Integrated Development Environment 596 Eclipse Project Setup 597 Examples 598 Transformation Step Plugins 599 StepMetaInterface 599 Value Metadata 605 Row Metadata 606 StepDataInterface 607 StepDialogInterface 607 Eclipse SWT 607 Form Layout 607 Kettle UI Elements 609 Hello World Example Dialog 609 StepInterface 614 Reading Rows from Specific Steps 616 Writing Rows to Specific Steps 616 Writing Rows to Error Handling 617 Identifying a Step Copy 617 Result Feedback 618 Variable Substitution 618 Apache VFS 619 Step Plugin Deployment 619 The User-Defined Java Class Step 620 Passing Metadata 620 Accessing Input and Fields 620 Snippets 620 Example 620 Job Entry Plugins 621 JobEntryInterface 622 JobEntryDialogInterface 624 Partitioning Method Plugins 624 Partitioner 625 Repository Type Plugins 626 Database Type Plugins 627 Summary 628 Appendix A The Kettle Ecosystem 629 Kettle Development and Versions 629 The Pentaho Community Wiki 631 Using the Forums 631 Jira 632 ##pentaho 633 Appendix B Kettle Enterprise Edition Features 635 Appendix C Built-in Variables and Properties Reference 637 Internal Variables 637 Kettle Variables 640 Variables for Configuring VFS 641 Noteworthy JRE Variables 642 Index 643

    £30.39

  • Biopolymers

    John Wiley & Sons Inc Biopolymers

    1 in stock

    Book SynopsisThis handbook focuses on biopolymers for both environmental and biomedical applications. It shows recent advances in technology in all areas from chemical synthesis or biosynthesis to end use applications. These areas have not been covered in a single book before and they include biopolymers for chemical and biotechnological modifications, material structures, characterization, processing, properties, and applications. After the introduction which summarizes the importance of biopolymer in the market, the book covers almost all the topics related to polysaccharides, biofibers, bioplastics, biocomposites, natural rubber, gums, bacterial and blood compatible polymers, and applications of biopolymers in various fields.Table of ContentsIntroductory Preface. About the Editors. Part I. Polysaccharides. 1. Hyaluronic Acid: A Natural Biopolymer (Juergen Schiller, Nicola Volpi, Eva Hrabárova, and Ladislav Soltes). 2. Polysaccharide Graft Copolymers Synthesis, Properties and Applications (B. S. Kaith, Hemant Mittal, Jaspreet Kaur Bhatia, and Susheel Kalia). 3. Natural Polysaccharides: From Membranes to Active Food Packaging (Keith J. Fahnestock, Marjorie S. Austero, and Caroline L. Schauer). 4. Starch as Source of Polymeric Materials (Antonio A. J. Carvalho). 5. Grafted Polysaccharides: Smart Materials of Future, Synthesis and Applications (Gautam Sen, Ashoke Sharon, and Sagar Pal). 6. Chitosan: The Marine based Biopolymer for Applications (Debasish Sahoo, and P. L. Nayak). Part II. Bioplastics and Biocomposites. 7. Biopolymers Based-on Carboxylic Acids Derived from Renewable Resources (Sushil Kumar, Nikhil Prakash, and Dipaloy Datta). 8. Characteristics and Applications of PLA (Sandra Domenek, Cecile Courgneau, and Violette Ducruet). 9. Biobased Composites & Applications (Smita Mohanty, and Sanjay K. Nayak). Part III. Miscellaneous Biopolymers. 10. Cassia Seed Gums: A Renewable Reservoir for Synthesizing High Performance Materials for Water Remediation (Vandana Singh, and Pramendra Kumar). 11. Bacterial Polymers: Resources, Synthesis and Applications (GVN Rathna, and Sutapa Gosh). 12. Gum Arabica: A Natural Biopolymer (A. Sarkar). 13. Gluten: A Natural Biopolymer (S. Georgiev, and Tereza Dekova). 14. Natural Rubber: Production, Properties, and Applications (Thomas Kurian, and N. M. Mathew). 15. Electronic Structures and Conduction Properties of Biopolymers (Mohsineen Wazir, Vinita Arora, and A. K. Bakhshi). Part IV. Biopolymers for Specific Applications. 16. Applications of Biopolymers in Agriculture with Special Reference to Role of Plant Derived Biopolymers in Crop Protection (S. Niranjan Raj, S. N. Lavanya, J, Sudisha, and H. Shekar Shetty). 17. Modified Cellulose Fibers as a Biosorbent for the Organic Pollutants (Sami Boufi, and Sabrine Alila). 18. Polymers and Biopolymers in Pharmaceutical Technology (István Erös). 19. Biopolymers Employed in Drug Delivery (Betina Giehl Zanetti Ramos). 20. Natural Polymeric Vectors in Gene Therapy (Patit P. Kundu, and Kishor Sarkar).

    1 in stock

    £170.06

  • Windows Command Line Administration Instant

    John Wiley & Sons Inc Windows Command Line Administration Instant

    Book SynopsisFocusing just on the essentials of command-line interface (CLI), this title shows how to quickly perform day-to-day tasks of Windows administration without ever touching the graphical user interface (GUI). It replaces many tedious GUI steps with just one command at the command-line, while easy to access answers provide solutions on the spot.Table of ContentsIntroduction xix Part I: Command Line Basics 1 Chapter 1: Configuring the Local Machine 3 Configure the Command Window 4 Set the Window Options 4 Change the Font 7 Choose a Window Layout 8 Define the Text Colors 9 Set the Environment 10 Manage Environment Variables with the Set Command 10 Manage Environment Variables with the SetX Utility 13 Perform Common Tasks 16 Clear the Display 16 Determine the Operating System Version 16 Start an Application 16 Work with Services 18 Shut Down the System 19 Obtain Command Line Help 20 Chapter 2: Making Remote Connections 23 Configure the Remote System 24 Change Security and Basic Setup 25 Setup Remote Administrator 28 Use the Remote Desktop Connection Application 30 Create a Connection 30 Use a Saved Connection 35 Set the Display 35 Access Local Resources 36 Run a Configuration Program 38 Optimize Performance 38 Terminate a Session 39 Use the Start Menu 40 Use the Logoff Utility 40 Chapter 3: Automating Tasks 41 View and Manage Tasks Using Scheduled Tasks 42 Configure the Task Scheduler 43 View Tasks 44 Create New Tasks 46 Delete Existing Tasks 50 Manage Tasks Using the SchTasks Command 51 Use the /Create Switch 51 Use the /Delete Switch 53 Use the /Query Switch 53 Use the /Change Switch 54 Use the /Run Switch 54 Use the /End Switch 54 Part II: Managing Data 55 Chapter 4: Working with File and Directory Objects 57 Manage Directory Objects 58 Find Directories 58 Find Directories Using Patterns 59 View the Current Directory 60 Change the Current Directory 60 Create Directories 61 Move Directories 61 Rename Directories 61 Remove a Directory 62 Display a Directory Structure 62 Manage File Objects 63 Find Files 63 Find Files in Sorted Order 64 Find Files by Attribute 65 Find Files Using Patterns 66 Copy Files 68 Perform Bulk File Transfers 69 Remove Files 70 Move Files 71 Rename a File 71 Set File Attributes 71 Work with File Associations and Types 72 Determine File Associations 72 Create File Associations 73 Determine File Types 73 Create File Types 73 Make Data Links 74 Create Simple Hard Links 75 View Simple Hard Links 75 Delete Simple Hard Links 75 Create Hard Links Using the New Technique 76 Create Symbolic Links 76 Create Junctions 77 Chapter 5: Administering File and Directory Content 79 Execute Applications Anywhere 80 View Application Paths 80 Set Application Paths 80 Locate Information in Files 81 Find Simple Strings 81 Find Complex Strings 82 Display Files Containing Strings 82 Perform Case Insensitive Searches 83 Monitor the File System with the FSUtil Command 83 Control File System Behavior 83 Manage the Volume Dirty Bit 86 Obtain the File System Information Using FSInfo 87 Manage Quotas 88 Repair File System Errors 90 Display Data Files 92 Display a Data File on Screen 92 Employ Data Redirection 92 Display Data One Page at a Time 95 Chapter 6: Managing the Hard Drive 99 Save Hard Drive Space 101 Compress Data 101 Uncompress Data 102 View Compression Status 102 Manage the Volume 102 Get Volume Information 103 Manage Volume Labels 103 Format a Disk 103 Mount a Volume 104 Maintain the Volume 106 Determine File and Directory Status 106 Locate Bad Sectors 107 Perform Boot-Time Disk Checks 108 Improve Disk Access Performance 109 Manage Partitions 110 Start DiskPart 110 List the Objects 111 See Object Details 112 Select an Object 113 Rescan a Computer for Objects 114 Create a Partition 114 Create a Volume 116 Clean a Drive 117 Mark a Partition as Active 117 Mark a Partition as Inactive 118 Assign a Drive Letter 118 Remove a Drive Letter 119 Extend a Volume 119 Delete an Object 120 Exit DiskPart 120 Chapter 7: Securing the Data 121 Protect Data 122 Encrypt a File or Directory 122 View Encrypted Files and Directories 123 Encrypt Hidden Files 124 Back Up Recovery Keys and Certificates 125 Add a User to a File or Directory 125 Remove a User from a File or Directory 126 Decrypt a File or Directory 127 Change File and Directory Access 127 Obtain the DACL 127 Find an SID 130 Grant Permission 130 Deny Permission 131 Remove Permission 131 Set the Owner 132 Verify Security 132 Detect Shared Open Files 132 Use the Query Option 132 Use the Disconnect Option 133 Use the Local Option 134 Take Ownership of Files 134 Set Administrator Ownership 134 Set Other User Ownership 135 Part III: Managing the Network 137 Chapter 8: Managing the Network 139 Get the Media Access Control Information 140 Interact with the Network Using the Net Utility 141 Manage Users 141 Manage Accounts 143 Manage Domains and Local Groups 146 Manage Computers 149 View and Close Sessions 149 Perform Server Configuration 151 View Workstation Configuration 153 Manage Services 153 Manage Files 155 Obtain Help for the Net Utility 156 Manage Print Jobs 157 Manage Resources 158 Obtain Statistics 161 Configure Time Synchronization 163 Chapter 9: Working with TCP/IP 165 Manage the Internet Protocol 166 Display the IP Information 166 Renew Addresses for an Adapter 168 Clear the DNS Resolver Cache 168 Renew DHCP Addresses and Register DNS Names 169 Release a Connection 169 Use Basic Diagnostics 170 Check Connections 170 Trace Transmission Paths 171 Track the Network Path 172 Perform Detailed Network Diagnostics 173 Obtain a Copy of NetDiag 174 Perform a Test 175 Understand Diagnostics 175 Locate and Fix Minor Problems 177 Get Network Statistics 177 Display All Connections and Ports 177 Display Application Statistics 178 Display Ethernet Statistics 179 Display Protocol Information 179 Set a Refresh Interval 180 Manipulate the Network Routing Tables 180 Print the Routing Tables 180 Add a New Route 181 Change a Route 182 Delete a Route 183 Chapter 10: Creating System Connections 185 Perform Remote System Management 186 Create Remote Connections 186 Set Up a Telephony Client 190 Perform Remote Windows Management 191 Execute Commands on a Remote System 206 Work with Terminal Server 206 Obtain Process Information 206 Get Session Information 207 Terminate a Session 208 Disconnect an Active Session 208 End Processes 208 Shut Down the Terminal Server 209 Part IV: Interacting with Active Directory 211 Chapter 11: Configuring Directory Services 213 Manage Directory Services Using the WMIC NTDomain Alias 214 List the Objects 215 List Object Properties 215 Get an Object Property 216 Set an Object Property 217 Query an Association 217 Manage Active Directory with the DSQuery Utility 218 Interact with Servers 218 Interact with Users 220 Interact with Computers 223 Interact with Contacts 223 Interact with Groups 223 Interact with Organizational Units 224 Manage the Active Directory Database 225 Issue a Command 225 Use a Stream 226 Chapter 12: Working with Directory Objects 229 Create New Objects 230 Add a Computer 230 Add a Contact 231 Add a Group 233 Add an Organizational Unit 234 Add a User 234 Get Objects 238 List Computers 238 List Contacts 239 List Groups 240 List Organizational Units 241 List Servers 241 List Users 242 Edit Existing Objects 243 Modify Computer Data 244 Modify Contact Data 245 Modify Group Data 246 Modify Organizational Unit Data 246 Modify User Data 246 Move Existing Objects 248 Delete Existing Objects 248 Part V: Performing Diagnostics 251 Chapter 13: Monitoring System Events 253 Create Simple System Events 254 Trigger System Events 257 Create an Event 258 Delete an Event 261 Query an Event 261 Manage Event Information 262 Display a List of Publishers 262 Get a Publisher 262 Enumerate the Logs 263 Query Log Events 264 Get a Log 267 Get Log Status Information 267 Set a Log 267 Export a Log 269 Archive a Log 270 Clear a Log 270 Chapter 14: Monitoring System Performance 271 Add Performance Counters 272 Load a Performance Counter 272 Save Performance Counter Settings 273 Restore Performance Counter Settings 273 Manage Performance Logs and Alerts 274 Create a Performance Log 274 Start Collecting Data 276 Stop Collecting Data 276 Query a Collection 277 Update a Collection 277 Delete a Collection 278 Create New Performance Logs from Existing Logs 278 Remove Performance Counters 281 Convert Event Trace Logs 281 Part VI: Performing Maintenance 283 Chapter 15: Performing Basic Maintenance 285 Configure the Server 286 Understand the SQL Syntax of WMIC 287 Use Aliases in WMIC 290 Get Help in WMIC 302 Format Data in WMIC 306 Translate Data in WMIC 310 Activate Windows 311 Perform an Activation 311 Display the Activation Information 312 Change the Product Key 312 Manage the System Time 312 Update the Time 313 Configure a Time Source 313 Obtain Time Settings Information 314 Manage the Boot Configuration 315 Enumerate the Configurations 315 Get BCDEdit Help 316 Edit an Existing Boot Setting 317 Change the Boot Sequence 318 Set the Default Boot Item 318 Chapter 16: Managing System Users 319 Audit User Access 320 List the Policies 321 Get a Policy 322 Set a Policy 326 Perform a Backup 327 Perform a Restore 327 Clear an Audit Policy 328 Remove an Audit Policy 328 Work with Group Policies 328 Obtain Group Policy Results 328 Manage Group Policies 330 Obtain Session Status Information 331 Get Process Information 331 Get Session Information 331 Get User Information 332 Get Terminal Server Information 332 Get the User’s Identity 332 Obtain User Logon Information 333 Discover User Identity 333 Chapter 17: Securing the System 335 Add Virus and External Intrusion Protection 337 Remove Viruses 337 Detect and Remove Malicious Software 338 Verify System Files 339 Verify Drivers 340 Change the Verifier Settings 342 Configure Local Security Policies 344 Perform an Analysis 344 Configure Security Policies 345 Export Policies 345 Import Policies 346 Validate a Policy File 346 Work with General Applications 347 Use TaskKill and TaskList Filters 347 Terminate Tasks 350 List Applications 350 List Services 351 Chapter 18: Interacting with the Registry 353 Perform Basic Registry Tasks 354 Export a Registry Key 356 Import a Registry Key 357 Delete a Registry Key 357 Save the Registry 358 Restore the Registry 358 Use the SCRegEdit Script 358 Set Automatic Updates 359 Enable Terminal Services 359 Configure the IP Security (IPSec) Monitor 360 Manage the DNS Service Priority and Weight 361 Use the Command Line Reference 361 Manage the Registry 362 Understand the Registry Settings 362 Query a Registry Entry 363 Add a Registry Entry 364 Delete a Registry Entry 365 Copy a Registry Entry 366 Compare Registry Entries 366 Export Registry Entries 367 Import Registry Entries 367 Restore Registry Entries 368 Part VII: Creating Batch Files 369 Chapter 19: Changing the Batch File Environment 371 Use the CMD Switches 372 Configure the Command Interpreter in the Registry 375 Use Command Extensions 377 Modify Config.NT 380 Use ANSI.SYS to Control the Environment 382 Set the Command Interpreter Location 382 Run Character Mode Applications Only 383 Display the Config.NT Commands 383 Control the Expanded Memory EMM Entry 383 Set the Number of Accessible Files 384 Control Extended Memory with HIMEM.SYS 385 Modify AutoExec.NT 387 Set the Code Page Number with the CHCP Utility 387 Add DPMI Support Using the DosX Utility 388 Enable Graphics Character Support with the GrafTabl Utility 389 Save Memory Using the LH Command 389 Install the Network Redirector Using the ReDir Utility 389 Chapter 20: Working at the Command Prompt 391 Redirect Command Line Output to the Clipboard 392 Manage Usernames and Passwords 393 Display Usernames 393 Create Users 394 Delete Users 394 Change Screen Colors 395 Configure the System Date 396 Configure the System Time 396 Change the Command Window Title 397 Chapter 21: Creating and Testing Batch Files 399 Use Batch File Commands 400 Employ the Call Command 401 Employ the Choice Command 403 Employ the Echo Command 406 Employ the Exit Command 406 Employ the ForFiles Utility 407 Employ the For Command 409 Employ the GoTo Command 414 Employ the If Command 414 Employ the Pause Command 418 Employ the Prompt Command 418 Employ the Rem Command 419 Employ the TimeOut Utility 420 Test Batch Files 420 Add Debug Information to Batch Files 421 Identify Batch Files and Their Actions 425 Use a Centralized Data Store 428 Store and Retrieve Directories with the PushD and PopD Commands 430 Part VIII: Creating Scripts 433 Chapter 22: Discovering Scripting Basics 435 Use Scripting Languages 436 Learn the Basics of JavaScript 436 Learn the Basics of VBScript 438 Use the Windows Scripting File 439 Execute Scripts 442 Run Scripts with the CScript and WScript Utilities 442 Configure the Host and Property Page Options 444 Chapter 23: Using the Scripting Objects 447 Use the WScript Object 449 Use the WScript Properties 449 Use the WScript Methods 451 Use the WScript.WshArguments Object 454 Use the WScript.WshShell Object 455 Use the WScript.WshNetwork Object 457 Use the WScript.WshNetwork Properties 457 Use the WScript.WshNetwork Methods 458 Create a Basic Script 462 Script the Command Line and System Environment 463 Script the Registry 466 Create .LNK Files 468 Chapter 24: Creating Advanced Scripting Examples 471 Script Registry Entries 472 Script Networking Solutions 473 Discover the NetSH Helper List 473 Get NetSH Help 474 Execute NetSH Commands 476 Understand the Basic NetSH Contexts 476 Use the Root Context Commands 478 Impersonate a User 480 Change the Environment 481 Change Logons, Ports, and Users 481 Enable or Disable Session Logons Directly 482 List COM Port Mappings 482 Modify the Install Mode 482 Map a Network Drive 483 Create a .CSV File 487 Appendix A: Alphabetical Command List 493 Appendix B: Topical Command List 505 Appendix C: Listing of Best Practices 521 Always Verify the Data 522 Real Administrators Use Help 523 Test Your Theories on a Test System 524 Use Batch Files, Scripts, and Written Procedures 525 Make Backups 526 Perform User-Specific Changes during Downtime 526 Index 529

    £22.95

  • Data Mining Techniques

    John Wiley & Sons Inc Data Mining Techniques

    Book SynopsisThe leading introductory book on data mining, fully updated and revised! When Berry and Linoff wrote the first edition of Data Mining Techniques in the late 1990s, data mining was just starting to move out of the lab and into the office and has since grown to become an indispensable tool of modern business.Table of ContentsIntroduction xxxvii Chapter 1 What Is Data Mining and Why Do It? 1 What Is Data Mining? 2 Data Mining Is a Business Process 2 Large Amounts of Data 3 Meaningful Patterns and Rules 3 Data Mining and Customer Relationship Management 4 Why Now? 6 Data Is Being Produced 6 Data Is Being Warehoused 6 Computing Power Is Affordable 7 Interest in Customer Relationship Management Is Strong 7 Commercial Data Mining Software Products Have Become Available 8 Skills for the Data Miner 9 The Virtuous Cycle of Data Mining 9 A Case Study in Business Data Mining 11 Identifying BofA’s Business Challenge 12 Applying Data Mining 12 Acting on the Results 13 Measuring the Effects of Data Mining 14 Steps of the Virtuous Cycle 15 Identify Business Opportunities 16 Transform Data into Information 17 Act on the Information 19 Measure the Results 20 Data Mining in the Context of the Virtuous Cycle 23 Lessons Learned 26 Chapter 2 Data Mining Applications in Marketing and Customer Relationship Management 27 Two Customer Lifecycles 27 The Customer’s Lifecycle 28 The Customer Lifecycle 28 Subscription Relationships versus Event-Based Relationships 30 Organize Business Processes Around the Customer Lifecycle 32 Customer Acquisition 33 Customer Activation 36 Customer Relationship Management 37 Winback 38 Data Mining Applications for Customer Acquisition 38 Identifying Good Prospects 39 Choosing a Communication Channel 39 Picking Appropriate Messages 40 A Data Mining Example: Choosing the Right Place to Advertise 40 Who Fits the Profile? 41 Measuring Fitness for Groups of Readers 44 Data Mining to Improve Direct Marketing Campaigns 45 Response Modeling 46 Optimizing Response for a Fixed Budget 47 Optimizing Campaign Profitability 49 Reaching the People Most Influenced by the Message 53 Using Current Customers to Learn About Prospects 54 Start Tracking Customers Before They Become “Customers” 55 Gather Information from New Customers 55 Acquisition-Time Variables Can Predict Future Outcomes 56 Data Mining Applications for Customer Relationship Management 56 Matching Campaigns to Customers 56 Reducing Exposure to Credit Risk 58 Determining Customer Value 59 Cross-selling, Up-selling, and Making Recommendations 60 Retention 60 Recognizing Attrition 60 Why Attrition Matters 61 Different Kinds of Attrition 62 Different Kinds of Attrition Model 63 Beyond the Customer Lifecycle 64 Lessons Learned 65 Chapter 3 The Data Mining Process 67 What Can Go Wrong? 68 Learning Things That Aren’t True 68 Learning Things That Are True, but Not Useful 73 Data Mining Styles 74 Hypothesis Testing 75 Directed Data Mining 81 Undirected Data Mining 81 Goals, Tasks, and Techniques 82 Data Mining Business Goals 82 Data Mining Tasks 83 Data Mining Techniques 88 Formulating Data Mining Problems: From Goals to Tasks to Techniques 88 What Techniques for Which Tasks? 95 Is There a Target or Targets? 96 What Is the Target Data Like? 96 What Is the Input Data Like? 96 How Important Is Ease of Use? 97 How Important Is Model Explicability? 97 Lessons Learned 98 Chapter 4 Statistics 101: What You Should Know About Data 101 Occam’s Razor 103 Skepticism and Simpson’s Paradox 103 The Null Hypothesis 104 P-Values 105 Looking At and Measuring Data 106 Categorical Values 106 Numeric Variables 117 A Couple More Statistical Ideas 120 Measuring Response 120 Standard Error of a Proportion 121 Comparing Results Using Confidence Bounds 123 Comparing Results Using Difference of Proportions 124 Size of Sample 125 What the Confidence Interval Really Means 126 Size of Test and Control for an Experiment 127 Multiple Comparisons 129 The Confidence Level with Multiple Comparisons 129 Bonferroni’s Correction 129 Chi-Square Test 130 Expected Values 130 Chi-Square Value 132 Comparison of Chi-Square to Difference of Proportions 134 An Example: Chi-Square for Regions and Starts 134 Case Study: Comparing Two Recommendation Systems with an A/B Test 138 First Metric: Participating Sessions 140 Data Mining and Statistics 144 Lessons Learned 148 Chapter 5 Descriptions and Prediction: Profiling and Predictive Modeling 151 Directed Data Mining Models 152 Defining the Model Structure and Target 152 Incremental Response Modeling 154 Model Stability 156 Time-Frames in the Model Set 157 Directed Data Mining Methodology 159 Step 1: Translate the Business Problem into a Data Mining Problem 161 How Will Results Be Used? 163 How Will Results Be Delivered? 163 The Role of Domain Experts and Information Technology 164 Step 2: Select Appropriate Data 165 What Data Is Available? 166 How Much Data Is Enough? 167 How Much History Is Required? 167 How Many Variables? 168 What Must the Data Contain? 168 Step 3: Get to Know the Data 169 Examine Distributions 169 Compare Values with Descriptions 170 Validate Assumptions 170 Ask Lots of Questions 171 Step 4: Create a Model Set 172 Assembling Customer Signatures 172 Creating a Balanced Sample 172 Including Multiple Timeframes 174 Creating a Model Set for Prediction 174 Creating a Model Set for Profiling 176 Partitioning the Model Set 176 Step 5: Fix Problems with the Data 177 Categorical Variables with Too Many Values 177 Numeric Variables with Skewed Distributions and Outliers 178 Missing Values 178 Values with Meanings That Change over Time 179 Inconsistent Data Encoding 179 Step 6: Transform Data to Bring Information to the Surface 180 Step 7: Build Models 180 Step 8: Assess Models 180 Assessing Binary Response Models and Classifiers 181 Assessing Binary Response Models Using Lift 182 Assessing Binary Response Model Scores Using Lift Charts 184 Assessing Binary Response Model Scores Using Profitability Models 185 Assessing Binary Response Models Using ROC Charts 186 Assessing Estimators 188 Assessing Estimators Using Score Rankings 189 Step 9: Deploy Models 190 Practical Issues in Deploying Models 190 Optimizing Models for Deployment 191 Step 10: Assess Results 191 Step 11: Begin Again 193 Lessons Learned 193 Chapter 6 Data Mining Using Classic Statistical Techniques 195 Similarity Models 196 Similarity and Distance 196 Example: A Similarity Model for Product Penetration 197 Table Lookup Models 203 Choosing Dimensions 204 Partitioning the Dimensions 205 From Training Data to Scores 205 Handling Sparse and Missing Data by Removing Dimensions 205 RFM: A Widely Used Lookup Model 206 RFM Cell Migration 207 RFM and the Test-and-Measure Methodology 208 RFM and Incremental Response Modeling 209 Naïve Bayesian Models 210 Some Ideas from Probability 210 The Naïve Bayesian Calculation 212 Comparison with Table Lookup Models 213 Linear Regression 213 The Best-fit Line 215 Goodness of Fit 217 Multiple Regression 220 The Equation 220 The Range of the Target Variable 221 Interpreting Coefficients of Linear Regression Equations 221 Capturing Local Effects with Linear Regression 223 Additional Considerations with Multiple Regression 224 Variable Selection for Multiple Regression 225 Logistic Regression 227 Modeling Binary Outcomes 227 The Logistic Function 229 Fixed Effects and Hierarchical Effects 231 Hierarchical Effects 232 Within and Between Effects 232 Fixed Effects 233 Lessons Learned 234 Chapter 7 Decision Trees 237 What Is a Decision Tree and How Is It Used? 238 A Typical Decision Tree 238 Using the Tree to Learn About Churn 240 Using the Tree to Learn About Data and Select Variables 241 Using the Tree to Produce Rankings 243 Using the Tree to Estimate Class Probabilities 243 Using the Tree to Classify Records 244 Using the Tree to Estimate Numeric Values 244 Decision Trees Are Local Models 245 Growing Decision Trees 247 Finding the Initial Split 248 Growing the Full Tree 251 Finding the Best Split 252 Gini (Population Diversity) as a Splitting Criterion 253 Entropy Reduction or Information Gain as a Splitting Criterion 254 Information Gain Ratio 256 Chi-Square Test as a Splitting Criterion 256 Incremental Response as a Splitting Criterion 258 Reduction in Variance as a Splitting Criterion for Numeric Targets 259 F Test 262 Pruning 262 The CART Pruning Algorithm 263 Pessimistic Pruning: The C5.0 Pruning Algorithm 267 Stability-Based Pruning 268 Extracting Rules from Trees 269 Decision Tree Variations 270 Multiway Splits 270 Splitting on More Than One Field at a Time 271 Creating Nonrectangular Boxes 271 Assessing the Quality of a Decision Tree 275 When Are Decision Trees Appropriate? 276 Case Study: Process Control in a Coffee Roasting Plant 277 Goals for the Simulator 277 Building a Roaster Simulation 278 Evaluation of the Roaster Simulation 278 Lessons Learned 279 Chapter 8 Artificial Neural Networks 281 A Bit of History 282 The Biological Model 283 The Biological Neuron 285 The Biological Input Layer 286 The Biological Output Layer 287 Neural Networks and Artificial Intelligence 287 Artificial Neural Networks 288 The Artificial Neuron 288 The Multi-Layer Perceptron 291 A Network Example 292 Network Topologies 293 A Sample Application: Real Estate Appraisal 295 Training Neural Networks 299 How Does a Neural Network Learn Using Back Propagation? 299 Pruning a Neural Network 300 Radial Basis Function Networks 303 Overview of RBF Networks 303 Choosing the Locations of the Radial Basis Functions 305 Universal Approximators 305 Neural Networks in Practice 308 Choosing the Training Set 309 Coverage of Values for All Features 309 Number of Features 310 Size of Training Set 310 Number and Range of Outputs 310 Rules of Thumb for Using MLPs 310 Preparing the Data 311 Interpreting the Output from a Neural Network 313 Neural Networks for Time Series 315 Time Series Modeling 315 A Neural Network Time Series Example 316 Can Neural Network Models Be Explained? 317 Sensitivity Analysis 318 Using Rules to Describe the Scores 318 Lessons Learned 319 Chapter 9 Nearest Neighbor Approaches: Memory-Based Reasoning and Collaborative Filtering 321 Memory-Based Reasoning 322 Look-Alike Models 323 Example: Using MBR to Estimate Rents in Tuxedo, New York 324 Challenges of MBR 327 Choosing a Balanced Set of Historical Records 328 Representing the Training Data 328 Determining the Distance Function, Combination Function, and Number of Neighbors 331 Case Study: Using MBR for Classifying Anomalies in Mammograms 331 The Business Problem: Identifying Abnormal Mammograms 332 Applying MBR to the Problem 332 The Total Solution 334 Measuring Distance and Similarity 335 What Is a Distance Function? 335 Building a Distance Function One Field at a Time 337 Distance Functions for Other Data Types 340 When a Distance Metric Already Exists 341 The Combination Function: Asking the Neighbors for Advice 342 The Simplest Approach: One Neighbor 342 The Basic Approach for Categorical Targets: Democracy 342 Weighted Voting for Categorical Targets 344 Numeric Targets 344 Case Study: Shazam — Finding Nearest Neighbors for Audio Files 345 Why This Feat Is Challenging 346 The Audio Signature 347 Measuring Similarity 348 Collaborative Filtering: A Nearest-Neighbor Approach to Making Recommendations 351 Building Profiles 352 Comparing Profiles 352 Making Predictions 353 Lessons Learned 354 Chapter 10 Knowing When to Worry: Using Survival Analysis to Understand Customers 357 Customer Survival 360 What Survival Curves Reveal 360 Finding the Average Tenure from a Survival Curve 362 Customer Retention Using Survival 364 Looking at Survival as Decay 365 Hazard Probabilities 367 The Basic Idea 368 Examples of Hazard Functions 369 Censoring 371 The Hazard Calculation 372 Other Types of Censoring 375 From Hazards to Survival 376 Retention 376 Survival 378 Comparison of Retention and Survival 378 Proportional Hazards 380 Examples of Proportional Hazards 381 Stratification: Measuring Initial Effects on Survival 382 Cox Proportional Hazards 382 Survival Analysis in Practice 385 Handling Different Types of Attrition 385 When Will a Customer Come Back? 387 Understanding Customer Value 389 Forecasting 392 Hazards Changing over Time 393 Lessons Learned 394 Chapter 11 Genetic Algorithms and Swarm Intelligence 397 Optimization 398 What Is an Optimization Problem? 398 An Optimization Problem in Ant World 399 E Pluribus Unum 400 A Smarter Ant 401 Genetic Algorithms 403 A Bit of History 404 Genetics on Computers 404 Representing the Genome 413 Schemata: The Building Blocks of Genetic Algorithms 414 Beyond the Simple Algorithm 417 The Traveling Salesman Problem 418 Exhaustive Search 419 A Simple Greedy Algorithm 419 The Genetic Algorithms Approach 419 The Swarm Intelligence Approach 420 Case Study: Using Genetic Algorithms for Resource Optimization 421 Case Study: Evolving a Solution for Classifying Complaints 423 Business Context 424 Data 425 The Comment Signature 425 The Genomes 426 The Fitness Function 427 The Results 427 Lessons Learned 427 Chapter 12 Tell Me Something New: Pattern Discovery and Data Mining 429 Undirected Techniques, Undirected Data Mining 431 Undirected versus Directed Techniques 431 Undirected versus Directed Data Mining 431 Case Study: Undirected Data Mining Using Directed Techniques 432 What is Undirected Data Mining? 435 Data Exploration 435 Segmentation and Clustering 436 Target Variable Definition, When the Target Is Not Explicit 438 Simulation, Forecasting, and Agent-Based Modeling 443 Methodology for Undirected Data Mining 455 There Is No Methodology 456 Things to Keep in Mind 456 Lessons Learned 457 Chapter 13 Finding Islands of Similarity: Automatic Cluster Detection 459 Searching for Islands of Simplicity 461 Customer Segmentation and Clustering 461 Similarity Clusters 463 Tracking Campaigns by Cluster-Based Segments 464 Clustering Reveals an Overlooked Market Segment 466 Fitting the Troops 467 The K-Means Clustering Algorithm 468 Two Steps of the K-Means Algorithm 468 Voronoi Diagrams and K-Means Clusters 471 Choosing the Cluster Seeds 473Choosing K 473 Using K-Means to Detect Outliers 474 Semi-Directed Clustering 475 Interpreting Clusters 475 Characterizing Clusters by Their Centroids 476 Characterizing Clusters by What Differentiates Them 477 Using Decision Trees to Describe Clusters 478 Evaluating Clusters 479 Cluster Measurements and Terminology 480 Cluster Silhouettes 480 Limiting Cluster Diameter for Scoring 483 Case Study: Clustering Towns 484 Creating Town Signatures 484 Creating Clusters 486 Determining the Right Number of Clusters 486 Evaluating the Clusters 487 Using Demographic Clusters to Adjust Zone Boundaries 488 Business Success 490 Variations on K-Means 490 K-Medians, K-Medoids, and K-Modes 490 The Soft Side of K-Means 494 Data Preparation for Clustering 495 Scaling for Consistency 496 Use Weights to Encode Outside Information 496 Selecting Variables for Clustering 497 Lessons Learned 497 Chapter 14 Alternative Approaches to Cluster Detection 499 Shortcomings of K-Means 500 Reasonableness 500 An Intuitive Example 501 Fixing the Problem by Changing the Scales 503 What This Means in Practice 504 Gaussian Mixture Models 505 Adding “Gaussians” to K-Means 505 Back to Gaussian Mixture Models 508 Scoring GMMs 510 Applying GMMs 511 Divisive Clustering 513 A Decision Tree–Like Method for Clustering 513 Scoring Divisive Clusters 515 Clusters and Trees 515 Agglomerative (Hierarchical) Clustering 516 Overview of Agglomerative Clustering Methods 516 Clustering People by Age: An Example of An Agglomerative Clustering Algorithm 520 Scoring Agglomerative Clusters 522 Limitations of Agglomerative Clustering 523 Agglomerative Clustering in Practice 525 Combining Agglomerative Clustering and K-Means 526 Self-Organizing Maps 527 What Is a Self-Organizing Map? 527 Training an SOM 530 Scoring an SOM 531 The Search Continues for Islands of Simplicity 532 Lessons Learned 533 Chapter 15 Market Basket Analysis and Association Rules 535 Defining Market Basket Analysis 536 Four Levels of Market Basket Data 537 The Foundation of Market Basket Analysis: Basic Measures 539 Order Characteristics 540 Item (Product) Popularity 541 Tracking Marketing Interventions 542 Case Study: Spanish or English 543 The Business Problem 543 The Data 544 Defining “Hispanicity” Preference 545 The Solution 546 Association Analysis 547 Rules Are Not Always Useful 548 Item Sets to Association Rules 551 How Good Is an Association Rule? 553 Building Association Rules 555 Choosing the Right Set of Items 556 Anonymous Versus Identified 561 Generating Rules from All This Data 561 Overcoming Practical Limits 565 The Problem of Big Data 567 Extending the Ideas 569 Different Items on the Right- and Left-Hand Sides 569 Using Association Rules to Compare Stores 570 Association Rules and Cross-Selling 572 A Typical Cross-Sell Model 572 A More Confident Approach to Product Propensities 573 Results from Using Confidence 574 Sequential Pattern Analysis 574 Finding the Sequences 575 Sequential Association Rules 578 Sequential Analysis Using Other Data Mining Techniques 579 Lessons Learned 579 Chapter 16 Link Analysis 581 Basic Graph Theory 582 What Is a Graph? 582 Directed Graphs 584 Weighted Graphs 585 Seven Bridges of Königsberg 585 Detecting Cycles in a Graph 588 The Traveling Salesman Problem Revisited 589 Social Network Analysis 593 Six Degrees of Separation 593 What Your Friends Say About You 595 Finding Childcare Benefits Fraud 596 Who Responds to Whom on Dating Sites 597 Social Marketing 598 Mining Call Graphs 598 Case Study: Tracking Down the Leader of the Pack 601 The Business Goal 601 The Data Processing Challenge 601 Finding Social Networks in Call Data 602 How the Results Are Used for Marketing 602 Estimating Customer Age 603 Case Study: Who Is Using Fax Machines from Home? 604 Why Finding Fax Machines Is Useful 604 How Do Fax Machines Behave? 604 A Graph Coloring Algorithm 605 “Coloring” the Graph to Identify Fax Machines 606 How Google Came to Rule the World 607 Hubs and Authorities 608 The Details 609 Hubs and Authorities in Practice 611 Lessons Learned 612 Chapter 17 Data Warehousing, OLAP, Analytic Sandboxes, and Data Mining 613 The Architecture of Data 615 Transaction Data, the Base Level 616 Operational Summary Data 617 Decision-Support Summary Data 617 Database Schema/Data Models 618 Metadata 623 Business Rules 623 A General Architecture for Data Warehousing 624 Source Systems 624 Extraction, Transformation, and Load 626 Central Repository 627 Metadata Repository 630 Data Marts 630 Operational Feedback 631 Users and Desktop Tools 631 Analytic Sandboxes 633 Why Are Analytic Sandboxes Needed? 634 Technology to Support Analytic Sandboxes 636 Where Does OLAP Fit In? 639 What’s in a Cube? 641 Star Schema 646 OLAP and Data Mining 648 Where Data Mining Fits in with Data Warehousing 650 Lots of Data 651 Consistent, Clean Data 651 Hypothesis Testing and Measurement 652 Scalable Hardware and RDBMS Support 653 Lessons Learned 653 Chapter 18 Building Customer Signatures 655 Finding Customers in Data 656 What Is a Customer? 657 Accounts? Customers? Households? 658 Anonymous Transactions 658 Transactions Linked to a Card 659 Transactions Linked to a Cookie 659 Transactions Linked to an Account 660 Transactions Linked to a Customer 661 Designing Signatures 661 Is a Customer Signature Necessary? 666 What Does a Row Represent? 666 Will the Signature Be Used for Predictive Modeling? 671 Has a Target Been Defined? 672 Are There Constraints Imposed by the Particular Data Mining Techniques to be Employed? 672 Which Customers Will Be Included? 673 What Might Be Interesting to Know About Customers? 673 What a Signature Looks Like 674 Process for Creating Signatures 677 Some Data Is Already at the Right Level of Granularity 678 Pivoting a Regular Time Series 679 Aggregating Time-Stamped Transactions 680 Dealing with Missing Values 685 Missing Values in Source Data 685 Unknown or Non-Existent? 687 What Not to Do 687 Things to Consider 689 Lessons Learned 691 Chapter 19 Derived Variables: Making the Data Mean More 693 Handset Churn Rate as a Predictor of Churn 694 Single-Variable Transformations 696 Standardizing Numeric Variables 696 Turning Numeric Values into Percentiles 697 Turning Counts into Rates 698 Relative Measures 699 Replacing Categorical Variables with Numeric Ones 700 Combining Variables 707 Classic Combinations 707 Combining Highly Correlated Variables 710 Rent to Home Value 712 Extracting Features from Time Series 718 Trend 719 Seasonality 721 Extracting Features from Geography 722 Geocoding 722 Mapping 723 Using Geography to Create Relative Measures 724 Using Past Values of the Target Variable 725 Using Model Scores as Inputs 725 Handling Sparse Data 726 Account Set Patterns 726 Binning Sparse Values 727 Capturing Customer Behavior from Transactions 727 Widening Narrow Data 728 Sphere of Influence as a Predictor of Good Customers 728 An Example: Ratings to Rater Profile 730 Sample Fields from the Rater Signature 730 The Rating Signature and Derived Variables 732 Lessons Learned 733 Chapter 20 Too Much of a Good Thing? Techniques for Reducing the Number of Variables 735 Problems with Too Many Variables 736 Risk of Correlation Among Input Variables 736 Risk of Overfitting 738 The Sparse Data Problem 738 Visualizing Sparseness 739 Independence 740 Exhaustive Feature Selection 743 Flavors of Variable Reduction Techniques 744 Using the Target 744 Original versus New Variables 744 Sequential Selection of Features 745 The Traditional Forward Selection Methodology 745 Forward Selection Using a Validation Set 747 Stepwise Selection 748 Forward Selection Using Non-Regression Techniques 748 Backward Selection 748 Undirected Forward Selection 749 Other Directed Variable Selection Methods 749 Using Decision Trees to Select Variables 750 Variable Reduction Using Neural Networks 752 Principal Components 753 What Are Principal Components? 753 Principal Components Example 758 Principal Component Analysis 763 Factor Analysis 767 Variable Clustering 768 Example of Variable Clusters 768 Using Variable Clusters 770 Hierarchical Variable Clustering 770 Divisive Variable Clustering 773 Lessons Learned 774 Chapter 21 Listen Carefully to What Your Customers Say: Text Mining 775 What Is Text Mining? 776 Text Mining for Derived Columns 776 Beyond Derived Features 777 Text Analysis Applications 778 Working with Text Data 781 Sources of Text 781 Language Effects 782 Basic Approaches to Representing Documents 783 Representing Documents in Practice 784 Documents and the Corpus 786 Case Study: Ad Hoc Text Mining 786 The Boycott 787 Business as Usual 787 Combining Text Mining and Hypothesis Testing 787 The Results 788 Classifying News Stories Using MBR 789 What Are the Codes? 789 Applying MBR 790 The Results 793 From Text to Numbers 794 Starting with a “Bag of Words” 794 Term-Document Matrix 796 Corpus Effects 797 Singular Value Decomposition (SVD) 798 Text Mining and Naïve Bayesian Models 800 Naïve Bayesian in the Text World 801 Identifying Spam Using Naïve Bayesian 801 Sentiment Analysis 806 DIRECTV: A Case Study in Customer Service 809 Background 809 Applying Text Mining 811 Taking the Technical Approach 814 Not an Iterative Process 818 Continuing to Benefit 818 Lessons Learned 819 Index 821

    £37.05

  • Principles of Wireless Access and Localization

    John Wiley & Sons Inc Principles of Wireless Access and Localization

    Book SynopsisA comprehensive, encompassing and accessible text examining a wide range of key Wireless Networking and Localization technologies This book provides a unified treatment of issues related to all wireless access and wireless localization techniques. The book reflects principles of design and deployment of infrastructure for wireless access and localization for wide, local, and personal networking. Description of wireless access methods includes design and deployment of traditional TDMA and CDMA technologies and emerging Long Term Evolution (LTE) techniques for wide area cellular networks, the IEEE 802.11/WiFi wireless local area networks as well as IEEE 802.15 Bluetooth, ZigBee, Ultra Wideband (UWB), RF Microwave and body area networks used for sensor and ad hoc networks. The principles of wireless localization techniques using time-of-arrival and received-signal-strength of the wireless signal used in military and commercial applications in smart devices operating in urTable of ContentsPreface xv 1 Introduction 1 1.1 Introduction 1 1.2 Elements of Information Networks 3 1.3 Evolution of Wireless Access to the PSTN 17 1.4 Evolution of Wireless Access to the Internet 21 1.5 Evolution of Wireless Localization Technologies 27 1.6 Structure of this Book 29 Part I PRINCIPLES OF AIR–INTERFERENCE DESIGN 2 Characteristics of the Wireless Medium 39 2.1 Introduction 39 2.2 Modeling of Large-scale RSS, Path Loss, and Shadow Fading 45 2.3 Modeling of RSS Fluctuations and Doppler Spectrum 60 2.4 Wideband Modeling of Multipath Characteristics 72 2.5 Emerging Channel Models 79 Appendix A2: What Is the Decibel? 84 3 Physical Layer Alternatives forWireless Networks 99 3.1 Introduction 99 3.2 Physical Layer Basics: Data rate, Bandwidth, and Power 100 3.3 Performance in Multipath Wireless Channels 107 3.4 Wireless Transmission Techniques 112 3.5 Multipath Resistant Techniques 120 3.6 Coding Techniques for Wireless Communications 136 3.7 Cognitive Radio and Dynamic Spectrum Access 145 Appendix A3 145 4 Medium Access Methods 153 4.1 Introduction 153 4.2 Centralized Assigned-Access Schemes 155 4.3 Distributed Random Access for Data Oriented Networks 173 4.4 Integration of Voice and Data Traffic 195 Part II PRINCIPLES OF NETWORK INFRASTRUCTURE DESIGN 5 Deployment ofWireless Networks 217 5.1 Introduction 217 5.2 Wireless Network Architectures 218 5.3 Interference in Wireless Networks 224 5.4 Deployment of Wireless LANs 233 5.5 Cellular Topology, Cell Fundamentals, and Frequency Reuse 238 5.6 Capacity Expansion Techniques 248 5.7 Network Planning for CDMA Systems 268 5.8 Femtocells 270 6 Wireless Network Operations 275 6.1 Introduction 275 6.2 Cell Search and Registration 281 6.3 Mobility Management 283 6.4 Radio Resources and Power Management 301 7 Wireless Network Security 321 7.1 Introduction 321 7.2 Security in Wireless Local Networks 324 7.3 Security in Wireless Personal Networks 330 7.4 Security in Wide Area Wireless Networks 334 7.5 Miscellaneous Issues 340 Appendix A7: An Overview of Cryptography and Cryptographic Protocols 341 Part III WIRELESS LOCAL ACCESS 8 Wireless LANs 357 8.1 Introduction 357 8.2 Wireless Local Area Networks and Standards 363 8.3 IEEE 802.11 WLAN Operations 369 9 Low Power Sensor Networks 405 9.1 Introduction 405 9.2 Bluetooth 406 9.3 IEEE 802.15.4 and ZigBee 424 9.4 IEEE 802.15.6 Body Area Networks 434 10 GigabitWireless 447 10.1 Introduction 447 10.2 UWB Communications at 3.1–10.6 GHz 451 10.3 Gigabit Wireless at 60 GHz 467 Part IV WIDE AREA WIRELESS ACCESS 11 TDMA Cellular Systems 479 11.1 Introduction 479 11.2 What is TDMA Cellular? 480 11.3 Mechanisms to Support a Mobile Environment 486 11.4 Communication Protocols 491 11.5 Channel Models for Cellular Networks 501 11.6 Transmission Techniques in TDMA Cellular 508 11.7 Evolution of TDMA for Internet Access 512 12 CDMA Cellular Systems 519 12.1 Introduction 519 12.2 Why CDMA? 520 12.3 CDMA Based Cellular Systems 521 12.4 Direct Sequence Spread Spectrum 522 12.5 Communication Channels and Protocols in Example CDMA Systems 534 12.6 Cell Search, Mobility, and Radio Resource Management in CDMA 546 12.7 High Speed Packet Access 554 13 OFDM and MIMO Cellular Systems 561 13.1 Introduction 561 13.2 Why OFDM? 562 13.3 Multiple Input Multiple Output 572 13.4 WiMax 576 13.5 Long Term Evolution 582 13.6 LTE Advanced 591 Part V WIRELESS LOCALIZATION 14 Geolocation Systems 597 14.1 Introduction 597 14.2 What is Wireless Geolocation? 598 14.3 RF Location Sensing and Positioning Methodologies 602 14.4 Location Services Architecture for Cellular Systems 613 14.5 Positioning in Ad Hoc and Sensor Networks 620 15 Fundamentals of RF Localization 625 15.1 Introduction 625 15.2 Modeling of the Behavior of RF Sensors 626 15.3 Performance Bounds for Ranging 631 15.4 Wireless Positioning Algorithms 639 16 Wireless Localization in Practice 653 16.1 Introduction 653 16.2 Emergence of Wi-Fi Localization 653 16.3 Comparison of Wi-Fi Localization Systems 657 16.4 Practical TOA Measurement 665 16.5 Localization in the Absence of DP 669 16.6 Challenges in Localization inside the Human Body 675 References 687 Index 701

    £92.10

  • LDAP Directories Building an Enterprise Directory

    John Wiley & Sons Inc LDAP Directories Building an Enterprise Directory

    Book SynopsisProvides an introduction to the Lightweight Directory Access Protocol (LDAP) technology. This book offers a detailed overview of the real world applications of the technology. It offers an explanation of the technical details of LDAP and a step-by-step demonstration of how to implement an LDAP directory.Table of ContentsIntroduction. What is the Aim of this Book? Structure of the Book. For Whom is this Book Intended? FAQs. Acknowledgements. PART 1: DIRECTORIES AND THEIR APPLICATIONS. 1. Directories Overview. 2. The History of Directories and an Introduction to LDAP. 3. LDAP Directories and Their Applications. PART 2: THE LDAP STANDARD. 4. LDAP Standard and its Client-Server Model. 5. The LDAP Models. 6. LDAP Interfaces and the Future of the Standard. PART 3: THE DESIGN PHASE. 7. Functional Design. 8. Technical Design. 9. LDAP Tools and Applications. 10. Case Studies. 11. The Life Cycle of a Corporate Directory. PART 4: EXAMPLES OF CODE. 12. Examples of Code in C and C++. 13. Examples of ADSI Implementation. Index.

    £32.00

  • Quality of Service in a Cisco Networking

    John Wiley & Sons Inc Quality of Service in a Cisco Networking

    Book SynopsisIn networks, Quality of Service (QoS) is the idea that transmission rates, error rates, and other characteristics can be measured, improved, and, to some extent, guaranteed in advance. QoS is of particular concern for the continuous transmission of high--bandwidth video and multimedia information.Table of ContentsPreface. 1. The Meaning of Quality of Service. Why QOS? Defining QOS. Book Preview. 2. Working at Layer 2. The IEEE 802.1p Signalling Technique. Configuring Cisco(r) Equipment. 3. QOS into the WAN. The IP Protocol Stack. Data Delivery. Queuing Addresses. The IPv4 Header. Router Queuing. First-in, First-out Queuing. Priority Queuing. Classifying Traffic Via the Arrival Interface. 4. Diffserv and MPLS. Differentiated Services. Supporting DiffServ in a Cisco Environment. Multi-Protocol Label Switching. Configuring MPLS. 5. The Resource Preservation Protocol. Understanding RSVP. Configuring RSVP. 6. QOS Enhancement Techniques. Enabling Static Routing. Enhancing the Address Resolution Process. Tailor the Access Line. Enabling RTP Header Compression. Enabling Other Compression Methods. Eliminate Directed Broadcasts. Enable Selective Acknowledgements. Enable Link Fragmentaton and Interleaving. 7. Monitoring Your Network. The Show Command. IP-Related Show Commands. Appendix: Testing Tools. Index.

    £100.76

  • Symbian OS Communications Programming 2 Symbian

    Wiley Symbian OS Communications Programming 2 Symbian

    Book SynopsisA developera s guide to the Symbian OS (Operating System) Communications Architecture. The Symbian OS Communications Architecture is the cornerstone of Symbian OS -- enabling the combination of voice communications, wireless Internet access and computing functionality.Trade Review"...clear and detailed...the supporting text is lucid and clear..." (www.wirelessdevnet.com, 5 July 2002) "…something useful for everyone…the writing is clear, and the structure makes it easy to learn…" (Forum Nokia, 6 March 12003) "…written in a clear and accessible manner…" (CVu, June 2003)Table of ContentsPreface. Foreword. Section 1: The Basics of Symbian OS Communication. Introduction. Introduction to the Symbian Communication Architecture. Several Introductions to the Architecture Infrastructure. Transport Technologies. Look at Content Technologies. Security and Communication. Section 2: Programming using Symbian OS Communication. Getting Started with Communications Programming. Serial Communications. Communicating via Infrared: Serial Communications. Using Sockets. Communicating via Infrared: Using Sockets. Communicating with TCP/IP. Bluetooth Communications. Telephony. Sending and Receiving Messages. Browsable Content Technologies. Section 3: Miscellaneous Topics. Synchronization: PLP and SyncML. The Communications Database. Looking Ahead. Appendix A Developer Resources and Bibliography. Index.

    £29.59

  • The Wireless Mobile Internet Architectures

    John Wiley & Sons Inc The Wireless Mobile Internet Architectures

    Book SynopsisInternet based applications are the emerging major source of traffic for wireless networks. Soon we will all be able to access the Internet from our mobile phones, PDAs, hand--held devices, etc. This book describes the networking technologies that will enable the seamless transmission of data to us, wherever we are.Trade Review"...excellent text book style...essential reading for those interested in or studying the topic..." (TelecomWorldWire, 25 June 2003) "...an excellent addition to the literature on the wireless mobile Internet...a must-read for seasoned professionals and also for those who are new to the subject...." (Computing Reviews) "...easy-to-read reference text is essential reading for those interested in or studying the topic..." (M2 Best Books, 25 June 2003) "...a survival guide that helps introduce us to issues related to providing Internet networking for wireless mobile terminals..." (IEEE Communications Magazine, Dec 2003)Table of ContentsPreface. Acknowledgements. PART I: THE WIRELESS INTERNET. An Introduction to Wireless Mobile Internet. Wireless Cellular Data Networks. Cellular Mobile Networks. Mobile Networks of the Future. PART II: FUNDAMENTAL TOPICS IN WIRELESS IP. Quality of Service in a Mobile Environment. Traffic Modeling for Wireless IP. Traffic Management for Wireless IP. Mobility in Cellular Networks. Transport Protocols for Wireless IP. Internet Protocol for Wireless IP. PART III: ADVANCED TOPICS IN WIRELESS IP. Internet Perspectives on Wireless IP. Mobile Ad Hoc Networks and Future Challenges. Satellites in Wireless IP. Acronyms. Index. About the Author.

    £100.76

  • Ethernet Networks 4e

    John Wiley & Sons Inc Ethernet Networks 4e

    Book SynopsisProvides the information needed to know to plan, implement, manage and upgrade Ethernet networks. This book helps to: improve your skills in employing Ethernet hubs, switches, and routers; learn how to set up and operate a wireless Local Area Network; discover how to extend a wired Ethernet via wireless LANs; and, understand cabling standards.Table of ContentsPreface. Acknowledgments. Introduction to Networking Concepts. Networking Standards. Ethernet Networks. Frame Operations. Networking Hardware and Software. Bridging and Switching Methods and Performance Issues. Routers. Wireless Ethernet. Security. Managing the Network. The Future of Ethernet. Index.

    £88.16

  • Concept Data Analysis

    John Wiley & Sons Inc Concept Data Analysis

    Book SynopsisOffers a treatment of the full range of algorithms available for conceptual data analysis, spanning creation, maintenance, display and manipulation of concept lattices. The website accompanying this book allows you to gain a better understanding of the principles covered herein through working on the topics discussed.Table of ContentsForeword. Preface. I: THEORY AND ALGORITHMS. 1. Theoretical Foundations. 1.1 Basic Notions of Orders and Lattices. 1.2 Context, Concept, and Concept Lattice. 1.3 Many-valued Contexts. 1.4 Bibliographic Notes. 2. Algorithms. 2.1 Constructing Concept Lattices. 2.2 Incremental Lattice Update. 2.3 Visualization. 2.4 Adding Knowledge to Concept Lattices. 2.5 Bibliographic Notes. II: APPLICATIONS. 3. Information Retrieval. 3.1 Query Modification. 3.2 Document Ranking 4. Text Mining. 4.1 Mining the Content of the ACM Digital Library. 4.2 MiningWeb Retrieval Results with CREDO. 4.3 Bibliographic Notes. 5. Rule Mining. 5.1 Implications. 5.2 Functional Dependencies. 5.3 Association Rules. 5.4 Classification Rules. 5.5 Bibliographic Notes. References. Index.

    £95.36

  • Web Server Programming

    John Wiley & Sons Inc Web Server Programming

    Book SynopsisWhen the web transitioned from a publishing to an interactive e--commerce medium, standardised web--browsers entered widespread use and developers were able to rely on a relatively stable client component.Table of ContentsPreface xi 1 Introduction 1 1.1 Servers on the Internet 2 1.2 Serving static hypertext 6 1.3 Serving dynamically generated hypertext 8 1.4 Forms and CGI 11 1.5 A CGI program and examples 18 1.6 Client-side scripting 29 Exercises 32 Practical 32 Short answer questions 32 Explorations 33 2 HTTP 35 2.1 Requests and responses 36 2.1.1 Requests 38 2.1.2 Responses 40 2.2 Authorization 41 2.3 Negotiated content 43 2.4 State in a stateless protocol 44 Exercises 45 Short answer questions 45 Explorations 45 3 Apache 47 3.1 Apache’s processes 48 3.2 Apache’s modules 51 3.3 Access controls 54 3.4 Logs 58 3.5 Generation of dynamic pages 61 3.6 Apache: installation and configuration 64 3.6.1 Basic installation and testing 64 3.6.2 The httpd.conf configuration file 67 Exercises 71 Practical 71 Short answer questions 75 Explorations 76 4 IP and DNS 77 4.1 IP addresses 78 4.2 IP addresses and names 81 4.3 Name resolution 84 4.4 BIND 86 Exercises 89 Practical 89 Short answer questions 90 Explorations 90 5 Perl 91 5.1 Perl’s origins 92 5.2 Running Perl, and the inevitable ‘Hello World’ program 93 5.3 Perl language 94 5.3.1 Scalar variables 95 5.3.2 Control structures 98 5.4 Perl core functions 101 5.5 ’CS1’ revisited: simple Perl programs 103 5.5.1 Burgers 103 5.5.2 ls -l 105 5.6 Beyond CS1: lists and arrays 108 5.6.1 Basics of lists 108 5.6.2 Two simple list examples 112 5.7 Subroutines 118 5.8 Hashes 120 5.9 An example using a hash and a list 122 5.10 Files and formatting 123 5.11 Regular expression matching 126 5.11.1 Basics of regex patterns 128 5.11.2 Finding ‘what matched?’ and other advanced features 131 5.12 Perl and the OS 136 5.12.1 Manipulating files and directories 137 5.12.2 Perl: processes 140 5.12.3 A ‘systems programming’ example 143 5.13 Networking 150 5.14 Modules 153 5.15 Databases 154 5.15.1 Basics 154 5.15.2 Database example 158 5.16 Perl: CGI 163 5.16.1 ’Roll your own’ CGI code 164 5.16.2 Perl: CGI module(s) 171 5.16.3 Security issues and CGI 173 Exercises 174 Practical 174 Short answer questions 180 Explorations 181 6 PHP4 183 6.1 PHP4’s origins 183 6.2 PHP language 187 6.2.1 Simple variables and data types 187 6.2.2 Operators 191 6.2.3 Program structure and flow control 191 6.2.4 Functions 193 6.3 Simple examples 194 6.4 Multi-page forms 198 6.5 File uploads 207 6.6 Databases 216 6.7 GD graphics library 227 6.8 State 238 Exercises 248 Practical 248 Short answer questions 257 Explorations 257 7 Java Servlets 259 7.1 Servlet overview 259 7.2 A first servlet example 261 7.2.1 Form and servlet code 263 7.2.2 Installation, Compilation, Deployment 265 7.2.3 web.xml deployment files 268 7.3 Sun’s servlet-related classes 269 7.4 Web application example: ‘Membership’ 276 7.5 Client state and sessions 290 7.6 Images 304 7.7 Security features 306 Exercises 328 Practical 328 Short answer questions 336 Explorations 336 Contents vii 8 JSP: Java Server Pages 337 8.1 JSP overview 337 8.2 The ‘Guru’ – a JSP example 340 8.2.1 The scriptlet Guru 340 8.2.2 The tagged Guru 343 8.3 Membership example 344 8.4 JSP: page contents 352 8.4.1 JSP directives 354 8.4.2 jsp: tag library 355 8.5 Servlet, bean and JSP examples 356 8.6 Tag libraries 368 8.6.1 Defining a simple customized action tag 369 8.6.2 Using tag libraries 373 Exercises 375 Practical 375 Short answer questions 379 Explorations 380 9 XML 381 9.1 XML overview 381 9.2 XML and friends 384 9.3 XSL, XSLT and XML display 391 9.4 XML and XSL generating WML 403 9.5 Simple API for XML 412 9.6 DOM – the Document Object Model 422 Exercises 428 Practical 428 Short answer questions 432 Explorations 433 10 Enterprise Java 435 10.1 EJB background 437 10.1.1 Smart beans in smarter containers 437 10.1.2 Distributed objects 438 10.2 EJB basics 441 10.2.1 Servers, containers and beans 441 10.2.2 The life of a bean 444 10.2.3 Classes and interfaces 444 10.2.4 EJB clients and EJB deployment 446 10.3 Session bean examples 447 10.3.1 Stateless server 447 10.3.2 Stateful server 453 10.4 An Entity bean 456 10.5 Real-world EJB 470 Exercises 485 Practical 485 Short answer questions 485 Explorations 485 11 Future technologies? 487 11.1 (Lack of) Speed kills 487 11.2 Personal internet presence 489 11.3 Peer-to-peer 490 11.4 ... and on to ‘Web Services’ 492 11.4.1 The existing world of distributed objects 492 11.4.2 Steps towards a future world of distributed objects 495 11.4.3 UDDI, WSDL and SOAP 498 11.4.4 Web service promises 509 Exercises 512 Explorations 512 Appendices A Minimalist guide to HTML and JavaScript 515 B Active Server Pages: ASP (scripting) 549 C .NET 573 Index 601

    £39.85

  • Convergence Technologies for 3G Networks IP UMTS

    John Wiley & Sons Inc Convergence Technologies for 3G Networks IP UMTS

    Book SynopsisAddresses the application of both IP and ATM technologies to a cellular environment, including IP telephony protocols, the use of ATM/AAL2 and the AAL2 signalling protocol for voice/multimedia and data transport. This book explains the operation and integration of GSM, GPRS, EDGE, UMTS, CDMA2000, IP, and ATM.Trade Review"…this is an excellent volume, a must-have for systems architects…also to be commended for its cohesive and comprehensive assembly of many complex standards." (Computing Reviews.com, October 4, 2005) "This both is very detailed, yet readable. It would be an excellent read for both students and telecommunications professionals…" (Computing Reviews.com, June 8, 2005) "…well-structured…it provides detailed, and carefully selected and prepared, material." (Computing Reviews.com, October 21, 2004) "...very detailed yet readable...an excellent read for both students and professionals..." (The IEE Communications Engineer, June/July 2004)Table of ContentsAbout the Authors. 1. Introduction. 2. Principles of Communications . 3. GSM Fundamentals. 4. General Packet Radio System. 5. IP Applications for GPRS/UMTS. 6. Universal Mobile Telecommunications System. 7. UMTS Transmission Networks. 8. IP Telephony for UMTS Release 4. 9. Release 5 and Beyond (All-IP). Glossary of Terms. Index.

    £100.76

  • Analytical Network and System Administration

    John Wiley & Sons Inc Analytical Network and System Administration

    Out of stock

    Book SynopsisNetwork and system administration usually refers to the skill of keeping computers and networks running properly. But in truth, the skill needed is that of managing complexity. This book describes the science behind these complex systems, independent of the actual operating systems they work on.Table of ContentsForeword xi Preface xiv 1 Introduction 1 1.1 What is system administration? 1 1.2 What is a system? 2 1.3 What is administration? 2 1.4 Studying systems 3 1.5 What’s in a theory? 6 1.6 How to use the text 10 1.7 Some notation used 10 2 Science and its methods 13 2.1 The aim of science 13 2.2 Causality, superposition and dependency 16 2.3 Controversies and philosophies of science 17 2.4 Technology 20 2.5 Hypotheses 20 2.6 The science of technology 21 2.7 Evaluating a system—dependencies 22 2.8 Abuses of science 22 3 Experiment and observation 25 3.1 Data plots and time series 26 3.2 Constancy of environment during measurement 27 3.3 Experimental design 28 3.4 Stochastic (random) variables 29 3.5 Actual values or characteristic values 30 3.6 Observational errors 30 3.7 The mean and standard deviation 31 3.8 Probability distributions and measurement 32 3.8.1 Scatter and jitter 35 3.8.2 The ‘normal’ distribution 35 3.8.3 Standard error of the mean 36 3.8.4 Other distributions 37 3.9 Uncertainty in general formulae 38 3.10 Fourier analysis and periodic behaviour 39 3.11 Local averaging procedures 41 3.12 Reminder 43 4 Simple systems 45 4.1 The concept of a system 45 4.2 Data structures and processes 46 4.3 Representation of variables 47 4.4 The simplest dynamical systems 48 4.5 More complex systems 49 4.6 Freedoms and constraints 50 4.7 Symmetries 51 4.8 Algorithms, protocols and standard ‘methods’ 52 4.9 Currencies and value systems 53 4.9.1 Energy and power 53 4.9.2 Money 54 4.9.3 Social currency and the notion of responsibility 54 4.10 Open and closed systems: the environment 56 4.11 Reliable and unreliable systems 58 5 Sets, states and logic 59 5.1 Sets 59 5.2 A system as a set of sets 61 5.3 Addresses and mappings 61 5.4 Chains and states 62 5.5 Configurations and macrostates 64 5.6 Continuum approximation 65 5.7 Theory of computation and machine language 65 5.7.1 Automata or State Machines 66 5.7.2 Operators and operands 68 5.7.3 Pattern matching and operational grammars 69 5.7.4 Pathway analysis and distributed algorithms 70 5.8 A policy-defined state 71 6 Diagrammatical representations 73 6.1 Diagrams as systems 73 6.2 The concept of a graph 74 6.3 Connectivity 77 6.4 Centrality: maxima and minima in graphs 77 6.5 Ranking in directed graphs 80 6.6 Applied diagrammatical methods 84 7 System variables 91 7.1 Information systems 91 7.2 Addresses, labels, keys and other resource locators 92 7.3 Continuous relationships 94 7.4 Digital comparison 94 8 Change in systems 97 8.1 Renditions of change 97 8.2 Determinism and predictability 98 8.3 Oscillations and fluctuations 99 8.4 Rate of change 102 8.5 Applications of the continuum approximation 103 8.6 Uncertainty in the continuum approximation 105 9 Information 109 9.1 What is information? 109 9.2 Transmission 110 9.3 Informationandcontrol 111 9.4 Classification and resolution 111 9.5 Statistical uncertainty and entropy 114 9.6 Propertiesoftheentropy 118 9.7 Uncertainty in communication 119 9.8 A geometrical interpretation of information 123 9.9 Compressibility and size of information 127 9.10 Information and state 128 9.11 Maximum entropy principle 129 9.12 Fluctuation spectra. 133 10 Stability 135 10.1 Basic notions 135 10.2 Types of stability 135 10.3 Constancy 136 10.4 Convergence of behaviour 137 10.5 Maxima and minima 138 10.6 Regions of stability in a graph 139 10.7 Graph stability under random node removal 141 10.8 Dynamical equilibria: compromise 142 10.9 Statistical stability 143 10.10 Scaling stability 145 10.11 Maximum entropy distributions 148 10.12 Eigenstates 148 10.13 Fixed points of maps 151 10.14 Metastable alternatives and adaptability 155 10.15 Final remarks 156 11 Resource networks 159 11.1 What is a system resource? 159 11.2 Representation of resources 160 11.3 Resource currency relationships 161 11.4 Resource allocation, consumption and conservation 162 11.5 Where to attach resources? 163 11.6 Access to resources 165 11.7 Methods of resource allocation 167 11.7.1 Logical regions of systems 167 11.7.2 Using centrality to identify resource bottlenecks 168 11.8 Directed resources: flow asymmetries 170 12 Task management and services 173 12.1 Task list scheduling 173 12.2 Deterministic and non-deterministic schedules 174 12.3 Human–computer scheduling 176 12.4 Service provision and policy 176 12.5 Queue processing 177 12.6 Models 178 12.7 The prototype queue M/M/ 1 179 12.8 Queue relationships or basic ‘laws’ 181 12.9 Expediting tasks with multiple servers M/M/k 186 12.10 Maximum entropy input events in periodic systems 188 12.11 Miscellaneous issues in scheduling 189 13 System architectures 191 13.1 Policy for organization 191 13.2 Informative and procedural flows 192 13.3 Structured systems and ad hoc systems 193 13.4 Dependence policy 193 13.5 System design strategy 195 13.6 Event-driven systems and functional systems 200 13.7 The organization of human resources 201 13.8 Principle of minimal dependency 202 13.9 Decision-making within a system 202 13.9.1 Layered systems: Managers and workers 202 13.9.2 Efficiency 203 13.10 Prediction, verification and their limitations 204 13.11 Graphical methods 205 14 System normalization 207 14.1 Dependency 207 14.2 The database model 209 14.3 Normalized forms 210 15 System integrity 215 15.1 System administration as communication? 215 15.2 Extensive or strategic instruction 219 15.3 Stochastic semi-groups and martingales 223 15.4 Characterizing probable or average error 224 15.5 Correcting errors of propagation 226 15.6 Gaussian continuum approximation formula 228 16 Policy and maintenance 231 16.1 What is maintenance? 231 16.2 Average changes in configuration 231 16.3 The reason for random fluctuations 234 16.4 Huge fluctuations 235 16.5 Equivalent configurations and policy 236 16.6 Policy 237 16.7 Convergent maintenance 237 16.8 The maintenance theorem 240 16.9 Theory of back-up and error correction 241 17 Knowledge, learning and training 249 17.1 Information and knowledge 250 17.2 Knowledgeasclassification 250 17.3 Bayes’ theorem 252 17.4 Belief versus truth 254 17.5 Decisions based on expert knowledge 255 17.6 Knowledge out of date 259 17.7 Convergence of the learning process 260 18 Policy transgressions and fault modelling 263 18.1 Faults and failures 263 18.2 Deterministic system approximation 265 18.3 Stochasticsystemmodels 269 18.4 Approximate information flow reliability 273 18.5 Fault correction by monitoring and instruction 275 18.6 Policy maintenance architectures 279 18.7 Diagnostic cause trees 286 18.8 Probabilistic fault trees 290 18.8.1 Faults 290 18.8.2 Conditions and set logic 291 18.8.3 Construction 293 19 Decision and strategy 295 19.1 Causal analysis 295 19.2 Decision-making 296 19.3 Game theory 297 19.4 The strategic form of a game 301 19.5 The extensive form of a game 302 19.6 Solving zero-sum games 303 19.7 Dominated strategies 304 19.8 Nash equilibria 305 19.9 A security game 309 19.9.1 Zero-sum approximation 310 19.9.2 Non-zero sum approximation 313 19.10 The garbage collection game 315 19.11 A social engineering game 321 19.12 Human elements of policy decision 328 19.13 Coda: extensive versus strategic configuration management 328 20 Conclusions 331 A Some Boolean formulae 335 A.1 Conditional probability 335 A.2 Boolean algebra and logic 336 B Statistical and scaling properties of time-series data 339 B. 1 Local averaging procedure 339 B. 2 Scaling and self-similarity 343 B. 3 Scaling of continuous functions 344 C Percolation conditions 347 C. 1 Random graph condition 347 C. 2 Bi-partite form 350 C. 3 Small-graph corrections 351 Bibliography 353 Index 359

    Out of stock

    £95.36

  • Principles of Network and System Administration

    John Wiley & Sons Inc Principles of Network and System Administration

    Book SynopsisA comprehensive resource that responds to the high demand for specialists who can provide advice to users and handle day-to-day administration, maintenance, and support of computer systems and networks. It shows how to discover customer needs and then use that information to identify, interpret, and evaluate system and network requirements.Table of ContentsPreface to Second Edition. 1. Introduction. 2. System Components. 3. Networked Communities. 4. Host Management. 5. User Management 6. Models of Network and System Administration. 7. Configuration and Maintenance. 8. Diagnostics, Fault and Change Management. 9. Application Level Services. 10. Network Level Services. 11. Principles of Security. 12. Security Implications. 13. Analytical System Administration. 14. Summary and Outlook. A. Some Useful Unix Commands. B. Programming and Compiling. C. Example Telnet Session. D. Glossary. E. Recommended Reading. Bibliography. Index.

    £58.85

  • Wireless Home Networking For Dummies

    John Wiley & Sons Inc Wireless Home Networking For Dummies

    Book SynopsisThe perennial bestseller shows you how share your files and Internet connection across a wireless network Fully updated for Windows 7 and Mac OS X Snow Leopard, this new edition of this bestseller returns with all the latest in wireless standards and security. This fun and friendly guide shows you how to integrate your iPhone, iPod touch, smartphone, or gaming system into your home network. Veteran authors escort you through the various financial and logisitical considerations that you need to take into account before building a wireless network at home. Covers the basics of planning, installing, and using wireless LANs Reviews essential information on the latest security issues Delivers valuable tips on how to stay current with fast-moving technology Discusses how to share resources such as printers, scanners, an Internet connection, files, and more with multiple computers on one network Wireless Home Networking For DTable of ContentsIntroduction 1 Part I: Wireless Networking Fundamentals 7 Chapter 1: Introducing Wireless Home Networking 9 Chapter 2: From a to n and b-yond 27 Chapter 3: Exploring Bluetooth and Other Wireless Networks 51 Part II: Making Plans 67 Chapter 4: Planning a Wireless Home Network 69 Chapter 5: Choosing Wireless Home Networking Equipment 91 Part III: Installing a Wireless Network 107 Chapter 6: Installing Wireless Access Points in Windows 109 Chapter 7: Setting Up a Wireless Windows Network 125 Chapter 8: Setting Up a Wireless Mac Network 143 Chapter 9: Securing Your Home Network 161 Part IV: Using Your Wireless Network 183 Chapter 10: Putting Your Wireless Network to Work 185 Chapter 11: Gaming Over Your Wireless Network 205 Chapter 12: Networking Your Entertainment Center 225 Chapter 13: Extending Your Mobile Network 245 Chapter 14: Other Cool Things You Can Network 257 Chapter 15: Using a Bluetooth Network 273 Chapter 16: Going Wireless Away from Home 285 Part V: The Part of Tens 297 Chapter 17: Ten FAQs about Wireless Home Networks 299 Chapter 18: Ten Ways to Troubleshoot Wireless LAN Performance 309 Chapter 19: Ten Devices to Connect to Your Wireless Network in the Future 319 Chapter 20: Ten Sources for More Information 339 Index 347

    £16.19

  • Algorithms and Parallel Computing

    John Wiley & Sons Inc Algorithms and Parallel Computing

    Book SynopsisNew techniques (z-transform, graphic, algebraic) for studying and analyzing parallel algorithms and how to use them Case studies throughout th book Problems at the end of each chapter and available solutions manual A companion website to include lecture notes .Table of ContentsPreface xiii List of Acronyms xix 1 Introduction 1 1.1 Introduction 1 1.2 Toward Automating Parallel Programming 2 1.3 Algorithms 4 1.4 Parallel Computing Design Considerations 12 1.5 Parallel Algorithms and Parallel Architectures 13 1.6 Relating Parallel Algorithm and Parallel Architecture 14 1.7 Implementation of Algorithms: A Two-Sided Problem 14 1.8 Measuring Benefi ts of Parallel Computing 15 1.9 Amdahl’s Law for Multiprocessor Systems 19 1.10 Gustafson–Barsis’s Law 21 1.11 Applications of Parallel Computing 22 2 Enhancing Uniprocessor Performance 29 2.1 Introduction 29 2.2 Increasing Processor Clock Frequency 30 2.3 Parallelizing ALU Structure 30 2.4 Using Memory Hierarchy 33 2.5 Pipelining 39 2.6 Very Long Instruction Word (VLIW) Processors 44 2.7 Instruction-Level Parallelism (ILP) and Superscalar Processors 45 2.8 Multithreaded Processor 49 3 Parallel Computers 53 3.1 Introduction 53 3.2 Parallel Computing 53 3.3 Shared-Memory Multiprocessors (Uniform Memory Access [UMA]) 54 3.4 Distributed-Memory Multiprocessor (Nonuniform Memory Access [NUMA]) 56 3.5 SIMD Processors 57 3.6 Systolic Processors 57 3.7 Cluster Computing 60 3.8 Grid (Cloud) Computing 60 3.9 Multicore Systems 61 3.10 SM 62 3.11 Communication Between Parallel Processors 64 3.12 Summary of Parallel Architectures 67 4 Shared-Memory Multiprocessors 69 4.1 Introduction 69 4.2 Cache Coherence and Memory Consistency 70 4.3 Synchronization and Mutual Exclusion 76 5 Interconnection Networks 83 5.1 Introduction 83 5.2 Classification of Interconnection Networks by Logical Topologies 84 5.3 Interconnection Network Switch Architecture 91 6 Concurrency Platforms 105 6.1 Introduction 105 6.2 Concurrency Platforms 105 6.3 Cilk++ 106 6.4 OpenMP 112 6.5 Compute Unifi ed Device Architecture (CUDA) 122 7 Ad Hoc Techniques for Parallel Algorithms 131 7.1 Introduction 131 7.2 Defining Algorithm Variables 133 7.3 Independent Loop Scheduling 133 7.4 Dependent Loops 134 7.5 Loop Spreading for Simple Dependent Loops 135 7.6 Loop Unrolling 135 7.7 Problem Partitioning 136 7.8 Divide-and-Conquer (Recursive Partitioning) Strategies 137 7.9 Pipelining 139 8 Nonserial–Parallel Algorithms 143 8.1 Introduction 143 8.2 Comparing DAG and DCG Algorithms 143 8.3 Parallelizing NSPA Algorithms Represented by a DAG 145 8.4 Formal Technique for Analyzing NSPAs 147 8.5 Detecting Cycles in the Algorithm 150 8.6 Extracting Serial and Parallel Algorithm Performance Parameters 151 8.7 Useful Theorems 153 8.8 Performance of Serial and Parallel Algorithms on Parallel Computers 156 9 z-Transform Analysis 159 9.1 Introduction 159 9.2 Definition of z-Transform 159 9.3 The 1-D FIR Digital Filter Algorithm 160 9.4 Software and Hardware Implementations of the z-Transform 161 9.5 Design 1: Using Horner’s Rule for Broadcast Input and Pipelined Output 162 9.6 Design 2: Pipelined Input and Broadcast Output 163 9.7 Design 3: Pipelined Input and Output 164 10 Dependence Graph Analysis 167 10.1 Introduction 167 10.2 The 1-D FIR Digital Filter Algorithm 167 10.3 The Dependence Graph of an Algorithm 168 10.4 Deriving the Dependence Graph for an Algorithm 169 10.5 The Scheduling Function for the 1-D FIR Filter 171 10.6 Node Projection Operation 177 10.7 Nonlinear Projection Operation 179 10.8 Software and Hardware Implementations of the DAG Technique 180 11 Computational Geometry Analysis 185 11.1 Introduction 185 11.2 Matrix Multiplication Algorithm 185 11.3 The 3-D Dependence Graph and Computation Domain D 186 11.4 The Facets and Vertices of D 188 11.5 The Dependence Matrices of the Algorithm Variables 188 11.6 Nullspace of Dependence Matrix: The Broadcast Subdomain B 189 11.7 Design Space Exploration: Choice of Broadcasting versus Pipelining Variables 192 11.8 Data Scheduling 195 11.9 Projection Operation Using the Linear Projection Operator 200 11.10 Effect of Projection Operation on Data 205 11.11 The Resulting Multithreaded/Multiprocessor Architecture 206 11.12 Summary of Work Done in this Chapter 207 12 Case Study: One-Dimensional IIR Digital Filters 209 12.1 Introduction 209 12.2 The 1-D IIR Digital Filter Algorithm 209 12.3 The IIR Filter Dependence Graph 209 12.4 z-Domain Analysis of 1-D IIR Digital Filter Algorithm 216 13 Case Study: Two- and Three-Dimensional Digital Filters 219 13.1 Introduction 219 13.2 Line and Frame Wraparound Problems 219 13.3 2-D Recursive Filters 221 13.4 3-D Digital Filters 223 14 Case Study: Multirate Decimators and Interpolators 227 14.1 Introduction 227 14.2 Decimator Structures 227 14.3 Decimator Dependence Graph 228 14.4 Decimator Scheduling 230 14.5 Decimator DAG for s1 = [1 0] 231 14.6 Decimator DAG for s2 = [1 −1] 233 14.7 Decimator DAG for s3 = [1 1] 235 14.8 Polyphase Decimator Implementations 235 14.9 Interpolator Structures 236 14.10 Interpolator Dependence Graph 237 14.11 Interpolator Scheduling 238 14.12 Interpolator DAG for s1 = [1 0] 239 14.13 Interpolator DAG for s2 = [1 −1] 241 14.14 Interpolator DAG for s3 = [1 1] 243 14.15 Polyphase Interpolator Implementations 243 15 Case Study: Pattern Matching 245 15.1 Introduction 245 15.2 Expressing the Algorithm as a Regular Iterative Algorithm (RIA) 245 15.3 Obtaining the Algorithm Dependence Graph 246 15.4 Data Scheduling 247 15.5 DAG Node Projection 248 15.6 DESIGN 1: Design Space Exploration When s ƒ­ƒn[1 1]t 249 15.7 DESIGN 2: Design Space Exploration When s ƒ­ƒn[1 −1]t 252 15.8 DESIGN 3: Design Space Exploration When s = [1 0]t 253 16 Case Study: Motion Estimation for Video Compression 255 16.1 Introduction 255 16.2 FBMAs 256 16.3 Data Buffering Requirements 257 16.4 Formulation of the FBMA 258 16.5 Hierarchical Formulation of Motion Estimation 259 16.6 Hardware Design of the Hierarchy Blocks 261 17 Case Study: Multiplication over GF(2m) 267 17.1 Introduction 267 17.2 The Multiplication Algorithm in GF(2m) 268 17.3 Expressing Field Multiplication as an RIA 270 17.4 Field Multiplication Dependence Graph 270 17.5 Data Scheduling 271 17.6 DAG Node Projection 273 17.7 Design 1: Using d1 = [1 0]t 275 17.8 Design 2: Using d2 = [1 1]t 275 17.9 Design 3: Using d3 = [1 −1]t 277 17.10 Applications of Finite Field Multipliers 277 18 Case Study: Polynomial Division over GF(2) 279 18.1 Introduction 279 18.2 The Polynomial Division Algorithm 279 18.3 The LFSR Dependence Graph 281 18.4 Data Scheduling 282 18.5 DAG Node Projection 283 18.6 Design 1: Design Space Exploration When s1 = [1 −1] 284 18.7 Design 2: Design Space Exploration When s2 = [1 0] 286 18.8 Design 3: Design Space Exploration When s3 = [1 −0.5] 289 18.9 Comparing the Three Designs 291 19 The Fast Fourier Transform 293 19.1 Introduction 293 19.2 Decimation-in-Time FFT 295 19.3 Pipeline Radix-2 Decimation-in-Time FFT Processor 298 19.4 Decimation-in-Frequency FFT 299 19.5 Pipeline Radix-2 Decimation-in-Frequency FFT Processor 303 20 Solving Systems of Linear Equations 305 20.1 Introduction 305 20.2 Special Matrix Structures 305 20.3 Forward Substitution (Direct Technique) 309 20.4 Back Substitution 312 20.5 Matrix Triangularization Algorithm 312 20.6 Successive over Relaxation (SOR) (Iterative Technique) 317 20.7 Problems 321 21 Solving Partial Differential Equations Using Finite Difference Method 323 21.1 Introduction 323 21.2 FDM for 1-D Systems 324 References 331 Index 337

    £95.36

  • EnergyEfficient Distributed Computing Systems

    John Wiley & Sons Inc EnergyEfficient Distributed Computing Systems

    2 in stock

    Book SynopsisThe energy consumption issue in distributed computing systems raises various monetary, environmental and system performance concerns.Electricity consumption in the US doubled from 2000 to 2005. From a financial and environmental standpoint, reducing the consumption of electricity is important, yet these reforms must not lead to performance degradation of the computing systems. These contradicting constraints create a suite of complex problems that need to be resolved in order to lead to ''greener'' distributed computing systems. This book brings together a group of outstanding researchers that investigate the different facets of green and energy efficient distributed computing. Key features: One of the first books of its kind Features latest research findings on emerging topics by well-known scientists Valuable research for grad students, postdocs, and researchers Research will greatly feed into other technologies and applicatioTable of ContentsPREFACE xxix ACKNOWLEDGMENTS xxxi CONTRIBUTORS xxxiii 1 POWER ALLOCATION AND TASK SCHEDULING ON MULTIPROCESSOR COMPUTERS WITH ENERGY AND TIME CONSTRAINTS 1 Keqin Li 1.1 Introduction 1 1.1.1 Energy Consumption 1 1.1.2 Power Reduction 2 1.1.3 Dynamic Power Management 3 1.1.4 Task Scheduling with Energy and Time Constraints 4 1.1.5 Chapter Outline 5 1.2 Preliminaries 5 1.2.1 Power Consumption Model 5 1.2.2 Problem Definitions 6 1.2.3 Task Models 7 1.2.4 Processor Models 8 1.2.5 Scheduling Models 9 1.2.6 Problem Decomposition 9 1.2.7 Types of Algorithms 10 1.3 Problem Analysis 10 1.3.1 Schedule Length Minimization 10 1.3.1.1 Uniprocessor computers 10 1.3.1.2 Multiprocessor computers 11 1.3.2 Energy Consumption Minimization 12 1.3.2.1 Uniprocessor computers 12 1.3.2.2 Multiprocessor computers 13 1.3.3 Strong NP-Hardness 14 1.3.4 Lower Bounds 14 1.3.5 Energy-Delay Trade-off 15 1.4 Pre-Power-Determination Algorithms 16 1.4.1 Overview 16 1.4.2 Performance Measures 17 1.4.3 Equal-Time Algorithms and Analysis 18 1.4.3.1 Schedule length minimization 18 1.4.3.2 Energy consumption minimization 19 1.4.4 Equal-Energy Algorithms and Analysis 19 1.4.4.1 Schedule length minimization 19 1.4.4.2 Energy consumption minimization 21 1.4.5 Equal-Speed Algorithms and Analysis 22 1.4.5.1 Schedule length minimization 22 1.4.5.2 Energy consumption minimization 23 1.4.6 Numerical Data 24 1.4.7 Simulation Results 25 1.5 Post-Power-Determination Algorithms 28 1.5.1 Overview 28 1.5.2 Analysis of List Scheduling Algorithms 29 1.5.2.1 Analysis of algorithm LS 29 1.5.2.2 Analysis of algorithm LRF 30 1.5.3 Application to Schedule Length Minimization 30 1.5.4 Application to Energy Consumption Minimization 31 1.5.5 Numerical Data 32 1.5.6 Simulation Results 32 1.6 Summary and Further Research 33 References 34 2 POWER-AWARE HIGH PERFORMANCE COMPUTING 39 Rong Ge and Kirk W. Cameron 2.1 Introduction 39 2.2 Background 41 2.2.1 Current Hardware Technology and Power Consumption 41 2.2.1.1 Processor power 41 2.2.1.2 Memory subsystem power 42 2.2.2 Performance 43 2.2.3 Energy Efficiency 44 2.3 Related Work 45 2.3.1 Power Profiling 45 2.3.1.1 Simulator-based power estimation 45 2.3.1.2 Direct measurements 46 2.3.1.3 Event-based estimation 46 2.3.2 Performance Scalability on Power-Aware Systems 46 2.3.3 Adaptive Power Allocation for Energy-Efficient Computing 47 2.4 PowerPack: Fine-Grain Energy Profiling of HPC Applications 48 2.4.1 Design and Implementation of PowerPack 48 2.4.1.1 Overview 48 2.4.1.2 Fine-grain systematic power measurement 50 2.4.1.3 Automatic power profiling and code synchronization 51 2.4.2 Power Profiles of HPC Applications and Systems 53 2.4.2.1 Power distribution over components 53 2.4.2.2 Power dynamics of applications 54 2.4.2.3 Power bounds on HPC systems 55 2.4.2.4 Power versus dynamic voltage and frequency scaling 57 2.5 Power-Aware Speedup Model 59 2.5.1 Power-Aware Speedup 59 2.5.1.1 Sequential execution time for a single workload T1(w, f ) 60 2.5.1.2 Sequential execution time for an ON-chip/OFF-chip workload 60 2.5.1.3 Parallel execution time on N processors for an ON-/OFF-chip workload with DOP = i 61 2.5.1.4 Power-aware speedup for DOP and ON-/OFF-chip workloads 62 2.5.2 Model Parametrization and Validation 63 2.5.2.1 Coarse-grain parametrization and validation 64 2.5.2.2 Fine-grain parametrization and validation 66 2.6 Model Usages 69 2.6.1 Identification of Optimal System Configurations 70 2.6.2 PAS-Directed Energy-Driven Runtime Frequency Scaling 71 2.7 Conclusion 73 References 75 3 ENERGY EFFICIENCY IN HPC SYSTEMS 81 Ivan Rodero and Manish Parashar 3.1 Introduction 81 3.2 Background and Related Work 83 3.2.1 CPU Power Management 83 3.2.1.1 OS-level CPU power management 83 3.2.1.2 Workload-level CPU power management 84 3.2.1.3 Cluster-level CPU power management 84 3.2.2 Component-Based Power Management 85 3.2.2.1 Memory subsystem 85 3.2.2.2 Storage subsystem 86 3.2.3 Thermal-Conscious Power Management 87 3.2.4 Power Management in Virtualized Datacenters 87 3.3 Proactive, Component-Based Power Management 88 3.3.1 Job Allocation Policies 88 3.3.2 Workload Profiling 90 3.4 Quantifying Energy Saving Possibilities 91 3.4.1 Methodology 92 3.4.2 Component-Level Power Requirements 92 3.4.3 Energy Savings 94 3.5 Evaluation of the Proposed Strategies 95 3.5.1 Methodology 96 3.5.2 Workloads 96 3.5.3 Metrics 97 3.6 Results 97 3.7 Concluding Remarks 102 3.8 Summary 103 References 104 4 A STOCHASTIC FRAMEWORK FOR HIERARCHICAL SYSTEM-LEVEL POWER MANAGEMENT 109 Peng Rong and Massoud Pedram 4.1 Introduction 109 4.2 Related Work 111 4.3 A Hierarchical DPM Architecture 113 4.4 Modeling 114 4.4.1 Model of the Application Pool 114 4.4.2 Model of the Service Flow Control 118 4.4.3 Model of the Simulated Service Provider 119 4.4.4 Modeling Dependencies between SPs 120 4.5 Policy Optimization 122 4.5.1 Mathematical Formulation 122 4.5.2 Optimal Time-Out Policy for Local Power Manager 123 4.6 Experimental Results 125 4.7 Conclusion 130 References 130 5 ENERGY-EFFICIENT RESERVATION INFRASTRUCTURE FOR GRIDS, CLOUDS, AND NETWORKS 133 Anne-Ce´ cile Orgerie and Laurent Lefe` vre 5.1 Introduction 133 5.2 Related Works 134 5.2.1 Server and Data Center Power Management 135 5.2.2 Node Optimizations 135 5.2.3 Virtualization to Improve Energy Efficiency 136 5.2.4 Energy Awareness in Wired Networking Equipment 136 5.2.5 Synthesis 137 5.3 ERIDIS: Energy-Efficient Reservation Infrastructure for Large-Scale Distributed Systems 138 5.3.1 ERIDIS Architecture 138 5.3.2 Management of the Resource Reservations 141 5.3.3 Resource Management and On/Off Algorithms 145 5.3.4 Energy-Consumption Estimates 146 5.3.5 Prediction Algorithms 146 5.4 EARI: Energy-Aware Reservation Infrastructure for Data Centers and Grids 147 5.4.1 EARI’s Architecture 147 5.4.2 Validation of EARI on Experimental Grid Traces 147 5.5 GOC: Green Open Cloud 149 5.5.1 GOC’s Resource Manager Architecture 150 5.5.2 Validation of the GOC Framework 152 5.6 HERMES: High Level Energy-Aware Model for Bandwidth Reservation in End-To-End Networks 152 5.6.1 HERMES’ Architecture 154 5.6.2 The Reservation Process of HERMES 155 5.6.3 Discussion 157 5.7 Summary 158 References 158 6 ENERGY-EFFICIENT JOB PLACEMENT ON CLUSTERS, GRIDS, AND CLOUDS 163 Damien Borgetto, Henri Casanova, Georges Da Costa, and Jean-Marc Pierson 6.1 Problem and Motivation 163 6.1.1 Context 163 6.1.2 Chapter Roadmap 164 6.2 Energy-Aware Infrastructures 164 6.2.1 Buildings 165 6.2.2 Context-Aware Buildings 165 6.2.3 Cooling 166 6.3 Current Resource Management Practices 167 6.3.1 Widely Used Resource Management Systems 167 6.3.2 Job Requirement Description 169 6.4 Scientific and Technical Challenges 170 6.4.1 Theoretical Difficulties 170 6.4.2 Technical Difficulties 170 6.4.3 Controlling and Tuning Jobs 171 6.5 Energy-Aware Job Placement Algorithms 172 6.5.1 State of the Art 172 6.5.2 Detailing One Approach 174 6.6 Discussion 180 6.6.1 Open Issues and Opportunities 180 6.6.2 Obstacles for Adoption in Production 182 6.7 Conclusion 183 References 184 7 COMPARISON AND ANALYSIS OF GREEDY ENERGY-EFFICIENT SCHEDULING ALGORITHMS FOR COMPUTATIONAL GRIDS 189 Peder Lindberg, James Leingang, Daniel Lysaker, Kashif Bilal, Samee Ullah Khan, Pascal Bouvry, Nasir Ghani, Nasro Min-Allah, and Juan Li 7.1 Introduction 189 7.2 Problem Formulation 191 7.2.1 The System Model 191 7.2.1.1 PEs 191 7.2.1.2 DVS 191 7.2.1.3 Tasks 192 7.2.1.4 Preliminaries 192 7.2.2 Formulating the Energy-Makespan Minimization Problem 192 7.3 Proposed Algorithms 193 7.3.1 Greedy Heuristics 194 7.3.1.1 Greedy heuristic scheduling algorithm 196 7.3.1.2 Greedy-min 197 7.3.1.3 Greedy-deadline 198 7.3.1.4 Greedy-max 198 7.3.1.5 MaxMin 199 7.3.1.6 ObFun 199 7.3.1.7 MinMin StdDev 202 7.3.1.8 MinMax StdDev 202 7.4 Simulations, Results, and Discussion 203 7.4.1 Workload 203 7.4.2 Comparative Results 204 7.4.2.1 Small-size problems 204 7.4.2.2 Large-size problems 206 7.5 Related Works 211 7.6 Conclusion 211 References 212 8 TOWARD ENERGY-AWARE SCHEDULING USING MACHINE LEARNING 215 Josep LL. Berral, In˜ igo Goiri, Ramon Nou, Ferran Julia` , Josep O. Fito´ , Jordi Guitart, Ricard Gavalda´ , and Jordi Torres 8.1 Introduction 215 8.1.1 Energetic Impact of the Cloud 216 8.1.2 An Intelligent Way to Manage Data Centers 216 8.1.3 Current Autonomic Computing Techniques 217 8.1.4 Power-Aware Autonomic Computing 217 8.1.5 State of the Art and Case Study 218 8.2 Intelligent Self-Management 218 8.2.1 Classical AI Approaches 219 8.2.1.1 Heuristic algorithms 219 8.2.1.2 AI planning 219 8.2.1.3 Semantic techniques 219 8.2.1.4 Expert systems and genetic algorithms 220 8.2.2 Machine Learning Approaches 220 8.2.2.1 Instance-based learning 221 8.2.2.2 Reinforcement learning 222 8.2.2.3 Feature and example selection 225 8.3 Introducing Power-Aware Approaches 225 8.3.1 Use of Virtualization 226 8.3.2 Turning On and Off Machines 228 8.3.3 Dynamic Voltage and Frequency Scaling 229 8.3.4 Hybrid Nodes and Data Centers 230 8.4 Experiences of Applying ML on Power-Aware Self-Management 230 8.4.1 Case Study Approach 231 8.4.2 Scheduling and Power Trade-Off 231 8.4.3 Experimenting with Power-Aware Techniques 233 8.4.4 Applying Machine Learning 236 8.4.5 Conclusions from the Experiments 238 8.5 Conclusions on Intelligent Power-Aware Self-Management 238 References 240 9 ENERGY EFFICIENCY METRICS FOR DATA CENTERS 245 Javid Taheri and Albert Y. Zomaya 9.1 Introduction 245 9.1.1 Background 245 9.1.2 Data Center Energy Use 246 9.1.3 Data Center Characteristics 246 9.1.3.1 Electric power 247 9.1.3.2 Heat removal 249 9.1.4 Energy Efficiency 250 9.2 Fundamentals of Metrics 250 9.2.1 Demand and Constraints on Data Center Operators 250 9.2.2 Metrics 251 9.2.2.1 Criteria for good metrics 251 9.2.2.2 Methodology 252 9.2.2.3 Stability of metrics 252 9.3 Data Center Energy Efficiency 252 9.3.1 Holistic IT Efficiency Metrics 252 9.3.1.1 Fixed versus proportional overheads 254 9.3.1.2 Power versus energy 254 9.3.1.3 Performance versus productivity 255 9.3.2 Code of Conduct 256 9.3.2.1 Environmental statement 256 9.3.2.2 Problem statement 256 9.3.2.3 Scope of the CoC 257 9.3.2.4 Aims and objectives of CoC 258 9.3.3 Power Use in Data Centers 259 9.3.3.1 Data center IT power to utility power relationship 259 9.3.3.2 Chiller efficiency and external temperature 260 9.4 Available Metrics 260 9.4.1 The Green Grid 261 9.4.1.1 Power usage effectiveness (PUE) 261 9.4.1.2 Data center efficiency (DCE) 262 9.4.1.3 Data center infrastructure efficiency (DCiE) 262 9.4.1.4 Data center productivity (DCP) 263 9.4.2 McKinsey 263 9.4.3 Uptime Institute 264 9.4.3.1 Site infrastructure power overhead multiplier (SI-POM) 265 9.4.3.2 IT hardware power overhead multiplier (H-POM) 266 9.4.3.3 DC hardware compute load per unit of computing work done 266 9.4.3.4 Deployed hardware utilization ratio (DH-UR) 266 9.4.3.5 Deployed hardware utilization efficiency (DH-UE) 267 9.5 Harmonizing Global Metrics for Data Center Energy Efficiency 267 References 268 10 AUTONOMIC GREEN COMPUTING IN LARGE-SCALE DATA CENTERS 271 Haoting Luo, Bithika Khargharia, Salim Hariri, and Youssif Al-Nashif 10.1 Introduction 271 10.2 Related Technologies and Techniques 272 10.2.1 Power Optimization Techniques in Data Centers 272 10.2.2 Design Model 273 10.2.3 Networks 274 10.2.4 Data Center Power Distribution 275 10.2.5 Data Center Power-Efficient Metrics 276 10.2.6 Modeling Prototype and Testbed 277 10.2.7 Green Computing 278 10.2.8 Energy Proportional Computing 280 10.2.9 Hardware Virtualization Technology 281 10.2.10 Autonomic Computing 282 10.3 Autonomic Green Computing: A Case Study 283 10.3.1 Autonomic Management Platform 285 10.3.1.1 Platform architecture 285 10.3.1.2 DEVS-based modeling and simulation platform 285 10.3.1.3 Workload generator 287 10.3.2 Model Parameter Evaluation 288 10.3.2.1 State transitioning overhead 288 10.3.2.2 VM template evaluation 289 10.3.2.3 Scalability analysis 291 10.3.3 Autonomic Power Efficiency Management Algorithm (Performance Per Watt) 291 10.3.4 Simulation Results and Evaluation 293 10.3.4.1 Analysis of energy and performance trade-offs 296 10.4 Conclusion and Future Directions 297 References 298 11 ENERGY AND THERMAL AWARE SCHEDULING IN DATA CENTERS 301 Gaurav Dhiman, Raid Ayoub, and Tajana S. Rosing 11.1 Introduction 301 11.2 Related Work 302 11.3 Intermachine Scheduling 305 11.3.1 Performance and Power Profile of VMs 305 11.3.2 Architecture 309 11.3.2.1 vgnode 309 11.3.2.2 vgxen 310 11.3.2.3 vgdom 312 11.3.2.4 vgserv 312 11.4 Intramachine Scheduling 315 11.4.1 Air-Forced Thermal Modeling and Cost 316 11.4.2 Cooling Aware Dynamic Workload Scheduling 317 11.4.3 Scheduling Mechanism 318 11.4.4 Cooling Costs Predictor 319 11.5 Evaluation 321 11.5.1 Intermachine Scheduler (vGreen) 321 11.5.2 Heterogeneous Workloads 323 11.5.2.1 Comparison with DVFS policies 325 11.5.2.2 Homogeneous workloads 328 11.5.3 Intramachine Scheduler (Cool and Save) 328 11.5.3.1 Results 331 11.5.3.2 Overhead of CAS 333 11.6 Conclusion 333 References 334 12 QOS-AWARE POWER MANAGEMENT IN DATA CENTERS 339 Jiayu Gong and Cheng-Zhong Xu 12.1 Introduction 339 12.2 Problem Classification 340 12.2.1 Objective and Constraint 340 12.2.2 Scope and Time Granularities 340 12.2.3 Methodology 341 12.2.4 Power Management Mechanism 342 12.3 Energy Efficiency 344 12.3.1 Energy-Efficiency Metrics 344 12.3.2 Improving Energy Efficiency 346 12.3.2.1 Energy minimization with performance guarantee 346 12.3.2.2 Performance maximization under power budget 348 12.3.2.3 Trade-off between power and performance 348 12.3.3 Energy-Proportional Computing 350 12.4 Power Capping 351 12.5 Conclusion 353 References 356 13 ENERGY-EFFICIENT STORAGE SYSTEMS FOR DATA CENTERS 361 Sudhanva Gurumurthi and Anand Sivasubramaniam 13.1 Introduction 361 13.2 Disk Drive Operation and Disk Power 362 13.2.1 An Overview of Disk Drives 362 13.2.2 Sources of Disk Power Consumption 363 13.2.3 Disk Activity and Power Consumption 365 13.3 Disk and Storage Power Reduction Techniques 366 13.3.1 Exploiting the STANDBY State 368 13.3.2 Reducing Seek Activity 369 13.3.3 Achieving Energy Proportionality 369 13.3.3.1 Hardware approaches 369 13.3.3.2 Software approaches 370 13.4 Using Nonvolatile Memory and Solid-State Disks 371 13.5 Conclusions 372 References 373 14 AUTONOMIC ENERGY/PERFORMANCE OPTIMIZATIONS FOR MEMORY IN SERVERS 377 Bithika Khargharia and Mazin Yousif 14.1 Introduction 378 14.2 Classifications of Dynamic Power Management Techniques 380 14.2.1 Heuristic and Predictive Techniques 380 14.2.2 QoS and Energy Trade-Offs 381 14.3 Applications of Dynamic Power Management (DPM) 382 14.3.1 Power Management of System Components in Isolation 382 14.3.2 Joint Power Management of System Components 383 14.3.3 Holistic System-Level Power Management 383 14.4 Autonomic Power and Performance Optimization of Memory Subsystems in Server Platforms 384 14.4.1 Adaptive Memory Interleaving Technique for Power and Performance Management 384 14.4.1.1 Formulating the optimization problem 386 14.4.1.2 Memory appflow 389 14.4.2 Industry Techniques 389 14.4.2.1 Enhancements in memory hardware design 390 14.4.2.2 Adding more operating states 390 14.4.2.3 Faster transition to and from low power states 390 14.4.2.4 Memory consolidation 390 14.5 Conclusion 391 References 391 15 ROD: A PRACTICAL APPROACH TO IMPROVING RELIABILITY OF ENERGY-EFFICIENT PARALLEL DISK SYSTEMS 395 Shu Yin, Xiaojun Ruan, Adam Manzanares, and Xiao Qin 15.1 Introduction 395 15.2 Modeling Reliability of Energy-Efficient Parallel Disks 396 15.2.1 The MINT Model 396 15.2.1.1 Disk utilization 398 15.2.1.2 Temperature 398 15.2.1.3 Power-state transition frequency 399 15.2.1.4 Single disk reliability model 399 15.2.2 MAID, Massive Arrays of Idle Disks 400 15.3 Improving Reliability of MAID via Disk Swapping 401 15.3.1 Improving Reliability of Cache Disks in MAID 401 15.3.2 Swapping Disks Multiple Times 404 15.4 Experimental Results and Evaluation 405 15.4.1 Experimental Setup 405 15.4.2 Disk Utilization 406 15.4.3 The Single Disk Swapping Strategy 406 15.4.4 The Multiple Disk Swapping Strategy 409 15.5 Related Work 411 15.6 Conclusions 412 References 413 16 EMBRACING THE MEMORY AND I/O WALLS FOR ENERGY-EFFICIENT SCIENTIFIC COMPUTING 417 Chung-Hsing Hsu and Wu-Chun Feng 16.1 Introduction 417 16.2 Background and Related Work 420 16.2.1 DVFS-Enabled Processors 420 16.2.2 DVFS Scheduling Algorithms 421 16.2.3 Memory-Aware, Interval-Based Algorithms 422 16.3 β-Adaptation: A New DVFS Algorithm 423 16.3.1 The Compute-Boundedness Metric, β 423 16.3.2 The Frequency Calculating Formula, f ∗ 424 16.3.3 The Online β Estimation 425 16.3.4 Putting It All Together 427 16.4 Algorithm Effectiveness 429 16.4.1 A Comparison to Other DVFS Algorithms 429 16.4.2 Frequency Emulation 432 16.4.3 The Minimum Dependence to the PMU 436 16.5 Conclusions and Future Work 438 References 439 17 MULTIPLE FREQUENCY SELECTION IN DVFS-ENABLED PROCESSORS TO MINIMIZE ENERGY CONSUMPTION 443 Nikzad Babaii Rizvandi, Albert Y. Zomaya, Young Choon Lee, Ali Javadzadeh Boloori, and Javid Taheri 17.1 Introduction 443 17.2 Energy Efficiency in HPC Systems 444 17.3 Exploitation of Dynamic Voltage–Frequency Scaling 446 17.3.1 Independent Slack Reclamation 446 17.3.2 Integrated Schedule Generation 447 17.4 Preliminaries 448 17.4.1 System and Application Models 448 17.4.2 Energy Model 448 17.5 Energy-Aware Scheduling via DVFS 450 17.5.1 Optimum Continuous Frequency 450 17.5.2 Reference Dynamic Voltage–Frequency Scaling (RDVFS) 451 17.5.3 Maximum-Minimum-Frequency for Dynamic Voltage–Frequency Scaling (MMF-DVFS) 452 17.5.4 Multiple Frequency Selection for Dynamic Voltage–Frequency Scaling (MFS-DVFS) 453 17.5.4.1 Task eligibility 454 17.6 Experimental Results 456 17.6.1 Simulation Settings 456 17.6.2 Results 458 17.7 Conclusion 461 References 461 18 THE PARAMOUNTCY OF RECONFIGURABLE COMPUTING 465 Reiner Hartenstein 18.1 Introduction 465 18.2 Why Computers are Important 466 18.2.1 Computing for a Sustainable Environment 470 18.3 Performance Progress Stalled 472 18.3.1 Unaffordable Energy Consumption of Computing 473 18.3.2 Crashing into the Programming Wall 475 18.4 The Tail is Wagging the Dog (Accelerators) 488 18.4.1 Hardwired Accelerators 489 18.4.2 Programmable Accelerators 490 18.5 Reconfigurable Computing 494 18.5.1 Speedup Factors by FPGAs 498 18.5.2 The Reconfigurable Computing Paradox 501 18.5.3 Saving Energy by Reconfigurable Computing 505 18.5.3.1 Traditional green computing 506 18.5.3.2 The role of graphics processors 507 18.5.3.3 Wintel versus ARM 508 18.5.4 Reconfigurable Computing is the Silver Bullet 511 18.5.4.1 A new world model of computing 511 18.5.5 The Twin-Paradigm Approach to Tear Down the Wall 514 18.5.6 A Mass Movement Needed as Soon as Possible 517 18.5.6.1 Legacy software from the mainframe age 518 18.5.7 How to Reinvent Computing 519 18.6 Conclusions 526 References 529 19 WORKLOAD CLUSTERING FOR INCREASING ENERGY SAVINGS ON EMBEDDED MPSOCS 549 Ozcan Ozturk, Mahmut Kandemir, and Sri Hari Krishna Narayanan 19.1 Introduction 549 19.2 Embedded MPSoC Architecture, Execution Model, and Related Work 550 19.3 Our Approach 551 19.3.1 Overview 551 19.3.2 Technical Details and Problem Formulation 553 19.3.2.1 System and job model 553 19.3.2.2 Mathematical programing model 554 19.3.2.3 Example 557 19.4 Experimental Evaluation 560 19.5 Conclusions 564 References 565 20 ENERGY-EFFICIENT INTERNET INFRASTRUCTURE 567 Weirong Jiang and Viktor K. Prasanna 20.1 Introduction 567 20.1.1 Performance Challenges 568 20.1.2 Existing Packet Forwarding Approaches 570 20.1.2.1 Software approaches 570 20.1.2.2 Hardware approaches 571 20.2 SRAM-Based Pipelined IP Lookup Architectures: Alternative to TCAMs 571 20.3 Data Structure Optimization for Power Efficiency 573 20.3.1 Problem Formulation 574 20.3.1.1 Non-pipelined and pipelined engines 574 20.3.1.2 Power function of SRAM 575 20.3.2 Special Case: Uniform Stride 576 20.3.3 Dynamic Programming 576 20.3.4 Performance Evaluation 577 20.3.4.1 Results for non-pipelined architecture 578 20.3.4.2 Results for pipelined architecture 578 20.4 Architectural Optimization to Reduce Dynamic Power Dissipation 580 20.4.1 Analysis and Motivation 581 20.4.1.1 Traffic locality 582 20.4.1.2 Traffic rate variation 582 20.4.1.3 Access frequency on different stages 583 20.4.2 Architecture-Specific Techniques 583 20.4.2.1 Inherent caching 584 20.4.2.2 Local clocking 584 20.4.2.3 Fine-grained memory enabling 585 20.4.3 Performance Evaluation 585 20.5 Related Work 588 20.6 Summary 589 References 589 21 DEMAND RESPONSE IN THE SMART GRID: A DISTRIBUTED COMPUTING PERSPECTIVE 593 Chen Wang and Martin De Groot 21.1 Introduction 593 21.2 Demand Response 595 21.2.1 Existing Demand Response Programs 595 21.2.2 Demand Response Supported by the Smart Grid 597 21.3 Demand Response as a Distributed System 600 21.3.1 An Overlay Network for Demand Response 600 21.3.2 Event Driven Demand Response 602 21.3.3 Cost Driven Demand Response 604 21.3.4 A Decentralized Demand Response Framework 609 21.3.5 Accountability of Coordination Decision Making 610 21.4 Summary 611 References 611 22 RESOURCE MANAGEMENT FOR DISTRIBUTED MOBILE COMPUTING 615 Jong-Kook Kim 22.1 Introduction 615 22.2 Single-Hop Energy-Constrained Environment 617 22.2.1 System Model 617 22.2.2 Related Work 620 22.2.3 Heuristic Descriptions 621 22.2.3.1 Mapping event 621 22.2.3.2 Scheduling communications 621 22.2.3.3 Opportunistic load balancing and minimum energy greedy heuristics 622 22.2.3.4 ME-MC heuristic 622 22.2.3.5 ME-ME heuristic 624 22.2.3.6 CRME heuristic 625 22.2.3.7 Originator and random 626 22.2.3.8 Upper bound 626 22.2.4 Simulation Model 628 22.2.5 Results 630 22.2.6 Summary 634 22.3 Multihop Distributed Mobile Computing Environment 635 22.3.1 The Multihop System Model 635 22.3.2 Energy-Aware Routing Protocol 636 22.3.2.1 Overview 636 22.3.2.2 DSDV 637 22.3.2.3 DSDV remaining energy 637 22.3.2.4 DSDV-energy consumption per remaining energy 637 22.3.3 Heuristic Description 638 22.3.3.1 Random 638 22.3.3.2 Estimated minimum total energy (EMTE) 638 22.3.3.3 K-percent-speed (KPS) and K-percent-energy (KPE) 639 22.3.3.4 Energy ratio and distance (ERD) 639 22.3.3.5 ETC and distance (ETCD) 640 22.3.3.6 Minimum execution time (MET) 640 22.3.3.7 Minimum completion time (MCT) and minimum completion time with DVS (MCT-DVS) 640 22.3.3.8 Switching algorithm (SA) 640 22.3.4 Simulation Model 641 22.3.5 Results 643 22.3.5.1 Distributed resource management 643 22.3.5.2 Energy-aware protocol 644 22.3.6 Summary 644 22.4 Future Work 647 References 647 23 AN ENERGY-AWARE FRAMEWORK FOR MOBILE DATA MINING 653 Carmela Comito, Domenico Talia, and Paolo Trunfio 23.1 Introduction 653 23.2 System Architecture 654 23.3 Mobile Device Components 657 23.4 Energy Model 659 23.5 Clustering Scheme 664 23.5.1 Clustering the M2M Architecture 666 23.6 Conclusion 670 References 670 24 ENERGY AWARENESS AND EFFICIENCY IN WIRELESS SENSOR NETWORKS: FROM PHYSICAL DEVICES TO THE COMMUNICATION LINK 673 Fla´ via C. Delicato and Paulo F. Pires 24.1 Introduction 673 24.2 WSN and Power Dissipation Models 676 24.2.1 Network and Node Architecture 676 24.2.2 Sources of Power Dissipation in WSNs 679 24.3 Strategies for Energy Optimization 683 24.3.1 Intranode Level 684 24.3.1.1 Duty cycling 685 24.3.1.2 Adaptive sensing 691 24.3.1.3 Dynamic voltage scale (DVS) 693 24.3.1.4 OS task scheduling 694 24.3.2 Internode Level 695 24.3.2.1 Transmission power control 695 24.3.2.2 Dynamic modulation scaling 696 24.3.2.3 Link layer optimizations 698 24.4 Final Remarks 701 References 702 25 NETWORK-WIDE STRATEGIES FOR ENERGY EFFICIENCY IN WIRELESS SENSOR NETWORKS 709 Fla´ via C. Delicato and Paulo F. Pires 25.1 Introduction 709 25.2 Data Link Layer 711 25.2.1 Topology Control Protocols 712 25.2.2 Energy-Efficient MAC Protocols 714 25.2.2.1 Scheduled MAC protocols in WSNs 716 25.2.2.2 Contention-based MAC protocols 717 25.3 Network Layer 719 25.3.1 Flat and Hierarchical Protocols 722 25.4 Transport Layer 725 25.5 Application Layer 729 25.5.1 Task Scheduling 729 25.5.2 Data Aggregation and Data Fusion in WSNs 733 25.5.2.1 Approaches of data fusion for energy efficiency 735 25.5.2.2 Data aggregation strategies 736 25.6 Final Remarks 740 References 741 26 ENERGY MANAGEMENT IN HETEROGENEOUS WIRELESS HEALTH CARE NETWORKS 751 Nima Nikzad, Priti Aghera, Piero Zappi, and Tajana S. Rosing 26.1 Introduction 751 26.2 System Model 753 26.2.1 Health Monitoring Task Model 753 26.3 Collaborative Distributed Environmental Sensing 755 26.3.1 Node Neighborhood and Localization Rate 757 26.3.2 Energy Ratio and Sensing Rate 758 26.3.3 Duty Cycling and Prediction 759 26.4 Task Assignment in a Body Area Network 760 26.4.1 Optimal Task Assignment 760 26.4.2 Dynamic Task Assignment 762 26.4.2.1 DynAGreen algorithm 763 26.4.2.2 DynAGreenLife algorithm 768 26.5 Results 771 26.5.1 Collaborative Sensing 771 26.5.1.1 Results 772 26.5.2 Dynamic Task Assignment 776 26.5.2.1 Performance in static conditions 777 26.5.2.2 Dynamic adaptability 780 26.6 Conclusion 784 References 785 INDEX 787

    2 in stock

    £112.46

  • Computer Forensics JumpStart

    John Wiley & Sons Inc Computer Forensics JumpStart

    Book SynopsisEssential reading for launching a career in computer forensics Internet crime is on the rise, catapulting the need for computer forensics specialists. This new edition presents you with a completely updated overview of the basic skills that are required as a computer forensics professional. The author team of technology security veterans introduces the latest software and tools that exist and they review the available certifications in this growing segment of IT that can help take your career to a new level. A variety of real-world practices take you behind the scenes to look at the root causes of security attacks and provides you with a unique perspective as you launch a career in this fast-growing field. Explores the profession of computer forensics, which is more in demand than ever due to the rise of Internet crime Details the ways to conduct a computer forensics investigation Highlights tips and techniques for finding hidden data, capturinTable of ContentsIntroduction. Chapter 1 The Need for Computer Forensics. Chapter 2 Preparation—What to Do Before You Start. Chapter 3 Computer Evidence. Chapter 4 Common Tasks. Chapter 5 Capturing the Data Image. Chapter 6 Extracting Information from Data. Chapter 7 Passwords and Encryption. Chapter 8 Common Forensic Tools. Chapter 9 Pulling It All Together. Chapter 10 How to Testify in Court. Appendix A Answers to Review Questions. Appendix B Forensic Resources. Appendix C Forensic Certifications and More. Appendix D Forensic Tools 289 Glossary. Index.

    £19.54

  • Cooperative Communications

    John Wiley & Sons Inc Cooperative Communications

    1 in stock

    Book SynopsisFacilitating Cooperation for Wireless Systems Cooperative Communications: Hardware, Channel & PHY focuses on issues pertaining to the PHY layer of wireless communication networks, offering a rigorous taxonomy of this dispersed field, along with a range of application scenarios for cooperative and distributed schemes, demonstrating how these techniques can be employed. The authors discuss hardware, complexity and power consumption issues, which are vital for understanding what can be realized at the PHY layer, showing how wireless channel models differ from more traditional models, and highlighting the reliance of PHY algorithm performance on the underlying channel models. Numerous transparent and regenerative relaying protocols are described in detail for a variety of transparent and regenerative cooperative schemes. Key Features: Introduces background, concepts, applications, milestones and thorough taxonomy ITable of ContentsPreface. Abbreviations. Functions. Symbols. 1 Introduction. 1.1 Book Structure. 1.2 Quick Introduction. 1.3 Application Scenarios. 1.4 Pros and Cons of Cooperation. 1.5 Cooperative Performance Bounds. 1.6 Definitions and Terminology. 1.7 Background and Milestones. 1.8 Concluding Remarks. 2 Wireless Relay Channel. 2.1 Introductory Note. 2.2 General Characteristics and Trends. 2.3 Regenerative Relaying Channel. 2.4 Transparent Relaying Channel. 2.5 Distributed MIMO Channel. 2.6 Concluding Remarks. 3 Transparent Relaying Techniques. 3.1 Introductory Note. 3.2 Transparent Relaying Protocols. 3.3 Transparent Space–Time Processing. 3.4 Distributed System Optimization. 3.5 Concluding Remarks. 4 Regenerative Relaying Techniques. 4.1 Introductory Note. 4.2 Regenerative Relay Protocols. 4.3 Distributed Space–Time Coding. 4.4 Distributed Network Coding. 4.5 Concluding Remarks. 5 Hardware Issues. 5.1 Introductory Note. 5.2 Analog Hardware Transceivers. 5.3 Digital Hardware Transceivers. 5.4 Architectural Comparisons. 5.5 Complexity of 3G UMTS Voice/HSDPA Relay. 5.6 Complexity of LTE/WiMAX Relay. 5.7 Hardware Demonstrators. 5.8 Concluding Remarks. 6 Conclusions and Outlook. 6.1 Contributions. 6.2 Real-World Impairments. 6.3 Open Research Problems. 6.4 Business Challenges. References. Index.

    1 in stock

    £88.16

  • Broadband Packet Switching Technologies

    John Wiley & Sons Inc Broadband Packet Switching Technologies

    Book SynopsisThe effective design of high-speed, reliable switching systems is essential for moving the huge volumes of traffic and multimedia over modern communications networks. This book explains all the main packet-switching architectures, including all theoretical and practical topics relevant to the design and management of high-speed networks. Delivering the most systematic coverage available of the subject, the authors interweave fundamental concepts with real-world applications and include engineering case studies from wireless and fiber-optic communications. Market: Hardware and Software Engineers in the telecommunication industry, System Engineers, and Technicians.Trade Review"...addresses the basics, theory, architectures, and technologies for implementing ATM switches and IP routers." (SciTech Book News, Vol. 26, No. 2, June 2002) "...a remarkable overview of switching architectures and techniques in different technological environments..." (IEEE Communications Magazine, September 2002)Table of ContentsPreface. Introduction. Basics of Packet Switching. Input-Buffered Switches. Shared-Memory Switches. Banyan-Based Switches. Knockout-Based Switches. The Abacus Switch. Crosspoint-Buffered Switches. The Tandem-Crosspoint Switch. Clos-Network Switches. Optical Packet Switches. Wireless ATM Switches. IP Route Lookups. Appendix: SONET and ATM Protocols. Index.

    £131.35

  • Understanding Telecommunications and Lightwave

    John Wiley & Sons Inc Understanding Telecommunications and Lightwave

    Book SynopsisThe up-to-date edition of the bestselling guide to the basics of telecommunications and digital technology Understanding Telecommunications and Lightwave Systems presents a nontechnical treatment of how voice, video, and multimedia can simultaneously travel over today''s evolving telecommunications systems. This updated Third Edition provides a comprehensive overview of the telecommunications field as well as a detailed introduction to the latest lightwave technology. The author''s examination of recent techniques and developing technologies in telecommunications includes: Third-generation cell phones with microbrowser capabilities Changes in the global PCS network Optical switching and transmission parameters Lightwave systems and Dense Wavelength Division Multiplexing A new chapter (Chapter 17: The Internet) that examines this multimedia structure and the network economy it has created Satellite communTrade Review"...provides a non-technical overview of contemporary telecommunications systems." (SciTech Book News, Vol. 26, No. 2, June 2002)Table of ContentsIntroduction 1 1 The Evolution of Telecommunications 3 The Telegraph 3 The Telephone 3 Wireless Communications 4 AT&T Monopoly 4 Trans-Canada System 4 Semiconductors 5 Digital Communications 5 Satellite Communications 6 Fiber Optics 6 AT&T Break-Up 6 Telecommunications Act of 1996 8 The Meltdown 10 Conclusion 10 2 Analog Transmission 12 Conclusion 15 Review Questions for Chapter 2 15 3 Digital Transmission 17 Conclusion 19 Review Questions for Chapter 3 20 4 Basic Multiplexing Techniques 21 Brief History 21 FDM 21 TDM 22 Pulse-Code Modulation 22 Conclusion 27 Review Questions for Chapter 4 27 5 Switching Hierarchy 28 Brief History '. 28 Divestiture 30 Conclusion 32 Review Questions for Chapter 5 32 6 North American Digital Hierarchies 34 Conclusion 37 Review Questions for Chapter 6 37 7 Transmission 38 Transmission Level 39 Via Net Loss (VNL) 40 All-Digital Network 40 Echo Suppressors and Echo Cancellers 43 Split Echo Suppressor 44 Full Echo Suppressor 45 Digital Echo Canceller 45 Conclusion 46 Review Questions for Chapter 7 47 8 The Local Subscriber Loop 48 Brief History 48 The Local Loop 48 Digital Subscriber Carrier Systems 50 Asymmetric Digital Subscriber Lines 52 Conclusion 54 Review Questions for Chapter 8 55 9 Microwave Radio 56 Brief History 56 Digital Radio 56 Design Considerations 58 SONET Radio 60 Conclusion 61 Review Questions for Chapter 9 61 10 Satellite Communications 63 Brief History 63 Geostationary (GEO) Satellites 65 Parking Slots 66 Transponders 67 The Footprint 68 Time Delay 68 Global Positioning System 70 MEO and LEO Satellites 71 Direct-to-Home Satellite System 75 Satellite Operators 75 Conclusion 76 Review Questions for Chapter 10 76 11 Switching Systems 78 The Strowger Switch 78 Panel Switching Syste 79 Crossbar Switch 79 The First Electronic Switch 80 The Digital Switch 81 The Optical Switch 84 Optical Switches with Electrical Cores 85 All-Optical Switches 85 Conclusion 90 Review Questions for Chapter 11 90 12 Private Branch Exchange 92 Brief History 92 Analog PBX 92 Digital PBX 93 Conclusion 95 Review Questions for Chapter 12 96 13 Traffic Considerations 97 Brief History 97 CCS 97 Grade of Service 98 Internet Congestion 99 Conclusion 101 Review Questions for Chapter 13 101 14 Video Transmission 102 Brief History 102 Video Compression 102 Switched Data Services 103 Video Codecs 103 Videophone 104 Multimedia 105 Conclusion 107 Review Questions for Chapter 14 108 15 Wireless 109 Brief History 109 Cellular Telephone Service 109 The Mobile Unit 111 Personal Communications Services (PCS) 113 The Standards 114 The Future 115 Conclusion 117 Review Questions for Chapter 15 119 16 The Computer 120 Brief History 120 Digital Computers 120 Microprocessors 123 Hard Drive 123 End of an Era 125 Internet Appliances 125 The Evolution of the Silicon Chip 127 Bluetooth 127 Conclusion 128 Review Questions for Chapter 16 130 17 The Internet 131 Brief History 131 Internet Access 132 Asymmetric Digital Subscriber Line 133 Very High Speed Digital Subscriber Line 134 Integrated Services Digital Network 134 Cable Modems 136 Satellite 137 Local Multipoint Distribution System 138 Circuit Switched vs. Packet Switched 139 Internet Telephony 142 Conclusion 143 Review Questions for Chapter 17 144 18 Lightwave Systems 145 Brief History 145 New Transcontinental Carriers 149 Lightwave Undersea Systems 150 Evolution of Lightwave Systems 150 Optical Fiber Cable 154 Optical Fiber Transmission Parameters 157 Fiber Connectors 163 Optical Emitters 165 Optical Detectors 167 Tunable Lasers 168 All-Optical Networks 169 Dense Wavelength-Division Multiplexing 169 Optical Amplifiers 171 Optical Cross-Connects 173 System Design Considerations 175 Synchronous Optical Network 178 Asynchronous Transfer Mode 186 SONET Ring Networks 190 System Availability 192 Cable Placement Choices 193 Cable Placement Techniques 195 Placement of Underground Cable 196 Placement of Aerial Cable 197 Placement of Direct Buried Cable 199 Field Splicing 203 Mechanical Splicing 205 Field Testing Using an Optical Time Domain Reflectometer 205 Fiber-to-the-Home 209 Video-on-Demand (VOD) 209 Fiber-to-the-Curb 210 Local Area Network 213 Ethernet 214 IBM Token Ring 215 LAN Topology 216 Wireless LANs 218 Fiber Optic LANs 218 Conclusion 224 Review Questions for Chapter 18 225 Telecommunications Glossary 228 Bibliography 250 Index 251 Answers to Review Questions 259 About the Author 269

    £71.06

© 2026 Book Curl

    • American Express
    • Apple Pay
    • Diners Club
    • Discover
    • Google Pay
    • Maestro
    • Mastercard
    • PayPal
    • Shop Pay
    • Union Pay
    • Visa

    Login

    Forgot your password?

    Don't have an account yet?
    Create account