Computer networking and communications Books

Book SynopsisThis book focuses heavily on the principles, analysis and applications of code-division multiple-access (CDMA) techniques in optical communication systems and networks. In this book, the authors intimately discuss modern optical networks and their applications in current and emerging communication technologies, evaluating the quality, speed and number of supported services. In particular, principles and fundamentals of optical CDMA techniques from beginner to advanced levels are heavily covered. Furthermore, the authors concentrate on methods and techniques of various encoding and decoding schemes and their structures, as well as analysis of optical CDMA systems with various transceiver models including advanced multi-level incoherent and coherent modulations with the architecture of access/aggregation networks in mind. Moreover, authors examine intriguing topics of optical CDMA networking, compatibility with IP networks, and implementation of optical multi-rate multiTable of ContentsList of Figures xiii List of Tables xxv Preface xxvii Acknowledgements xxxiii 1 Introduction to Optical Communications 1 1.1 Evolution of Lightwave Technology 1 1.2 Laser Technologies 3 1.3 Optical Fibre Communication Systems 4 1.4 Lightwave Technology in Future 7 1.5 Optical Lightwave Spectrum 7 1.6 Optical Fibre Transmission 9 1.7 Multiple Access Techniques 10 1.8 Spread Spectrum Communications Techniques 14 1.9 Motivations for Optical CDMA Communications 21 1.10 Access Networks Challenges 22 1.11 Summary 23 References 24 2 Optical Spreading Codes 29 2.1 Introduction 29 2.2 Bipolar Codes 30 2.3 Unipolar Codes: Optical Orthogonal Codes 37 2.4 Unipolar Codes: Prime Code Families 41 2.5 Codes with Ideal In-Phase Cross-Correlation 62 2.6 Multidimensional Optical Codes 76 2.7 Channel Encoding in OCDMA Systems 84 2.8 Turbo-Coded Optical CDMA 100 2.9 Summary 110 References 111 3 Optical CDMA Review 115 3.1 Introduction 115 3.2 Optical Coding Principles 115 3.3 OCDMA Networking: Users Are Codes 117 3.4 Optical CDMA Techniques 119 3.5 Free-Space and Atmospheric Optical CDMA 126 3.6 Summary 128 References 128 4 Spectrally Encoded OCDMA Networks 133 4.1 Introduction 133 4.2 Spectral-Amplitude-Coding Schemes 134 4.3 System Considerations 141 4.4 Gaussian Approach Analysis 144 4.5 Negative Binomial Approach Analysis 153 4.6 Spectral-Phase-Coding Schemes 164 4.7 Summary 167 References 167 5 Incoherent Temporal OCDMA Networks 171 5.1 Introduction 171 5.2 PPM-OCDMA Signalling 172 5.3 PPM-OCDMA Transceiver Architecture 173 5.4 PPM-OCDMA Performance Analysis 180 5.5 Discussion of Results 183 5.6 Overlapping PPM-OCDMA Signalling 187 5.7 OPPM-OCDMA Transceiver Architecture 188 5.8 OPPM-OCDMA Performance Analysis 196 .9 Discussion of Results 203 5.10 Analysis of Throughput 209 5.11 Summary 211 References 211 6 Coherent Temporal OCDMA Networks 213 6.1 Introduction 213 6.2 Coherent Homodyne BPSK-OCDMA Architecture 214 6.3 Coherent Heterodyne BPSK-OCDMA Architecture 222 6.4 Summary 229 References 230 7 Hybrid Temporal Coherent and Incoherent OCDMA Networks 231 7.1 Introduction 231 7.2 Coherent Transmitter with Incoherent Receiver 232 7.3 Analysis of Transceivers with MAI Cancellation 235 7.4 Results and Throughput Analysis 239 7.5 Summary 244 References 244 8 Optical CDMA with Polarization Modulations 245 8.1 Introduction 245 8.2 Optical Polarization Shift Keying (PolSK) 247 8.3 PolSK-OCDMA Transceiver Architecture 254 8.4 Evaluation of PolSK-OCDMA Transceiver Performance 263 8.5 Transceiver Architecture for Hybrid F-PolSK-OCDMA 265 8.6 Performance of F-PolSK-OCDMA Transceiver 273 8.7 Long-Haul PolSK Transmission 273 8.8 Summary 278 References 278 9 Optical CDMA Networking 281 9.1 Introduction 281 9.2 OCDMA-PON 289 9.3 OCDMA-PON Architecture 290 9.4 IP Traffic over OCDMA Networks 299 9.5 Random Access Protocols 308 9.6 Multi-Protocol Label Switching 330 9.7 Summary 342 References 344 10 Services Differentiation and Quality of Services in Optical CDMA Networks 347 10.1 Introduction 347 10.2 Differentiated Services in Optical CDMA 351 10.3 Variable-Weight Optical Spreading Codes 354 10.4 Variable-Length Optical Spreading Codes 364 10.5 Multirate Differentiated Services in OCDMA Networks 376 10.6 Summary 383 References 384 Index 387

Read more less

Book SynopsisWritten by experts in the field, this book describes the Personal Network architecture and its various components This book focuses on networking and security aspects of Personal Networks (PNs). Given a single user, the authors propose an architecture for PNs in which devices are divided into one of two types of nodes: personal nodes and foreign nodes. Furthermore, the authors demonstrate the ways in which PNs can be formed in a self-organized and secure way, how they can be interconnected using infrastructure networks, how multiple PNs can be connected, and how their services and resources can be shared. In addition, the book shows how security and ease-of-use can be achieved through automatic configuration and how mobility can be supported through adaptability and self-organization. The motivations for the PN concept, the PN architecture, its functionalities and features, as well as future challenges are covered in depth. Finally, the authors consider the potential applicaTable of ContentsForeword. Preface. List of Abbreviations. 1 The Vision of Personal Networks. 1.1 Past, Present, and Future Telecommunication. 1.2 Personal Networks. 1.3 Some Typical PN Use-Case Scenarios. 1.4 Federations of Personal Networks. 1.5 Early Personal Network Implementations. 1.6 Expected Impact. 1.7 Summary. 2 Personal Networks User Requirements. 2.1 Ubiquitous Networking. 2.2 Heterogeneous Hardware Constraints. 2.3 Quality of Service and Reliability. 2.4 Name, Service, and Content Management. 2.5 Context Awareness. 2.6 Being Cognitive. 2.7 Security and Trust. 2.8 Privacy. 2.9 Usability. 2.10 Other Requirements. 2.11 Jane Revisited. 2.12 Summary. 3 Trends in Personal Networks. 3.1 Wireless Communications. 3.2 Ad Hoc Networking. 3.3 WWRF Book of Visions. 3.4 Ubiquitous and Pervasive Computing and Communication. 3.5 Ambient Networks. 3.6 IST PACWOMAN and SHAMAN. 3.7 Personal Distributed Environment. 3.8 MyNet. 3.9 P2P Universal Computing Consortium. 3.10 More Trends. 3.11 Personal Networks and Current Trends. 3.12 Summary. 4 The Personal Network Architecture. 4.1 Terminology. 4.2 Personal and Foreign Nodes. 4.3 The Three Level Architecture View. 4.4 Personalization of Nodes. 4.5 Cluster Organization. 4.6 Personal Network Organization. 4.7 Foreign Communication. 4.8 Higher Layer Support Systems. 4.9 Federations of Personal Networks. 4.10 Discussion. 4.11 Summary. 5 Cluster Formation and Routing. 5.1 What is a Cluster? 5.2 Mobile Ad Hoc Network Technologies. 5.3 Cluster Formation and Maintenance. 5.4 Intra-Cluster Routing. 5.5 Summary. 6 Inter-Cluster Tunneling and Routing. 6.1 Inter-Cluster Tunneling Requirements. 6.2 IP Mobility. 6.3 PN Addressing. 6.4 Infrastructure Support. 6.5 Inter-Cluster Tunneling. 6.6 Inter-Cluster Routing. 6.7 Summary. 7 Foreign Communication. 7.1 Requirements for Foreign Communication. 7.2 Setting up Communication with Foreign Nodes. 7.3 Bridging Inside and Outside Protocols. 7.4 Mobility and Gateway Node Handover. 7.5 Summary. 8 Personal Network Application Support Systems. 8.1 Required PN Application Support. 8.2 Design of a PN Application Support System. 8.3 Service Discovery and Management Implementation. 8.4 An Implementation of Context Management. 8.5 Summary. 9 Personal Network Security. 9.1 Device Personalization. 9.2 Establishment of Secure Communication. 9.3 Secure Foreign Communication. 9.4 Anonymity. 9.5 Summary. 10 Personal Network Federations. 10.1 Examples. 10.2 Types of Federations. 10.3 Requirements. 10.4 Architecture of a Federation. 10.5 Life Cycle of a Federation. 10.6 Federation Access Control. 10.7 Federation Implementation Approaches. 10.8 Security. 10.9 Summary. 11 Personal Network Prototypes. 11.1 The TU Delft Prototype. 11.2 The PNP2008 Prototypes. 11.3 The MAGNET Prototype. 11.4 Summary. 12 The Future of Personal Networks. 12.1 Are We There Yet? 12.2 Future Directions. Appendix A Terminology. A.1 Connectivity Abstraction Level. A.2 Network Abstraction Level. A.3 Application and Service Abstraction Level. A.4 Personal Network Federations. References. Related Websites. Index.

Read more less

Book SynopsisFocusing on IP over WDM optical networks, this book summarizes the fundamental mechanisms and the development and deployment of WDM optical networks. It provides information on both the network and the software architectures needed to implement WDM enabled optical networks designed to transport IP traffic.Trade Review"Network engineering and planners...will be interested in this book.... Developers and architects...will also find the book useful." (Journal of Optical Networking, Vol. 2, No. 4, April 2003)Table of ContentsPreface. Acknowledgements. Introduction. Review. Characteristics of the Internet and IP Routing. WDM Optical Networks. IP over WDM. IP/WDM Network Control. IP/WDM Traffic Engineering. Other IP/WDM Specific Issues. Concluding Remarks. Bibliography. Web Site List. Acronym List. Index.

Read more less

Book SynopsisWireless Local Area Networks (LANs) represent the revolution occuring in wireless communications. These networks, allow small communities of office workers, industrial workers, hospital employees, technical teams, and others, to communicate via their mobile devices without having to worry about cables. This book covers this area.Table of ContentsPreface xi Structure of the book xii 1 Introduction 1 1.1 Definition and restriction 1 1.2 Overview of advantages and disadvantages 1 1.3 Applications overview 3 1.4 Market events 6 1.5 Organizations and governing bodies 12 2 Basics 17 2.1 History of wireless vs. wired 17 2.2 Technical communication models and classification 20 2.3 Demands on transfer networks 26 2.4 Properties of electromagnetic waves 28 2.5 Digital modulation technology 33 2.6 Channel access 38 2.7 Spread spectrum techniques 39 2.8 Orthogonal frequency division multiplex procedure 43 2.9 Antennae 2.10 Special features of wireless networks 47 2.11 Frequency allocations 48 3 Applications, devices and standards 51 3.1 Application scenarios 51 3.2 Device types 53 3.3 Standards 54 4 IEEE802.11 57 4.1 The standard 57 4.2 Architectures 59 4.3 Channel access 61 4.4 The Physical layer and bit transfer 81 4.5 Other services 86 4.6 Security 86 4.7 Extensions to the standard 88 5 Bluetooth 95 5.1 The standard 95 5.2 Architectures 99 5.3 Channel access 99 5.4 Controlling states 104 5.5 Bit transfer 108 5.6 Security 110 5.7 System implementation 110 6 DECT 113 6.1 The standard 113 6.2 Architectures 113 6.3 Channel access 114 6.4 Bit transfer 115 6.5 Application profiles 115 7 HomeRF 117 7.1 The standard 117 7.2 Architectures 117 7.3 Channel access 119 7.4 Bit transfer 121 8 HiperLAN/2 123 8.1 The standard 123 8.2 Architectures 125 8.3 Channel access 127 8.4 Bit transfer 130 8.5 Other services 132 8.6 The HiperLAN/2 standard versus IEEE802.1 a 132 9 Operating an IEEE802.11b-complaint WLAN 133 9.1 Introduction 133 9.2 Mobile stations 133 9.3 Access points 136 9.4 Extended networks 141 9.5 Network analysis 143 9.6 Examples from real life 148 10 Various aspects of WLAN technology 153 10.1 Security 10.2 Sources of interference 161 10.3 Selecting a spread spectrum technique 163 10.4 Aspects of EMT interference 165 10.5 WLANs and TCP/IP 167 10.6 Deciding factors 167 10.7 Future prospects 169 Appendix 171 A.1 Maxwellian equations 171 A.2 Physical basis of direct sequence spread spectrum process 171 A.3 Directional antennae 174 B Bibliography 179 B.1 English-language publications 179 B.2 German-language publications 182 C Abbreviations 185

Read more less

Book SynopsisAn expert guide for applying data mining with uncertain reasoning to a wide range of uses This volume presents a holistic view of data mining by integrating this diverse and exciting field with uncertain reasoning. It treats a wide range of issues and examines the state of the art in both fields while summarizing vital concepts that can normally only be found in various separate resources. The author concentrates on practical aspects of data mining-such as infrastructure and overall processes-but also discusses some selected algorithms and performance-related issues. Several important topics are addressed specifically, such as bridging the fields of machine learning and data mining and the discovery of influential association rules. In addition, the author discusses data warehousing as an enabling technique for data mining. Case studies are included throughout to illustrate important concepts. Data Mining and Uncertain Reasoning is a practical reference for pTable of ContentsWhat This Book Is About. Basics of Data Mining. Enabling Techniques and Advanced Features of Data Mining. Dealing with Uncertainty in Manipulation of Data. Data Mining Tasks for Knowledge Discovery. Bayesian Networks and Artificial Neural Networks. Uncertain Reasoning Techniques for Data Mining. Data Mining Lifecycle with Uncertainty Handling: Case Studies and Software Tools. Intelligent Conceptual Query Answering with Uncertainty: Basic Aspects and Case Studies. References. Index.

Read more less

