DOCSLIB.ORG

Computer Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Computer Networks COMPUTER NETWORKS For COMPUTER SCIENCE COMPUTER NETWORKS . Syllabus Concept of layering. LAN technologies (Ethernet). Flow and error control techniques. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/ UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls. Basics of Wifi & switching, Digital signals. ANALYSIS OF GATE PAPERS Exam Year 1 Mark Ques. 2 Mark Ques. Total 2003 2 3 8 2004 3 4 11 2005 5 2 15 2006 1 5 11 2007 2 6 14 2008 1 4 9 2009 - 5 10 2010 2 3 8 2011 2 2 6 2012 3 3 9 2013 3 2 7 2014 Set-1 2 3 8 2014 Set-2 3 2 7 2014 Set-3 3 3 9 2015 Set-1 4 2 8 2015 Set-2 2 3 8 2015 Set-3 2 3 8 2016 Set-1 2 4 10 2016 Set-2 3 4 11 2017 Set-1 2 3 8 2017 Set-2 1 2 5 2018 3 4 7 © Copyright Reserved by Gateflix.in No part of this material should be copied or reproduced without permission CONTENTS Topics Page No 1. ISO OSI PHYSICAL LAYER, LAN TECHNOLOGIES 1.1 Introduction 1.2 Computer Networks 1.3 Design Issues of Layers 01 1.4 Network Hardware 01 1.5 Network Topology 01 1.6 Transmission Mode 02 1.7 Reference Models 0703 1.8 Functions of the Layer 07 1.9 TCP/IP References Model 1 1.10 Comparison of OSI and TCP/IP Reference Models 108 1.11 Physical Layer 0 1.12 Transmission Media 2 1.13 Coaxial Cable 13 1.14 Optical Fiber 13 1.15 Maximum Date Rate of the Channel 16 1.16 Communication Satellite 17 1.17 Access Algorithms 19 1.18 Manchester Encoding 219 1.19 LMR (Last Minute Revision) 221 Gate Questions 22 2 2. DATALINK LAYER AND SWP 4 2.1 Introduction 2.2 Data Link Layer Design Issue 2.3 Error Detection Correction 335 2.4 Error Correcting Codes 435 2.5 Data Link Protocols 59 2.6 IEEE LAN Standards 0 2.7 LLC Protocol 0 2.8 ALOHA 54 2.9 IEEE 802.3 and Ethernet 55 2.10 LMR (Last Minute Revision) 57 Gate Questions 59 62 3. NETWORK AND TRANSPORT LAYER 66 3.1 Introduction 3.2 Switching Networks 3.3 Congestion Control 76 76 83 © Copyright Reserved by Gateflix.in No part of this material should be copied or reproduced without permission 3.4 Bridges 3.5 Internetworking Devices 3.6 IP Addressing 87 3.7 Inter Networking Protocol (IPv4) Format 89 3.8 IPv6 Addressing 96 3.9 Routing Protocol 98 3.10 Introduction to Transport Layer 992 3.11 Duties of the Transport Layer 1002 3.12 Connection 105 3.13 OSI Transport Protocol 10 3.14 Addressing 10 3.15 Multihomed Device 106 3.16 Subnetting and Supernetting 108 3.17 IP Datagrams and Routing 111 3.18 Internet Protocol 113 Gate Questions 114 116 4. APPLICATION LAYER AND NETWORK SECURITY 129 4.1 Session Layer 4.2 Presentation Layer 4.3 Application Layer 154 4.4 Digital Signatures 155 4.5 Firewalls 163 4.6 Standard Common Applications 165 4.7 POP3 (Post Office Protocol) 166 4.8 IMAP (Interactive Mail Access Protocol) 1662 4.9 DMSP (Distributed Mail System Protocol) 1712 4.10 LMR (Last Minute Revision) 17 Gate Questions 117 172 74 ASSIGNMENT QUESTIONS 1 90 © Copyright Reserved by Gateflix.in No part of this material should be copied or reproduced without permission 1 ISO, OSI PHYSICAL LAYER, LAN TECHNOLOGY 1.1 INTRODUCTION A Network is a set of devices (often referred to as nodes) connected by media links. A node can be a computer, printer, or any other devices capable of sending and / or receiving data generated by other nodes on the network. The links connecting the devices are called communications channels. E.g. fiber optic link, satellite link. 1.2 COMPUTER NETWORKS Computer network means an interconnected collection of autonomous computers capable of having interconnections with each other. Computer network are generally organized as a series of layers or levels, each one built upon the one below it. 1.2.1 DESIGN ISSUES OF LAYERS Every layer needs a mechanism for identifying senders and receivers. A mean should be there for a process on one machine to specify with whom it wants to talk. Design decisions should concern the rules for data transfer. It can either be simplex or half- duplex or full – duplex communication. Error control is an important issue and any error – detecting or correcting codes must be known on both ends of the connections. Protocol that make explicit for the receiver to allow the pieces to be put back together properly. An issue that occurs at every level is how to keep, a fast sender from swapping a slow receiver with data. Issue that allows an arbitrarily long message to get accepted by the processes is, when there are multiple paths between source and destination, a route must be chosen. Sometimes this decision spilt over two or more layers. 1.3 NETWORK HARDWARE The physical devices that are used to establish and maintain the network are said to be Network Hardware. In addition to computers, Network hardware includes NIC, Hub, Switch, Router, Bridge and Gateway. Network Interface Card: It gives minimum eligibility for the nodes to be in networks. It can exist in either H/w or S/w form. It operates typically at Physical Layer. Repeater: It works like amplifier, i.e. It convert weak digital signal in to strong digital signal. It Operates at Physical Layer. Hub: It is a broadcasting device. Hence it stands for Hybrid Universal Broadcast. It operates at Physical and Data link Layers. There are 2 types of hubs: Active and Passive. Passive Hub is Just a Hub but Active hub can do repeater functionality also. © Copyright Reserved by Gateflix.in No part of this material should be copied or reproduced without permission Switch: It is a Uni casting device. There are two switch configurations: 2-layer and 3- layer. 2- Layer switch operates at Data link layer and 3-layer switch operates at Network layer. Router: It is to calculate the optimal route among network nodes. It operates at network and transport layers. Bridge: It is a forwarding device, used to connect two or more LANs or network segments. It operates at Data Link Layer. There are 3 types of bridges: Simple, Learning and Multi Port. Gateway: It is used as intermediate between two or more dissimilar networks. It is capable to convert one protocol format to another. It operates at all the layers. NOTE: Network Hardware, further discussed in detail in Chapter 4. 1.4 TYPES OF COMPUTER NETWORKS 1.4.1 LOCAL AREA NETWORKS (LAN) Local area networks (LAN) are privately – owned networks within a single building or campus of up to a few kilo meters in size e.g. Networks within IIT campus. 1.4.2 METROPOLITAN AREA NETWORK (MAN) Metropolitan area network (MAN) is basically a bigger version of a LAN and can support both data and voice. It covers a group of nearby corporate offices or a city and might be either private or public. E.g. Network connecting all IITs 1.4.3 WIDE AREA NETWORK (WAN) Wide area network (WAN) spans large geographical area, often a country or continent. It contains a collection of machines intended for running user programs. In most wide area network, the subnet consists of two distinct components: transmission lines and switching elements. Transmission lines move bits between machines. They can be made of copper wire, optical fiber, or even radio links. Switching elements are specialized computers that connect three or more transmission lines. When data arrive on an incoming line, the switching element must choose an outgoing line on which to forward them. These switching computers have been called by various names in the past; the name router is now most commonly used. 1.4.4 SYSTEM AREA NETWORKS (SAN) Another kind of network that we need to be aware of is SANs (system area networks). SANs are usually confined to a single room and connect the various components of a large computing system. For example, HiPPI (High Performance Parallel Interface) and Fiber Channel are two common SAN technologies used to connect massively parallel processors to scalable storage server and data vaults. (Because they often connect computers to © Copyright Reserved by Gateflix.in No part of this material should be copied or reproduced without permission storage servers, SANs are sometimes defined as storage area network s). e.g. Organization connected worldwide. 1.4.5 LINE CONFIGURATION Line configuration refers to the way two or more communication devices attach to link. There are two possible line configurations: i) Point- to - Point A point–to–point line configuration provides a dedicated link between two devices. ii) Multi point A multiport line configuration is one in which more than two specific devices share a single link. 1.5 NETWORK TOPOLOGY Topology refers to the way a network is laid out, either physically or logically. Two or more devices connect to a link, and then these two or more links form a topology. The topology of a network is the geometric representation of the relationship of all the links and linking devices (usually called nodes) to each other. Topology is the relative status of the devices to be linked. It can either be peer- to –peer, where the devices share the link equally or primary – secondary, where one devices controls traffic and the others must transmit through it.
Load more

