DOCSLIB.ORG

Wiley Networking Council Series

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Wiley Networking Council Series Y L F M A E T Brought to you by Team FLY® Team-Fly® Page i High-Speed Networking A Systematic Approach to High-Bandwidth Low-Latency Communication Page ii This page intentionally left blank. Page iii High-Speed Networking A Systematic Approach to High-Bandwidth Low-Latency Communication James P.G. Sterbenz and Joseph D. Touch with contributions from Julio Escobar Rajesh Krishnan Chunming Qiao technical editor A. Lyman Chapin Page iv Publisher: Robert Ipsen Editor: Carol A. Long Assistant Editor: Adaobi Obi Managing Editor: Gerry Fahey Text Design & Composition: UG / GGS Information Services, Inc. Designations used by companies to distinguish their products are often claimed as trademarks. In all instances where John Wiley & Sons, Inc., is aware of a claim, the product names appear in initial capital or ALL CAPITAL LETTERS. Readers, however, should contact the appropriate companies for more complete information regarding trademarks and registration. Copyright © 2001 by James P.G. Sterbenz and Joseph D. Touch. All rights reserved. Published by John Wiley & Sons, Inc. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, scanning or otherwise, except as permitted under Sections 107 or 108 of the 1976 United States Copyright Act, without either the prior written permission of the Publisher, or authorization through payment of the appropriate per- copy fee to the Copyright Clearance Center, 222 Rosewood Drive, Danvers, MA 01923, (978) 750-8400, fax (978) 750-4744. Requests to the Publisher for permission should be addressed to the Permissions Department, John Wiley & Sons, Inc., 605 Third Avenue, New York, NY 10158-0012, (212) 850-6011, fax (212) 850-6008, E-Mail: PERMREQ @ WILEY.COM. This publication is designed to provide accurate and authoritative information in regard to the subject matter covered. It is sold with the understanding that the publisher is not engaged in professional services. If professional advice or other expert assistance is required, the services of a competent professional person should be sought. This title is also available in print as ISBN 0-471-33036-1 For more information about Wiley products, visit our web site at www.Wiley.com Page v Wiley Networking Council Series Series Editors: Scott Bradner Senior Technical Consultant , Harvard University Vinton Cerf Senior Vice President, MCIWorldCom Lyman Chapin Chief Scientist, BBN Technologies Books in series: ISP Survival Guide: Strategies for Running a Competitive ISP Geoff Huston ISBN: 0-471-31499-4 Implementing IPsec: Making Security Work on VPN's, Intranets, and Extranets Elizabeth Kaufman, Andrew Newman ISBN: 0-471-34467-2 Internet Performance Survival Guide: QoS Strategies for Multiservice Networks Geoff Huston ISBN: 0-471-37808-9 ISP Liability Survival Guide: Strategies for Managing Copyright, Spam, Cache, and Privacy Regulations Tim Casey ISBN: 0-471-37748-1 VPN Applications Guide: Real Solutions for Enterprise Networks Dave McDysan ISBN: 0-471-37175-0 Converged Networks and Services: Internetworking IP and the PSTN Igor Faynberg, Hui -Lan Lu, and Lawrence Gabuzda ISBN: 0-471-35644-1 WAN Survival Guide: Strategies for VPNs and Multiservice Networks Howard C. Berkowitz ISBN: 0-471-38428-3 The NAT Handbook: Implementing and Managing Network Address Translation Bill Dutcher ISBN: 0-471-39089-5 Page vi This page intentionally left blank. Page vii To my wife Kris and daughter Katy Page viii This page intentionally left blank. Page ix Contents Networking Council Foreword xv Acknowledgments xvii Chapter 1 Introduction 1 1.1 Bandwidth and Latency 2 1.1.1 Individual Delay 2 1.1.2 Aggregate Bandwidth 3 1.2 What is High Speed? 3 1.2.1 High-Speed Technologies 4 1.2.2 Barriers and Constraints 4 1.3 Organization of This Book 6 Chapter 1— Introduction 6 Chapter 2— Fundamentals and Design Principles 7 Chapter 3— Network Architecture and Topology 9 Chapter 4— Network Control and Signaling 10 Chapter 5— Network Components 10 Chapter 6— End Systems 10 Chapter 7— End-to -End Protocols 11 Chapter 8— Networked Applications 11 Chapter 9— Future Directions and Conclusion 12 1.4 Who Should Read This Book 12 Chapter 2 Fundamentals and Design Principles 13 2.1 A Brief History of Networking 14 2.1.1 First Generation: Emergence 16 2.1.2 Second Generation: The Internet 16 2.1.3 Third Generation: Convergence and the Web 17 2.1.4 Fourth Generation: Scale, Ubiquity, and Mobility 19 2.2 Drivers and Constraints 20 2.2.1 Applications 20 2.2.2 The Ideal Network 23 2.2.3 Limiting Constraints 27 Page x 2.3 Design Principles and Tradeoffs 31 2.3.1 Critical Path 34 2.3.2 Resource Tradeoffs 37 2.3.3 End-to-End versus Hop-by -Hop 39 2.3.4 Protocol Layering 41 2.3.5 State and Hierarchy 49 2.3.6 Control Mechanisms 54 2.3.7 Distribution of Application Data 60 2.3.8 Protocol Data Units 61 2.4 Design Techniques 63 2.4.1 Scaling Time and Space 63 2.4.2 Cheating and Masking the Speed of Light 64 2.4.3 Specialized Hardware Implementation 65 2.4.4 Parallelism and Pipelining 65 2.4.5 Data Structure Optimization 68 2.4.6 Latency Reduction 70 2.5 Summary 72 2.5.1 Further Reading 72 Key Axioms 73 Key Design Principles Y 75 L Chapter 3 Network Architecture and Topology 79 F 3.1 Topology and Geography 80 3.1.1 Scalability M 81 3.1.2 Latency A 82 3.1.3 Bandwidth 88 3.1.4 Virtual Overlays and LightpathsE 90 3.1.5 Practical Constraints T 94 3.2 Scale 95 3.2.1 Network Engineering 95 3.2.2 Hierarchy 97 3.2.3 Bandwidth Aggregation and Isolation 101 3.2.4 Latency Optimization 102 3.2.5 Wireless Network Density 103 3.2.6 Practical Constraints 107 3.3 Resource Tradeoffs 110 3.3.1 Bandwidth, Processing, and Memory 111 3.3.2 Latency as a Constraint 112 3.3.3 Relative Scaling with High Speed 114 3.3.4 Active Networking 115 3.4 Summary 116 3.4.1 Further Reading 116 Key Network Topology Principles 117 Team-Fly® Page xi Chapter 4 Network Control and Signaling 119 4.1 Signaling and Control 121 4.1.1 Circuit and Message Switching 122 4.1.2 Packet Switching 126 4.1.3 Fast Packet Switching 128 4.1.4 Intermediate Control Mechanisms 134 4.1.5 Fast Circuit and Burst Switching 139 4.1.6 Multicast Flows 143 4.1.7 Session Control 145 4.2 Traffic Management 148 4.2.1 Resource Reservation 151 4.2.2 Network-Based Congestion Control 152 4.3 Path Routing Dynamics 157 4.3.1 Multipoint Groups 158 4.3.2 Node Mobility 159 4.4 Monitoring and Management 161 4.5 Summary 163 4.5.1 Further Reading 163 Axioms and Principles 163 Chapter 5 Network Components 165 5.1 Links 167 5.1.1 Physical Transmission Media 167 5.1.2 Link Technologies 176 5.1.3 Link-Layer Components 188 5.1.4 Support for Higher Layers 192 5.2 Switches and Routers 195 5.2.1 Switching 196 5.2.2 Traditional Store -and-Forward Routers 199 5.2.3 Ideal Switch Architecture 201 5.3 Fast Packet Switches 202 5.3.1 Switch Architecture 202 5.3.2 Input and Label Processing 203 5.3.3 Packet Size and Variability 206 5.3.4 Packet Structure 213 5.3.5 Traffic Management 215 5.3.6 Functional Partitioning 223 5.4 Switch Fabric Architecture 226 5.4.1 Buffering 227 5.4.2 Single-Stage Shared Elements 233 5.4.3 Single-Stage Space Division Elements 236 5.4.4 Multistage Switches 241 5.4.5 Multicast Support 246 Page xii 5.5 Fast Datagram Switches 249 5.5.1 Overall Architecture and Performance 251 5.5.2 Fast Forwarding Lookup 254 5.5.3 Packet Classification and Filtering 268 5.5.4 Output Processing and Packet Scheduling 271 5.6 Higher-Layer and Active Processing 274 5.6.1 Alternative Strategies 275 5.6.2 Active Network Nodes 275 5.7 Summary 279 5.7.1 Further Reading 280 Network Component Axioms and Principles 281 Chapter 6 End Systems 285 6.1 End System Components 287 6.1.1 End System Hardware 287 6.1.2 End System Software 288 6.1.3 End System Bottlenecks 289 6.1.4 Traditional End System Implementation 291 6.1.5 Ideal End System Architecture 294 6.2 Protocol and OS Software 296 6.2.1 Protocol Software 297 6.2.2 Operating Systems 301 6.2.3 Protocol Software Optimizations 309 6.3 End System Organization 313 6.3.1 Host Interconnects 314 6.3.2 Host–Network Interconnection Alternatives 318 6.3.3 Host–Network Interface Issues 321 6.4 Host–Network Interface 326 6.4.1 Offloading of Communication Processing 327 6.4.2 Network Interface Design 330 6.5 Summary 340 6.5.1 Further Reading 340 End System Axioms and Principles 341 Chapter 7 End-to-End Protocols 343 7.1 Functions and Mechanisms 344 7.1.1 End-to-End Semantics 345 7.1.2 End-to-End Mechanisms 352 7.1.3 Transport Protocols 353 7.1.4 Control of State 357 7.2 State Management 360 7.2.1 Impact of High Speed 360 7.2.2 Transfer Modes 364 Page xiii 7.2.3 State Establishment and Maintenance 373 7.2.4 Assumed Initial Conditions 377 7.3 Framing and Multiplexing 378 7.3.1 Framing and Fragmentation 378 7.3.2 Application Layer Framing 382 7.3.3 Multiplexing 384 7.4 Error Control 386 7.4.1 Types and Causes of Errors 386 7.4.2 Impact of High Speed 390 7.4.3 Closed-Loop Retransmission 391 7.4.4 Open-Loop Error Control 398 7.5 Flow and Congestion Control 400 7.5.1 Impact of High Speed 402 7.5.2 Open-Loop Rate Control 402 7.5.3 Closed-Loop Flow Control 408 7.5.4 Closed-Loop Congestion Control 409 7.5.5 Hybrid Flow and Congestion Control 417 7.6 Security and Information Assurance 422 7.6.1 End-to-End Security 423 7.6.2 High-Speed Security 425 7.7 Summary 427 7.7.1 Further Reading 427 End-to-End Axioms and Principles 428 Chapter 8 Networked Applications 431 8.1 Application Characteristics 433 8.1.1 Bandwidth 434 8.1.2 Latency 438 8.1.3 Error Tolerance 444 8.1.4
Load more