Book SynopsisThis revolutionary text and its accompanying CD replace a whole lab full of computer equipment. They give computer science students realistic hands-on experience working with network protocols, without requiring all the routers, switches, hubs, and PCs of an actual network. Using the latest version of the open source program Ethereal, the reader opens packet trace files from the CD and follows the text to perform the exercises, gaining a thorough understanding of the material in the best way possibleby seeing it in action. This approach also benefits the instructor, who is spared the time-consuming tasks of maintaining a laboratory and taking traces. It can even relieve the anxiety system administrators have about students collecting traces on campus networks!Table of ContentsPreface iii Acknowledgments viii Section 1: Getting Started 1 Introduction 1 Exercise 1.1 Examining a Quiet Network 2 Introduction 2 Configuration 3 Experiment 3 Using the Capture Options Dialog 6 Examining a Short Trace 9 List, Protocol, and Raw Panes 10 Trace Summary Statistics 12 Questions 14 Discussion and Investigation 14 Resources 15 Exercise 1.2 Protocol Layering 16 Introduction 16 Configuration 19 Experiment 19 Protocol Hierarchy Statistics 20 TCP Connection 20 Frame Layer 22 Ethernet Layer 23 Internet Protocol Layer 25 Transport Control Protocol 26 Packet Overview 27 UDP Packets 27 Questions 27 Discussion and Investigation 28 Resources 29 Exercise 1.3 Examining a Busy Network Using Filters 30 Introduction 30 Configuration 31 Experiment 32 Capture Filters 32 Color Filters 34 Display Filters 38 Searching for Packets 39 Questions 39 Discussion and Investigation 40 Resources 40 Section 2: Application Layer Protocols 42 Introduction 42 Exercise 2.1 Under the Hood of HTTP 44 Introduction 44 Configuration 46 Experiment 47 HTTP Get Request 48 HTTP Response 50 Multiple GET Requests per URL 50 Plain Text Data 51 Multiple TCP Streams 54 Questions 54 Discussion and Investigation 55 Resources 56 Exercise 2.2 HTTP Caching,Authorization and Cookies 57 Introduction 57 Configuration 57 Experiment 58 Cookies 58 Authorization Headers 59 Caching Headers 61 Questions 63 Discussion and Investigation 64 Resources 64 Exercise 2.3 FTP – File Transfer Protocol 65 Introduction 65 Configuration 66 Experiment 67 Control Channel 67 Data Channels 71 Questions 73 Discussion and Investigation 74 Resources 75 Exercise 2.4 Sending and Receiving Email with SMTP and POP 76 Introduction 76 Configuration 77 Experiment 78 Outgoing Mail 78 Incoming Mail 81 E-mail Headers 82 No Mail 84 Questions 85 Discussion and Investigation 86 Resources 86 Section 3: Transport Layer Protocols 88 Introduction 88 Exercise 3.1 Introduction to TCP 90 Introduction 90 Configuration 92 Experiment 93 Local TTCP Connection 93 Connection Establishment 94 One-way Data Flow 96 Closing a Connection 97 Connection Statistics 97 Remote SSH Connection 98 Questions 99 Discussion and Investigation 99 Resources 101 Exercise 3.2 Retransmission in TCP 102 Introduction 102 Configuration 103 Experiment 104 Local TTCP Connection 104 SACK Option Negotiated 105 Missing Packets and Retransmission 107 Impact on Sending Rate 109 Remote TTCP Connection 111 Questions 112 Discussion and Investigation 113 Resources 114 Exercise 3.3 Comparing TCP to UDP 115 Introduction 115 Configuration 117 Experiment 117 Using TTCP To Generate TCP and UDP Traffic 118 Normal Data Transfer In TCP 119 Normal Data Transfer In UDP 120 No Receiver Present for TCP and UDP 122 Questions 123 Discussion and Investigation 124 Resources 125 Exercise 3.4 Competing TCP and UDP Streams 126 Introduction 126 Configuration 127 Experiment 128 Two Competing TCP Streams 128 UDP Competing with TCP 132 Two Competing UDP Streams 133 Questions 135 Discussion and Investigation 136 Resources 136 Section 4: Network Layer Protocols 137 Introduction 137 Exercise 4.1 Joining the Internet: Introduction to IP and DHCP 139 Introduction 139 Configuration 142 Experiment 143 Obtaining an IP Address Via DHCP 143 Fragmentation in IPv4 146 Ping Over IPv6 149 Questions 151 Discussion and Investigation 151 Resources 152 Exercise 4.2 Ping and Traceroute 153 Introduction 153 Configuration 156 Experiment 157 Local and Remote Pings 157 Local Traceroute 159 Remote Traceroute 162 Questions 163 Discussion and Investigation 164 Resources 164 Exercise 4.3 Dynamic Routing with RIP 166 Introduction 166 Configuration 168 Experiment 170 No RIP Enabled 170 RIP Enabled on the Endpoints 170 RIP Enabled on All Machines But One 171 RIP Enabled End-to-End 175 Adding a Loop in the Network Graph 177 Adjusting to a Failed Link 178 Open Shortest Path First 178 Questions 180 Discussion and Investigation 181 Resources 181 Exercise 4.4 Border Gateway Protocol 182 Introduction 182 Configuration 184 Experiment 186 Establishing BGP Peering Sessions 186 Withdrawing a Route 188 Repairing a Connection 191 Questions 193 Discussion and Investigation 193 Resources 194 Section 5: Link Layer Protocols 195 Introduction 195 Exercise 5.1 MAC Addresses and the Address Resolution Protocol 197 Introduction 197 Configuration 200 Experiment 201 Address Resolution Protocol 201 MAC Address Spoofing 203 Questions 207 Discussion and Investigation 208 Resources 208 Exercise 5.2 Ethernet 209 Introduction 209 Configuration 213 Experiment 214 Ethernet Switch 214 Ethernet Hub 216 Questions 217 Discussion and Investigation 219 Resources 219 Exercise 5.3 Wireless LANs 220 Introduction 220 Configuration 226 Experiment 227 Beacon Frames 227 WEP Disabled 229 Contents xi Data Frames 231 WEP Enabled 232 Questions 233 Discussion and Investigation 234 Resources 234 Section 6: Security 235 Introduction 235 Exercise 6.1 Encryption 236 Introduction 236 Configuration 238 Experiment 239 Plain Text Telnet Session 239 Encrypted SSH Session 240 Attacks Against SSH 242 Comparing HTTP and HTTPS 243 Questions 246 Discussion and Investigation 247 Resources 248 Exercise 6.2 IP Spoofing and TCP Session Stealing 249 Introduction 249 Configuration 250 Experiment 251 TCP Session Hijacking 252 TCP Session Termination 256 Questions 257 Discussion and Investigation 257 Resources 258 Exercise 6.3 System Vulnerabilities 259 Introduction 259 Configuration 261 Experiment 262 Port Scans 262 Blaster Worm 265 Questions 267 Discussion and Investigation 268 Resources 268 Index 269

Read more less

Book Synopsis

Read more less

Book SynopsisCombining clear explanations of elementary principles, advanced topics and applications with step-by-step mathematical derivations, this textbook provides a comprehensive yet accessible introduction to digital signal processing. All the key topics are covered, including discrete-time Fourier transform, z-transform, discrete Fourier transform and FFT, A/D conversion, and FIR and IIR filtering algorithms, as well as more advanced topics such as multirate systems, the discrete cosine transform and spectral signal processing. Over 600 full-color illustrations, 200 fully worked examples, hundreds of end-of-chapter homework problems and detailed computational examples of DSP algorithms implemented in MATLAB and C aid understanding, and help put knowledge into practice. A wealth of supplementary material accompanies the book online, including interactive programs for instructors, a full set of solutions and MATLAB laboratory exercises, making this the ideal text for senior undergraduate and gTrade Review'Professor Holton has done a great service to faculty who teach digital signal processing. The material is developed in a clear and thorough manner with an excellent range of topics, from elementary to advanced and from theoretical to applied. Many insightful analytical and computational examples and homework problems are included, with Matlab intelligently integrated. This textbook is the clear front-runner in a crowded field.' Howard Weinert, Johns Hopkins University'… a student-friendly book, making learning DSP a fun journey.' Xiyi Hang, California State University, Northridge'… an excellent textbook for undergraduate as well as graduate students. It is well written, very clearly defined and presents all DSP topics, using many examples including the use of Matlab … Holton covers all necessary materials for a thorough understanding of DSP concepts and practical applications of a subject which is very mathematical … It is without any reservations that I strongly endorse and recommend the DSP book by Professor Holton.' Mousavinezhad Hossein, Idaho State University'The Holton text includes technical materials that a practicing engineer needs to know to prototype a fixed-coefficient DSP system architecture using Matlab. There are many unique features of this textbook, including a full chapter on visualizing frequency response from pole-zero plots, multi-color plots for better comprehension, rigorous derivation of all formulas, and up-to-date hardware- and software-based implementation ideas for the benefit of novice and practicing engineers. I strongly recommend its adoption.' Kalyan Mondal, Fairleigh Dickinson UniversityTable of ContentsPreface; 1. Signals and systems; 2. Impulse response; 3. Discrete-time Fourier transform; 4. z-transform; 5. Frequency response; 6. A/D and D/A conversion; 7. Finite impulse response systems; 8. Infinite impulse response systems; 9. Filter architecture; 10. Discrete Fourier transform; 11. Fast Fourier transform; 12. Discrete cosine transform; 13. Multirate and multistage systems; 14. Spectral analysis; Appendices; Index.

Read more less

Book Synopsis

Read more less

Book SynopsisThe definitive guide to administering a Red Hat Enterprise Linux 6 network Linux professionals who need a go-to guide on version 6 of Red Hat Enterprise Linux (RHEL) will find what they need in this comprehensive Sybex book. It covers RHEL administration in detail, including how to set up and manage web and mail services, use RHEL in enterprise environments, secure it, optimize storage, configure for virtualization and high availability, and much more. It also provides a great study aid for those preparing for either the RHCSA or RHCE certification exam. Red Hat is the Linux market leader, and Red Hat administrators are in demand This Sybex guide is a comprehensive resource on Red Hat Enterprise Linux administration and useful for those preparing for one of the Red Hat certification exams Covers setting up and managing web and mail services, using RHEL in enterprise environments, securing RHEL, and optimizing storage to fit your environmeTable of ContentsIntroduction xxvii Assessment Test xxxiii Part I Getting Familiar with Red Hat Enterprise Linux 1 Chapter 1 Getting Started with Red Hat Enterprise Linux 3 Chapter 2 Finding Your Way on the Command Line 41 Part II Administering Red Hat Enterprise Linux 67 Chapter 3 Performing Daily System Administration Tasks 69 Chapter 4 Managing Software 99 Chapter 5 Configuring and Managing Storage 121 Chapter 6 Connecting to the Network 155 Part III Securing Red Hat Enterprise Linux 187 Chapter 7 Working with Users, Groups, and Permissions 189 Chapter 8 Understanding and Configuring SELinux 229 Chapter 9 Working with KVM Virtualization 245 Chapter 10 Securing Your Server with iptables 269 Chapter 11 Setting Up Cryptographic Services 293 Part IV Networking Red Hat Enterprise Linux 313 Chapter 12 Configuring OpenLDAP 315 Chapter 13 Configuring Your Server for File Sharing 333 Chapter 14 Configuring DNS and DHCP 355 Chapter 15 Setting Up a Mail Server 375 Chapter 16 Configuring Apache on Red Hat Enterprise Linux 385 Part V Advanced Red Hat Enterprise Linux Configuration 411 Chapter 17 Monitoring and Optimizing Performance 413 Chapter 18 Introducing Bash Shell Scripting 467 Chapter 19 Understanding and Troubleshooting the Boot Procedure 505 Chapter 20 Introducing High-Availability Clustering 529 Chapter 21 Setting Up an Installation Server 561 Glossary 577 Appendix A Hands-On Labs 595 Appendix B Answers to Hands-On Labs 607 Index 625

Read more less

Book SynopsisThe essential guide to solving algorithmic and networking problems in commercial computer games, revised and extended Algorithms and Networking for Computer Games, Second Editionis written from the perspective of the computer scientist. Combining algorithmic knowledge and game-related problems, it explores the most common problems encountered in game programing. The first part of the book presents practical algorithms for solving classical topics, such as random numbers, procedural generation, tournaments, group formations and game trees. The authors also focus on how to find a path in, create the terrain of, and make decisions in the game world. The second part introduces networking related problems in computer games, focusing on four key questions: how to hide the inherent communication delay, how to best exploit limited network resources, how to cope with cheating and how to measure the on-line game data. Thoroughly revised, updated, and Trade Review“More than 70 algorithms are presented, covering random numbers, noise in data (a realistic world is full of imperfections), procedural generation, tournaments, game trees, path finding, group movement, decision making, and modelling uncertainty – as well as networking problems, including dealing with cheating. The exercises at the end of each chapter range from simple thought exercises to studying Braben and Bell’s namegeneration algorithm from Elite (1984) … use of pseudocode throughout ensures the book works equally well for C, C++, Java, Python, or even C# programmers.” MagPi, Issue 64, December 2017 Table of ContentsPreface xiii 1 Introduction 1 1.1 Anatomy of Computer Games 4 1.2 Game Development 6 1.2.1 Phases of development 7 1.2.2 Documentation 8 1.2.3 Other considerations 11 1.3 Synthetic Players 12 1.3.1 Humanness 13 1.3.2 Stance 14 1.4 Multiplaying 14 1.5 Interactive Storytelling 15 1.5.1 Approaches 16 1.5.2 Storytelling in games 17 1.6 Outline of the Book 19 1.6.1 Algorithms 20 1.6.2 Networking 20 1.7 Summary 21 Exercises 21 I Algorithms 25 2 Random Numbers 26 2.1 Linear Congruential Method 27 2.1.1 Choice of parameters 30 2.1.2 Testing the randomness 32 2.1.3 Using the generators 33 2.2 Discrete Finite Distributions 36 2.3 Random Shuffling 40 2.4 Summary 44 Exercises 44 3 Noise 49 3.1 Applying Noise 50 3.2 Origin of Noise 51 3.3 Visualization 52 3.4 Interpolation 55 3.4.1 Utility routines for value conversions 56 3.4.2 Interpolation in a single parameter 58 3.4.3 Interpolation in two parameters 61 3.5 Composition of Noise 62 3.6 Periodic Noise 65 3.7 Perlin Noise 68 3.8 Worley Noise 73 3.9 Summary 83 Exercises 83 4 Procedural Generation 88 4.1 Terrain Generation 89 4.2 Maze Algorithms 96 4.2.1 Depth-first algorithm 98 4.2.2 Randomized Kruskal’s algorithm 99 4.2.3 Randomized Prim’s algorithm 101 4.3 L-Systems 101 4.3.1 Examples 103 4.3.2 City generation 105 4.4 Hierarchical Universe Generation 108 4.5 Summary 109 Exercises 111 5 Tournaments 115 5.1 Rank Adjustment Tournaments 118 5.2 Elimination Tournaments 123 5.3 Scoring Tournaments 131 5.4 Summary 135 Exercises 138 6 Game Trees 143 6.1 Minimax 144 6.1.1 Analysis 147 6.1.2 Partial minimax 148 6.2 Alpha-Beta Pruning 152 6.2.1 Analysis 156 6.2.2 Principal variation search 157 6.3 Monte Carlo Tree Search 157 6.4 Games of Chance 166 6.5 Summary 168 Exercises 170 7 Path Finding 177 7.1 Discretization of the Game World 178 7.1.1 Grid 179 7.1.2 Navigation mesh 180 7.2 Finding the Minimum Path 182 7.2.1 Evaluation function 183 7.2.2 Properties 184 7.2.3 Algorithm A* 185 7.3 Realizing the Movement 187 7.4 Summary 189 Exercises 190 8 Group Movement 194 8.1 Flocking 195 8.2 Formations 200 8.2.1 Coordinating formations 200 8.2.2 Behaviour-based steering 204 8.2.3 Fuzzy logic control 205 8.2.4 Mass-spring systems 207 8.3 Summary 208 Exercises 208 9 Decision-Making 211 9.1 Background 211 9.1.1 Levels of decision-making 212 9.1.2 Modelled knowledge 213 9.1.3 Methods 214 9.2 Finite State Machines 218 9.2.1 Computational FSM 221 9.2.2 Mealy and Moore machines 224 9.2.3 Implementation 227 9.2.4 Discussion 228 9.3 Influence Maps 231 9.4 Automated Planning 235 9.5 Summary 237 Exercises 240 10 Modelling Uncertainty 246 10.1 Statistical Reasoning 246 10.1.1 Bayes’ theorem 246 10.1.2 Bayesian networks 248 10.1.3 Dempster–Shafer theory 249 10.2 Fuzzy Sets 252 10.2.1 Membership function 253 10.2.2 Fuzzy operations 255 10.2.3 Defuzzification 255 10.3 Fuzzy Constraint Satisfaction Problem 257 10.3.1 Modelling the criteria as fuzzy sets 259 10.3.2 Weighting the criteria importances 262 10.3.3 Aggregating the criteria 262 10.3.4 Making a decision 263 10.4 Summary 263 Exercises 265 II Networking 268 11 Communication Layers 269 11.1 Physical Platform 270 11.1.1 Resource limitations 271 11.1.2 Transmission techniques and protocols 272 11.2 Logical Platform 274 11.2.1 Communication architecture 274 11.2.2 Data and control architecture 275 11.3 Networked Application 277 11.4 Summary 278 Exercises 278 12 Compensating Resource Limitations 283 12.1 Aspects of Compensation 284 12.1.1 Consistency and responsiveness 284 12.1.2 Scalability 287 12.2 Protocol Optimization 291 12.2.1 Message compression 291 12.2.2 Message aggregation 292 12.3 Dead Reckoning 293 12.3.1 Prediction 293 12.3.2 Convergence 295 12.4 Local Perception Filters 297 12.4.1 Linear temporal contour 301 12.4.2 Adding bullet time to the delays 305 12.5 Synchronized Simulation 307 12.6 Interest Management 308 12.6.1 Aura-based interest management 310 12.6.2 Zone-based interest management 310 12.6.3 Visibility-based interest management 312 12.6.4 Class-based interest management 312 12.7 Compensation by Game Design 314 12.7.1 Short active turns 314 12.7.2 Semi-autonomous avatars 315 12.7.3 Interaction via proxies 316 12.8 Summary 317 Exercises 318 13 Cheating Prevention 321 13.1 Technical Exploitations 322 13.1.1 Packet tampering 323 13.1.2 Look-ahead cheating 324 13.1.3 Cracking and other attacks 330 13.2 Collusion 331 13.2.1 Classification 333 13.2.2 Collusion detection 335 13.3 Rule Violations 337 13.4 Summary 338 Exercises 338 14 Online Metrics 341 14.1 Players 344 14.2 Monetization 345 14.3 Acquisition 347 14.4 Game Session 347 14.5 Summary 348 Exercises 348 A Pseudocode Conventions 351 A.1 Changing the Flow of Control 355 A.1.1 Expressions 355 A.1.2 Control structures 357 A.2 Data Structures 360 A.2.1 Values and entities 360 A.2.2 Data collections 360 A.3 Format of Algorithms 365 A.4 Conversion to Existing Programming Languages 367 B Practical Vectors and Matrices 371 B.1 Points and Vectors 372 B.2 Matrices 381 B.3 Conclusion 387 Bibliography 391 Ludography 408 Index 409

Read more less