Recommended publications
  • Introduction to the Ipaddress Module
    Introduction to the ipaddress Module An Introduction to the ipaddress Module Overview: This document provides an introduction to the ipaddress module used in the Python language for manipulation of IPv4 and IPv6 addresses. At a high level, IPv4 and IPv6 addresses are used for like purposes and functions. However, since there are major differences in the address structure for each protocol, this tutorial has separated into separate sections, one each for IPv4 and IPv6. In today’s Internet, the IPv4 protocol controls the majority of IP processing and will remain so for the near future. The enhancements in scale and functionality that come with IPv6 are necessary for the future of the Internet and adoption is progressing. The adoption rate, however, remains slow to this date. IPv4 and the ipaddress Module: The following is a brief discussion of the engineering of an IPv4 address. Only topics pertinent to the ipaddress module are included. A IPv4 address is composed of 32 bits, organized into four eight bit groupings referred to as “octets”. The word “octet” is used to identify an eight-bit structure in place of the more common term “byte”, but they carry the same definition. The four octets are referred to as octet1, octet2, octet3, and octet4. This is a “dotted decimal” format where each eight-bit octet can have a decimal value based on eight bits from zero to 255. IPv4 example: 192.168.100.10 Every packet in an IPv4 network contains a separate source and destination address. As a unique entity, a IPv4 address should be sufficient to route an IPv4 data packet from the source address of the packet to the destination address of the packet on a IPv4 enabled network, such as the Internet.
    [Show full text]
  • The Essentials of Computer Organization and Architecture / Linda Null, Julia Lobur
    the essentials of Linda Null and Julia Lobur JONES AND BARTLETT COMPUTER SCIENCE the essentials of Linda Null Pennsylvania State University Julia Lobur Pennsylvania State University World Headquarters Jones and Bartlett Publishers Jones and Bartlett Publishers Jones and Bartlett Publishers International 40 Tall Pine Drive Canada Barb House, Barb Mews Sudbury, MA 01776 2406 Nikanna Road London W6 7PA 978-443-5000 Mississauga, ON L5C 2W6 UK [email protected] CANADA www.jbpub.com Copyright © 2003 by Jones and Bartlett Publishers, Inc. Cover image © David Buffington / Getty Images Illustrations based upon and drawn from art provided by Julia Lobur Library of Congress Cataloging-in-Publication Data Null, Linda. The essentials of computer organization and architecture / Linda Null, Julia Lobur. p. cm. ISBN 0-7637-0444-X 1. Computer organization. 2. Computer architecture. I. Lobur, Julia. II. Title. QA76.9.C643 N85 2003 004.2’2—dc21 2002040576 All rights reserved. No part of the material protected by this copyright notice may be reproduced or utilized in any form, electronic or mechanical, including photocopying, recording, or any information storage or retrieval system, without written permission from the copyright owner. Chief Executive Officer: Clayton Jones Chief Operating Officer: Don W. Jones, Jr. Executive V.P. and Publisher: Robert W. Holland, Jr. V.P., Design and Production: Anne Spencer V.P., Manufacturing and Inventory Control: Therese Bräuer Director, Sales and Marketing: William Kane Editor-in-Chief, College: J. Michael Stranz Production Manager: Amy Rose Senior Marketing Manager: Nathan Schultz Associate Production Editor: Karen C. Ferreira Associate Editor: Theresa DiDonato Production Assistant: Jenny McIsaac Cover Design: Kristin E.
    [Show full text]
  • Chapter 2 Data Representation in Computer Systems 2.1 Introduction
    QUIZ ch.1 • 1st generation • Integrated circuits • 2nd generation • Density of silicon chips doubles every 1.5 yrs. rd • 3 generation • Multi-core CPU th • 4 generation • Transistors • 5th generation • Cost of manufacturing • Rock’s Law infrastructure doubles every 4 yrs. • Vacuum tubes • Moore’s Law • VLSI QUIZ ch.1 The highest # of transistors in a CPU commercially available today is about: • 100 million • 500 million • 1 billion • 2 billion • 2.5 billion • 5 billion QUIZ ch.1 The highest # of transistors in a CPU commercially available today is about: • 100 million • 500 million “As of 2012, the highest transistor count in a commercially available CPU is over 2.5 • 1 billion billion transistors, in Intel's 10-core Xeon • 2 billion Westmere-EX. • 2.5 billion Xilinx currently holds the "world-record" for an FPGA containing 6.8 billion transistors.” Source: Wikipedia – Transistor_count Chapter 2 Data Representation in Computer Systems 2.1 Introduction • A bit is the most basic unit of information in a computer. – It is a state of “on” or “off” in a digital circuit. – Sometimes these states are “high” or “low” voltage instead of “on” or “off..” • A byte is a group of eight bits. – A byte is the smallest possible addressable unit of computer storage. – The term, “addressable,” means that a particular byte can be retrieved according to its location in memory. 5 2.1 Introduction A word is a contiguous group of bytes. – Words can be any number of bits or bytes. – Word sizes of 16, 32, or 64 bits are most common. – Intel: 16 bits = 1 word, 32 bits = double word, 64 bits = quad word – In a word-addressable system, a word is the smallest addressable unit of storage.
    [Show full text]
  • Topics Today
    CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 01, SPRING 2013 TOPICS TODAY • Course overview • Levels of machines • Machine models: von Neumann & System Bus • Fetch-Execute Cycle • Base Conversion COURSE OVERVIEW CMSC 313 Course Description Spring 2013 Computer Organization & Assembly Language Programming Instructor. Prof. Richard Chang, [email protected], 410-455-3093. Office Hours: Tuesday & Thursday 11:30am–12:30pm, ITE 326. Teaching Assistant. Roshan Ghumare, [email protected] Office Hours: TBA Time and Place. Section 01: Tu - Th 10:00am – 11:15am, ITE 229. Section 02: Tu - Th 1:00pm – 2:15pm, ITE 229. Textbook. • Essentials of Computer Organization and Architecture, third edition, by Linda Null & Julia Lobur. Jones & Bartlett Learning, 2010. ISBN: 1449600069. • Assembly Language Step-by-Step: Programming with Linux, third edition, by Jeff Duntemann. Wiley, 2009. ISBN: 0470497025. Web Page. http://umbc.edu/~chang/cs313/ Catalog Description. This course introduces the student to the low-level abstraction of a computer system from a programmer's point of view, with an emphasis on low-level programming. Topics include data representation, assembly language programming, C programming, the process of compiling and linking, low-level memory management, exceptional control flow, and basic processor architecture. Prerequisites. You should have mastered the material covered in the following courses: CMSC 202 Computer Science II and CMSC 203 Discrete Structures. You need the programming experience from CMSC202. Additional experience from CMSC341 Data Structures would also be helpful. You must also be familiar with and be able to work with truth tables, Boolean algebra and modular arithmetic. Objectives. The purpose of this course is to introduce computer science majors to computing systems below that of a high-level programming language.
    [Show full text]
  • CS5865 Laboratory #1 Notes File Transfer Protocols
    1 CS5865 Laboratory #1 Notes File Transfer Protocols - An Overview Dr. B.J. Kurz XMODEM (Ward Christensen, 1970), one of the earliest ‘industry standard’ file transfer protocols in the public domain. HDX operation, character (byte)-oriented, fixed-length 128-byte blocks, 8-bit characters (bytes), 8-bit BCC = sum-mod256, stop-wait ARQ, block counts, binary data capability. Poor error detection capability, typically 95%. data block format: SOH/count/1’s compl. count/ user data/BCC control block format: ACK or NAK (or C), EOT Several later versions of XMODEM are in use: XMODEM-CRC same as regular XMODEM above except uses 8-bit BCC = CRC-8 (some implementations use 16-bit BCC = CRC-16). Better error detection capability, typically 99.97% (for CRC-8). Some versions negotiate the error character generation method: the sender first tries sum- mod256 BCC, then switches to CRC-8 BCC after three unsuccessful attempts indicated by NAKs from the receiver. XMODEM-1K same as XMODEM-CRC except uses 1024-byte blocks for better throughput (fewer line- turn-arounds), but slightly degraded error detection performance. WXMODEM a sliding-window version of XMODEM. Group size is fixed as 4 blocks. Much improved throughput. FDX capable lines needed if continous-ARQ error recovery used. YMODEM (Chuck Forsberg) a variation of XMODEM-1K. Supports two block lengths of 128 bytes and 1024 bytes, uses 2-byte CRC-16, excellent error detection capability, typically 99.99%. KERMIT (Frank de Cruz, Columbia Univ. Comp. Center, N.Y), most popular file transfer protocol, copyrighted, over 200 implementations for various systems. This is a comprehensive 2 remote communications package including terminal emulators, storage-to-storage transfer, not only a file transfer protocol.
    [Show full text]
  • Flow Control and ARQ Media Access Physical
    Data Link Layer The Data Link layer can be further subdivided into: Computer Networks application 1. Logical Link Control (LLC): provides flow and error control transport • different link protocols may provide different services, e.g., Ethernet doesn’t provide reliable network delivery (error recovery) Lecture 26: 2. Media Access Control (MAC): framing and LLC MAC Flow Control and ARQ media access physical Link Layer Services Flow Control Flow Control: What is flow control? • pacing between adjacent sending and receiving nodes • receiver telling sender to slow down Error Control: Why do you need flow control? • errors caused by signal attenuation, noise • ARQ: receiver detects presence of errors and asks sender for retransmission Flow control protocols at data link layer (single hop): • FEC: receiver identifies and corrects bit error(s), • XON/XOFF without resorting to retransmission • Stop & Wait Protocol • Sliding Window Protocol Reliable delivery between adjacent nodes • seldom used on low bit error links (fiber, some twisted pair) Similar issues and mechanisms apply at the • plays an important role in wireless links with high error rates transport layer (end-to-end) • Q: why do we need both link-level and end-end reliability? XON/XOFF Stop and Wait (S&W) Protocol ! : propagation After sending a packet, sender must wait for delay SR acknowledgment (ACK) before sending the next packet sender receiver Sender Receiver S R round-trip Algorithm: time (rtt) t • S sends stream of data Time ! : propagation • R sends XOFF, S stops transmission pkt
    [Show full text]
  • Effect of Sliding Window Techniques Over a Performance of Tcp/Ip Networks
    EFFECT OF SLIDING WINDOW TECHNIQUES OVER A PERFORMANCE OF TCP/IP NETWORKS ABBAS ABEDI JANUARY, 2018 EFFECT OF SLIDING WINDOWS TECHNIQUES OVER A PERFORMANCE OF TCP/IP NETWORKS A THESIS SUBMITTED TO THE GRADUATE SCHOOL OF NATURAL AND APPLIED SCIENCES OF CANKAYA UNIVERSITY BY ABBAS ABEDI IN PARTIAL FULLFILLMENT OF a REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN THE DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING JANUARY, 2018 ABSTRACT EFFECT OF SLIDING WINDOWS TECHNIQUES OVER A PERFORMANCE OF TCP/IP NETWORKS ABEDI, Abbas M.Sc., Department of Electronics and Communication Engineering Supervisor: Asst. Prof. Dr. Barbaros PREVEZE January 2018 The communication channels have a variety of features in the communication system and networks, particularly wireless channels. It is used in transmissions between two nodes and deals with high error rates. Such errors that occur frequently which are not easy to be avoided, have the greatest effect on the performance of a network. So, it must be concluded that error rates are for different network conditions with use of different types of sliding windows techniques. In this thesis, error correcting techniques have been investigated based on a retransmission technique they used. One of the famous retransmission techniques is sliding windows technique, which it has three sub-algorithms called: stop and wait, selective repeat, and go back N. In this work, selective repeat and go back N algorithms were taken into account, but a stop and wait algorithm was not considered since it doesn’t use any window structure in their retransmissions. Also, it always has a high delay amount with less performance compared to the selective repeat and go back N techniques.
    [Show full text]
  • The Kermit File Transfer Protocol
    THE KERMIT FILE TRANSFER PROTOCOL Frank da Cruz February 1985 This is the original manuscript of the Digital Press book Kermit, A File Transfer Protocol, ISBN 0-932976-88-6, Copyright 1987, written in 1985 and in print from 1986 until 2001. This PDF file was produced by running the original Scribe markup-language source files through the Scribe publishing package, which still existed on an old Sun Solaris computer that was about to be shut off at the end of February 2016, and then converting the resulting PostScript version to PDF. Neither PostScript nor PDF existed in 1985, so this result is a near miracle, especially since the last time this book was "scribed" was on a DECSYSTEM-20 for a Xerox 9700 laser printer (one of the first). Some of the tables are messed up, some of the source code comes out in the wrong font; there's not much I can do about that. Also (unavoidably) the page numbering is different from the printed book and of couse the artwork is missing. Bear in mind Kermit protocol and software have seen over 30 years of progress and development since this book was written. All information herein regarding the Kermit Project, how to get Kermit software, or its license or status, etc, is no longer valid. The Kermit Project at Columbia University survived until 2011 but now it's gone and all Kermit software was converted to Open Source at that time. For current information, please visit the New Open Source Kermit Project website at http://www.kermitproject.org (as long as it lasts).
    [Show full text]
  • Data Representation in Computer Systems
    © Jones & Bartlett Learning, LLC © Jones & Bartlett Learning, LLC NOT FOR SALE OR DISTRIBUTION NOT FOR SALE OR DISTRIBUTION There are 10 kinds of people in the world—those who understand binary and those who don’t. © Jones & Bartlett Learning, LLC © Jones—Anonymous & Bartlett Learning, LLC NOT FOR SALE OR DISTRIBUTION NOT FOR SALE OR DISTRIBUTION © Jones & Bartlett Learning, LLC © Jones & Bartlett Learning, LLC NOT FOR SALE OR DISTRIBUTION NOT FOR SALE OR DISTRIBUTION CHAPTER Data Representation © Jones & Bartlett Learning, LLC © Jones & Bartlett Learning, LLC NOT FOR SALE 2OR DISTRIBUTIONin ComputerNOT FOR Systems SALE OR DISTRIBUTION © Jones & Bartlett Learning, LLC © Jones & Bartlett Learning, LLC NOT FOR SALE OR DISTRIBUTION NOT FOR SALE OR DISTRIBUTION 2.1 INTRODUCTION he organization of any computer depends considerably on how it represents T numbers, characters, and control information. The converse is also true: Stan- © Jones & Bartlettdards Learning, and conventions LLC established over the years© Jones have determined& Bartlett certain Learning, aspects LLC of computer organization. This chapter describes the various ways in which com- NOT FOR SALE putersOR DISTRIBUTION can store and manipulate numbers andNOT characters. FOR SALE The ideas OR presented DISTRIBUTION in the following sections form the basis for understanding the organization and func- tion of all types of digital systems. The most basic unit of information in a digital computer is called a bit, which is a contraction of binary digit. In the concrete sense, a bit is nothing more than © Jones & Bartlett Learning, aLLC state of “on” or “off ” (or “high”© Jones and “low”)& Bartlett within Learning, a computer LLCcircuit. In 1964, NOT FOR SALE OR DISTRIBUTIONthe designers of the IBM System/360NOT FOR mainframe SALE OR computer DISTRIBUTION established a conven- tion of using groups of 8 bits as the basic unit of addressable computer storage.
    [Show full text]
  • Courier V.Everything External Modem: Getting Started
    Courier V.Everything External Modem: Getting Started FINAL 4/96 p/n 1.024.492 1996 U.S. Robotics Access Corp. 8100 North McCormick Blvd. Skokie, IL 60076-2999 All Rights Reserved U.S. Robotics and the U.S. Robotics logo are registered trademarks of U.S. Robotics Access Corp. V.Fast Class and V.FC are trademarks of Rockwell International. Any trademarks, tradenames, service marks or service names owned or registered by any other company and used in this manual are the property of their respective companies. 1996 U.S. Robotics Access Corp. 8100 N. McCormick Blvd. Skokie, IL 60076-2999 USA Table of Contents About This Manual iii We Welcome Your Suggestions.............................................................iii Chapter 1 The Courier 1-1 Courier Controls, Displays, and Connectors.....................................1-3 Status Indicators ....................................................................................1-4 Features...................................................................................................1-5 Chapter 2 Installing the Courier 2-1 What You Need......................................................................................2-1 Package Contents...................................................................................2-3 Installing the Courier ............................................................................2-4 Setting the DIP Switches.......................................................................2-4 Powering On the Courier .....................................................................2-6
    [Show full text]
  • Configuration Parameters
    Good news, everyone! User Documentation Version: 2020-01-01 M. Brutman ([email protected]) http://www.brutman.com/mTCP/ Table of Contents Introduction and Setup Introduction..............................................................................................................................................................8 What is mTCP?...................................................................................................................................................8 Features...............................................................................................................................................................8 Tested machines/environments...........................................................................................................................9 Licensing...........................................................................................................................................................10 Packaging..........................................................................................................................................................10 Binaries.....................................................................................................................................................................10 Documentation..........................................................................................................................................................11 Support and contact information.......................................................................................................................11
    [Show full text]
  • Electronic Bulletin Board System for the Federal Depository Library Program
    GP 3.2:E1 2 Electronic Bulletin Board System for the Federal Depository Library Program: A Study Library Programs Service U.S. Government Printing Office Superintendent of Documents Washington, D.C. 1991 tr Electronic Bulletin Board System for the Federal Depository Library Program A Study Written by: Marian W. MacGilvray Joseph P. Paskoski John M. Walters Project Director: Joseph C. McClane February 1, 1991 Library Programs Service U.S. Government Printing Office Washington, D.C. U.S. Government Printing Office Robert W. Houk, Public Printer Superintendent of Documents (Vacant) Library Programs Service Bonnie B. Trivizas, Director Library Division Gil Baldwin, Chief Depository Services Staff Joseph C. McClane, Chief Any use of trade, product, or firm names in this publication is for descriptive purposes only and does not imply endorsement by the U.S. Government. Table of Contents Preface , iv I. Executive Summary and Recommendations 1 II. Introduction A. Federal Depository Library Program 2 B. Basis of the Study 2 C. Scope of the System 2 D. Study Methodology 2 III. Bulletin Board Systems - General Characteristics 3 IV. FDLP Bulletin Board System - System Description A. File Characteristics and Size 4 B. Usage Characteristics 7 C. Staffing 7 D. Telecommunications . 7 E. System Configuration Options and Costs 8 F. Implementation Schedule 11 Bibliography 13 Appendix A. Recommendations, Depository Library Council 14 Appendix B. List of Consultants 15 Appendix C. Suggestions for File Content 18 Appendix D. Alternate Technologies 20 Appendix E. Hardware and Software 25 iii Preface A preliminary draft of "Electronic Bulletin Board • the system will be beta tested with the 54 System for the Federal Depository Library Program: A regional depositories before being made Study" was completed on October 15, 1990 and available to all depository libraries.
    [Show full text]