Recommended publications
  • Etir Code Lists
    eTIR Code Lists Code lists CL01 Equipment size and type description code (UN/EDIFACT 8155) Code specifying the size and type of equipment. 1 Dime coated tank A tank coated with dime. 2 Epoxy coated tank A tank coated with epoxy. 6 Pressurized tank A tank capable of holding pressurized goods. 7 Refrigerated tank A tank capable of keeping goods refrigerated. 9 Stainless steel tank A tank made of stainless steel. 10 Nonworking reefer container 40 ft A 40 foot refrigerated container that is not actively controlling temperature of the product. 12 Europallet 80 x 120 cm. 13 Scandinavian pallet 100 x 120 cm. 14 Trailer Non self-propelled vehicle designed for the carriage of cargo so that it can be towed by a motor vehicle. 15 Nonworking reefer container 20 ft A 20 foot refrigerated container that is not actively controlling temperature of the product. 16 Exchangeable pallet Standard pallet exchangeable following international convention. 17 Semi-trailer Non self propelled vehicle without front wheels designed for the carriage of cargo and provided with a kingpin. 18 Tank container 20 feet A tank container with a length of 20 feet. 19 Tank container 30 feet A tank container with a length of 30 feet. 20 Tank container 40 feet A tank container with a length of 40 feet. 21 Container IC 20 feet A container owned by InterContainer, a European railway subsidiary, with a length of 20 feet. 22 Container IC 30 feet A container owned by InterContainer, a European railway subsidiary, with a length of 30 feet. 23 Container IC 40 feet A container owned by InterContainer, a European railway subsidiary, with a length of 40 feet.
    [Show full text]
  • Breaking Through the Myths to Reality: a Future-Proof View Of
    Breaking Through the Myths to Reality A Future-Proof View of Fiber Optic Inspection and Cleaning Dear Viewer: As presented at BICSI® in February- 2018, this seminar has video and animations that Edward J. Forrest, Jr. are not available as a .pdf file. If you would like the RMS(RaceMarketingServices) original version, please contact BICSI or the author. Bringing Ideas Together Caution: This Presentation is going to be controversial! IT IS BASED ON 2,500 YEARS OF SCIENCE AND PRODUCT DEVELOPMENT 2 Fact OR FICTION of Fiber Optic Cleaning and Inspection This seminarWE WILL mayDISCUSS contradictAND currentDEFINE: trends ➢ There➢ Cleaningand are what OTHER you’ve is notWAYS been important…BESIDES taught. VIDEO ➢ ➢➢“Automatic99.9%Debris➢ ➢ExistingA “Reagent FiberonS Detection” CIENTIFICthe standards, Optic surface Grade” ConnectorR isEALITY of such“good Isopropanola fiber… as enough”.is optic a is IECconnector“Pass 61300Let’sanI NSPECTIONanythingeffective- Fail”separate- 3surface-35, is is bettereasy are Factsfiberto is “Best determine thantwoto from optic understand nothing!-dimensional Practice”Fiction cleaner What we’veTwoif the ( ALL-Dimensional connector) been taught/bought/soldand is Structure“clean” over the last 30+Myth yearsfrom may“diameter”. Scientific not be the same Reality thing! 3 Fact OR FICTION of Fiber Optic Cleaning and Inspection ➢ A Fiber Optic Connector is a Two-Dimensional Structure ➢ 99.9% “Reagent Grade” Isopropanol is an effective fiber optic cleaner ➢ Cleaning is not important… anything is better than nothing! ➢ There are OTHER WAYS BESIDES VIDEO INSPECTION to determine if the connector is “clean” ➢ Debris on the surface of a fiber optic connector surface is two-dimensional “diameter”. ➢ “Automatic Detection” is “good enough”.
    [Show full text]
  • File Organization and Management Com 214 Pdf
    File organization and management com 214 pdf Continue 1 1 UNESCO-NIGERIA TECHNICAL - VOCATIONAL EDUCATION REVITALISATION PROJECT-PHASE II NATIONAL DIPLOMA IN COMPUTER TECHNOLOGY FILE Organization AND MANAGEMENT YEAR II- SE MESTER I THEORY Version 1: December 2 2 Content Table WEEK 1 File Concepts... 6 Bit:... 7 Binary figure... 8 Representation... 9 Transmission... 9 Storage... 9 Storage unit... 9 Abbreviation and symbol More than one bit, trit, dontcare, what? RfC on trivial bits Alternative Words WEEK 2 WEEK 3 Identification and File File System Aspects of File Systems File Names Metadata Hierarchical File Systems Means Secure Access WEEK 6 Types of File Systems Disk File Systems File Systems File Systems Transactional Systems File Systems Network File Systems Special Purpose File Systems 3 3 File Systems and Operating Systems Flat File Systems File Systems according to Unix-like Operating Systems File Systems according to Plan 9 from Bell Files under Microsoft Windows WEEK 7 File Storage Backup Files Purpose Storage Primary Storage Secondary Storage Third Storage Out Storage Features Storage Volatility Volatility UncertaintyAbility Availability Availability Performance Key Storage Technology Semiconductor Magnetic Paper Unusual Related Technology Connecting Network Connection Robotic Processing Robotic Processing File Processing Activity 4 4 Technology Execution Program interrupts secure mode and memory control mode Virtual Memory Operating Systems Linux and UNIX Microsoft Windows Mac OS X Special File Systems Journalized File Systems Graphic User Interfaces History Mainframes Microcomputers Microsoft Windows Plan Unix and Unix-like operating systems Mac OS X Real-time Operating Systems Built-in Core Development Hobby Systems Pre-Emptification 5 5 WEEK 1 THIS WEEK SPECIFIC LEARNING OUTCOMES To understand: The concept of the file in the computing concept, field, character, byte and bits in relation to File 5 6 6 Concept Files In this section, we will deal with the concepts of the file and their relationship.
    [Show full text]
  • Dictionary of Ibm & Computing Terminology 1 8307D01a
    1 DICTIONARY OF IBM & COMPUTING TERMINOLOGY 8307D01A 2 A AA (ay-ay) n. Administrative Assistant. An up-and-coming employee serving in a broadening assignment who supports a senior executive by arranging meetings and schedules, drafting and coordinating correspondence, assigning tasks, developing presentations and handling a variety of other administrative responsibilities. The AA’s position is to be distinguished from that of the executive secretary, although the boundary line between the two roles is frequently blurred. access control n. In computer security, the process of ensuring that the resources of a computer system can be accessed only by authorized users in authorized ways. acknowledgment 1. n. The transmission, by a receiver, of acknowledge characters as an affirmative response to a sender. 2. n. An indication that an item sent was received. action plan n. A plan. Project management is never satisfied by just a plan. The only acceptable plans are action plans. Also used to mean an ad hoc short-term scheme for resolving a specific and well defined problem. active program n. Any program that is loaded and ready to be executed. active window n. The window that can receive input from the keyboard. It is distinguishable by the unique color of its title bar and window border. added value 1. n. The features or bells and whistles (see) that distinguish one product from another. 2. n. The additional peripherals, software, support, installation, etc., provided by a dealer or other third party. administrivia n. Any kind of bureaucratic red tape or paperwork, IBM or not, that hinders the accomplishment of one’s objectives or goals.
    [Show full text]
  • Chapter 1: Data Storage
    Chapter 1: Data Storage 1.1 Bits and Their Storage 1.2 Main Memory 1.3 Mass Storage 1.4 Representing Information as Bit Patterns 1.5 The Binary System 1.6 Storing Integers 1.7 Storing Fractions 1.8 Data Compression 1.9 Communication Errors 1 Computer == 0 and 1 ? Hmm…every movie says so…. Chapter 2 2 Why I can’t see any 0 and 1 when opening up a computer?? Chapter 2 3 What’s really in the computer With the help of an oscilloscope (示波器) Chapter 2 4 HIGH Bits LOW Bit Binary Digit The basic unit of information in a computer A symbol whose meaning depends on the application at hand. Numeric value (1 or 0) Boolean value (true or false) Voltage (high or low) For TTL, high=5V, low=0V 5 More bits? kilobit (kbit) 103 210 megabit (Mbit) 106 220 gigabit (Gbit) 109 230 terabit (Tbit) 1012 240 petabit (Pbit) 1015 250 exabit (Ebit) 1018 260 zettabit (Zbit) 1021 270 6 Bit Patterns All data stored in a computer are represented by patterns of bits: Numbers Text characters Images Sound Anything else… 7 Now you know what’s a ‘bit’, and then? How to ‘compute’ bits? How to ‘implement’ it ? How to ‘store’ bit in a computer? Chapter 2 8 How to do computation on Bits? Chapter 2 9 Boolean Operations Boolean operation any operation that manipulates one or more true/false values (e.g. 0=true, 1=false) Can be used to operate on bits Specific operations AND OR XOR NOT 10 AND, OR, XOR 11 Implement the Boolean operation on a computer Chapter 2 12 Gates Gates devices that produce the outputs of Boolean operations when given
    [Show full text]
  • Engilab Units 2018 V2.2
    EngiLab Units 2021 v3.1 (v3.1.7864) User Manual www.engilab.com This page intentionally left blank. EngiLab Units 2021 v3.1 User Manual (c) 2021 EngiLab PC All rights reserved. No parts of this work may be reproduced in any form or by any means - graphic, electronic, or mechanical, including photocopying, recording, taping, or information storage and retrieval systems - without the written permission of the publisher. Products that are referred to in this document may be either trademarks and/or registered trademarks of the respective owners. The publisher and the author make no claim to these trademarks. While every precaution has been taken in the preparation of this document, the publisher and the author assume no responsibility for errors or omissions, or for damages resulting from the use of information contained in this document or from the use of programs and source code that may accompany it. In no event shall the publisher and the author be liable for any loss of profit or any other commercial damage caused or alleged to have been caused directly or indirectly by this document. "There are two possible outcomes: if the result confirms the Publisher hypothesis, then you've made a measurement. If the result is EngiLab PC contrary to the hypothesis, then you've made a discovery." Document type Enrico Fermi User Manual Program name EngiLab Units Program version v3.1.7864 Document version v1.0 Document release date July 13, 2021 This page intentionally left blank. Table of Contents V Table of Contents Chapter 1 Introduction to EngiLab Units 1 1 Overview ..................................................................................................................................
    [Show full text]
  • Data Storage
    Chapter 1: Data Storage 1.1 Bits and Their Storage 1.2 Main Memory 1.3 Mass Storage 1.4 Representing Information as Bit Patterns 1.5 The Binary System 1.6 Storing Integers 1.7 Storing Fractions 1.8 Data Compression 1.9 Communication Errors 1 HIGH Bits LOW Bit Binary Digit A symbol whose meaning depends on the application at hand. Numeric value (1 or 0) Boolean value (true or false) Voltage (high or low) For TTL, high=5V, low=0V 2 More bits? kilobit (kbit) 103 210 megabit (Mbit) 106 220 gigabit (Gbit) 109 230 terabit (Tbit) 1012 240 petabit (Pbit) 1015 250 exabit (Ebit) 1018 260 zettabit (Zbit) 1021 270 3 Bit Patterns All data stored in a computer are represented by patterns of bits: Numbers Text characters Images Sound Anything else… 4 Boolean Operations Boolean operation any operation that manipulates one or more true/false values Can be used to operate on bits Specific operations AND OR XOR NOT 5 AND, OR, XOR 6 Gates Gates devices that produce the outputs of Boolean operations when given the operations‟ input values Often implemented as electronic circuits Provide the building blocks from which computers are constructed 7 AND, OR, XOR, NOT Gates Chapter 2 8 INPUT OUTPUT A B A NAND B NAND 0 0 1 0 1 1 1 0 1 NOR 1 1 0 XNOR 9 10 Store the bit What do we mean by „storing‟ the data? Bits in the computer at the i th second = Bits in the computer at the (i + 1) th second For example If the current state of the bit is „1‟, it should be still „1‟ at the next second 11 Flip-Flops Flip-Flop a circuit built from gates that can store one bit of data Two input lines One input line sets its stored value to 1 Another input line sets its stored value to 0 When both input lines are 0, the most recently stored value is preserved 12 Flip-Flops Illustrated X Y Z X Z 0 0 -- 0 1 0 Flip-Flop 1 0 1 Y 1 1 * 13 A Simple Flip-Flop Circuit 14 Setting to 1 – Step a.
    [Show full text]
  • File Organization & Management
    1 UNESCO -NIGERIA TECHNICAL & VOCATIONAL EDUCATION REVITALISATION PROJECT -PHASE II NATIONAL DIPLOMA IN COMPUTER TECHNOLOGY File Organization and Management YEAR II- SE MESTER I THEORY Version 1: December 2008 1 2 Table of Contents WEEK 1 File Concepts .................................................................................................................................6 Bit: . .................................................................................................................................................7 Binary digit .....................................................................................................................................8 Representation ...............................................................................................................................9 Transmission ..................................................................................................................................9 Storage ............................................................................................................................................9 Storage Unit .....................................................................................................................................9 Abbreviation and symbol ............................................................................................................ 10 More than one bit ......................................................................................................................... 11 Bit, trit,
    [Show full text]
  • 1 © 2010 Cisco And/Or Its Aliates. All Rights Reserved
    © 2010 Cisco and/or its a!liates. All rights reserved. 1 100G and beyond Bogdan Zapca Consulting Systems Engineer, [email protected] © 2010 Cisco and/or its a!liates. All rights reserved. Cisco Public 2 • Some opinions presented here are personal • During the presentation things like blunt approach, rude and/or o"ensive language may appear © 2010 Cisco and/or its a!liates. All rights reserved. Cisco Public 3 • Where we are • 40G and 100G today and tomorrow • Quo Vadis? • Beyond 100G © 2010 Cisco and/or its a!liates. All rights reserved. Cisco Public 4 Where are we? © 2010 Cisco and/or its a!liates. All rights reserved. Cisco Public 5 • In 2012, Half a Zettabyte (1021) Will Cross the Global Network • Services converging on IP Peer to peer Voice Video broadcast and VoD Over the top providers Video conferencing “According to the annual survey of the global digital output by International Data Corporation, the total amount of global data was expected to pass 1.2 zettabytes sometime during 2010. This is equivalent to the amount of data that would be generated by everyone in the world posting messages on the microblogging site Twitter continuously for a century.” - Wikipedia © 2010 Cisco and/or its a!liates. All rights reserved. Cisco Public 6 • Anybody measuring tra!c? (i.e. Do you really know what is passing over your network?) • Does your tra!c grow 300% / year? • What do you need /plan to use 40G or 100G? © 2010 Cisco and/or its a!liates. All rights reserved. Cisco Public 7 40G and 100G today and tomorrow Slides from Alessandro Cavaciuti Manager, Engineering – Transceiver Module Group © 2010 Cisco and/or its a!liates.
    [Show full text]
  • Mh4718 Week 2 Week 2
    Pat O'Sullivan Mh4718 Week 2 Week 2 0.0.0.1 Scientific Notation. Scientific notation, also known as standard form or as exponential notation, is a way of writing numbers that accommodates values too large or small to be conveniently written in standard decimal nota- tion. Scientific notation has a number of useful properties and is often favored by scientists, mathematicians and engineers, who work with such numbers. In scientific notation all numbers are written in the form: a × 10b where the exponent b is an integer, and the coefficient a is any real number (but see normalized notation below), called the significand or mantissa If the number is negative then a minus sign precedes a (as in ordinary decimal nota- tion). Any given number can be written in the form of a10b in many ways; for exam- ple 350 can be written as 3:5 × 102 or 35 × 101 or 350 × 100 In normalized scientific notation, the exponent b is chosen such that 1 ≤ jaj < 10. For example, 350 is written as 3:5 × 102. This form allows easy comparison of two numbers of the same sign in a, as the exponent b gives the number's order of magnitude. Note that 0 itself cannot be written in normalised scientific notation since the mantissa would have to be zero and the exponent undefined. 1 2 Mh4718 Numerical Analysis Ordinary decimal notation Scientific notation (normalized) 300 3 × 102 4,000 4 × 103 5,720,000,000 5:72 × 109 0.0000000061 6:1 × 109 Example 0.1 Base ten: • 2318 = 2:318 × 103.
    [Show full text]
  • The 2015 SNIA Dictionary Was Underwritten by the Generous Contributions Of
    The 2015 SNIA Dictionary was underwritten by the generous contributions of: If your organization is a SNIA member and is interested in sponsoring the 2016 edition of this dictionary, please contact [email protected]. 4360 ArrowsWest Drive Colorado Springs, CO 80907 719.694.1380 www.snia.org SNIA acknowledges and thanks its Voting Member Companies: Cisco Computerworld Cryptsoft Cygate DDN Dell EMC Emulex Evaluator Group Flexstar Fujitsu Hitachi HP Huawei IBM Intel Macrosan Microsoft NetApp NTP Software Oracle Pure Storage QLogic Samsung Toshiba XIO Voting members as of 3.23.15 Storage Networking Industry Association Your Connection Is Here Welcome to the Storage Networking Industry Association (SNIA). Our mission is to lead the storage industry worldwide in developing and promoting standards, technologies, and educational services to empower organizations in the management of information. Made up of member companies spanning the global storage market, the SNIA connects the IT industry with end-to-end storage and information management solutions. From vendors, to channel partners, to end users, SNIA members are dedicated to providing the industry with a high level of knowledge exchange and thought leadership. An important part of our work is to deliver vendor-neutral and technology-agnostic information to the storage and data management industry to drive the advancement of IT technologies, standards, and education programs for all IT professionals. For more information visit: www.snia.org The Storage Networking Industry Association 4360 ArrowsWest Drive Colorado Springs, Colorado 80907, U.S.A. +1 719-694-1380 The 2015 SNIA Dictionary A glossary of storage networking, data, and information management terminology by the Storage Networking Industry Association The SNIA Dictionary contains terms and definitions related to storage and other information technologies, and is the storage networking industry's most comprehensive attempt to date to arrive at a common body of terminology for the technologies it represents.
    [Show full text]
  • Evolving TDM to IP
    Evolving the Network to IP Services Andrew Walding, CellStream, Inc. www.cellstream.com ©2010 CellStream, Inc. All Rights Reserved 1 December 21, 1956 - February 9, 2010 ©2010 CellStream, Inc. All Rights Reserved 2 What will the Customer Demand? “Mobility” “Bandwidth” Performance Do they get the speed they are paying for? Do the games and video work? Is the phone better than the cell phone? This means “convergence” of voice, video, data with “Quality of Service” Need to define who the customer is ©2010 CellStream, Inc. All Rights Reserved 3 Connectivity Today - 2010 Does a POTS (Plain Old Telephone Service) Line mean: “truly connected”? 21st Century connectivity requires more than a POTS line -- requires a “pipe” to the information and services offered by the Internet Cloud The Internet ©2010 CellStream, Inc. All Rights Reserved 4 Past vs. Present The Past – 20th Century The Present – 21st Century Peer-to-Peer with broadcast Many-to-Many with multicast Mix of Analog and Digital All media is digital – single transport Producers supply Consumers All media is connected Peer-to-Peer is 1:1 Many-to-Many is M:N Traditional Telephone Producers and Consumers do Broadcast is 1:N both Newspaper CNN takes reports from TV/Radio Twitter End users send pictures and reports ©2010 CellStream, Inc. All Rights Reserved 5 “Take-Rate” The rate at which users adopt broadband Availa- bility to users ©2010 CellStream, Inc. All Rights Reserved 6 Broadband Adoption Rate Data Percentage Year Source Data Methodology 63% 2009 Pew Internet and Phone Survey of American American Life households and adults 64% 2009 Pike & Fischer Subscriber counts from industry reported information 63% 2008 Forrester Mail survey of American and Research Canadian households and adults 67% 2008 Nielsen Phone surveys Sources shown ©2010 CellStream, Inc.
    [Show full text]