Book SynopsisThis book focuses on the key functional areas of LTE Self-Organizing Networks (SON), first introducing LTE network scenarios, technologies, and general SON concepts, and on to the latest status of 3GPP standardization.Table of ContentsForeword xiii Preface xv List of Contributors xix Acknowledgements xxi List of Abbreviations xxiii 1. Introduction 1 1.1 Self-Organising Networks (SON) 3 1.2 The Transition from Conventional Network Operation to SON 6 1.2.1 Automation of the Network Rollout 9 1.2.2 Automation of Network Optimisation and Troubleshooting 10 1.2.3 SON Characteristics and Challenges 11 References 12 2. LTE Overview 13 2.1 Introduction to LTE and SAE 13 2.1.1 3GPP Structure, Timeline and LTE Specifications 14 2.1.2 LTE Requirements 16 2.1.3 System Architecture Overview 16 2.1.4 Evolved UTRAN 18 2.1.5 E-UTRAN Functional Elements 19 2.1.6 Evolved Packet Core 21 2.1.7 Voice over LTE (VoLTE) 24 2.1.8 LTE-Advanced 24 2.1.9 Network Management 30 2.2 LTE Radio Access Network Scenarios and Their Evolution 33 2.2.1 LTE Radio Coverage Scenario 33 2.2.2 LTE for Capacity Enhancement in Existing GERAN/UTRAN 34 2.2.3 Enhancing LTE Capacity, the Multi-Layer LTE 34 2.2.4 Data Offloading, LIPA-SIPTO 35 2.2.5 Multi-Radio Access Network Scenarios or non-GPP 36 References 37 3. Self-Organising Networks (SON) 39 3.1 Vision 39 3.2 NGMN Operator Use Cases and 3GPP SON Use Cases 42 3.2.1 Operational Use Cases 42 3.2.2 NGMN SON Use Cases and Requirements 47 3.2.3 SON Use Cases in 3GPP 50 3.3 Foundations for SON 52 3.3.1 Control Engineering: Feedback Loops 53 3.3.2 Autonomic Computing and Autonomic Management 55 3.3.3 SON Research Projects 57 3.4 Architecture 60 3.4.1 Use-Case Related Criteria 62 3.4.2 System-Level Criteria 64 3.5 Business Value 65 3.5.1 The Economics of eNB Sites 65 3.5.2 General Mode of Operation of SON 68 3.5.3 Installation and Planning 71 3.5.4 Network Optimisation 72 3.5.5 Fault Management 73 3.5.6 Conclusions 74 3.6 SON Operational and Technical Challenges 75 3.6.1 Transition of Operational Processes to SON 75 3.6.2 Technical (Engineering) Challenges 78 References 80 4. Self-Configuration (‘Plug-and-Play’) 81 4.1 Auto-Connectivity and -Commissioning 82 4.1.1 Preparation 85 4.1.2 Connectivity Setup, Site-Identification and Auto-Commissioning 87 4.1.3 LTE-A Relay Auto-Connectivity 93 4.1.4 Conclusions 100 4.2 Dynamic Radio Configuration 100 4.2.1 Generation of Initial Transmission Parameters 106 4.2.2 Physical Cell-ID Allocation 111 4.2.3 Automatic Neighbour Relationship Setup (ANR) 118 4.2.4 DRC Architecture 130 4.2.5 Conclusions 132 References 133 5. Self-Optimisation 135 5.1 Mobility Robustness Optimisation 136 5.1.1 Goals of MRO 136 5.1.2 Cell Changes and Interference Challenges 137 5.1.3 MRO Relevant Parameters 140 5.1.4 Causes for Mobility Problems 144 5.1.5 MRO Solutions 146 5.1.6 MRO Time Scales 151 5.1.7 MRO Performance 152 5.2 Mobility Load Balancing and Traffic Steering 157 5.2.1 Introduction to Traffic Steering 157 5.2.2 SON Policies for Mobility Load Balancing 159 5.2.3 A Theoretical View of Load Balancing 160 5.2.4 Standardised Features and Procedures to Direct UEs to the Desired Layer 166 5.2.5 Exemplary Results of MLB 182 5.2.6 Uplink Load Balancing 189 5.2.7 Interactions Between TS/MLB and MRO 190 5.3 Energy Saving 193 5.3.1 Introduction 193 5.3.2 Requirements 195 5.3.3 Energy Saving Management 195 5.3.4 eNB Overlaid Scenario 196 5.3.5 Capacity-Limited Network 198 5.3.6 Equipment/Local ES 200 5.3.7 Example Scenarios and Expected Gains 201 5.3.8 Summary 204 5.4 Coverage and Capacity Optimisation 204 5.4.1 CCO with Adaptive Antennas 205 5.4.2 Performance Analysis for Antenna Parameter Optimisation Based CCO 208 5.4.3 CCO with TX Power 216 5.5 RACH Optimisation 217 5.5.1 General 217 5.5.2 PRACH Configuration 218 5.5.3 RACH Configuration 219 5.5.4 RACH/PRACH Configuration Example 221 5.5.5 RA Performance 222 5.5.6 Self-Optimisation Framework 223 5.5.7 UE Reporting 223 5.5.8 Inter-eNB Communication 225 5.6 RRM and SON (Interference Coordination, P0 Optimisation) 226 5.6.1 Interference Coordination 226 5.6.2 P0 Optimisation 230 References 232 6. Self-Healing 235 6.1 Introduction 236 6.1.1 3GPP Use Cases 236 6.1.2 3GPP Self-Healing Process and its Management 237 6.1.3 Cell Degradation Management 238 6.2 Cell Degradation Detection 242 6.3 Cell Degradation Diagnosis and Prediction 248 6.3.1 Rule Based Systems 250 6.3.2 Bayesian Networks 251 6.3.3 Case Based Reasoning 253 6.3.4 Neural Networks 255 6.3.5 Active Measurements 256 6.3.6 Prediction 257 6.4 Cell Outage Compensation 259 6.4.1 Activation of Cell Outage Compensation 260 6.4.2 Means of Cell Outage Compensation 260 6.4.3 Interaction between Cell Outage Compensation and Self-Configuration Functions 263 References 264 7. Supporting Function: Minimisation of Drive Tests (MDT) 267 7.1 Introduction 267 7.1.1 General 267 7.1.2 History and Background 269 7.2 Relation to SON 272 7.3 Requirements 273 7.4 Use Cases 275 7.4.1 Operator Scenarios 276 7.4.2 Coverage Optimisation 277 7.4.3 Mobility Optimisation 281 7.4.4 Capacity Optimisation 281 7.4.5 Parameterisation for Common Channels 282 7.4.6 QoS Verification 282 7.5 Overall Architecture 283 7.6 Managing MDT 285 7.6.1 Subscriber and Equipment Trace 285 7.6.2 MDT Configuration Parameters 285 7.6.3 Subscription Based MDT 287 7.6.4 Area Based MDT 292 7.6.5 Supporting Functionality in the Management System 293 7.6.6 MDT Reporting 293 7.7 MDT Radio Interface Procedures 295 7.7.1 Immediate MDT 296 7.7.2 Logged MDT 298 7.7.3 RLF Reporting 303 7.7.4 Measurement Parameters 305 7.7.5 Location Information 308 7.8 Conclusion 309 References 310 8. SON for Core Networks 311 8.1 Introduction 311 8.2 SON for Packet Core Networks 311 8.2.1 Packet Core Element Auto-Configuration 311 8.2.2 Automatic Neighbour Relation 313 8.2.3 S1 Flex (MME Pooling) 314 8.2.4 Signalling Optimisation 315 8.2.5 Latency Optimisation 317 8.2.6 Fast Gateway Convergence with Bidirectional Forward Detection 318 8.2.7 Dynamic IP Pool Allocation 318 8.2.8 Energy Saving 319 8.3 SON for Voice Core Networks 319 8.3.1 Voice Over IP Quality Monitoring and Management 319 8.3.2 Resource Optimisation in Voice Core Network 320 References 321 9. SON Operation 322 9.1 SON Function Interactions 323 9.1.1 Spatial Characteristic 324 9.1.2 Temporal Characteristic 324 9.1.3 Categories of SON Conflicts 326 9.1.4 Network Parameters Related to SON Functions 329 9.1.5 Examples for Conflicts between SON Functions 330 9.2 Coordination of SON Functions 334 9.2.1 Basic Options for SON Coordination 334 9.2.2 Goals of SON Function Coordination 338 9.2.3 SON Coordination Function Concept 340 9.2.4 Coordination Schemes 346 9.2.5 Related Work 352 9.2.6 SON Function Coordination Example 352 9.3 Conclusions 355 References 356 10. SON for Heterogeneous Networks (HetNet) 357 10.1 Introduction 357 10.2 Standardisation and Network Architecture 359 10.2.1 Network Architecture for HetNet 361 10.3 Self-Configuration 362 10.3.1 Auto-Connectivity and -Commissioning 363 10.3.2 Automatic Site Identification and Hardware-to-Site Mapping 364 10.3.3 Automatic Neighbour Relations (ANR) 365 10.4 Self-Optimisation: Interference Management 365 10.4.1 Interference Characteristics in HetNet Scenarios 365 10.4.2 Basic Interference Management Techniques 366 10.4.3 Scenarios with Macro eNBs and Micro/Pico eNBs 369 10.4.4 Enhanced Time-Domain Interference Management: eICIC 370 10.4.5 Outlook on Further Interference Management Innovations 374 10.5 Self-Optimisation: Mobility Aspects; MRO and Traffic Steering 375 10.5.1 Mobility Robustness Optimisation 375 10.5.2 Multi-Layer Traffic Steering and Load Balancing 377 10.5.3 IEEE 802.11 (WiFi) Integration 378 References 378 11. Future Research Topics 379 11.1 Future Mobile Network Scenarios 379 11.1.1 Heterogeneous Networks 379 11.1.2 Cloud RAN 380 11.1.3 Requirements for Future OAM Systems 381 11.2 Cognitive Radio Networks (CRN) 381 11.2.1 From SON to CRN 381 11.2.2 Definitions 382 11.2.3 Framework 383 11.2.4 Artificial Intelligence 385 11.3 Applications 387 11.3.1 Self-Configuration 387 11.3.2 Self-Optimisation 387 11.3.3 Self-Healing 388 11.3.4 Operation 388 11.4 Conclusion 389 References 389 Index 391

Read more less

Book Synopsis

Read more less

Book Synopsis

Read more less

Book SynopsisPrepare for a career in network administration using Microsoft Windows 10 with the real-world examples and hands-on activities that reinforce key concepts in MICROSOFT SPECIALIST GUIDE TO MICROSOFT WINDOWS 10. This book also features troubleshooting tips for solutions to common problems that you will encounter in Windows 10 administration. This book's in-depth study focuses on all of the functions and features of installing, configuring, and maintaining Windows 10 as a client operating system. Activities let you experience first-hand the processes involved in Windows 10 configuration and management. Review Questions reinforce concepts and help you prepare for the Microsoft certification exam. Case Projects offer a real-world perspective on the concepts introduced in each chapter, helping you prepare for even the most challenging situations that must be managed in a live networking environment.Table of ContentsIntroduction to Windows 10. Installing Windows 10. Using System Utilities. Managing Disks and File Systems. User Management. Windows 10 Security Features. Networking. User Productivity Tools. Application Support. Disaster Recovery and Troubleshooting. Windows Intune. Hyper-V. Enterprise Computing. Remote Access. Appendix: Exam 70-697 Appendix: Objectives Mapping Grid Appendix: Cloud Computing.

Read more less

Book SynopsisExamine two of the most prominent operating systems -- Windows 10 and Linux CentOS7 -- in parallel with the unique approach found only in GUIDE TO PARALLEL OPERATING SYSTEMS WITH WINDOWS 10 AND LINUX, 3E. Rather than using a compare and contrast model, the book presents each topic conceptually before demonstrating it simultaneously on both operating systems. You are able to switch instantly between Windows 10 and Linux CentOS 7 to complete the myriad of hands-on activities that reinforce the similarities between the two operating systems for each conceptual task. The text's virtualization approach provides flexibility that enables you to use Microsoft Hyper-V Client, Oracle VirtualBox, or VMWare Workstation. This comprehensive guide helps you develop the competencies you need in Windows 10 and Linux to maximize success in today's classroom as well as in tomorrow's business environment.Table of Contents1. Hardware Components. 2. Software Components. 3. Graphical User Interface. 4. Installing and Configuring Applications. 5. File Systems. 6. Directory Commands. 7. Files and File Attributes. 8. The Command Line. 9. Text Editors. 10. Scripting in Windows 10 and CentOS 7. 11. Local Network Access. 12. Operating System Management. Appendix A: Number Systems and Data Representation. Appendix B: Microsoft Hyper-V Virtualization. Appendix C: Oracle Virtual Box. Appendix D: VMWare Workstation.

Read more less

Book SynopsisA top-to-bottom discussion of website bot attacks and how to defend against them In The Reign of Botnets: Defending Against Abuses, Bots and Fraud on the Internet, fraud and bot detection expert David Senecal delivers a timely and incisive presentation of the contemporary bot threat landscape and the latest defense strategies used by leading companies to protect themselves. The author uses plain language to lift the veil on bots and fraud, making a topic critical to your website''s security easy to understand and even easier to implement. You''ll learn how attackers think, what motivates them, how their strategies have evolved over time, and how website owners have changed their own behaviors to keep up with their adversaries. You''ll also discover how you can best respond to patterns and incidents that pose a threat to your site, your business, and your customers. The book includes: A description of common bot detection techniques exploring the diffe

Read more less

Book Synopsis

Read more less

Book SynopsisThis title covers the most commonly used elements of Internet and Intranet technology and their development. It details the latest developments in research and covers new themes such as IP6, MPLS, and IS-IS routing, as well as explaining the function of standardization committees such as IETF, IEEE, and UIT. The book is illustrated with numerous examples and applications which will help the reader to place protocols in their proper context.Trade Review"This comprehensive volume on the technical specification of computer networks provides detailed information on the hardware, processes and protocols used by networks from local office LANs to the Internet." (Booknews, 1 June 2011)Table of ContentsChapter 1. Introduction 1 1.1. Why a network? 1 1.2. Network classification 2 1.3. Interconnection networks. 8 1.4. Examples of network utilization 10 1.5. The Internet network 11 1.6. Structure of this book 15 Chapter 2. Standardization and Wiring 19 2.1. The IEEE 802 committee 19 2.2. The standards 21 2.3. IEEE 802.1 addressing 27 2.4. Cabling rules 30 Chapter 3. Ethernet and IEEE 802.3 Protocols 37 3.1. History 37 3.2. Physical level 39 3.3. The fundamentals of CSMA/CD 45 3.4. Frame format 53 3.5. The 10BASE5 network 58 3.6. Devices for the 10BASE2 62 3.7. Twisted pair equipment 63 3.8. Fiber optics 79 3.9. Examples of Ethernet frames 87 3.10 Evolution of the Ethernet 92 Chapter 4. The LLC and SNAP Sublayers 95 4.1. Definition 95 4.2. LLC frames 97 4.3. Example 106 4.4. The SNAP layer 111 Chapter 5. Interconnection by Bridges: The Spanning Tree Algorithm 115 5.1. Introduction115 5.2. Transparent filtering bridges 116 5.3. Spanning tree algorithm 118 Chapter 6. Internet 131 6.1. The Internet players 131 Chapter 7. IP Protocols 143 7.1. Implementation of the TCP/IP protocols 143 7.2. Internet addressing 149 7.3. The IPv4 protocol (RFC 791, RFC 1122) 168 7.4. The ICMP (Internet Control Message Protocol) (RFC 792) 180 7.5. The IPv6 protocol 196 7.6. Tunnels 199 7.7. Configurations 202 7.8. Configuration of a Cisco router 204 7.9. IPv4 and multicast 207 Chapter 8. Level 4 Protocols: TCP, UDP and SCTP 213 8.1. Port notion 213 8.2. TCP (Transmission Control Protocol) (RFC 793) 215 8.3. The three protocol phases 218 8.4. The options 227 8.5. Adaptation to the environment 230 8.6. TCP flow control 239 8.7. Study of TCP by simulations 252 8.8. Network consideration of TCP 263 8.9. The UDP (user datagram protocol) (RFC 768) 275 8.10. SCTP 283 Chapter 9. Address Resolution and Automatic Configuration Protocols 299 9.1. Introduction 299 9.2. The address resolution protocol (ARP) 300 9.3. Neighbor discovery in IPv6 308 9.4. Initialization and auto-configuration 309 9.5. The domain name server (DNS) (RFC 1034, RFC 1035) 333 Chapter 10. Routing Protocols 367 10.1. Routing tables 367 10.2. Equipment classification 368 10.3. Routing table configuration 369 10.4. Station or router? 373 10.5. High-speed router 374 10.6. Router classification 375 10.7. Routing protocols 376 10.8. Autonomous systems 376 Chapter 11. Internal Routing Protocols 381 11.1. The Distant Vector algorithm 381 11.2. Link State algorithm 396 11.3. The OSPF protocol 403 11.4. IS-IS 434 Chapter 12. External Routing Protocols 453 12.1. Path announcing 453 12.2. The interconnection points 461 12.3. The symmetry of routes 461 12.4. BGP (border gateway protocol) 462 12.5. Route selection rules 480 12.6. BGP traffic analysis 481 12.7. Reduction of oscillations 485 12.8. Routing limit in the Internet 486 Chapter 13. Virtual Local Networks 487 13.1. Definition 487 13.2. Multicast data management 488 13.3. Virtual networks 497 Chapter 14. MPLS (Multi Protocol Label Switching) 507 14.1. Routing protocols’ limits 507 14.2. MPLS header format 510 14.3. Principles of operation 513 14.4. MPLS label D distribution protocols 518 14.5. Traffic engineering 525 Chapter 15. IP on Point-to-Point Links: PPP 529 15.1. Serial links 530 15.2. SLIP (Serial Link IP, RFC 1055) 533 15.3. PPP (point-to-point protocol, RFC 1661) 535 15.4. Configuration of routers 560 15.5. The RADIUS protocol 560 15.6. PPP over X.25 (RFC 1598) 561 15.7. PPP over high-speed networks 561 15.8. Bridging with PPP (RFC 1638) 561 15.9. ADSL network architecture 565 Chapter 16. Network Administration 571 16.1. Vocabulary and concepts 571 16.2. ASN.1 (Abstract Syntax Notation) 574 16.3. Definition of the MIB SNMP (RFC 1213) 579 16.4. Format of SNMPvl messages (RFC 1157) 581 16.5. Formats of SNMPv2 messages (RFC 1905) 587 16.6. Examples of SNMPvl traffic 590 16.7. MIB example 594 16.8. Other MIBs 607 Chapter 17. Security 613 17.1. Risks 613 17.2. Filtering routers 614 17.3. Bastion 622 17.4. Proxy 623 17.5. NAT (Network Address Translator, RFC 1631) 624 Chapter 18. Flow Management 627 18.1. Quality of service 627 18.2. Flow notion 630 18.3. Flow management 631 18.4. Flow measurements 644 18.5. Integration of services on the Internet 648 18.6. Differentiated services 675 18.7. Perspectives 677 Bibliography 679 Index 681

