Communication and Networking Circuit and Packet Switching Basics

Total Page:16

File Type:pdf, Size:1020Kb

Communication and Networking Circuit and Packet Switching Basics ECE2305: Circuit and Packet Switching Basics Communication and Networking Circuit and Packet Switching Basics D. Richard Brown III (selected figures from Stallings Data and Computer Communications 10th edition) D. Richard Brown III 1 / 20 ECE2305: Circuit and Packet Switching Basics Unswitched/Unmultiplexed Network I Dedicated link between each user I Lots of wires I Lots of network ports I Difficult to add more users D. Richard Brown III 2 / 20 ECE2305: Circuit and Packet Switching Basics Switched Network I No dedicated links between users I Extra switching hardware needed I Additional overhead to ensure data goes to the right place D. Richard Brown III 3 / 20 ECE2305: Circuit and Packet Switching Basics Circuit Switching Three phases: 1. Circuit establishment 2. Data transfer 3. Circuit disconnect Once connected, the data transfer is transparent: I Dedicated circuit between sender and receiver I Very low delay (essentially just propagation delay) I Efficient for analog transmission of voice signals I Can be inefficient for digital transmissions since channel capacity is dedicated for the duration of connection I Like structured multiplexing techniques, e.g., synchronous TDM, channel is reserved even if not used (until disconnect) D. Richard Brown III 4 / 20 ECE2305: Circuit and Packet Switching Basics Blocking vs. Non-Blocking Circuit Switched Networks Blocking network: I More users than actual circuits available in network I May be unable to connect users in periods of high use because all circuits are busy I Usually acceptable (although inconvenient) for voice traffic Non-blocking network: I Enough circuits available to permit all users to connect (in pairs) simultaneously I Usually expected for data traffic I May require buffering D. Richard Brown III 5 / 20 ECE2305: Circuit and Packet Switching Basics Space Division Switching I Originally developed for analog links I Also applicable to digital links I Signal paths are physically separate from one another I Path is dedicated solely to transfer signals I Basic building block of switch is a metallic crosspoint or semiconductor gate Images from: http://www.forensicgenealogy.info/contest 28 results.html and http://rhetoricaldevice.com/RingRingRing.html. D. Richard Brown III 6 / 20 ECE2305: Circuit and Packet Switching Basics Non-Blocking Space Division Switch D. Richard Brown III 7 / 20 ECE2305: Circuit and Packet Switching Basics Three-Stage Space Division Switch Blocking possible here. D. Richard Brown III 8 / 20 ECE2305: Circuit and Packet Switching Basics Public Circuit Switched Network Note that trunks might be synchronous TDM lines, e.g., DS-1 or SONET The main idea here is that, from the point of view of the users, there is a dedicated circuit between them. D. Richard Brown III 9 / 20 ECE2305: Circuit and Packet Switching Basics Modern \Circuit" Switching: Time-Division Switching I Most analog signals are now digitized before transmission through a network I Low cost of digital hardware I Telephone operators replaced by smart digital switches that automatically establish and release dedicated \circuits" I Synchronous TDM multiplexing usually used: I Multiplex low rate data streams into dedicated timeslots in a high rate data stream I Guaranteed data rate through circuit I Low delay I Transparent to end users D. Richard Brown III 10 / 20 ECE2305: Circuit and Packet Switching Basics Motivation for Packet Switching Fundamental conflict/tradeoff in communication systems: I Pre-allocation of dedicated channel capacity (FDM, synchronous TDM, circuit switching) I Dynamic allocation of on-demand channel capacity (statistical TDM, packet switching) 1968: I Almost all voice/data networks were circuit switched I Real-time dynamic allocation of channel capacity was unrealistic given current computer hardware 1969: ARPANET I First demonstrations of packet switched computer network If lines are cheap: use circuit switching If computing is cheap: use packet switching D. Richard Brown III 11 / 20 ECE2305: Circuit and Packet Switching Basics Packet Switching I Station breaks long message into packets I Packets sent one at a time to the network I Network dynamically allocates capacity and delivers packets to receiver without establishing a dedicated link I Two common approaches: I Virtual circuit packet switching I Datagram packet switching D. Richard Brown III 12 / 20 ECE2305: Circuit and Packet Switching Basics Effect of Packet Size Packets: X ! a ! b ! Y Packets forwarded only after they have been completely received. Assume: I 40 byte/octet data I 3 byte header Cases: (a) 40 + 3 = 43 byte packets (b) 20 + 3 = 23 byte packets (c) 8 + 3 = 11 byte packets (d) 4 + 3 = 7 byte packets D. Richard Brown III 13 / 20 ECE2305: Circuit and Packet Switching Basics Virtual Circuit Packet Switching I Route is pre-planned (requires a call setup phase) I All packets follow the same route I Packets will arrive in order I No per-packet routing decisions need to be made (low per-packet overhead) I Can be affected by network problems I Network can provide sequencing and error control I Typically more efficient for long messages (low per-packet overhead outweighs fixed call setup overhead) Note this is not a dedicated circuit (no reserved capacity). D. Richard Brown III 14 / 20 ECE2305: Circuit and Packet Switching Basics Virtual Circuit Packet Switching D. Richard Brown III 15 / 20 ECE2305: Circuit and Packet Switching Basics Datagram Packet Switching I No call setup phase I Each packet is treated independently I Packets may take different routes I Packets may arrive out of order I Usually more reliable (robust to network problems) I More flexible I Typically more efficient for short messages (no fixed call setup overhead but higher per-packet overhead) As seen in lab 5, this is how IP works. D. Richard Brown III 16 / 20 ECE2305: Circuit and Packet Switching Basics Virtual Circuits vs. Datagram Packet Switching Virtual circuits: I Call setup phase results in more fixed overhead I Less per-packet overhead during data transmission since no routing decisions have to be made for each packet I Network can provide sequencing and error control I Susceptible to single point of failure Datagram: I No call setup phase results in very small fixed overhead I More per-packet overhead during data transmission since routing decisions have to be made for each packet I Typically more flexible and resilient to network problems D. Richard Brown III 17 / 20 ECE2305: Circuit and Packet Switching Basics Typical Timing Diagrams D. Richard Brown III 18 / 20 ECE2305: Circuit and Packet Switching Basics Comparison Table D. Richard Brown III 19 / 20 ECE2305: Circuit and Packet Switching Basics Final Remarks I Circuit switching (originally developed for analog voice communication) I Packet switching (1969 ARPANET) I Virtual circuit I Datagram I Performance depends on several factors I Propagation delays I Length of message that will be transmitted I Application (continuous data or intermittent?) I Size of packets I Switching/routing delays I Bottom line: I Tradeoff between fixed overhead and per-packet overhead I Datagram packet switching preferred in most modern applications D. Richard Brown III 20 / 20.
Recommended publications
  • Guidelines on Mobile Device Forensics
    NIST Special Publication 800-101 Revision 1 Guidelines on Mobile Device Forensics Rick Ayers Sam Brothers Wayne Jansen http://dx.doi.org/10.6028/NIST.SP.800-101r1 NIST Special Publication 800-101 Revision 1 Guidelines on Mobile Device Forensics Rick Ayers Software and Systems Division Information Technology Laboratory Sam Brothers U.S. Customs and Border Protection Department of Homeland Security Springfield, VA Wayne Jansen Booz-Allen-Hamilton McLean, VA http://dx.doi.org/10.6028/NIST.SP. 800-101r1 May 2014 U.S. Department of Commerce Penny Pritzker, Secretary National Institute of Standards and Technology Patrick D. Gallagher, Under Secretary of Commerce for Standards and Technology and Director Authority This publication has been developed by NIST in accordance with its statutory responsibilities under the Federal Information Security Management Act of 2002 (FISMA), 44 U.S.C. § 3541 et seq., Public Law (P.L.) 107-347. NIST is responsible for developing information security standards and guidelines, including minimum requirements for Federal information systems, but such standards and guidelines shall not apply to national security systems without the express approval of appropriate Federal officials exercising policy authority over such systems. This guideline is consistent with the requirements of the Office of Management and Budget (OMB) Circular A-130, Section 8b(3), Securing Agency Information Systems, as analyzed in Circular A- 130, Appendix IV: Analysis of Key Sections. Supplemental information is provided in Circular A- 130, Appendix III, Security of Federal Automated Information Resources. Nothing in this publication should be taken to contradict the standards and guidelines made mandatory and binding on Federal agencies by the Secretary of Commerce under statutory authority.
    [Show full text]
  • Research on the System Structure of IPV9 Based on TCP/IP/M
    International Journal of Advanced Network, Monitoring and Controls Volume 04, No.03, 2019 Research on the System Structure of IPV9 Based on TCP/IP/M Wang Jianguo Xie Jianping 1. State and Provincial Joint Engineering Lab. of 1. Chinese Decimal Network Working Group Advanced Network, Monitoring and Control Shanghai, China 2. Xi'an, China Shanghai Decimal System Network Information 2. School of Computer Science and Engineering Technology Ltd. Xi'an Technological University e-mail: [email protected] Xi'an, China e-mail: [email protected] Wang Zhongsheng Zhong Wei 1. School of Computer Science and Engineering 1. Chinese Decimal Network Working Group Xi'an Technological University Shanghai, China Xi'an, China 2. Shanghai Decimal System Network Information 2. State and Provincial Joint Engineering Lab. of Technology Ltd. Advanced Network, Monitoring and Control e-mail: [email protected] Xi'an, China e-mail: [email protected] Abstract—Network system structure is the basis of network theory, which requires the establishment of a link before data communication. The design of network model can change the transmission and the withdrawal of the link after the network structure from the root, solve the deficiency of the transmission is completed. It solves the problem of original network system, and meet the new demand of the high-quality real-time media communication caused by the future network. TCP/IP as the core network technology is integration of three networks (communication network, successful, it has shortcomings but is a reasonable existence, broadcasting network and Internet) from the underlying will continue to play a role. Considering the compatibility with structure of the network, realizes the long-distance and the original network, the new network model needs to be large-traffic data transmission of the future network, and lays compatible with the existing TCP/IP four-layer model, at the a solid foundation for the digital currency and virtual same time; it can provide a better technical system to currency of the Internet.
    [Show full text]
  • X.25: ITU-T Protocol for WAN Communications
    X.25: ITU-T Protocol for WAN Communications X.25, an ITU-T protocol for WAN communications, is a packet switched data network protocol which defines the exchange of data as well as control information between a user device, called Data Terminal Equipment (DTE) and a network node, called Data Circuit Terminating Equipment (DCE). X.25 is designed to operate effectively regardless of the type of systems connected to the network. X.25 is typically used in the packet-switched networks (PSNs) of common carriers, such as the telephone companies. Subscribers are charged based on their use of the network. X.25 utilizes a Connection-Oriented service which insures that packets are transmitted in order. X.25 sessions are established when one DTE device contacts another to request a communication session. The DTE device that receives the request can either accept or refuse the connection. If the request is accepted, the two systems begin full-duplex information transfer. Either DTE device can terminate the connection. After the session is terminated, any further communication requires the establishment of a new session. X.25 uses virtual circuits for packets communications. Both switched and permanent virtual circuits are used. X.75 is the signaling protocol for X.25, which defines the signaling system between two PDNs. X.75 is essentially an Network to Network Interface (NNI). X.25 protocol suite comes with three levels based on the first three layers of the OSI seven layers architecture. The Physical Level: describes the interface with the physical environment. There are three protocols in this group: 1) X.21 interface operates over eight interchange circuits; 2) X.21bis defines the analogue interface to allow access to the digital circuit switched network using an analogue circuit; 3) V.24 provides procedures which enable the DTE to operate over a leased analogue circuit connecting it to a packet switching node or concentrator.
    [Show full text]
  • Virtual-Circuit Networks: Frame Relay Andatm
    CHAPTER 18 Virtual-Circuit Networks: Frame Relay andATM In Chapter 8, we discussed switching techniques. We said that there are three types of switching: circuit switching, packet switching, and message switching. We also men­ tioned that packet switching can use two approaches: the virtual-circuit approach and the datagram approach. In this chapter, we show how the virtual-circuit approach can be used in wide-area networks. Two common WAN technologies use virtual-circuit switching. Frame Relay is a relatively high-speed protocol that can provide some services not available in other WAN technologies such as DSL, cable TV, and T lines. ATM, as a high-speed protocol, can be the superhighway of communication when it deploys physical layer carriers such as SONET. We first discuss Frame Relay. We then discuss ATM in greater detaiL Finally, we show how ATM technology, which was originally designed as a WAN technology, can also be used in LAN technology, ATM LANs. 18.1 FRAME RELAY Frame Relay is a virtual-circuit wide-area network that was designed in response to demands for a new type ofWAN in the late 1980s and early 1990s. 1. Prior to Frame Relay, some organizations were using a virtual-circuit switching network called X.25 that performed switching at the network layer. For example, the Internet, which needs wide-area networks to carry its packets from one place to another, used X.25. And X.25 is still being used by the Internet, but it is being replaced by other WANs. However, X.25 has several drawbacks: a.
    [Show full text]
  • F. Circuit Switching
    CSE 3461: Introduction to Computer Networking and Internet Technologies Circuit Switching Presentation F Study: 10.1, 10.2, 8 .1, 8.2 (without SONET/SDH), 8.4 10-02-2012 A Closer Look At Network Structure: • network edge: applications and hosts • network core: —routers —network of networks • access networks, physical media: communication links d. xuan 2 1 The Network Core • mesh of interconnected routers • the fundamental question: how is data transferred through net? —circuit switching: dedicated circuit per call: telephone net —packet-switching: data sent thru net in discrete “chunks” d. xuan 3 Network Layer Functions • transport packet from sending to receiving hosts application transport • network layer protocols in network data link network physical every host, router network data link network data link physical data link three important functions: physical physical network data link • path determination: route physical network data link taken by packets from source physical to dest. Routing algorithms network network data link • switching: move packets from data link physical physical router’s input to appropriate network data link application router output physical transport network data link • call setup: some network physical architectures require router call setup along path before data flows d. xuan 4 2 Network Core: Circuit Switching End-end resources reserved for “call” • link bandwidth, switch capacity • dedicated resources: no sharing • circuit-like (guaranteed) performance • call setup required d. xuan 5 Circuit Switching • Dedicated communication path between two stations • Three phases — Establish (set up connection) — Data Transfer — Disconnect • Must have switching capacity and channel capacity to establish connection • Must have intelligence to work out routing • Inefficient — Channel capacity dedicated for duration of connection — If no data, capacity wasted • Set up (connection) takes time • Once connected, transfer is transparent • Developed for voice traffic (phone) g.
    [Show full text]
  • Circuit-Switching
    Welcome to CSC358! Introduction to Computer Networks Amir H. Chinaei, Winter 2016 Today Course Outline . What this course is about Logistics . Course organization, information sheet . Assignments, grading scheme, etc. Introduction to . Principles of computer networks Introduction 1-2 What is this course about? Theory vs practice . CSC358 : Theory . CSC309 and CSC458 : Practice Need to have solid math background . in particular, probability theory Overview . principles of computer networks, layered architecture . connectionless and connection-oriented transports . reliable data transfer, congestion control . routing algorithms, multi-access protocols, . delay models, addressing, and some special topics Introduction 1-3 Overview: internet protocol stack application: supporting network applications . FTP, SMTP, HTTP application transport: process-process data transfer transport . TCP, UDP network network: routing of datagrams from source to destination link . IP, routing protocols link: data transfer between physical neighboring network elements . Ethernet, 802.111 (WiFi), PPP physical: bits “on the wire” Introduction 1-4 Logistics (1/3) Prerequisite knowledge . Probability theory is a must . Mathematical modeling . Data structures & algorithms Course components . Lectures: concepts . Tutorials: problem solving . Assignments: mastering your knowledge . Readings: preparing you for above . Optional assignments: things in practice, bonus Introduction 1-5 Logistics (2/3) Text book . Computer Networking A Top-Down Approach Featuring the Internet 5th Edition, J. F. Kurose and K. W. Ross Lecture slides . Many slides are (adapted) from the above source . © All material copyright . All rights reserved for the authors Introduction 1-6 Logistics (3/3) For important information on . Lecture and tutorial time/location . Contact information of course staff (instructor and TAs) . Office hour and location . Assignments specification and solution .
    [Show full text]
  • From Packet Switching to the Cloud
    Professor Nigel Linge FROM PACKET SWITCHING TO THE CLOUD Telecommunication engineers have always drawn a picture of a cloud to represent a network. Today, however, the cloud has taken on a new meaning, where IT becomes a utility, accessed and used in exactly the same on-demand way as we connect to the National Grid for electricity. Yet, only 50 years ago, this vision of universal access to an all- encompassing and powerful network would have been seen as nothing more than fanciful science fiction. he first electronic, digital, network - a figure that represented a concept of packet switching in which stored-program computer 230% increase on the previous year. data is assembled into a short se- was built in 1948 and This clear and growing demand for quence of data bits (a packet) which heralded the dawning of data services resulted in the GPO com- includes an address to tell the network a new age. missioning in July 1970 an experi- where the data is to be sent, error de- T mental, manual call-set-up, data net- tection to allow the receiver to confirm DATA COMMUNICATIONS 1 work that used modems operating at that the contents of the packet are cor- These early computers were large, 48,000bit/s (48kbit/s). rect and a source address to facilitate cumbersome and expensive machines However, computer communica- a reply. and inevitably a need arose for a com- tions is different to voice communi- Since each packet is self-contained, munication system that would allow cations not only in its form but also any number of them can be transmit- shared remote access to them.
    [Show full text]
  • Multiprotocol Label Switching
    CHAPTER23 MULTIPROTOCOL LABEL SWITCHING 23.1 The Role of Mpls 23.2 Background Connection-Oriented QoS Support Traffic Engineering Virtual Private Network (VPN) Support Multiprotocol Support 23.3 MPLS Operation 23.4 Labels Label Stacking Label Format Label Placement 23.5 FECs, LSPs, and Labels Route Selection 23.6 Label Distribution Requirements for Label Distribution Label Distribution Protocol LDP Messages LDP Message Format 23.7 Traffic Engineering Elements of MPLS Traffic Engineering Constrained Shortest-Path First Algorithm RSVP-TE 23.8 Virtual Private Networks Layer 2 Virtual Private Network Layer 3 Virtual Private Network 23.9 Recommended Reading 23.10 Key Terms, Review Questions, and Problems 749 750 CHAPTER 23 / MULTIPROTOCOL LABEL SWITCHING LEARNING OBJECTIVES After studying this chapter, you should be able to: ◆ Discuss the role of MPLS in an Internet traffic management strategy. ◆ Explain at a top level how MPLS operates. ◆ Understand the use of labels in MPLS. ◆ Present an overview of how the function of label distribution works. ◆ Present an overview of MPLS traffic engineering. ◆ Understand the difference between layer 2 and layer 3 VPNs. In Chapter 19, we examined a number of IP-based mechanisms designed to improve the performance of IP-based networks and to provide different levels of quality of service (QoS) to different service users. Although the routing protocols discussed in Chapter 19 have as their fundamental purpose dynami- cally finding a route through an internet between any source and any destina- tion, they also provide support for performance goals in two ways: 1. Because these protocols are distributed and dynamic, they can react to congestion by altering routes to avoid pockets of heavy traffic.
    [Show full text]
  • Networking CS 3470, Section 1 Forwarding
    Chapter 3 Part 3 Switching and Bridging Networking CS 3470, Section 1 Forwarding A switching device’s primary job is to receive incoming packets on one of its links and to transmit them on some other link This function is referred as switching and forwarding According to OSI architecture this is the main function of the network layer Forwarding How does the switch decide which output port to place each packet on? It looks at the header of the packet for an identifier that it uses to make the decision Two common approaches Datagram or Connectionless approach Virtual circuit or Connection-oriented approach Forwarding Assumptions Each host has a globally unique address There is some way to identify the input and output ports of each switch We can use numbers We can use names Datagram / Connectionless Approach Key Idea Every packet contains enough information to enable any switch to decide how to get it to destination Every packet contains the complete destination address Datagram / Connectionless Approach An example network To decide how to forward a packet, a switch consults a forwarding table (sometimes called a routing table) Copyright © 2010, Elsevier Inc. All rights Reserved Datagram / Connectionless Approach Destination Port ----------------------------------- A 3 B 0 C 3 D 3 E 2 F 1 G 0 H 0 Forwarding Table for Switch 2 Copyright © 2010, Elsevier Inc. All rights Reserved Datagram Networks: The Internet Model No call setup at network layer Routers: no state about end-to-end connections no network-level concept of “connection” Packets forwarded using destination host address packets between same source-dest pair may take different paths session session transport transport network network 1.
    [Show full text]
  • Not the Internet, but This Internet
    Not The Internet, but This Internet: How Othernets Illuminate Our Feudal Internet Paul Dourish Department of Informatics University of California, Irvine Irvine, CA 92697-3440, USA [email protected] ABSTRACT built – the Internet, this Internet, our Internet, the one to What is the Internet like, and how do we know? Less which I’m connected right now? tendentiously, how can we make general statements about the Internet without reference to alternatives that help us to I ask these questions in the context of a burgeoning recent understand what the space of network design possibilities interest in examining digital technologies as materially, might be? This paper presents a series of cases of network socially, historically and geographically specific [e.g. 13, alternatives which provide a vantage point from which to 15, 36, 37]. There is no denying the central role that “the reflect upon the ways that the Internet does or does not digital,” broadly construed, plays as part of contemporary uphold both its own design goals and our collective everyday life. Wireless connectivity, broadband imaginings of what it does and how. The goal is to provide communications, and computational devices may be a framework for understanding how technologies embody concentrated in the urban centers of economically promises, and how these both come to evolve. privileged nations, but even in the most “remote” corners of the globe, much of everyday life is structured, organized, Author Keywords and governed by databases and algorithms, and “the digital” Network protocols; network topology; naming routing; still operates even in the central fact of its occasional media infrastructures.
    [Show full text]
  • Future of Asynchronous Transfer Mode Networking
    California State University, San Bernardino CSUSB ScholarWorks Theses Digitization Project John M. Pfau Library 2004 Future of asynchronous transfer mode networking Fakhreddine Mohamed Hachfi Follow this and additional works at: https://scholarworks.lib.csusb.edu/etd-project Part of the Digital Communications and Networking Commons Recommended Citation Hachfi, akhrF eddine Mohamed, "Future of asynchronous transfer mode networking" (2004). Theses Digitization Project. 2639. https://scholarworks.lib.csusb.edu/etd-project/2639 This Thesis is brought to you for free and open access by the John M. Pfau Library at CSUSB ScholarWorks. It has been accepted for inclusion in Theses Digitization Project by an authorized administrator of CSUSB ScholarWorks. For more information, please contact [email protected]. FUTURE OF ASYNCHRONOUS TRANSFER MODE NETWORKING A Thesis Presented to the Faculty of California State University, San Bernardino In Partial Fulfillment of the Requirements for the Degree Master of Business Administration by ' Fakhreddine Mohamed Hachfi June 2004 FUTURE OF ASYNCHRONOUS TRANSFER MODE NETWORKING A Thesis Presented to the Faculty of California State University, San Bernardino by Fakhreddine Mohamed Hachfi June 2004 Approved by: Da^e Frank Lin, Ph.D., Inf ormatTdn—&^-DSsision Sciences „ / Walt Stewart, Jr., Ph.D., Department Chair Information & Decision Sciences © 2004 Fakhreddine Mohamed Hachfi ABSTRACT The growth of Asynchronous Transfer Mode ATM was considered to be the ideal carrier of the high bandwidth applications like video on demand and multimedia e-learning. ATM emerged commercially in the beginning of the 1990's. It was designed to provide a different quality of service at a speed up to 10 Gbps for both real time and non real time application.
    [Show full text]
  • Chapter 10: Circuit Switching and Packet Switching Switching Networks
    Chapter 10: Circuit Switching and Packet Switching CS420/520 Axel Krings Page 1 Sequence 10 Switching Networks • Long distance transmission is typically done over a network of switched nodes • Nodes not concerned with content of data • End devices are stations — Computer, terminal, phone, etc. • A collection of nodes and connections is a communications network • Data is routed by being switched from node to node CS420/520 Axel Krings Page 2 Sequence 10 1 Nodes • Nodes may connect to other nodes only, or to stations and other nodes • Node to node links usually multiplexed • Network is usually partially connected — Some redundant connections are desirable for reliability • Two different switching technologies — Circuit switching — Packet switching CS420/520 Axel Krings Page 3 Sequence 10 Simple Switched Network CS420/520 Axel Krings Page 4 Sequence 10 2 Circuit Switching • Dedicated communication path between two stations • Three phases — Establish — Transfer — Disconnect • Must have switching capacity and channel capacity to establish connection • Must have intelligence to work out routing CS420/520 Axel Krings Page 5 Sequence 10 Circuit Switching • Inefficient — Channel capacity dedicated for duration of connection — If no data, capacity wasted • Set up (connection) takes time • Once connected, transfer is transparent • Developed for voice traffic (phone) CS420/520 Axel Krings Page 6 Sequence 10 3 Public Circuit Switched Network CS420/520 Axel Krings Page 7 Sequence 10 Telecom Components • Subscriber — Devices attached to network • Subscriber
    [Show full text]