DOCSLIB.ORG

Wavelength Division Multiplexing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Wavelength Division Multiplexing Communication Networks MAP-TELE 2011/12 José Ruela Network basic mechanisms Multiplexing Multiplexing • Multiplexing is a technique that allows a single resource to be shared among multiple users – sharing can be static or dynamic • Multiplexing in a physical link means that multiple signals, which represent different flows of information, are simultaneously transmitted over the medium – a separate channel is provided to each flow • Different methods are possible to realize such “physical” multiplexing, either on point-to-point or multipoint (broadcast) links • On point-to-point links, the basic multiplexing techniques divide the physical link into channels along one of three dimensions – frequency, time or wavelength, but a combination of multiplexing techniques is possible –FDM –Frequency Division Multiplexing – TDM – Time Division Multiplexing –WDM –Wavelength Division Multiplexing (optical domain equivalent of FDM) • Multiplexing (channelization) in multipoint links is one solution (among others) to the multiple access problem (to be studied separately) Multiplexing L1 R1 L2 R2 Mux 1 Mux 2 L3 R3 FDM – Frequency Division Multiplexing • FDM is an analogue technique that divides the bandwidth of a link (in Hz) into channels of smaller bandwidth – the channels occupy different (non overlapping) frequency bands – Example: multiplexing 12 analogue voice channels (4 kHz nominal bandwidth) into a link with bandwidth equal to 48 kHz • Signals generated by different transmitters can be analogue or digital and modulate carriers on different frequencies (thus occupying a different band or frequency slot) – For digital signals it is possible to relate the channel capacity (in bit/s) with its bandwidth (in Hz) • FDM creates circuits of fixed bandwidth and thus has a number of limitations (especially for data traffic) – The bandwidth is shared among a maximum fixed number of flows, which has to be decided in advance, and thus it is not practical to resize the bandwidth quantum (let alone change it in a dynamic way) – The bandwidth of an idle channel cannot be reused by active flows – The bandwidth of a channel allocated to a flow cannot be reused when the flow is temporarily idle (case of variable bit rate flows) FDM – Frequency Division Multiplexing • Transmission in all channels is simultaneous, on separate frequency bands (for digital signals, the bit rate of a channel is a fraction of the total bit rate that may be achieved on the link) B (Hz) CH 4 CH 3 CH 2 CH 1 t FDM – Frequency Division Multiplexing FDM – Frequency Division Multiplexing WDM – Wavelength Division Multiplexing • WDM is conceptually similar to FDM, but the multiplexing and demultiplexing functions are realized on optical signals transmitted through optical fibers on different wavelengths () TDM – Time Division Multiplexing • TDM is a digital technique that divides the capacity of a link (in bit/s) into multiple channels using temporal interleaving – the channels occupy different (non overlapping) time slots • The basic form of TDM is Synchronous Time Division Multiplexing (STM) – fixed size time slots allocated to each channel repeat periodically and time slots in the same cycle constitute a frame – Example: for a frame made up of 32 time slots with a period of 125 s and 8 bits transmitted per slot, the channel capacity is 64 kbit/s • A channel is identified by the position of the slot it occupies in the frame (position multiplexing), which requires a mechanism for identifying the start of a frame (frame synchronization) • Each flow is transmitted on the multiplexed link at the link rate and a conversion to the original rate occurs at the demultiplexer – the flow suffers a fixed delay (that corresponds to the time to access its slot) • Since STDM provides channels of fixed capacity, it has the same limitations as FDM • The flexibility of TDM allows exploiting alternatives that overcome the limitations of STDM STDM – Synchronous Time Division Multiplexing • Channel transmissions are not “truly” simultaneous – transmission on each channel occurs at the link rate during a fraction of the frame time (on its time slot), but temporal transparency (with some delay) is achieved by the joint operation of the multiplexer and demultiplexer C (bit/s) CH 1CH 2 CH 3 CH 4 CH 1CH 2 CH 3 CH 4 t Frame i Frame i + 1 STDM – Synchronous Time Division Multiplexing Limitations of STDM • In the first place, STDM provides fixed bit rate channels – This is adequate for constant bit rate but not for variable bit rate flows – Even for constant bit rate flows, the channel rate may not match the natural bit rates of the flows • For variable bit rate flows, the channel rate limits the maximum instantaneous bit rate of the flow – The channel is not fully used when the flow is transmitting with an average rate lower than the channel rate (there will be idle periods) – Handling bursts with an instantaneous peak rate higher than the channel rate requires buffering, which introduces variable delays (and even losses) • A channel may remain idle during some time periods, whenever the corresponding time slots are not allocated to any flow • Time slots not used for any of these reasons cannot be reused by active flows (but this would be desirable when the instantaneous bit rate of a flow exceeds the capacity of its channel) Limitations of STDM – examples Frame i Frame i+1 Frame i+2 CH1 CH2 CH3 CH4CH1 CH2 CH3 CH4 CH1 CH2 CH3 CH4 1 2 3 Idle slot • 1 – all channels are fully used • 2 – channel 3 is idle (all corresponding slots are unused) • 3 – some slots are unused due to variable bit rate traffic on some channels STDM – channel aggregation • It is possible to aggregate channels to form higher bit rate channels, by allocating multiple slots to a channel • In this way it is possible to create channels of different rates, but the bit rates of such channels form a discrete set (the possible values are multiples of the basic rate) – Since such channels are of fixed rates, they have the same problems as the basic channels • Creating such channels in a static (fixed) way is straightforward – a channel is allocated a number of slots in known positions on the frame (and this may be achieved by configuration) • The application of this concept to switching (multi-rate switching) is highly complex because it would be necessary to preserve the temporal order of the slots throughout the network • All these limitations may be overcome by dynamically allocating slots to channels, which is more efficient but more complex – this is the idea behind Asynchronous Time Division Multiplexing (ATDM) ATDM – Asynchronous Time Division Multiplexing • ATDM is based on a dynamic allocation of time slots to channels, which may be performed on different ways • Starting with an STDM frame structure and fixed size slots, it is necessary to identify the channel that is associated with each time slot, since the number and position of slots allocated to a channel are not defined in advance (in particular, they depend on the traffic submitted to each channel and slot availability) – One possible solution is to include on each frame a map of the slot usage, which associates a channel identifier with each slot – Another solution is to carry on each slot a channel identifier (label) together with the data (label multiplexing) • The need for a channel identification introduces overhead, which may be very high when the slots carry a small number of bits • An alternative solution is not using physical frames but allocating time slots of variable size to carry variable length data frames, which carry an identifier on their header (e.g., addresses or labels) – A delineation mechanism for data frames (framing) is necessary ATDM – Asynchronous Time Division Multiplexing • Channels created by ATDM are logical channels, since resources (time slots) are not previously reserved and allocated in a fixed way – Resources are allocated on demand to competing flows and thus statistical multiplexing can be exploited – Competition is arbitrated by means of scheduling mechanisms that may implement different strategies (based on the characteristics and requirements of the traffic flows, possibly of different classes) – As a result of dynamic allocation of resources, channel rates may have any value in a continuous range • A transmission link may be divided into multiple physical channels (using, for example STDM) or handled as a single physical channel – In either case, a physical channel may carry multiple logical channels by means of ATDM • ATDM is the basis for Packet Switching – a packet switch has multiple input and output ports (a multiplexer has a single output port) – Incoming and outgoing links carry ATDM flows – Flows are demultiplexed at each input port, independently switched to output ports (spatial switching), where they are again multiplexed ATDM – example ■■■ STDM vs. ATDM • Consider input links with Capacity Ci, which places an upper limit on the bit rate of a flow (its peak rate), and bursty flows with an average rate Ri • An important question is how to choose the capacity C of the transmission link in STDM and ATDM Ci Ci 1 1 2 M M 2 A C U U B X X N N STDM vs. ATDM • In STDM the capacity of the multiplexed link is C = Ci (ignoring overhead bits) – the multiplexed link is equivalent to N independent links, each with capacity Ci – The ratio Ri / Ci is critical (as far as resource utilization vs. delay) • In ATDM, statistical multiplexing may be exploited – The average rate of all multiplexed flows is R = Ri – The aggregate flow is expected to have a smoother pattern than the individual flows (this is the basis for statistical multiplexing) –Ci is usually chosen so that Ri is (much) lower than Ci (this means that the input link may handle bursts with low delay) – The capacity of the multiplexed link (C) must be higher than R, but does not need to be as high as Ci (R = Ri < C < Ci) – this means that traffic is concentrated – When the multiplexed link is moderately loaded, an active flow sending at its peak rate (Ci) may profit from the spare capacity on the multiplexed link (this would not be possible if Ci was chosen with a value slightly higher than Ri – the input link would be a bottleneck for the flow) STDM vs.
Load more