Read more less

Book SynopsisThis book provides a thorough examination and analysis of cutting-edge research and security solutions in wireless and mobile networks. It begins with coverage of the basic security concepts and fundamentals which underpin and provide the knowledge necessary for understanding and evaluating security issues, challenges, and solutions. This material will be of invaluable use to all those working in the network security field, and especially to the many people entering the field. The next area of focus is on the security issues and available solutions associated with off-the-shelf wireless and mobile technologies such as Bluetooth, WiFi, WiMax, 2G, and 3G. There is coverage of the security techniques used to protect applications downloaded by mobile terminals through mobile cellular networks, and finally the book addresses security issues and solutions in emerging wireless and mobile technologies such as ad hoc and sensor networks, cellular 4G and IMS networks.Table of ContentsIntroduction. xvii PART 1. Basic Concepts 1 Chapter 1. Introduction to Mobile and Wireless Networks 3 Hakima CHAOUCHI and Tara ALI YAHIYA 1.1. Introduction 3 1.2. Mobile cellular networks 4 1.3. IEEE wireless networks 13 1.4. Mobile Internet networks 32 1.5. Current trends 42 1.6. Conclusions 44 1.7. Bibliography 45 Chapter 2. Vulnerabilities of Wired and Wireless Networks 47 Artur HECKER 2.1. Introduction 47 2.2. Security in the digital age 48 2.3. Threats and risks to telecommunications systems 55 2.4. From wireline vulnerabilities to vulnerabilities in wireless communications 67 2.5. Conclusions 70 2.6. Bibliography 71 Chapter 3. Fundamental Security Mechanisms 73 Maryline LAURENT-MAKNAVICIUS, Hakima CHAOUCHI and Olivier PAUL 3.1. Introduction 73 3.2. Basics on security 73 3.3. Secure communication protocols and VPN implementation 88 3.4. Authentication 105 3.5. Access control 118 3.6. Conclusions126 3.7. Bibliography 126 Chapter 4. Wi-Fi Security Dedicated Architectures 131 Franck VEYSSET, Laurent BUTTI and Jerôme RAZNIEWSKI 4.1. Introduction 131 4.2. Hot spot architecture: captive portals131 4.3. Wireless intrusion detection systems (WIDS) 137 4.4. Wireless honeypots 145 Chapter 5. Multimedia Content Watermarking 149 Mihai MITREA and Françoise PRÊTEUX 5.1. Introduction 149 5.2. Robust watermarking: a new challenge for the information society 150 5.3. Different constraints for different types of media 157 5.4. Toward the watermarking theoretical model 172 5.5. Discussion and perspectives 188 5.6. Conclusion 195 5.7. Bibliography 196 PART 2. Off-the Shelf Technologies 203 Chapter 6. Bluetooth Security 205 Franck GILLET 6.1. Introduction 205 6.2. Bluetooth technical specification 207 6.3. Bluetooth security 220 6.4. Conclusion 228 6.5. Bibliography 229 Chapter 7. Wi-Fi Security 231 Guy PUJOLLE 7.1. Introduction 231 7.2. Attacks on wireless networks 232 7.3. Security in the IEEE 802.11 standard 235 7.4. Security in 802.1x 245 7.5. Security in 802.11i 249 7.6. Authentication in wireless networks 258 7.7. Layer 3 security mechanisms 263 7.8. Bibliography 270 Chapter 8. WiMAX Security 271 Pascal URIEN, translated by Léa URIEN 8.1. Introduction 271 8.2. WiMAX low layers 276 8.3. Security according to 802.16-2004 283 8.4. Security according to the IEEE-802.16e standard 293 8.5. The role of the smart card in WiMAX infrastructures 308 8.6. Conclusion 311 8.7. Glossary 311 8.8. Bibliography 313 Chapter 9. Security in Mobile Telecommunication Networks 315 Jérôme HÄRRI and Christian BONNET 9.1. Introduction 315 9.2. Signaling 317 9.3. Security in the GSM 326 9.4. GPRS security 338 9.5. 3G security 349 9.6. Network interconnection 356 9.7. Conclusion 357 9.8. Bibliography 358 Chapter 10. Security of Downloadable Applications 361 Pierre CRÉGUT, Isabelle RAVOT and Cuihtlauac ALVARADO 10.1. Introduction 361 10.2. Opening the handset 362 10.3. Security policy 363 10.4. The implementation of a security policy 368 10.5. Execution environments for active contents 370 10.6. Validation of active contents 382 10.7. Detection of attacks 391 10.8. Conclusion 402 10.9. Bibliography 404 PART 3. Emerging Technologies 409 Chapter 11. Security in Next Generation Mobile Networks 411 Jérôme HÄRRI and Christian BONNET 11.1. Introduction 411 11.2. The SIP 414 11.3. VoIP 418 11.4. IP Multimedia Subsystem (IMS) 422 11.5. 4G security 429 11.6. Confidentiality 431 11.7. Conclusion 433 11.8. Bibliography 434 Chapter 12. Security of IP-Based Mobile Networks 437 Jean-Michel COMBES, Daniel MIGAULT, Julien BOURNELLE, Hakima CHAOUCHI and Maryline LAURENT-MAKNAVICIUS 12.1. Introduction 437 12.2. Security issues related to mobility 438 12.3. Mobility with MIPv6 442 12.4. Mobility with Mobile IPv4 457 12.5. Mobility with MOBIKE 460 12.6. IP mobility with HIP and NetLMM 462 12.7. Conclusions 467 12.8. Glossary 468 12.9. Bibliography 470 Chapter 13. Security in Ad Hoc Networks 475 Jean-Marie ORSET and Ana CAVALLI 13.1. Introduction 475 13.2. Motivations and application fields 475 13.3. Routing protocols 479 13.4. Attacks to routing protocols 484 13.5. Security mechanisms 490 13.6. Auto-configuration 514 13.7. Conclusion 519 13.8. Bibliography 521 Chapter 14. Key Management in Ad Hoc Networks 525 Mohamed SALAH BOUASSIDA, Isabelle CHRISMENT and Olivier FESTOR 14.1. Introduction 525 14.2. Authentication issue within ad hoc networks 526 14.3. Group key management within ad hoc networks 534 14.4. Discussions 554 14.5. Conclusions 560 14.6. Bibliography 561 Chapter 15. Wireless Sensor Network Security 565 José-Marcos NOGUEIRA, Hao-Chi WONG, Antonio A.F. LOUREIRO, Chakib BEKARA, Maryline LAURENT-MAKNAVICIUS, Ana Paula RIBEIRO DA SILVA, Sérgio de OLIVEIRA and Fernando A. TEIXEIRA 15.1. Introduction 565 15.2. Attacks on wireless sensor networks and counter-measures 567 15.3. Prevention mechanisms: authentication and traffic protection 571 15.4. Case study: centralized and passive intruder detection 582 15.5. Case study: decentralized intrusion detection 589 15.6. Case study: intrusion tolerance with multiple routes 598 15.7. Conclusion 607 15.8. Bibliography 609 Chapter 16. Key Management in Wireless Sensor Networks 613 Chakib BEKARA and Maryline LAURENT-MAKNAVICIUS 16.1. Introduction 613 16.2. Introduction to key management 614 16.3. Security needs of WSNs 616 16.4. Key management problems in WSNs 617 16.5. Metric for evaluating key management protocols in WSNs 620 16.6. Classification of key management protocols in WSNs 621 16.7. Notations and assumptions 622 16.8. Broadcast source authentication protocols 623 16.9. Probabilistic key management protocols 627 16.10. Deterministic key management protocols 631 16.11. Hybrid key management protocols 637 16.12. Comparison of key management protocols in WSNs 641 16.13. Conclusion 646 16.14. Bibliography 647 Conclusion 649 List of Authors 653 Index 657

Read more less

Book SynopsisNetworked Control Systems (NCS) is a growing field of application and calls for the development of integrated approaches requiring multidisciplinary skills in control, real-time computing and communication protocols. This book describes co-design approaches, and establishes the links between the QoC (Quality of Control) and QoS (Quality of Service) of the network and computing resources. The methods and tools described in this book take into account, at design level, various parameters and properties that must be satisfied by systems controlled through a network. Among the important network properties examined are the QoC, the dependability of the system, and the feasibility of the real-time scheduling of tasks and messages. Correct exploitation of these approaches allows for efficient design, diagnosis, and implementation of the NCS. This book will be of great interest to researchers and advanced students in automatic control, real-time computing, and networking domains, and to engineers tasked with development of NCS, as well as those working in related network design and engineering fields.Table of ContentsForeword xiiiDominique SAUTER Introduction and Problem Statement 1Christophe AUBRUN, Daniel SIMON and Ye-Qiong SONG I.1 Networked control systems and control design challenges 2 I.2 Control design: from continuous time to networked implementation 4 I.3 Timing parameter assignment 6 I.4 Control and task/message scheduling 8 I.5 Diagnosis and fault tolerance in NCS 10 I.6 Co-design approaches 11 I.7 Outline of the book 12 I.8 Bibliography 15 Chapter 1 Preliminary Notions and State of the Art 19Christophe AUBRUN, Daniel SIMON and Ye-Qiong SONG 1.1.Overview 19 1.2 Preliminary notions on real-time scheduling 20 1.3 Control aware computing 26 1.4 Feedback-scheduling basics 30 1.5 Fault diagnosis of NCS with network-induced effects 43 1.6 Summary 53 1.7.Bibliography 53 Chapter 2 Computing-aware Control 63Mongi BEN GAID, David ROBERT, Olivier SENAME, Alexandre SEURET and Daniel SIMON 2.1.Overview 63 2.2 Robust control w.r.t computing and networking-induced latencies 65 2.3 Weakly hard constraints 76 2.4 LPV adaptive variable sampling 89 2.5 Summary 98 2.6.Bibliography 99 Chapter 3 QoC-aware Dynamic Network QoS Adaptation 105Christophe AUBRUN, Belynda BRAHIMI, Jean-Philippe GEORGES, Guy JUANOLE, Gerard MOUNEY, Xuan Hung NGUYEN and Eric RONDEAU 3.1.Overview 105 3.2 Dynamic CAN message priority allocation according to the control application needs 107 3.3 Bandwidth allocation control for switched Ethernet networks 132 3.4 Conclusion 144 3.5.Bibliography 145 Chapter 4 Plant-state-based Feedback Scheduling 149Mongi BEN GAID, David ROBERT, Olivier SENAME and Daniel SIMON 4.1.Overview 149 4.2 Adaptive scheduling and varying sampling robust control 151 4.3 MPC-based integrated control and scheduling 156 4.4 A convex optimization approach to feedback scheduling 162 4.5 Control and real-time scheduling co-design via a LPV approach 170 4.6 Summary 177 4.7.Bibliography 181 Chapter 5 Overload Management Through Selective Data Dropping 185Flavia FELICIONI, Ning JIA, Francoise SIMONOT-LION and Ye-Qiong SONG 5.1 Introduction 185 5.2 Scheduling under (m, k)-firm constraint 188 5.3 Stability analysis of a multidimensional system 193 5.4 Optimized control and scheduling co-design 197 5.5 Plant-state-triggered control and scheduling adaptation and optimization 209 5.6 Conclusions 218 5.7.Bibliography 220 Chapter 6 Fault Detection and Isolation, Fault Tolerant Control 223Christophe AUBRUN, Cedric BERBRA, Sylviane GENTIL, Suzanne LESECQ and Dominique SAUTER 6.1 Introduction 223 6.2 FDI and FTC 224 6.3 Networked-induced effects 238 6.4 Pragmatic solutions 243 6.5 Advanced techniques 248 6.6 Conclusion and perspectives 262 6.7.Bibliography 262 Chapter 7 Implementation: Control and Diagnosis for an Unmanned Aerial Vehicle 267Cedric BERBRA, Sylviane GENTIL, Suzanne LESECQ and Daniel SIMON 7.1 Introduction 267 7.2 The quadrotor model, control and diagnosis 269 7.3 Simulation of the network 282 7.4.Hardware in the loop architecture 285 7.5 Experiments and results 290 7.6 Summary 302 7.7 Bibliography 303 Glossary and Acronyms 305 List of Authors 309 Index 313

Read more less

Book SynopsisThis work presents ad hoc networks and their characteristics. It explains a new protocol of routing with QoS as well as its implementation in a network simulator and compares it with the existing protocols. The book discusses the principle of the load balancing, treats the approaches of optimization of energy, and proposes a new approach with an analytical model that gives a better performance.Trade Review"This is a technical work appropriate for network architects and communication engineers and includes numerous diagrams, illustration and equations as well as appendix information on creating ad-hoc network simulation environments." (Booknews, 1 April 2011) "This is a technical work appropriate for network architects and communication engineers and includes numerous diagrams, illustration and equations as well as appendix information on creating ad-hoc network simulation environments." (Reference and Research Book News, 1 April 2011) Table of ContentsChapter 1. Introduction to Ad Hoc Networks 1 1.1. Introduction 1 1.2. Wireless networks and communications 2 1.3. Ad hoc networks (MANET) 8 1.4. Routing of ad hoc networks 15 1.5. Conclusion 22 Chapter 2. Routing in MANETs 23 2.1. Introduction 23 2.2. Internet routing protocols 24 2.3. Classification of routing protocols in MANET 28 2.4. Conclusion 47 Chapter 3. Performance Evaluation of OLSR and AODV Protocols 49 3.1. Introduction 49 3.2. The AODV protocol 50 3.3. The OLSR protocol 58 3.4. Simulation environment 74 3.5. Results and analysis 80 3.6. Conclusion 86 Chapter 4. Quality of Service in MANETs 89 4.1. Introduction 89 4.2. QoS: a definition 90 4.3. The OLSRQSUP protocol and QoS extensions 100 4.4. Conclusion 113 Chapter 5. Implementation and Simulation 115 5.1. Introduction 115 5.2. Implementation 116 5.3. Simulation 121 5.4. Conclusion 143 Chapter 6. Load Distribution in MANETs 145 6.1. Introduction 145 6.2. Previous approaches to the load-sharing problem 146 6.3. Analytical study of the load-sharing problem in an ad hoc network with shortest-path routing 156 6.4. Proposition 161 6.5. Performance evaluation of proposed load-balancing mechanisms 171 6.6. Conclusion 177 Chapter 7. Energy Optimization in Routing Protocols 179 7.1. Introduction 179 7.2. Energy optimization techniques 180 7.3. Energy minimizing routing models in ad hoc networks 188 7.4. Comparison of energy consumption for an ad hoc network routing protocols simulated in ns-2 198 7.5. Conclusion 210 Chapter 8. Wi-Fi Access for Ad Hoc Networks 211 8.1. Introduction 211 8.2. Wi-Fi network structure 212 8.3. Wi-Fi network architecture 225 8.4. Wi-Fi norms 231 8.5. 802.11n migration 237 8.6. Conclusion 239 Bibliography 241 APPENDICES 247 Appendix 1. The Ad Hoc Networks Simulator (ANS) 249 Appendix 2. TCL Script of OLSRQSUP Protocol 255 Appendix 3. Awk Script 261 Index 265

Read more less

Book SynopsisWithin the framework of the Sixth I-ESA International Conference, supported by the INTEROP VLab (International Virtual Laboratory on Enterprise Interoperability, http://www.interop-vlab.eu), three workshops and a Doctoral Symposium have been organized in order to strengthen some key topics related to interoperability for enterprise applications and software. The workshops were selected to complement the conference topics, leaving more time to researchers for brainstorming and then coming up, at the end of the workshops, with new research directions for the future. The goal of the workshop “Standards – a Foundation for Interoperability” is to increase awareness and understanding of interoperability standards as a fundamental need. The workshop “Use of MDI/SOA Concepts in Industry” promotes the application of MDI (Model-Driven Interoperability) combined with SOA (Services Oriented Architecture) and the associated technology (BPM, Enterprise Modeling, ontology, mediation, model transformation, etc.) in industry. The workshop on “Dynamic Management across Interoperating Enterprises” investigates the need for enhancements to current business management systems and processes to address the needs of global trading across enterprises utilizing the new service-oriented Internet. Finally, the Doctoral Symposium has given the opportunity for students involved in the preparation of their PhDs in this emerging area to present and discuss their research issues and ideas with senior researchers.Table of ContentsEditorial Hervé Panetto, Nacer Boudjlida xi Session 1. Standards – A Foundation for Interoperability 1 Standards Workshop Chairs’ Message Martin Zelm, David Chen 5 Standards for Enterprise Interoperation – How to Improve? Martin Zelm, Kurt Kosanke 7 Framework for Enterprise Interoperability and Maturity Model (CEN/ISO 11354) David Chen 15 Testing Interoperability Standards – A Test Case Generation Methodology Nenad Ivezic, Jungyub Woo 23 OMG Specifications for Enterprise Interoperability Brian Elvesæter, Arne-Jørgen Berre 31 Standards Creation and Adoption for SME Networks Piero De Sabbata, Nicola Gessa, Arianna Brutti, Cristiano Novelli, Angelo Frascella, Gianluca D’Agosta 41 The European Public Procurement Initiative and Standards for Information Exchange Tim McGrath 53 Challenges in Project Management Georgios Kapogiannis, Colin Piddington 61 Session 2. Use of MDI/SOA Concepts in Industry 67 MDI/SOA Workshop Chairs’ Message Guy Doumeingts, Martine Grandin-Dubost 71 Application of SHAPE Technologies in Production and Process Optimization Brian Elvesæter, Arne-Jørgen Berre, Einar Landre 73 An Exploration of Foundation Ontologies and Verification Methods for Manufacturing Knowledge Sharing R. Young, N. Chungoora, Z. Usman, N. Anjum, G. Gunendran, C. Palmer, J.A. Harding, K. Case, A.-F. Cutting-Decelle 83 ISTA3 Methodology Application Case Nabila Zouggar, Mickaël Romain, Guy Doumeingts, Sébastien Cazajous, Yves Ducq, Christophe Merlo, Martine Grandin-Dubost 95 Session 3. Doctoral Symposium 111 Doctoral Symposium Chair’s Message Jenny A. Harding 115 The Mediation Information System Engineering Project: Status and Perspectives N. Boissel-Dallier, F. Bénaben, H. Pingaud, J.-P. Lorré 117 Quality Measurement of Semantic Standards E.J.A. Folmer, P.H.W.M. Oude Luttighuis, J. van Hillegersberg 125 Towards a Model-Driven and Role-Configurable Methodology Suite for Enterprise and Service-Oriented Interoperability Brian Elvesæter, Arne-Jørgen Berre 133 Mediation Information System Engineering: Business and Logic Characterization in a Collaborative Situation W. Mu, F. Bénaben, H. Pingaud 139 Role of Semantic Web in the Changing Context of Enterprise Collaboration N. Khilwani, J. A. Harding 147 A Dynamic Knowledge Management Framework B. A. Piorkowski, J. X. Gao 155 Author Index 163

Read more less

Book SynopsisThis book summarizes the key Quality of Service technologies deployed in telecommunications networks: Ethernet, IP, and MPLS. The QoS of the network is made up of two parts: fault and resource management. Network operation quality is among the functions to be fulfilled in order to offer QoS to the end user. It is characterized by four parameters: packet loss, delay, jitter or the variation of delay over time, and availability. Resource management employs mechanisms that enable the first three parameters to be guaranteed or optimized. Fault management aims to ensure continuity of service.Table of ContentsPreface xi Chapter 1. Network Operation 1 1.1. Basic concepts 1 1.2. IP technology 9 1.3. The MPLS technology 14 1.4. The ICMP 19 1.5. Ethernet technology 22 Chapter 2. Characterizing Quality of Service 27 2.1. Quality of service functions 27 2.2. Quality of network operation 29 2.3. Requirements of applications 36 2.4. The service contract 44 Chapter 3. Transport Protocols 51 3.1. Introduction 51 3.2. The TCP 52 3.3. The UDP 59 3.4. The RTP 60 3.5. The RTCP 62 3.6. The DCCP 65 3.7. The SCTP 70 Chapter 4. Implementing Operation Quality 77 4.1. The architectural framework 77 4.2. Implementation of resource management 77 4.3. Implementing fault management 96 Chapter 5. IP Technology – Resource Management 101 5.1. Introduction 101 5.2. The DiffServ model 102 5.3. The IntServ model 109 5.4. The ARSVP protocol 123 Chapter 6. IP Technology – Fault Management 127 6.1. Introduction127 6.2. Hot Standby Router Protocol 128 6.3. Virtual Router Redundancy Protocol 132 6.4. OSPF protocol 134 6.5. Border Gateway Protocol 144 Chapter 7. MPLS Technology – Resource Management 153 7.1. Introduction 153 7.2. Support for DiffServ 154 7.3. Traffic engineering 158 Chapter 8. MPLS Technology – Fault Management 177 8.1. Introduction 177 8.2. The LDP 178 8.3. The RSVP-TE protocol 189 8.4. The FRR mechanism 193 Chapter 9. Ethernet Technology – Resource Management 203 9.1. Introduction 203 9.2. Priority management 204 9.3. Resource reservation 207 9.4. Flow control 216 9.5. The access network 217 9.6. The aggregation network 224 Chapter 10. Ethernet Technology – Fault Management 227 10.1. Introduction 227 10.2. The STP 228 10.3. The RSTP 233 10.4. The MSTP 237 10.5. Link aggregation 242 10.6. The aggregation network 246 Conclusion 251 Bibliography 255 Abbreviations 259 Index 265

Read more less

Book Synopsis“Computing Networks” explores the core of the new distributed computing infrastructures we are using today: the networking systems of clusters, grids and clouds. It helps network designers and distributed-application developers and users to better understand the technologies, specificities, constraints and benefits of these different infrastructures’ communication systems. Cloud Computing will give the possibility for millions of users to process data anytime, anywhere, while being eco-friendly. In order to deliver this emerging traffic in a timely, cost-efficient, energy-efficient, and reliable manner over long-distance networks, several issues such as quality of service, security, metrology, network-resource scheduling and virtualization are being investigated since 15 years. “Computing Networks” explores the core of clusters, grids and clouds networks, giving designers, application developers and users the keys to better construct and use these powerful infrastructures.Table of ContentsIntroduction 13 Chapter 1. From Multiprocessor Computers to the Clouds 21 1.1. The explosion of demand for computing power 21 1.2. Computer clusters 24 1.3. Computing grids 26 1.4. Computing in a cloud 32 1.5. Conclusion 36 Chapter 2. Utilization of Network Computing Technologies 39 2.1. Anatomy of a distributed computing application 39 2.2. Programming models of distributed parallel applications 52 2.3. Coordination of distributed resources in a grid 57 2.4. Conclusion 60 Chapter 3. Specificities of Computing Networks 63 3.1. Typology of computing networks 63 3.2. Network transparency 68 3.3. Detailed analysis of characteristics expected from protocols 78 3.4. Conclusion 85 Chapter 4. The Challenge of Latency in Computing Clusters 87 4.1. Key principles of high-performance networks for clusters 88 4.2. Software support for high-performance networks 90 4.3. Description of the main high-performance networks 99 4.4. Convergence between fast and traditional networks 108 4.5. Conclusion 111 Chapter 5. The Challenge of Throughput and Distance 113 5.1. Obstacles to high rate 113 5.2. Operating principle and limits of TCP congestion control 115 5.3. Limits of TCP over long distances 120 5.4. Configuration of TCP for high speed 122 5.5. Alternative congestion-control approaches to that of standard TCP 126 5.6. Exploration of TCP variants for very high rate 133 5.7. Conclusion 136 Chapter 6. Measuring End-to-End Performances 139 6.1. Objectives of network measurement and forecast in a grid 139 6.2. Problem and methods 144 6.3. Grid network-performance measurement systems 155 6.4. Performance forecast 164 6.5. Conclusion 170 Chapter 7. Optical Technology and Grids 171 7.1. Optical networks and switching paradigms 172 7.2. Functional planes of transport networks 179 7.3. Unified control plane: GMPLS/automatic switched transport networks 184 Chapter 8. Bandwidth on Demand 189 8.1. Current service model: network neutrality 190 8.2. Peer model for bandwidth-delivery services 194 8.3. Overlay model for bandwidth-providing services 196 8.4. Bandwidth market 200 8.5. Conclusion 201 Chapter 9. Security of Computing Networks 203 9.1. Introductory example 203 9.2. Principles and methods 205 9.3. Communication security 212 9.4. Network virtualization and security 213 9.5. Conclusion 216 Chapter 10. Practical Guide for the Configuration of High-speed Networks 217 10.1. Hardware configuration 218 10.2. Importance of the tuning of TCP parameters 221 10.3. Short practical tuning guide 222 10.4. Use of multi-flow 226 10.5. Conclusion 228 Conclusion: From Grids to the Future Internet 229 Bibliography 235 Acronyms and Definitions 251 Index 263

Read more less

Book SynopsisThis book gives a practical approach to modeling and analyzing communication protocols using UML 2. Network protocols are always presented with a point of view focusing on partial mechanisms and starting models. This book aims at giving the basis needed for anybody to model and validate their own protocols. It follows a practical approach and gives many examples for the description and analysis of well known basic network mechanisms for protocols. The book firstly shows how to describe and validate the main protocol issues (such as synchronization problems, client-server interactions, layer organization and behavior, etc.) in an easy and understandable way. To do so, the book considers and presents the main traditional network examples (e.g. unidirectional flows, full-duplex com-munication, error recovering, alternating bit). Finally, it presents the outputs resulting from a few simulations of these UML models. Other books usually only focus either on teaching UML or on analyzing network protocols, however this book will allow readers to model network protocols using a new perspective and integrating these two views, so facilitating their comprehension and development. Any university student studying in the field of computing science, or those working in telecommunications, embedded systems or networking will find this book a very useful addition.Trade Review"Students and engineers in computer science and related fields may find the material of interest." (Book News, 1 October 2011) Table of ContentsPreface xi Chapter 1. Why Use UML to Model Network Protocols? 1 1.1. Modeling network protocols 1 1.2. UML as a common language 14 1.3. Chapter summary 28 1.4. Bibliography 28 Chapter 2. Simple Transmission 31 2.1. Introduction 31 2.2. Echo 31 2.3. Unidirectional: simple data sending 42 2.4. Full duplex: simple data sending 52 2.5. Chapter summary 73 2.6. Bibliography 73 Chapter 3. Simple Chat Application 75 3.1. Introduction 75 3.2. Requirements 75 3.3. Analysis 76 3.4. Architecture design 88 3.5. Detailed design 89 3.6. Simple chat simulation 101 3.7. Chapter summary 130 3.8. Bibliography 131 Chapter 4. Non-reliable Transmission Mediums 133 4.1. Introduction 133 4.2. Requirements 134 4.3. Analysis 135 4.4. Architecture design 147 4.5. Detailed design 150 4.6. Validation 160 4.7. Chapter summary 179 4.8. Bibliography 179 Chapter 5. Simple Transport Protocol 181 5.1. Introduction 181 5.2. Requirements 182 5.3. The Alternating Bit Protocol 182 5.4. Analysis 191 5.5. Architecture design 200 5.6. Detailed design 204 5.7. Simulations 217 5.8. Further considerations 235 5.9. Chapter summary 238 5.10. Bibliography 239 Appendix. Detailed Diagrams of the Simple Transport Protocol 241 A.1. State machines for the Application Data Unit Manager (Simple Transport Protocol) 242 A.2. Detailed simulations of the Simple Transport Protocol 245 Index 259

Read more less

Book SynopsisThe book presents some key mathematical tools for the performance analysis of communication networks and computer systems. Communication networks and computer systems have become extremely complex. The statistical resource sharing induced by the random behavior of users and the underlying protocols and algorithms may affect Quality of Service. This book introduces the main results of queuing theory that are useful for analyzing the performance of these systems. These mathematical tools are key to the development of robust dimensioning rules and engineering methods. A number of examples illustrate their practical interest.Trade Review“Overall, I was very glad to read the present book which is an invaluable resource for master, postgraduate students undertaking courses in electrical engineering or computer science. In addition it is a good reference for researchers and engineers in the field of performance mod-elling of modern info-communication systems.” (Zentralblatt MATH, 1 December 2012)Table of ContentsPreface xi Chapter 1. Introduction 1 1.1. Motivation 1 1.2. Networks 2 1.3. Traffic 3 1.4. Queues 5 1.5. Structure of the book 5 1.6. Bibliography 6 Chapter 2. Exponential Distribution 9 2.1. Definition 9 2.2. Discrete analog 10 2.3. An amnesic distribution 12 2.4. Minimum of exponential variables 13 2.5. Sum of exponential variables 15 2.6. Random sum of exponential variables 16 2.7. A limiting distribution 16 2.8. A “very” random variable 17 2.9. Exercises 18 2.10. Solution to the exercises 20 Chapter 3. Poisson Processes 23 3.1. Definition 23 3.2. Discrete analog 25 3.3. An amnesic process 27 3.4. Distribution of the points of a Poisson process 27 3.5. Superposition of Poisson processes 28 3.6. Subdivision of a Poisson process 29 3.7. A limiting process 30 3.8. A “very” random process 30 3.9. Exercises 31 3.10. Solution to the exercises 32 Chapter 4. Markov Chains 35 4.1. Definition 36 4.2. Transition probabilities 36 4.3. Periodicity 37 4.4. Balance equations 38 4.5. Stationary measure 38 4.6. Stability and ergodicity 39 4.7. Finite state space 40 4.8. Recurrence and transience 41 4.9. Frequency of transition 42 4.10. Formula of conditional transitions 43 4.11. Chain in reverse time 43 4.12. Reversibility 44 4.13. Kolmogorov’s criterion 46 4.14. Truncation of a Markov chain 47 4.15. Random walk 49 4.16. Exercises 51 4.17. Solution to the exercises 52 Chapter 5. Markov Processes 57 5.1. Definition 57 5.2. Transition rates 58 5.3. Discrete analog 59 5.4. Balance equations 60 5.5. Stationary measure 61 5.6. Stability and ergodicity 61 5.7. Recurrence and transience 63 5.8. Frequency of transition 63 5.9. Virtual transitions 64 5.10. Embedded chain 66 5.11. Formula of conditional transitions 68 5.12. Process in reverse time 68 5.13. Reversibility 70 5.14. Kolmogorov’s criterion 70 5.15. Truncation of a reversible process 71 5.16. Product of independent Markov processes 73 5.17. Birth–death processes 74 5.18. Exercises 74 5.19. Solution to the exercises 78 Chapter 6. Queues 87 6.1. Kendall’s notation 87 6.2. Traffic and load 88 6.3. Service discipline 90 6.4. Basic queues 91 6.5. A general queue 97 6.6. Little’s formula 99 6.7. PASTA property 101 6.8. Insensitivity 101 6.9. Pollaczek–Khinchin’s formula 102 6.10. The observer paradox 105 6.11. Exercises 108 6.12. Solution to the exercises 111 Chapter 7. Queuing Networks 119 7.1. Jackson networks 119 7.2. Traffic equations 120 7.3. Stationary distribution 122 7.4. MUSTA property 124 7.5. Closed networks 125 7.6. Whittle networks 127 7.7. Kelly networks 129 7.8. Exercises 131 7.9. Solution to the exercises 133 Chapter 8. Circuit Traffic 141 8.1. Erlang’s model 141 8.2. Erlang’s formula 142 8.3. Engset’s formula 145 8.4. Erlang’s waiting formula 149 8.5. The multiclass Erlang model 151 8.6. Kaufman–Roberts formula 154 8.7. Network models 155 8.8. Decoupling approximation 157 8.9. Exercises 157 8.10. Solutions to the exercises 160 Chapter 9. Real-time Traffic 167 9.1. Flows and packets 167 9.2. Packet-level model 168 9.3. Flow-level model 171 9.4. Congestion rate 173 9.5. Mean throughput 174 9.6. Loss rate 176 9.7. Multirate model 177 9.8. Recursive formula 179 9.9. Network models 179 9.10. Gaussian approximation 181 9.11. Exercises 183 9.12. Solution to the exercises 185 Chapter 10. Elastic Traffic 191 10.1. Bandwidth sharing 191 10.2. Congestion rate 194 10.3. Mean throughput 195 10.4. Loss rate 197 10.5. Multirate model 199 10.6. Recursive formula 202 10.7. Network model 204 10.8. Exercises 205 10.9. Solution to the exercises 208 Chapter 11. Network Performance 215 11.1. IP access networks 215 11.2. 2G mobile networks 219 11.3. 3G mobile networks 223 11.4. 3G+ mobile networks 228 11.5. WiFi access networks 231 11.6. Data centers 238 11.7. Cloud computing 241 11.8. Exercises 242 11.9. Solution to the exercises 245 Index 251

Read more less

Book SynopsisNetwork coding, a relatively new area of research, has evolved from the theoretical level to become a tool used to optimize the performance of communication networks – wired, cellular, ad hoc, etc. The idea consists of mixing “packets” of data together when routing them from source to destination. Since network coding increases the network performance, it becomes a tool to enhance the existing protocols and algorithms in a network or for applications such as peer-to-peer and TCP. This book delivers an understanding of network coding and provides a set of studies showing the improvements in security, capacity and performance of fixed and mobile networks. This is increasingly topical as industry is increasingly becoming more reliant upon and applying network coding in multiple applications. Many cases where network coding is used in routing, physical layer, security, flooding, error correction, optimization and relaying are given – all of which are key areas of interest. Network Coding is the ideal resource for university students studying coding, and researchers and practitioners in sectors of all industries where digital communication and its application needs to be correctly understood and implemented. Contents 1. Network Coding: From Theory to Practice, Youghourta Benfattoum, Steven Martin and Khaldoun Al Agha. 2. Fountain Codes and Network Coding for WSNs, Anya Apavatjrut, Claire Goursaud, Katia Jaffrès-Runser and Jean-Marie Gorce. 3. Switched Code for Ad Hoc Networks: Optimizing the Diffusion by Using Network Coding, Nour Kadi and Khaldoun Al Agha. 4. Security by Network Coding, Katia Jaffrès-Runser and Cédric Lauradoux. 5. Security for Network Coding, Marine Minier, Yuanyuan Zhang and Wassim Znaïdi. 6. Random Network Coding and Matroids, Maximilien Gadouleau. 7. Joint Network-Channel Coding for the Semi-Orthogonal MARC: Theoretical Bounds and Practical Design, Atoosa Hatefi, Antoine O. Berthet and Raphael Visoz. 8. Robust Network Coding, Lana Iwaza, Marco Di Renzo and Michel Kieffer. 9. Flow Models and Optimization for Network Coding, Eric Gourdin and Jeremiah Edwards.Table of ContentsChapter 1. Network Coding: From Theory to Practice 1 Youghourta BENFATTOUM, Steven MARTIN and Khaldoun AL AGHA 1.1. Introduction 1 1.2. Theoretical approach 2 1.3. Practical approach 10 1.4. Conclusion 23 1.5. Bibliography 24 Chapter 2. Fountain Codes and Network Coding for WSNs 27 Anya APAVATJRUT, Claire GOURSAUD, Katia JAFFRÈS-RUNSER and Jean-Marie GORCE 2.1. Introduction 27 2.2. Fountain codes 29 2.3. Fountain codes in WSNs 41 2.4. Fountain codes and network code for sensor networks 49 2.5. Conclusion 66 2.6. Bibliography 67 Chapter 3. Switched Code for Ad Hoc Networks: Optimizing the Diffusion by Using Network Coding 73 Nour KADI and Khaldoun AL AGHA 3.1. Abstract 73 3.2. Introduction 74 3.3. Diffusion in ad hoc networks 77 3.4. Diffusion and network coding 78 3.5. Switched code: incorporate erasure codes with network coding 83 3.6. Decoding function of switched code 85 3.7. Design and analysis of a new distribution 87 3.8. Conclusion 96 3.9. Bibliography 97 Chapter 4. Security by Network Coding 99 Katia JAFFRÈS-RUNSER and Cédric LAURADOUX 4.1. Introduction 99 4.2. Attack models 100 4.3. Security for a wiretap network 105 4.4. Algebraic security criteria 106 4.5. Conclusion 112 4.6. Bibliography 112 Chapter 5. Security for Network Coding 115 Marine MINIER, Yuanyuan ZHANG and Wassim ZNAÏDI 5.1. Introduction 115 5.2. Attack models 116 5.3. Confidentiality 128 5.4. Integrity and authenticity solutions 130 5.5. Conclusion 142 5.6. Bibliography 143 Chapter 6. Random Network Coding and Matroids 147 Maximilien GADOULEAU 6.1. Protocols for non-coherent communication 148 6.2. Transmission model based on flats of matroid 153 6.3. Parameters for errorless communication 160 6.4. Error-correcting codes for matroids 167 6.5. Matroid codes for network coding 173 6.6. Conclusion 180 6.7. Bibliography 181 Chapter 7. Joint Network-Channel Coding for the Semi-Orthogonal MARC: Theoretical Bounds and Practical Design 185 Atoosa HATEFI, Antoine O. BERTHET and Raphaël VISOZ 7.1. Introduction 185 7.2. System model 191 7.3. Information-theoretic analysis 195 7.4. Joint network channel coding and decoding 203 7.5. Separate network channel coding and decoding 212 7.6. Numerical results 214 7.7. Conclusion 226 7.8. Appendix. MAC outage performance of high SNR 228 7.9. Bibliography 230 Chapter 8. Robust Network Coding 235 Lana IWAZA, Marco Di RENZO and Michel KIEFFER 8.1. Coherent network error-correction codes 237 8.2 Codes for noncoherent networks, random codes 240 8.3. Codes for noncoherent networks, subspace codes 242 8.4. Joint network–channel coding/decoding 245 8.5. Joint source–network coding/decoding 249 8.6. Conclusion 256 8.7. Acknowledgments 257 8.8. Bibliography 257 Chapter 9. Flow Models and Optimization for Network Coding 265 Eric GOURDIN and Jeremiah EDWARDS 9.1. Introduction 265 9.2. Some reminders on flow problems in graphs 267 9.3. Flow models for multicast traffic 272 9.4. Flow models for network coding 277 9.5. Conclusion 284 9.6. Bibliography 285 List of Authors 289 Index 291

Read more less

Book SynopsisThis book provides a comprehensive overview of the subject of channel coding. It starts with a description of information theory, focusing on the quantitative measurement of information and introducing two fundamental theorems on source and channel coding. The basics of channel coding in two chapters, block codes and convolutional codes, are then discussed, and for these the authors introduce weighted input and output decoding algorithms and recursive systematic convolutional codes, which are used in the rest of the book. Trellis coded modulations, which have their primary applications in high spectral efficiency transmissions, are then covered, before the discussion moves on to an advanced coding technique called turbocoding. These codes, invented in the 1990s by C. Berrou and A. Glavieux, show exceptional performance. The differences between convolutional turbocodes and block turbocodes are outlined, and for each family, the authors present the coding and decoding techniques, together with their performances. The book concludes with a chapter on the implementation of turbocodes in circuits. As such, anyone involved in the areas of channel coding and error correcting coding will find this book to be of invaluable assistance.Trade Review"The book offers a very good overview of channel coding topics, selected and proposed by a group of experienced researchers including inventors of turbocodes from ENST Bretagne . . . The presented material is well illustrated with examples, referring to both encoding and decoding schemes . . . The most valuable part of the book consists of chapters from 3 to 7 and is connected with convolutional codes, trellis coded modulations and especially turbocodes." (Einzelbeleg, 2010) "This book provides a comprehensive overview of the subject of channel coding . . . as such, anyone involved in the area of channel coding and error correcting coding will find this book to be of invaluable assistance." (Mathematical Reviews, 2010) Table of ContentsHomage to Alain Glavieux xv Chapter 1. Information Theory 1 Gérard BATTAIL 1.1. Introduction: the Shannon paradigm 1 1.2. Principal coding functions 5 1.2.1. Source coding 5 1.2.2. Channel coding 6 1.2.3. Cryptography 7 1.2.4. Standardization of the Shannon diagram blocks 8 1.2.5. Fundamental theorems 9 1.3. Quantitative measurement of information 9 1.3.1. Principle 9 1.3.2. Measurement of self-information 10 1.3.3. Entropy of a source 11 1.3.4. Mutual information measure 12 1.3.5. Channel capacity 14 1.3.6. Comments on the measurement of information 15 1.4. Source coding 15 1.4.1. Introduction 15 1.4.2. Decodability, Kraft-McMillan inequality 16 1.4.3. Demonstration of the fundamental theorem 17 1.4.4. Outline of optimal algorithms of source coding 18 1.5. Channel coding 19 1.5.1. Introduction and statement of the fundamental theorem 19 1.5.2. General comments 20 1.5.3. Need for redundancy 20 1.5.4. Example of the binary symmetric channel 21 1.5.5. A geometrical interpretation 25 1.5.6. Fundamental theorem: Gallager’s proof 26 1.6. Channels with continuous noise 32 1.6.1. Introduction 32 1.6.2. A reference model in physical reality: the channel with Gaussian additive noise 32 1.6.3. Communication via a channel with additive white Gaussian noise 35 1.6.4. Channel with fadings 37 1.7. Information theory and channel coding 38 1.8. Bibliography 40 Chapter 2. Block Codes 41 Alain POLI 2.1. Unstructured codes 41 2.1.1. The fundamental question of message redundancy 41 2.1.2. Unstructured codes 42 2.2. Linear codes 44 2.2.1. Introduction 44 2.2.2. Properties of linear codes 44 2.2.3. Dual code 46 2.2.4. Some linear codes 50 2.2.5. Decoding of linear codes 51 2.3. Finite fields 53 2.3.1. Basic concepts 53 2.3.2. Polynomial modulo calculations: quotient ring 53 2.3.3. Irreducible polynomial modulo calculations: finite field 54 2.3.4. Order and the opposite of an element of F2[X]/(p(X)) 54 2.3.5. Minimum polynomials 59 2.3.6. The field of nth roots of unity 60 2.3.7. Projective geometry in a finite field 61 2.4. Cyclic codes 62 2.4.1. Introduction 62 2.4.2. Base, coding, dual code and code annihilator 63 2.4.3. Certain cyclic codes 68 2.4.4. Existence and construction of cyclic codes 74 2.4.5. Applications of cyclic codes 82 2.5. Electronic circuits 82 2.5.1. Basic gates for error correcting codes 82 2.5.2. Shift registers 83 2.5.3. Circuits for the correct codes 83 2.5.4. Polynomial representation and representation to the power of a primitive representation for a field 87 2.6. Decoding of cyclic codes 88 2.6.1. Meggitt decoding (trapping of bursts) 88 2.6.2. Decoding by the DFT 89 2.6.3. FG-decoding 94 2.6.4. Berlekamp-Massey decoding 99 2.6.5. Majority decoding 105 2.6.6. Hard decoding, soft decoding and chase decoding 110 2.7. 2D codes 111 2.7.1. Introduction 111 2.7.2. Product codes 112 2.7.3. Minimum distance of 2D codes 112 2.7.4. Practical examples of the use of 2D codes 112 2.7.5. Coding 112 2.7.6. Decoding 113 2.8. Exercises on block codes 113 2.8.1. Unstructured codes 113 2.8.2. Linear codes 114 2.8.3. Finite bodies 117 2.8.4. Cyclic codes 119 2.8.5. Exercises on circuits 123 Chapter 3. Convolutional Codes 129 Alain GLAVIEUX and Sandrine VATON 3.1. Introduction 129 3.2. State transition diagram, trellis, tree 135 3.3. Transfer function and distance spectrum 137 3.4. Perforated convolutional codes 140 3.5. Catastrophic codes 142 3.6. The decoding of convolutional codes 142 3.6.1. Viterbi algorithm 143 3.6.2. MAP criterion or BCJR algorithm 156 3.6.3. SubMAP algorithm 169 3.7. Performance of convolutional codes 172 3.7.1. Channel with binary input and continuous output 173 3.7.2. Channel with binary input and output 180 3.8. Distance spectrum of convolutional codes 182 3.9. Recursive convolution codes 184 Chapter 4. Coded Modulations 197 Ezio BIGLIERI 4.1. Hamming distance and Euclidean distance 197 4.2. Trellis code 200 4.3. Decoding 201 4.4. Some examples of TCM 201 4.5. Choice of a TCM diagram 205 4.6. TCM representations 207 4.7. TCM transparent to rotations 209 4.7.1. Partitions transparent to rotations 211 4.7.2. Transparent trellis with rotations 212 4.7.3. Transparent encoder 213 4.7.4. General considerations 215 4.8. TCM error probability 215 4.8.1. Upper limit of the probability of an error event 215 4.8.2. Examples 226 4.8.3. Calculation of áfree 228 4.9. Power spectral density 232 4.10. Multi-level coding 234 4.10.1. Block coded modulation 235 4.10.2. Decoding of multilevel codes by stages 237 4.11. Probability of error for the BCM 238 4.11.1. Additive Gaussian channel 239 4.11.2. Calculation of the transfer function 240 4.12. Coded modulations for channels with fading 241 4.12.1. Modeling of channels with fading 241 4.12.2. Rayleigh fading channel: Euclidean distance and Hamming distance 247 4.13. Bit interleaved coded modulation (BICM) 251 4.14. Bibliography 253 Chapter 5. Turbocodes 255 Claude BERROU, Catherine DOUILLARD, Michel JÉZÉQUEL and Annie PICART 5.1. History of turbocodes 255 5.1.1. Concatenation 256 5.1.2. Negative feedback in the decoder 256 5.1.3. Recursive systematic codes 258 5.1.4. Extrinsic information 258 5.1.5. Parallel concatenation 259 5.1.6. Irregular interleaving 260 5.2. A simple and convincing illustration of the turbo effect 260 5.3. Turbocodes 265 5.3.1. Coding 265 5.3.2. The termination of constituent codes 272 5.3.3. Decoding 275 5.3.4. SISO decoding and extrinsic information 280 5.4. The permutation function 287 5.4.1. The regular permutation 288 5.4.2. Statistical approach 290 5.4.3. Real permutations 291 5.5. m-binary turbocodes 297 5.5.1. m-binary RSC encoders 298 5.5.2. m-binary turbocodes 300 5.5.3. Double-binary turbocodes with 8 states 302 5.5.4. Double-binary turbocodes with 16 states 303 5.6. Bibliography 304 Chapter 6. Block Turbocodes 307 Ramesh PYNDIAH and Patrick ADDE 6.1. Introduction 307 6.2. Concatenation of block codes 308 6.2.1. Parallel concatenation of block codes 309 6.2.2. Serial concatenation of block codes 313 6.2.3. Properties of product codes and theoretical performances 318 6.3. Soft decoding of block codes 323 6.3.1. Soft decoding of block codes 324 6.3.2. Soft decoding of block codes (Chase algorithm) 326 6.3.3. Decoding of block codes by the Viterbi algorithm 334 6.3.4. Decoding of block codes by the Hartmann and Rudolph algorithm 338 6.4. Iterative decoding of product codes 340 6.4.1. SISO decoding of a block code 341 6.4.2. Implementation of the weighting algorithm 345 6.4.3. Iterative decoding of product codes 347 6.4.4. Comparison of the performances of BTC 349 6.5. Conclusion 367 6.6. Bibliography 367 Chapter 7. Block Turbocodes in a Practical Setting 373 Patrick ADDE and Ramesh PYNDIAH 7.1. Introduction 373 7.2. Implementation of BTC: structure and complexity 373 7.2.1. Influence of integration constraints 373 7.2.2. General architecture and organization of the circuit 376 7.2.3. Memorizing of data and results 380 7.2.4. Elementary decoder 384 7.2.5. High flow structure 392 7.3. Flexibility of turbo block codes 397 7.4. Hybrid turbocodes 404 7.4.1. Construction of the code 404 7.4.2. Binary error rates (BER) function of the signal-to-noise ratio in a Gaussian channel 406 7.4.3. Variation of the size of the blocks 408 7.4.4. Variation of the total rate 409 7.5. Multidimensional turbocodes 409 7.6. Bibliography 412 List of Authors 415 Index 417

Read more less

Book SynopsisThis book examines multicast technology and will be a key text for undergraduate engineering students and master students in networks and telecoms. However, it will be equally useful for a wide range of professionals in this research field. Multicast routing was introduced with the advent of multiparty applications (for example, videoconferencing on the Internet) and collaborative work (for example, distributed simulations). It is related to the concept of group communication, a technique introduced to reduce communication costs. The various problems of multicast routing on the Internet are examined in detail. They include: group membership management, quality of service, reliability, safety, scalability and transport. Throughout the text, several protocols are introduced in order to analyze, compare and cover the various aspects of multicast routing.Table of ContentsPreface xvii Chapter 1. Multicast Routing on the Internet 1 Jean-Jacques PANSIOT 1.1. Introduction and definitions 1 1.2. Multicast addressing 4 1.2.1. Limited scope addressing 5 1.2.2. GLOP global addressing 5 1.2.3. Dynamic addressing: MALLOC 6 1.3. Structure of a multicast router 7 1.3.1. The unicast routing base for multicasting (MRIB) 7 1.3.2. Tree information base (TIB) 8 1.3.3. Multicast forwarding information base (MFIB) 8 1.4. Relationship with the other protocol layers 10 1.4.1. Relationship with the lower layer 10 1.4.2. Relationship with the upper layers 12 1.5. Belonging to groups: IGMP 12 1.5.1. IGMP version 1 13 1.5.2. IGMP version 2 13 1.5.3. IGMP version 3 14 1.6. Routing in flood-and-prune mode and the RPF 15 1.6.1. Reverse path forwarding or RPF check 15 1.6.2. Pruning 16 1.6.3. Protocol cost 17 1.6.4. DVMRP 17 1.6.5. Mbone 18 1.6.6. PIM dense mode: PIM-DM 18 1.7. Link-state routing and MOSPF 18 1.7.1. MOSPF principle 18 1.7.2. MOSPF inter-areas 19 1.7.3. Cost of MOSPF 20 1.8. Routing with explicit construction: PIM-SM and CBT 20 1.8.1. PIM sparse-mode principles: PIM-SM 21 1.8.2. Discovery of RPs: boot strap routers (BSR) 24 1.8.3. Maintenance of the PIM-SM tree 24 1.8.4. Core based trees: CBT 25 1.8.5. Bidirectional PIM 25 1.8.6. Cost of explicit methods 26 1.9. Inter-domain multicast routing 27 1.9.1. MASC/BGMP architecture 27 1.9.2. BGP multiprotocol extensions 28 1.9.3. Interaction with intra-domain routing 29 1.9.4. BGMP 29 1.9.5. PIM-SM and MSDP solution 30 1.10. Model of multicasting with a single source: SSM 32 1.10.1. Express 32 1.10.2. The SSM and PIM-SM model 33 1.10.3. Limitations of PIM-SSM 33 1.11. Multicasting and IPv6 34 1.11.1. IPv6 multicast addressing 34 1.11.2. Protocol for group subscription: MLD 35 1.11.3. RP-embedded mechanism 35 1.12. Other multicast routing proposals 36 1.12.1. Simple multicast 37 1.12.2. Logical addressing and routing: LAR 37 1.12.3. Reunite 38 1.12.4. Hop by hop multicast routing: HBH 39 1.13. Comparison of various protocols 40 1.13.1. Quality of the broadcast trees 40 1.13.2. Cost of protocols 42 1.14. Alternatives to multicast routing 43 1.14.1. Multiple unicast connections 43 1.14.2. Multicasting for small groups 43 1.14.3. Application level multicast 43 1.15. Conclusion 44 1.16. Bibliography 44 1.17. Glossary of acronyms 49 Chapter 2. Hierarchical Multicast Protocols with Quality of Service 51 Abderrahim BENSLIMANE and Omar MOUSSAOUI 2.1. Introduction 51 2.2. Multicast principle 53 2.2.1. Advantage of multicasting 53 2.2.2. Technological constraints 55 2.2.3. Main types of trees 56 2.2.3.1. Shared tree/specific tree 56 2.2.3.2. Shortest path tree (SPT) 57 2.2.3.3. Steiner tree 57 2.2.3.4. Centered tree (CBT) 58 2.2.3.5. Summary 58 2.3. Multicast routing protocols 59 2.3.1. DVMRP 59 2.3.2. PIM 60 2.3.3. MOSPF 61 2.3.4. IP multicast 62 2.3.5. Limitations of the current multicast routing protocols 63 2.3.5.1. DVMRP 63 2.3.5.2. PIM 63 2.4. Quality of service in multicast routing 64 2.4.1. SJP 64 2.4.2. QoSMIC 66 2.4.3. QMRP 67 2.4.4. Conclusion 68 2.5. Hierarchical multicasting 69 2.5.1. HDVMRP 70 2.5.2. LGC 73 2.5.3. HIP 74 2.5.4. QHMRP 78 2.5.5. Conclusion 81 2.6. Hierarchical structure for multicasting 82 2.6.1. Context of the system 82 2.6.2. Construction of local groups 82 2.6.2.1. Construction of the neighborhood 82 2.6.2.2. Construction of transit groups 83 2.6.2.3. Grouping and election 83 2.6.3. Construction of hierarchical trees between servers 84 2.6.3.1. Use of centered trees 85 2.6.3.2. Use of SPT trees 87 2.6.3.3. Comparison between the two methods 88 2.6.4. Management of the hierarchical structure 89 2.7. Conclusion 90 2.8. Bibliography 90 Chapter 3. A Transport Protocol for Multimedia Multicast with Differentiated Quality of Service 93 David GARDUNO, Ernesto EXPOSITO and Michel DIAZ 3.1. Introduction 93 3.1.1. Multimedia 93 3.1.2. Partial QoS 93 3.1.3. Multicast 95 3.1.4. Text organization 96 3.2. State of the art 96 3.2.1. Point-to-point multimedia data transmission 96 3.2.1.1. UDP and TCP 96 3.2.1.2. SCTP 97 3.2.1.3. DCCP 98 3.2.1.4. Networking layer: IntServ 98 3.2.1.5. Networking layer: DiffServ 99 3.2.2. Multicast algorithms 100 3.3. Network model, Tree and QoS oriented multicast service 102 3.3.1. Introduction 102 3.3.2. Hierarchized graph 104 3.3.3. Degree Bounded Shortest Path Tree (DGBSPT) 107 3.3.4. Model and simulations 116 3.4. Fully Programmable Transport Protocol 118 3.4.1. Introduction 118 3.4.2. Design principles 119 3.4.3. Contextual model of QoS 119 3.4.3.1. QoS specification 119 3.4.3.2. QoS mechanisms 120 3.4.4. Protocol specification 121 3.4.5. Implementation and evaluation 123 3.5. Integration of multicast services and multimedia protocols 125 3.5.1. Deployment of transport services by proxies 125 3.5.1.1. Basic FPTP architecture and mechanisms 126 3.5.2. The M-FPTP multimedia multicast service 128 3.5.3. Tests and results 130 3.6. Conclusion 131 3.7. Bibliography 132 Chapter 4. Reliability in Group Communications: An Introduction 135 Vincent ROCA 4.1. Introduction 135 4.2. Which reliability for which applications? 136 4.2.1. Reliability levels 136 4.2.2. Group models 137 4.2.3. Transmission models 137 4.2.4. Multiplicity of applications and their needs 138 4.3. Challenges and big classes of solutions in the case of a reliable group communication service 139 4.3.1. Challenges 139 4.3.2. Reliable scaling and communications: problems 140 4.3.3. Scaling of control traffic 140 4.3.3.1. Use of removal mechanisms by recipients 140 4.3.3.2. Use of FEC codes 141 4.3.3.3. Use of assistance node trees 142 4.3.4. Scaling of retransmissions 142 4.3.4.1. Use of FEC 142 4.3.4.2. Use of a retransmission server tree 142 4.3.4.3. Local retransmissions 142 4.3.5. Considering the heterogenity 143 4.3.6. First assessment 144 4.4. FEC codes 144 4.4.1. Codes for packet erasure channels 144 4.4.2. The concepts of systematic codes and MDS codes 145 4.4.3. Classification of FEC codes 145 4.4.4. Small block codes 146 4.4.4.1. Principles 146 4.4.4.2. Problem linked to block segmentation 146 4.4.4.3. Use in the reliable communication systems 147 4.4.5. Large block codes 147 4.4.5.1. Introduction 147 4.4.5.2. Operation mode of LDPC-staircase and LDPC-triangle codes 147 4.4.6. Rateless codes (also known as extensible codes) 152 4.4.6.1. Introduction 152 4.4.6.2. Principles of online codes 152 4.4.6.3. Comparison with the LDPC-staircase and triangle codes 153 4.4.7. A few additional notes on the FEC rateless and large block codes 153 4.5. Conclusion 154 4.6. Bibliography 155 Chapter 5. End-to-end Approaches for Reliable Communications 157 Vincent ROCA 5.1. Introduction 157 5.2. The main protocol classes and the block approach of the IETF 158 5.3. The FEC building block 159 5.3.1. The “FEC encoding ID” and “FEC instance ID” 159 5.3.2. The FPI (FEC payload ID) 159 5.3.3. The “FEC object transmission information” (FEC OTI) 160 5.3.3.1. Block partitioning algorithm 161 5.3.3.2. The n algorithm 162 5.4. The NORM approach 163 5.4.1. Operating principles 163 5.4.1.1. General ideas 163 5.4.1.2. Main types of packets 163 5.4.1.3. Transmission window mechanism 164 5.4.2. The building blocks used 165 5.4.2.1. FEC block 165 5.4.3. Scope 166 5.5. ALC approach 166 5.5.1. Operating principles 166 5.5.1.1. General ideas 166 5.5.1.2. Close-up on the layered transmission principle 167 5.5.1.3. And if we used only one layer? 169 5.5.2. The building blocks used 169 5.5.2.1. The LCT block 170 5.5.3. Scope 171 5.6. The FLUTE file transfer application on ALC 172 5.6.1. Operating principles 173 5.6.2. An example of FDT instance 174 5.6.3. Scope 175 5.7. A few NORM and FLUTE/ALC available implementations 176 5.8. Conclusion 177 5.9. Bibliography 177 Chapter 6. Router-assist Based Reliable Multicast 181 Prométhée SPATHIS and Kim THAI 6.1. Introduction 181 6.2. Motivations and objectives 183 6.3. Protocol network architecture 186 6.3.1. Active error recovery (AER) and light-weight multicast services (LMS) 186 6.3.2. Pragmatic general multicast (PGM) 187 6.3.3. Active reliable multicast (ARM) and multicast actiffiable (MAF) 187 6.4. Classification 188 6.4.1. Organizing the control tree 188 6.4.2. Repair entities 190 6.4.3. Local approaches 193 6.4.3.1. Receiver-initiated approach 193 6.4.3.2. Sender-initiated approach 194 6.4.4. Buffer management 195 6.4.4.1. Receiver-initiated approach 195 6.4.4.2. Aggregated ACKs 196 6.4.5. Exposure of receivers 197 6.4.5.1. ARM and PGM 197 6.4.5.2. MAF 199 6.4.5.3. AER and LMS 199 6.4.6. Feedback implosion 202 6.4.6.1. Aggregation 202 6.4.6.2. Optimization of aggregation 203 6.4.7. Suppression 205 6.4.7.1. Anticipation 205 6.4.7.2. LMS and MAF 205 6.4.8. Loss recovery burden 206 6.4.8.1. ARM and PGM 206 6.4.8.2. AER and LMS 207 6.4.9. Standardization of router-assist based approaches 208 6.5. Placement mechanisms 209 6.5.1. Motivations and objectives of the placement of repair entities 210 6.5.2. Location models 211 6.5.3. Applications of the p-median problems to the placement of repair entities 212 6.6. Performance analysis 213 6.6.1. Large scale simulations and experiments 213 6.6.2. Analytical models 214 6.6.3. Precursory works 215 6.6.4. Comparative analytical studies of router support approaches 215 6.7. Conclusion 216 6.8. Bibliography 217 Chapter 7. Congestion Control in Multicast Communications 223 CongDuc PHAM and Moufida MAIMOUR-BOUYOUCEF 7.1. Introduction 223 7.2. Congestion control 225 7.2.1. Congestion control: a bit of theory 225 7.2.2. The congestion control in practice: example with TCP and the AIMD process 226 7.3. The congestion control in group communications 229 7.3.1. Information filtering and representativeness 229 7.3.2. Scalability 231 7.3.3. Heterogenity management 232 7.3.4. In brief 233 7.4. Single-rate approaches 233 7.5. Multi-rate approaches 235 7.6. Approaches with router assistance 239 7.7. Conclusion 242 7.8. Bibliography 242 7.9. Appendix 1: summary table of the approaches quoted in this chapter 245 7.10. Appendix 2: acronyms of the protocols presented 246 Chapter 8. Approaches to Multicast Traffic Engineering 247 Christian JACQUENET 8.1. Introduction 247 8.2. The use of DiffServ mechanisms 249 8.2.1. Reminder of the DiffServ architecture 249 8.2.2. Risks of over-use of resources within the DiffServ domain 250 8.2.3. Marking and signaling: establishment and maintenance of multicast distribution trees with differentiated qualities of service 250 8.3. Multicast traffic engineering and MPLS networks 257 8.3.1. The difficulty of activating multicast traffic processing capabilities in MPLS domains 257 8.3.2. Multicast traffic engineering using the point-to-point LSP MPLS resources 258 8.3.2.1. Establishment of multicast distribution trees at the edge of MPLS networks 258 8.3.2.2. Construction of distribution trees according to the service classes supported in the MPLS domain 261 8.3.3 Multicast traffic engineering using point-to-multipoint LSP MPLS tree structures 262 8.3.3.1. Establishment of point-to-multipoint LSP 262 8.3.3.2. Routing of multicast flows in traffic-engineered point-to-multipoint LSP trees 267 8.4. Conclusion 268 8.5. Bibliography 269 Chapter 9. Towards New Protocols for Small Multicast Groups: Explicit Routing and Recursive Unicast 271 Ali BOUDANI and Abderrahim BENSLIMANE 9.1. Introduction 271 9.2. Explicit multicast routing protocols 273 9.2.1. Xcast 273 9.2.2. Xcast+ 275 9.2.3. Advantages and disadvantages of the Xcast technique 276 9.2.3.1. Advantages of the Xcast technique 277 9.2.3.2. Disadvantages of the Xcast technique 277 9.2.4. Generalization of the Xcast technique 279 9.2.4.1. Description of the GXcast protocol 279 9.2.4.2. Links between GXcast and the maximum transfer unit 281 9.2.5. Incremental deployment of an Xcast protocol in a network 281 9.2.5.1. Tunneling 281 9.2.5.2. Premature X2U 283 9.2.5.3. Semi-permeable tunneling (only with IPv6) 283 9.2.6. Different explicit multicast propositions 284 9.2.6.1. SGM 285 9.2.6.2. CLM 285 9.2.6.3. MDO6 286 9.2.6.4. Somecast 286 9.2.6.5. ERM 286 9.2.6.6. MSC 286 9.2.6.7. DCM 287 9.2.7. Summary and limitations of the various explicit multicast routing protocols 287 9.3. Recursive unicast 290 9.3.1. REUNITE 292 9.3.2. HBH 293 9.3.3. SEM 295 9.3.4. Comparison between HBH and SEM 297 9.3.5. SREM 300 9.4. Conclusion 304 9.5. Bibliography 304 Chapter 10. Secure Multicast Communications 307 Melek ÖNEN, Refik MOLVA and Alain PANNETRAT 10.1. Introduction to multicast security 307 10.1.1. Multicast applications and their characteristics 307 10.1.2. Security requirements 309 10.1.3. Limitations of the unicast solutions 310 10.2. Multicast authentication 311 10.2.1. Definition and requirements 311 10.2.2. Techniques using symmetric algorithms 312 10.2.2.1. Multicast message authentication codes (MMAC) 312 10.2.2.2. TESLA 313 10.2.3. Combination of asymmetric and symmetric algorithms 315 10.2.3.1. Hash trees 315 10.2.3.2. Hash chains 316 10.2.3.3. The use of erasure codes 318 10.2.4. Conclusion 320 10.3. Multicast confidentiality 320 10.3.1. Definition and requirements 320 10.3.2. Re-encryption trees 322 10.3.2.1. Iolus 322 10.3.2.2. Cipher sequences 324 10.3.3. LKH: Logical Key Hierarchy 326 10.3.4. Conclusion 327 10.4. Reliability of key distribution protocols 328 10.4.1. Requirements 328 10.4.2. Solutions based on replication techniques 329 10.4.3. Solutions based on the use of FEC 330 10.4.4. Conclusion 330 10.5. General conclusion 331 10.6. Bibliography 332 Chapter 11. Scalable Virtual Environments 335 Walid DABBOUS and Thierry TURLETTI 11.1. Introduction 335 11.2. Specificities of the LSVE 337 11.2.1. Scalability 337 11.2.2. Interactivity 338 11.2.3. Heterogenity 338 11.2.4. Consistency 339 11.2.5. Reliability 339 11.3. Multipoint limitations 340 11.3.1. Routing 340 11.3.2. Subscriptions and unsubscriptions latency 341 11.4. SCORE-ASM 342 11.4.1. Assessment of the additional cost related to the use of multipoint 343 11.4.2. The role of the agents 344 11.4.2.1. Association of multipoint cells-groups 346 11.4.2.2. Assignment of multipoint groups 346 11.4.3. Communications in SCORE-ASM 347 11.4.3.1. Communication between participants 348 11.4.3.2. Participants-agent communication 349 11.4.3.3. Communication between agents 350 11.4.4. Connection to the virtual world 351 11.4.5. Subscriptions update mechanism 351 11.4.6. Clipping algorithm 352 11.4.7. Conclusions regarding SCORE-ASM 353 11.5. SCORE-SSM 354 11.5.1. Problematic 355 11.5.2. Choice of design 356 11.5.3. SCORE-SSM structure 356 11.5.3.1. Filtering 357 11.5.3.2. Heterogenity and multimedia flow 358 11.5.3.3. Correspondence with the network multipoint 359 11.5.4. Prospects regarding SCORE-SSM 359 11.6. Final comment 360 11.7. Bibliography 361 List of Authors 363 Index 365

Read more less

Book SynopsisInternet Protocol (IP) networks have, for a number of years, provided the basis for modern communication channels. However, the control and management of these networks needs to be extended so that the required Quality of Service can be achieved. Information about new generations of IP networks is given, covering the future of pervasive networks (that is, networks that arealways present), Wi-Fi, the control of mobility and improved Quality of Service, sensor networks, inter-vehicle communication and optical networks.Table of ContentsPart 1. Control of IP Networks 1 Chapter 1. Introduction 3 Guy PUJOLLE 1.1. Introduction 3 1.2. Signaling 4 1.3. Flow control and management techniques 7 1.4. Policy-based management 14 1.5. Security 15 1.6. Mobile network control 18 1.7. Optical network control 19 1.8. Conclusion 20 1.9. Bibliography 20 Chapter 2. Quality of Service: The Basics 23 Benoît CAMPEDEL 2.1. Introduction to Quality of Service 23 2.2. Network parameters 27 2.3. Overview of the basic mechanisms on IP 36 2.4. Overview 47 Chapter 3. Quality of Service: Mechanisms and Protocols 49 Stéphane LOHIER 3.1. QoS and IP 49 3.2. IntServ (RSVP) model 54 3.3. The DiffServ model 64 3.4. MPLS architecture 71 3.5. QoS at level 2 75 Chapter 4. DiffServ: Differentiated Quality of Service 81 Idir FODIL 4.1. Introduction 81 4.2. Principles of DiffServ 82 4.3. Structure 83 4.4. DiffServ in edge routers 84 4.5. Conclusion 88 4.6. Bibliography 88 Chapter 5. Quality of Service in Wi-Fi 91 Yacine GHAMRI-DOUDANE, Anelise MUNARETTO and Hakima CHAOUCHI 5.1. Introduction 91 5.2. Packets transmission with CSMA/CA access method 92 5.3. MAC level QoS in IEEE 802.11 96 5.4. Summary and conclusion 108 5.5. Bibliography 109 Chapter 6. Quality of Service: Policy-based Management 111 Thi Mai Trang NGUYEN 6.1. Introduction to policy-based management in IP networks 111 6.2. Architecture and protocols for policy-based management 113 6.3. The COPS protocol 114 6.4. COPS-RSVP 117 6.5. COPS-PR 119 6.6. SNMP 123 6.7. Conclusion 124 6.8. Bibliography 124 Chapter 7. Inter-domain Quality of Service 127 Mauro FONSECA 7.1. Introduction 127 7.2. Goal 128 7.3. Motivations for the use of mobile agents to offer inter-domain QoS 131 7.4. Negotiation of inter-domain QoS 133 7.5. An architecture for inter-domain negotiation 135 7.6. Conclusion 147 7.7. Bibliography 148 Part 2. The Evolution of IP Networks 151 Chapter 8. An Introduction to the Evolution in the World of IP 153 Guy PUJOLLE 8.1. Introduction 153 8.2. Great evolutions 154 8.3. Quality of Service 156 8.4. IP mobility 157 8.5. IP multicast 162 8.6. VPN IP 164 8.7. Filtering 168 8.8. Intelligent IP networks 170 8.9. Conclusion 171 8.10. Bibliography 171 Chapter 9. IPv6, the New Internet Generation 175 Idir FODIL 9.1. Introduction 175 9.2. IPv6 characteristics 176 9.3. IPv6 packet header 177 9.4. IPv6 addressing 178 9.5. Transition from IPv4 Internet to IPv6 Internet 181 Chapter 10. Addressing in IP Networks 193 Julien ROTROU and Julien RIDOUX 10.1. Introduction 193 10.2. IPv4 addressing 194 10.3. The future version of the IP protocol: IPv6 203 10.4. Conclusion 215 10.5. Bibliography 216 Chapter 11. SLA Driven Network Management 219 Issam AIB and Belkacem DAHEB 11.1. Introduction 219 11.2. Requirements for service driven management 219 11.3. The SLA 221 11.4. Specification of level of service (SLS) 223 11.5. Service contract chains 226 11.6. SLA types 227 11.7. SLA management (SLM) 228 11.8. SLA modeling and representation 231 11.9. Research projects and activities 233 11.10. Conclusion 244 11.11. Abbreviations and acronyms 244 11.12. Bibliography 245 Chapter 12. New Approaches for the Management and Control of IP Networks 247 Yacine GHAMRI-DOUDANE 12.1. Introduction 247 12.2. Network management policies 248 12.3. Policy-based management framework 250 12.4. COPS protocol 254 12.5. Policy domains 257 12.6. Information modeling 260 12.7. Conclusion 263 12.8. Bibliography 264 Chapter 13. Internet Security 267 Vedat YILMAZ 13.1. Introduction 267 13.2. Elements of security 267 13.3. User data security 270 13.4. Internet infrastructure security 277 13.5. Internet access infrastructure security 283 13.6. Summary and conclusion 289 13.7. Bibliography 290 Chapter 14. Security Protocols for the Internet 293 Idir FODIL 14.1. Introduction 293 14.2. IPSec 294 14.3. IEEE 802.1x 300 14.4. Bibliography 304 Chapter 15. Secured Infrastructure for Ambient Virtual Offices 307 Laurent CIARLETTA and Abderrahim BENSLIMANE 15.1. Introduction to ambient Internet and to its needs in terms of security 307 15.2. Virtual Private Smart Spaces (VPSS) 309 15.3. An infrastructure secured by ambient virtual offices 315 15.4. Conclusion and perspectives 324 15.5. Bibliography 326 Chapter 16. Smart Card Security 329 Vincent GUYOT 16.1. Introduction 329 16.2. History 330 16.3. Different parts of a smart card 330 16.4. Smart card communication 333 16.5. A secure component 339 16.6. Smart card alternatives. 340 16.7. Smart card security advantages 341 16.8. Network security 347 16.9. Conclusion 349 16.10. Bibliography 349 Chapter 17. Video Adaptation on the Internet 353 Nadjib ACHIR 17.1. Introduction 353 17.2. Error control 355 17.3. Point-to-point congestion and flow control 359 17.4. Multicast congestion and flow control 362 17.5. An example of video adaptation: multi-object video transmission 367 17.6. Conclusion 377 17.7. Bibliography 378 Chapter 18. Voice over IP 383 Guy PUJOLLE 18.1. Introduction 383 18.2. Telephonic application in an IP context 384 18.3. Audio coders 385 18.4. Telephony over IP 387 18.5. Signaling protocols 389 18.6. QoS 400 18.7. Corporate IP telephony networks 412 18.8. Implementation of telephony over IP 413 18.9. Telephonic IP applications for the general public 414 18.10. Telephony-data integration 414 18.11. Conclusion 415 18.12. Bibliography 415 Chapter 19. Wireless Voice over IP 417 Laurent OUAKIL 19.1. Introduction 417 19.2. Wireless VoIP problems 418 19.3. Voice management indications and designs 421 19.4. Adapting wireless QoS for voice 428 19.5. Conclusion 438 19.6. Bibliography 439 Part 3. The Next Generation of IP Networks 441 Chapter 20. Pervasive Networks 443 Sidi-Mohammed SENOUCI 20.1. Introduction 443 20.2. Ambient intelligence 444 20.3. Ambient networks 447 20.4. Conclusion 465 20.5. Bibliography 465 Chapter 21. Wi-Fi/IEEE 802.11 469 Denis BEAUTIER 21.1. Introduction. 469 21.2. Technology 472 21.3. Amendments, progress and characteristics 488 21.4. Conclusion 494 21.5. Appendices 497 21.6. Bibliography 499 Chapter 22. Mobility and Quality of Service 501 Hakima CHAOUCHI 22.1. Introduction. 501 22.2. Summary of QoS and mobility architectures 502 22.3. Mobility architectures 509 22.4. Impact of mobility on QoS 516 22.5. Interaction architectures between QoS and mobility 519 22.6. Band interactions 519 22.7. Interaction with band signaling: INSIGNIA 525 22.8. Other communities 526 22.9. Conclusion 527 22.10. Bibliography 528 Chapter 23. Sensor Networks 531 Paulo GONÇALVES 23.1. Introduction 531 23.2. Definitions 533 23.3. Transmission medium 535 23.4. Platforms 536 23.5. Energy consumption 539 23.6. Power supply 540 23.7. Evaluation metrics 543 23.8. Network protocols 544 23.9. Auto-organization 546 23.10. Applications 547 23.11. IEEE 802.15.4 standard or ZigBee™ 549 23.12. Production cost 549 23.13. Conclusion 549 23.14. Bibliography 549 Chapter 24. Mobile Ad Hoc Networks: Inter-vehicle Geocast 553 Abderrahim BENSLIMANE 24.1. Introduction 553 24.2. Mobile ad hoc networks 555 24.3. Communication in intelligent transport 557 24.4. Inter-vehicle geocast 559 24.5. Performance evaluation 565 24.6. Conclusion 570 24.7. Bibliography 571 24.8. Appendix 573 Chapter 25. Pervasive Networks: Today and Tomorrow 575 Guy PUJOLLE 25.1. Introduction 575 25.2. Networks of the pervasive Internet 576 25.3. QoS and security 586 25.4. Services 587 25.5. Bibliography 590 Chapter 26. Optical Networks 591 Nizar BOUABDALLAH 26.1. Introduction 591 26.2. History 592 26.3. Evolution of optical networks 594 26.4. Structure of an optical transmission system 596 26.5. Multiplexing techniques 598 26.6. Second generation optical networks 600 26.7. Wavelength switching optical networks 601 26.8. Distribution by optical fiber 604 26.9. Conclusion 609 26.10. Bibliography 609 Chapter 27. GMPLS-enabled Optical Networks 611 Wissam FAWAZ and Belkacem DAHEB 27.1. Introduction 611 27.2. Label switching (MPLS) 612 27.3. Evolution of IP/MPLS signaling for optical WDM networks 622 27.4. Conclusion 636 27.5. Bibliography 636 List of Authors 637 Index 641

Read more less

Book Synopsis

Read more less

Book SynopsisThe advent of Internet of Things (IoT) has paved the way for sensing the environment and smartly responding. This can be further improved by enabling intelligence to the system with the support of machine learning and deep learning techniques. This book describes learning algorithms that can be applied to IoT-based, real-time applications and improve the utilization of data collected and the overall performance of the system. Many societal challenges and problems can be resolved using a better amalgamation of IoT and learning algorithms. Smartness is the buzzword that is realized only with the help of learning algorithms. In addition, it supports researchers with code snippets that focus on the implementation and performance of learning algorithms on IoT based applications such as healthcare, agriculture, transportation, etc. These snippets include Python packages such as Scipy, Scikit-learn, Theano, TensorFlow, Keras, PyTorch, and more. Learning Algorithms for Internet of Things provides you with an easier way to understand the purpose and application of learning algorithms on IoT. What you'll LearnSupervised algorithms such as Regression and Classification. Unsupervised algorithms, like K-means clustering, KNN, hierarchical clustering, principal component analysis, and more. Artificial neural networks for IoT (architecture, feedback, feed-forward, unsupervised). Convolutional neural networks for IoT (general, LeNet, AlexNet, VGGNet, GoogLeNet, etc.). Optimization methods, such as gradient descent, stochastic gradient descent, Adagrad, AdaDelta, and IoT optimization. Who This Book Is For Students interested in learning algorithms and their implementations, as well as researchers in IoT looking to extend their work with learning algorithms

Read more less

Book SynopsisGain a comprehensive understanding of digital reliability to ensure consistent, dependable user experiences that foster trust in technology. Part of author Saurav Bhattacharya's trilogy that covers the essential pillars of digital ecosystemssecurity, reliability, and usabilitythis book tackles the challenges of achieving high reliability in complex systems and provides strategies to overcome these obstacles. You'll start by reviewing the pivotal role of reliability in establishing the foundation of digital trust, essential for the sustainable growth of digital ecosystems.In today's digital landscape, characterized by rapid technological advancements and increasing cyber threats, understanding and addressing reliability issues are paramount. As transformative technologies like AI, blockchain, and quantum computing emerge, grasping these fundamental principles becomes crucial. Enterprise Digital Reliability advocates for collaborative efforts among technologists, policymakers, and society to create digital environments that are innovative, inclusive, safe, and respectful of human values. What You Will LearnUnderstand the multifaceted concept of reliability in technology and its significance in building digital trustFoster innovation and inclusivity in digital environments and large-scale enterpriseand explore strategies to address them effectivelyProvide a framework for understanding and achieving digital equilibriumExamine operational uptime and consistent user experiences crucial successful digital platformsWho This Book Is ForCybersecurity Professionals, Technology Developers and Engineers

Read more less

Book SynopsisChapter 1: Problem.- Chapter 2: Idea.- Chapter 3: Theory.- Chapter 4: Model.- Chapter 5: Architecture.- Chapter 6: Design.- Chapter 7: Implementation.- Chapter 8: Interactions.- Chapter 9: Conclusion.- Appendix A: Evolveburgh: A City of Innovation and Tradition.- Appendix B: Bibliography.

Read more less

Book SynopsisChapter 1: Automate the Workspace.- Chapter 2: Empowering Frontline Workers.- Chapter 3: VDI with Software Defined Network.- Chapter 4: Mobility Best Practices for Higher Education.- Chapter 5: Enterprise Mobility Management.- Chapter 6: Any App from Anywhere on Any Device.- Chapter 7: Consumerization of IT Services.- Chapter 8: IoT with Workspace One- Chapter 9: Delivering the Digital Workspace.- Chapter 10: Single Business WorkplaceChapter 11: Android and Citrix with Workspace One.- Chapter 12: A: Networking with Horizon.

Read more less

Book SynopsisChapter 1: Site Reliability Engineering 101.- Chapter 2: Scale Site Reliability Engineering Capability in Enterprise.- Chapter 3: Site Reliability Engineering: best in class and case studies.- Chapter 4: Future of Site Reliability Engineering.- Chapter 5: Deep dive into essential Site Reliability Engineering practices: Chaos Engineering and Observability.- Chapter 6: Learn how to start and on what to focus in complex Enterprise.

Read more less

Book SynopsisPART – I.- Chapter 1:  Introduction: Evolution of AI and Large language models (LLM). PART – II.- Chapter 2:  Generative AI in Business. PART – III.-  Chapter 3:  Design patterns for developing enterprise GenAI applications. Chapter 4: Introduction to Agentic.- Chapter 5: End to end implementation of a practical Use case. Chapter 6: Evaluation and Deployment. PART – IV.- Chapter 7: Responsible AI & Risk framework.- Chapter 8: Conclusion and best practices.

Read more less

Book SynopsisChapter 1: Introduction to Identity and Access Management on Google Cloud Platform.- Chapter 2: Managing Roles, Policies and Permissions.- Chapter 3: Advanced IAM Features.- Chapter 4: Service Accounts and Workload Identity.- Chapter 5: Securing APIs and Workloads.- Chapter 6: Automating IAM Policies.- Chapter 7: Auditing and Monitoring IAM Policies.- Chapter 8 : Managing Multi-Cloud and Hybrid IAM.- Chapter 9:Securing Sensitive Data with IAM.- Chapter 10: AI-Driven Identity and Access Management.

Read more less

Book SynopsisChapter 1: Introduction to Nano-Biotechnology.- Chapter 2: Types of Nanomaterials and Their Properties.- Chapter 3: Cellular Nanostructures and Biomolecular Motors.- Chapter 4: Synthesis of Nanomaterials.- Chapter 5: Characterization of Nanomaterials.- Chapter 6: Thin Films and Colloidal Nanostructures.- Chapter 7: Self-Assembly and Nanovesicles.- Chapter 8: Nanoparticles for Drug Delivery.- Chapter 9: Nanoparticles for Diagnostics and Imaging.- Chapter 10: Nanobiocatalysts and Their Applications.- Chapter 11: Environmental and Health Impacts of Nanomaterials.- Chapter 12: Ecotoxicology and Life Cycle Assessment.- Chapter 13: Nanomaterials in Catalysis.- Chapter 14: Nanotechnology in Medicine.- Chapter 15: Nanotechnology in Food Science.- Chapter 16: Nanotechnology for Water Remediation and Purification.- Chapter 17: MEMS and NEMS Based on Nanomaterials.- Chapter 18: Safety and Regulation of Nanomaterials.- Chapter 19: Genotoxicity and Cytotoxicity of Nanomaterials.- Chapter 20: Future Directions in Nano-Biotechnology.

Read more less