Recommended publications
  • Evolution of Switching Techniques Frequency Division Multiplexing
    Evolution of Switching Techniques 1. Dedicate Channel. Separate wire frequency division multiplexing (FDM) time division multiplexing (TDM) Multiplexor (MUX) Demultiplexor (Concentrator) DEMUX individual lines shared individual lines high speed line Frequency Frequency Channel 1 available bandwidth 2 1 2 3 4 1 2 3 4 1 2 3 4 3 4 FDM Time TDM Time chow CS522 F2001—Multiplexing and Switching—10/17/2001—Page 1 Frequency Division Multiplexing (FDM) chow CS522 F2001—Multiplexing and Switching—10/17/2001—Page 2 Wavelength Division Multiplexing chow CS522 F2001—Multiplexing and Switching—10/17/2001—Page 3 Impact of WDM z Many big organizations are starting projects to design WDM system or DWDN (Dense Wave Division Mutiplexing Network). We may see products appear in next three years.In Fujitsu and CCL/Taiwan, 128 different wavelengthes on the same strand of fiber was reported working in the lab. z We may have optical routers between end systems that can take one wavelenght signal, covert to different wavelenght, send it out on different links. Some are designing traditional routers that covert optical signal to electronical signal, and use time slot interchange based on high speed memory to do the switching, the convert the electronic signal back to optical signal. z With this type of optical networks, we will have a virtual circuit network, where each connection is assigned some wave length. Each connection can have 2.4 gbps tremedous bandwidth. z With inital 128 different wavelength, we can have about 10 end users. If each pair of end users needs to communicate simultaneously, it will use 10*10=100 different wavelength.
    [Show full text]
  • Spread Spectrum and Wi-Fi Basics Syed Masud Mahmud, Ph.D
    Spread Spectrum and Wi-Fi Basics Syed Masud Mahmud, Ph.D. Electrical and Computer Engineering Dept. Wayne State University Detroit MI 48202 Spread Spectrum and Wi-Fi Basics by Syed M. Mahmud 1 Spread Spectrum Spread Spectrum techniques are used to deliberately spread the frequency domain of a signal from its narrow band domain. These techniques are used for a variety of reasons such as: establishment of secure communications, increasing resistance to natural interference and jamming Spread Spectrum and Wi-Fi Basics by Syed M. Mahmud 2 Spread Spectrum Techniques Frequency Hopping Spread Spectrum (FHSS) Direct -Sequence Spread Spectrum (DSSS) Orthogonal Frequency-Division Multiplexing (OFDM) Spread Spectrum and Wi-Fi Basics by Syed M. Mahmud 3 The FHSS Technology FHSS is a method of transmitting signals by rapidly switching channels, using a pseudorandom sequence known to both the transmitter and receiver. FHSS offers three main advantages over a fixed- frequency transmission: Resistant to narrowband interference. Difficult to intercept. An eavesdropper would only be able to intercept the transmission if they knew the pseudorandom sequence. Can share a frequency band with many types of conventional transmissions with minimal interference. Spread Spectrum and Wi-Fi Basics by Syed M. Mahmud 4 The FHSS Technology If the hop sequence of two transmitters are different and never transmit the same frequency at the same time, then there will be no interference among them. A hopping code determines the frequencies the radio will transmit and in which order. A set of hopping codes that never use the same frequencies at the same time are considered orthogonal .
    [Show full text]
  • Lecture 8: Overview of Computer Networking Roadmap
    Lecture 8: Overview of Computer Networking Slides adapted from those of Computer Networking: A Top Down Approach, 5th edition. Jim Kurose, Keith Ross, Addison-Wesley, April 2009. Roadmap ! what’s the Internet? ! network edge: hosts, access net ! network core: packet/circuit switching, Internet structure ! performance: loss, delay, throughput ! media distribution: UDP, TCP/IP 1 What’s the Internet: “nuts and bolts” view PC ! millions of connected Mobile network computing devices: server Global ISP hosts = end systems wireless laptop " running network apps cellular handheld Home network ! communication links Regional ISP " fiber, copper, radio, satellite access " points transmission rate = bandwidth Institutional network wired links ! routers: forward packets (chunks of router data) What’s the Internet: “nuts and bolts” view ! protocols control sending, receiving Mobile network of msgs Global ISP " e.g., TCP, IP, HTTP, Skype, Ethernet ! Internet: “network of networks” Home network " loosely hierarchical Regional ISP " public Internet versus private intranet Institutional network ! Internet standards " RFC: Request for comments " IETF: Internet Engineering Task Force 2 A closer look at network structure: ! network edge: applications and hosts ! access networks, physical media: wired, wireless communication links ! network core: " interconnected routers " network of networks The network edge: ! end systems (hosts): " run application programs " e.g. Web, email " at “edge of network” peer-peer ! client/server model " client host requests, receives
    [Show full text]
  • 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]
  • Circuit-Switched Coherence
    Circuit-Switched Coherence ‡Natalie Enright Jerger, ‡Mikko Lipasti, and ?Li-Shiuan Peh ‡Electrical and Computer Engineering Department, University of Wisconsin-Madison ?Department of Electrical Engineering, Princeton University Abstract—Circuit-switched networks can significantly lower contention, overall system performance can degrade by 20% the communication latency between processor cores, when or more. This latency sensitivity coupled with low link uti- compared to packet-switched networks, since once circuits are set up, communication latency approaches pure intercon- lization motivates our exploration of circuit-switched fabrics nect delay. However, if circuits are not frequently reused, the for CMPs. long set up time and poorer interconnect utilization can hurt Our investigations show that traditional circuit-switched overall performance. To combat this problem, we propose a hybrid router design which intermingles packet-switched networks do not perform well, as circuits are not reused suf- flits with circuit-switched flits. Additionally, we co-design a ficiently to amortize circuit setup delay. This observation prediction-based coherence protocol that leverages the exis- motivates a network with a hybrid router design that sup- tence of circuits to optimize pair-wise sharing between cores. The protocol allows pair-wise sharers to communicate di- ports both circuit and packet switching with very fast circuit rectly with each other via circuits and drives up circuit reuse. reconfiguration (setup/teardown). Our preliminary results Circuit-switched coherence provides overall system perfor- show this leading to up to 8% improvement in overall system mance improvements of up to 17% with an average improve- performance over a packet-switched fabric. ment of 10% and reduces network latency by up to 30%.
    [Show full text]
  • Medium Access Control Layer
    Telematics Chapter 5: Medium Access Control Sublayer User Server watching with video Beispielbildvideo clip clips Application Layer Application Layer Presentation Layer Presentation Layer Session Layer Session Layer Transport Layer Transport Layer Network Layer Network Layer Network Layer Univ.-Prof. Dr.-Ing. Jochen H. Schiller Data Link Layer Data Link Layer Data Link Layer Computer Systems and Telematics (CST) Physical Layer Physical Layer Physical Layer Institute of Computer Science Freie Universität Berlin http://cst.mi.fu-berlin.de Contents ● Design Issues ● Metropolitan Area Networks ● Network Topologies (MAN) ● The Channel Allocation Problem ● Wide Area Networks (WAN) ● Multiple Access Protocols ● Frame Relay (historical) ● Ethernet ● ATM ● IEEE 802.2 – Logical Link Control ● SDH ● Token Bus (historical) ● Network Infrastructure ● Token Ring (historical) ● Virtual LANs ● Fiber Distributed Data Interface ● Structured Cabling Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 5: Medium Access Control Sublayer 5.2 Design Issues Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 5: Medium Access Control Sublayer 5.3 Design Issues ● Two kinds of connections in networks ● Point-to-point connections OSI Reference Model ● Broadcast (Multi-access channel, Application Layer Random access channel) Presentation Layer ● In a network with broadcast Session Layer connections ● Who gets the channel? Transport Layer Network Layer ● Protocols used to determine who gets next access to the channel Data Link Layer ● Medium Access Control (MAC) sublayer Physical Layer Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 5: Medium Access Control Sublayer 5.4 Network Types for the Local Range ● LLC layer: uniform interface and same frame format to upper layers ● MAC layer: defines medium access ..
    [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]
  • Application Note: 2-Cell Test Environment
    Application Note 2-cell Test Environment MD8475A Signalling Tester 1. Background to LTE Rollout Mobile phones appearing in the late 1980s soon experienced rapid evolution of functions from 1990 to 2000 and also spread worldwide as key communications infrastructure. The mobile phone is not limited to just two-way communications between two people but also supports sending and receiving of Short Message Services (SMS), web browsing using the Internet, application and video download, etc., and has become a popular and key cultural tool supporting a fuller lifestyle for many people. Figure 1. Evolution on UE According to one research company, total mobile phone (terminal) shipments at the end of 2010 were valued at $38 billion split between 45% for 2G phones and 49% for 3G. Table 1. Mobile Terminal Shipments Mobile Terminal Shipments ($38 billion total) LTE 1.3% WiMAX 4.0% W-CDMA 40.0% CDMA 9.3% GSM 45.4% 1 MD8475A-E-F-1 The purpose of the shift from 2G to 3G systems was to make more efficient use of frequency bandwidths and was closely related to the explosive growth of the Internet. While still maintaining the easy portability of a mobile phone, users were able to access the information they needed easily at any time and place using the Internet. Similarly to growth of 3G technology, the requirements of LTE systems, which is are positioned in the market as 3.9G to maintain competitiveness with coming 4G systems, are being examined. Connectivity with IP-based core networks must be maintained to support multimedia applications and ubiquitous networks using the packet domain.
    [Show full text]
  • Research on Super 3G Technology
    03-10E_T-Box_3.3 06.12.26 10:07 AM ページ 55 NTT DoCoMo Technical Journal Vol. 8 No.3 Part 2: Research on Super 3G Technology In this part 2 of the Super 3G research that is being conducted to achieve a smooth transition from 3G to 4G, we present technology that is currently being studied for standardization as technical details. Sadayuki Abeta, Minami Ishii, Yasuhiro Kato and Kenichi Higuchi At the RAN WG1 meeting of November 2005, there was 1. Introduction agreement by many companies that high commonality is As explained in part1, Super 3G, the so-called Evolved extremely important and wireless access should be the same for URAN and UTRAN or Long term evolution by the 3rd FDD (paired spectrum) and TDD (unpaired spectrum). As this Generation Partnership Project (3GPP) has been extensively common wireless access system for FDD and TDD, Orthogonal studied since 2005. Agreement on the requirement was reached Frequency Division Multiple Access (OFDMA), which features in June of 2005 to begin investigation of specific technologies. highly efficient frequency utilization was approved for the In June 2006, it was agreed that investigation of the feasibility downlink and Single-Carrier Frequency Division Multiple of the basic approach for satisfying the requirements was essen- Access (SC-FDMA) was approved for the uplink at the tially completed, and effort shifted to the work item phase to December 2005 Plenary Meeting. start the detailed specifications work. Here, we explain technol- The features of the wireless access system are described in ogy that has been proposed as study items.
    [Show full text]
  • UMTS Core Network
    UMTS Core Network V. Mancuso, I. Tinnirello GSM/GPRS Network Architecture Radio access network GSM/GPRS core network BSS PSTN, ISDN PSTN, MSC GMSC BTS VLR MS BSC HLR PCU AuC SGSN EIR BTS IP Backbone GGSN database Internet V. Mancuso, I. Tinnirello 3GPP Rel.’99 Network Architecture Radio access network Core network (GSM/GPRS-based) UTRAN PSTN Iub RNC MSC GMSC Iu CS BS VLR UE HLR Uu Iur AuC Iub RNC SGSN Iu PS EIR BS Gn IP Backbone GGSN database Internet V. Mancuso, I. Tinnirello 3GPP RelRel.’99.’99 Network Architecture Radio access network 2G => 3G MS => UE UTRAN (User Equipment), often also called (user) terminal Iub RNC New air (radio) interface BS based on WCDMA access UE technology Uu Iur New RAN architecture Iub RNC (Iur interface is available for BS soft handover, BSC => RNC) V. Mancuso, I. Tinnirello 3GPP Rel.’99 Network Architecture Changes in the core Core network (GSM/GPRS-based) network: PSTN MSC is upgraded to 3G MSC GMSC Iu CS MSC VLR SGSN is upgraded to 3G HLR SGSN AuC SGSN GMSC and GGSN remain Iu PS EIR the same Gn GGSN AuC is upgraded (more IP Backbone security features in 3G) Internet V. Mancuso, I. Tinnirello 3GPP Rel.4 Network Architecture UTRAN Circuit Switched (CS) core network (UMTS Terrestrial Radio Access Network) MSC GMSC Server Server SGW SGW PSTN MGW MGW New option in Rel.4: GERAN (GSM and EDGE Radio Access Network) PS core as in Rel.’99 V. Mancuso, I. Tinnirello 3GPP Rel.4 Network Architecture MSC Server takes care Circuit Switched (CS) core of call control signalling network The user connections MSC GMSC are set up via MGW Server Server (Media GateWay) SGW SGW PSTN “Lower layer” protocol conversion in SGW MGW MGW (Signalling GateWay) RANAP / ISUP PS core as in Rel.’99 SS7 MTP IP Sigtran V.
    [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]