Unavoidable Constraints and Collision Avoidance Techniques in Performance Evaluation of Asynchronous Transmission WDMA Protocols
|
|
- Candace Russell
- 6 years ago
- Views:
Transcription
1 1th WEA International Conference on COMMUICATIO, Heraklion, reece, July 3-5, 8 Unavoidable Constraints and Collision Avoidance Techniques in Performance Evaluation of Asynchronous Transmission WDMA Protocols I.E. POUTOURAKI, D.A.PAVLIDI chool of Electrical and Computer Engineering, ational Technical University of Athens Zografou, Athens REECE Abstract: - This study extends the analysis in [1] where the effect of the round trip propagation delay on performance measures of an Asynchronous Transmission WDMA protocol is examined for infinite population and Poisson arrivals. An other attribute, associated with the WDM networks, that affects their behaviour is the receiver collision phenomenon. Especially this paper examines the influence on throughput and total delay measures of the transmitted information as function of the propagation delay latency and the receiver collision phenomenon characteristics []. o this presentation accomplishes the analysis for a complete study and a substantial examination of the real performance behaviour of the optical Passive tar WDM networks. Key-Words: - Wavelength Division Multiplexing (WDM), Collision Avoidance Technique, Asynchronous transmission, propagation delay latency, receiver collisions. 1 Introduction WDMA protocols can be divided into two categories, a) synchronous and b) asynchronous transmission techniques. In the first category the data channels are slotted and stations are obliged to transmit at the beginning of each time interval, denoted as cycle [3]. In the second category the data channels are unslotted and there is no synchronization among the stations for data transmission [1]. The adopting procedures introduce three causes of packet loss. The first is the control packets collision on the control channel, the second the collision of data packets overlapping in time in the same data channel and the third is receiver collision. Receiver collision corresponds to the case of a successfully (re)transmitted data packet over a data channel and finds the destination station tunable receiver busy, when it arrives []. Therefore the capacity utilization is limited due to channel contentions and destination conflicts that consequently result in low throughput. In an unslotted network the packets may or may not be of the same size. Packets arrive and enter the network system without being aligned. Therefore, the packet (re) transmission could take place at any point in time. Obviously, in unslotted networks, the chance for contention is larger because the behaviour of the packets is more unpredictable and less regulated. On the other hand, unslotted networks are easier and cheaper to build, more robust, and more flexible than slotted networks. The roundtrip propagation delay plays a key role in the performance evaluation of the WDMA protocols. In optical networks, the propagation delay is higher than the data packet transmission time. The close relation and the difference between propagation delay and data packet transmission time is a very important factor in designing multiple access WDM networks [1]. In this paper, the proposed architecture is a Passive tar network and the transmission access scheme belongs to the asynchronous transmission protocols. This work can be considered as an extension of the study in [1] for infinite population where the time axis is slotted for the control channel competition while the data channel contention is based on the Unslotted Aloha scheme adopting the tell and wait asynchronous transmission policy for fixed length data packets. The proposed protocol exploits the large propagation delay as a useful attribute to develop suitable multiple access algorithms based on the knowledge about the availability of the data channels and the status of tunable receivers (idle or busy) of the end stations. In other words, the proposed access method is based on the decision of a station for transmission or not at the end of the propagation delay after a I: IB:
2 1th WEA International Conference on COMMUICATIO, Heraklion, reece, July 3-5, 8 successful transmission on the control channel. In this way only one data packet among those that are destined to the same data channel during the critical period of time is transmitted, given that the receiver tunable receiver is idle at the time instant where the successfully transmitted data packet arrives at destination. With this update method, at any time unit the availability of data channels and the status of tunable receivers is known for any destination. o each station can schedule its (re)transmission avoiding data channel and receiver collision. The contribution of this analysis is: 1) The system model uses a simple scheduling algorithm that can be implemented in real time, ) Preserves without changing the complexity of network architecture. 3) Reduces the undesirable characteristics of the asynchronous and unslotted transmission protocols by improving the throughput performance. The paper is organized as follows: In section, we describe the network architecture model and assumptions. In section 3, we analyze the model for throughput and delay measure evaluations with and without receiver collision analysis. Also simulation analysis verifies the analytical obtained results. We present numerical results in section 4, and we make some concluding remarks in section 5. multichannel transmission system. Thus, the proposed network model can be described as a CC TT FR TR structure. It has a common control channel CC. TT means that each station has a tunable transmitter tuned at λ, λ 1,,λ Ν. The outcoming traffic from a station is connected to one input of the passive star coupler. Additionally, every station uses a fixed tuned receiver FR for the control channel and one tunable receiver to any of data channels λ 1,,λ Ν, indicated by TR. The incoming traffic to a user station is splitted into + 1 wavelength by a WDMA splitter from which one of wavelengths can be selected by the tunable receiver. The transmission time of a fixed size control packet is used as time unit (control slot) and the data packet transmission, normalized in control slot time units is L (L > 1), which is called data slot. We assume the existence of a common clock, obtained by distributing a clock to all stations. The round trip propagation time between any station to the hub of the star coupler and to any other station is assumed to be equal to R data slots (R L time units) and is the same for all the stations. Control channel is considered to be slotted with control packet transmission time. The control packet consists of the transmitter address, the receiver address, the wavelength λ k and the transmission instant t th over the control channel as it is shown in Fig.. The speed and the range of tunable transmitters set major limitations affecting WDM operation. In our study we are not taking into account these limitations assuming negligible tuning times and very large tunable bandwidths. Fig.1. Passive tar Coupler etwork Model and Assumption The system under consideration as Fig. 1 shows is a passive star network. The system uses +1 wavelengths, λ, λ 1,,λ Ν, and assumes infinite population. The system at wavelength λ operates as the control channel while the remaining Ν channels at wavelengths λ 1,,λ Ν, constitute the data.1 Transmission part We apply data packet collision avoidance algorithm as following. If a station has to send a data packet to another, first chooses randomly a wavelength on which the packet will be transmitted. Then, informs the other stations by sending a control packet on the control channel to compete according to the lotted Aloha protocol to gain access. The station continuously monitors the control channel with its fixed tuned receiver. The outcome of its control packet will be known R L time units later (acknowledgement period of time) because of the broadcast nature of the control channel. The station monitoring the control channel gives emphasis for the last L time units before the end of the acknowledgement period. After the end of this period the station is aware of the status of the data channels. Especially the station recognizes if the specified data channel on its control packet will be I: IB:
3 1th WEA International Conference on COMMUICATIO, Heraklion, reece, July 3-5, 8 idle or busy at the end of the acknowledgement time period and on the other hand ascertains the destination station tunable receiver status. In case of idle data channel and successful (re) transmission of the corresponding control packet in conjunction with the availability of the destination tunable receiver at the end of next (R+1)L time units, the station transmits immediately the data packet without data channel collision and destination conflict. In the opposite case the station postpones the data packet transmission waiting for a number of time units according to the adopted retransmission policy.. Reception part In the receiving part, all stations continuously monitor the control channel with their fixed tuned receiver examining all control slots. At the beginning of each control slot every station knows the status of the data channels (idle or busy) and the time instant that a busy channel will be idle. When a destination station sees its address announced in a successful transmitted control packet, reads first the transmission time t th in the control packet and examines if the sender will find idle the prescribed data channel at the next time instant after the end of its acknowledgement period. Moreover the prospective receiver knows the status case of its tunable receiver (idle or busy) at the next time instant after the passage of (R+1)L time units, for the suitable decision. amely, if the receiver knows that the sender wins the right to transmit and it is ready at the subsequent (R+1)L time units, then adjusts its idle tunable receiver to the channel specified in the control packet for data packet reception. Fig.. Data and Control packets structure Finally according to collision avoidance algorithm the sending and the receiving part receive the same information simultaneously, at the end of the critical period of time, and synchronize their action for transmission or postponement of a data packet. 3 Analysis We use the following notations: = the number of data channels in the system; L = the length of data packets in control packet transmission time units; =the average number of transmitted control packets per control slot time on the control channel; C e =, the output rate of successful transmitted control packets; d = the average rate of successfully transmitted data packets through one of the data channels per data slot. According to the reference protocol in [1], the is given by equation (4) which we repeat here: d L e = 1 e (1) T = the total system throughput per data slot without the effect of receiver collision is: T = d () 3.1 Delay D= the interval between the generation time of a data packet and the time of successful reception at destination. Data packet delay D, is composed from three parts as follows: D = D w + D r + (R+1)L +1 (3) D W = the waiting time from the generation of a packet until the begin of the next control slot. D r = the delay from the transmission of a data packet until the begin of successful reception at the destination. F r = the probability of successful transmission of a data packet. From (1) we take: Fr = e 1 e ( 4) Q = the average number of trials for successful transmission of a data packet: e Q = (5) 1 e D b = the average delay between successive retransmissions given by: K + 1 D b = (6) K is a number representing time units. After a station s unsuccessful transmission, it schedules the next retransmission choosing randomly a number between 1 and K time units. o: d I: IB:
4 1th WEA International Conference on COMMUICATIO, Heraklion, reece, July 3-5, 8 [ D] E[ D ] + E[ D ] + (R + 1)L 1 E = w r + (7) 1 e K + 1 E[ D] = + 1 RL 1 + L (8) 1 e + (R + 1)L Receiver Collision In this subsection is analyzed the case of finite number, M, of stations in the system. We approximate the total input traffic rate of control packets into the data channels transmission system, by a Poisson arrival process. According to the equation (6) in [] the total network throughput, RC, conditional upon the receiver collision phenomenon is: T RC = T 1 ML (9) ubstituting T in the above equation with (), we take: [ 1 ] e RC = Le 1 e 1 e M (1) According to the Delay analysis of subsection it is taken: F = e r e 1 e 1 1 e M (11) And finally: 1 e D + e 1 e 1 1 e M K RL (R + 1)L + 1 [ ] E = L 1 1 (1) 3.3 Average Rejection Probability We define P rej, as the average rejection probability at destination, in steady state, the ratio of the average number of data packets rejected at destination due to active receivers, to the average number of successfully transmitted packets over the multichannel system during a data packet transmission time, then: T RC Prej = (13) T 4 umerical results The results from the analysis are illustrated in Fig. 3, 4, 5 and 6. Fig. 3 depicts the throughput D versus. Analysis without and with receiver collision and simulation for = {5, 1, } data channels, M=5 stations, L=5 time units, R=1 data slots time and K=1 time units. This figure shows how the receiver collision effect, affects the throughput performance. The curves divergence is obvious in the two cases (with and without receiver collision) as the number of channels increases. The network and the protocol behaviour are accomplished in Fig. 5. This figure shows the average rejection probability versus for = {5, 1, } data channels and M= {5, 1} stations. Rejection probability, P rej, is a very interesting magnitude and shows how this quantity changes in two cases, first as the number of stations increases and second as the number of data channels varies. The P rej reduction was expected as M increases for fixed values of and. d (packets/data slot) =5 =1 M=5 R=1 L=5 K=1 without receiver collisions... with receiver collisions x simulation (control packets/time unit) Fig.3. Throughput d (packets/data slot) versus (control packets/time unit) without and with receiver collision analysis and simulation for = {5, 1, } data channels, M=5 station, L=5 time units, R=1 data slots time and K=1 time units. Reversely, for fixed values of M and, as increases, P rej grows up. Fig. 4 illustrates the average Delay, E[D], versus d. Analysis without and with receiver collision and simulation, for = {5, 1, } data channels, M=5 stations, R=1 data slots and K=1 time units. The unstable distinctiveness of the Aloha protocols follows the unslotted multichannel Aloha case too. I: IB:
5 1th WEA International Conference on COMMUICATIO, Heraklion, reece, July 3-5, 8 E[D] (time units) M=5 R=1 L=5 K= without receiver collisions. with receiver collisions simulation = d (packets/data slot) Fig.4. Average Delay E[D] (time units), versus throughput, d (packets/data slot) without and with receiver collision analysis and simulation for = {5, 1, } data channels, M=5 stations, R=1 data slots and K=1 time units. Average Rejection Probability =5 M= M=1 =5 = (control packets/time unit) Fig.5. Average Rejection Probability versus (control packets/time unit) for = {5, 1, } data channels and M= {5, 1} stations. M axim um A verage Rejec tion P robabilities M=5 M=1 M=15 =5 =1 Fig.6. Maximum Average Rejection Probabilities for = {5, 1, } data channels and M= {5, 1, 15} stations. evertheless the figure shows the operation range of the proposed Protocol algorithm which associates with higher throughput and lower delay. A remarkable point is the major unstable attributes when we take into account the effect of receiver collision. An other notation is that as increases the system becomes more stable. Finally, Fig. 6 presents the P rej (max) for = {5, 1, } data channels and M= {5, 1, 15} stations. The conclusions from this figure verify the ascertainments from the previous comments and explanations. 5 Conclusion This paper is an attempt to represent the basic characteristics of WDM networks, as propagation delay latency and receiver collision phenomenon and the way these parameters affect the performance measures behaviour of an Asynchronous transmission protocol. The study in [1] proposes an algorithm for exploitation of the propagation delay latency to improve the system throughput characteristics but ignores the receiver collision phenomenon. This effort, analysis and simulation, demonstrates how the conjunction of the two basic aforementioned optical network parameters, especially the receiver collision occurrences, influences the total performance characteristics of the proposed Passive tar network architecture, I: IB:
6 1th WEA International Conference on COMMUICATIO, Heraklion, reece, July 3-5, 8 giving a complete and real treatment of our protocol consideration. References: [1]Ioannis E. Pountourakis, Propagation Delay Latency and Data Channel Collision Avoidance Protocol Journal of Information cience Vol.157, o.1-, 3, pp []I.Pountourakis, Performance Evaluation with Receiver Collisions Analysis in Very High- peed Optical Fiber Local Area etworks Using Passive tar Topology, IEEE J. Lightwave Technology, Vol.16, o.1, 1998, pp [3]I.Pountourakis, P.Baziana, Markovian Receiver Collision Analysis of high-speed multi-channel networks, Mathematical Methods in the Applied ciences J., Vol.9, o.5, 6, pp I: IB:
A hs t r act A RESERNATION AND COLLISION-FREE MEDIA ACCESS PROTOCOL FOR OPTICAL STAR LOCAL AREA NETWO. 1 Introduction
A RESERNATION AND COLLISION-FREE MEDIA ACCESS PROTOCOL FOR OPTICAL STAR LOCAL AREA NETWO David A. Levine and Ian F. Akyildiz School of Electrical and Computer Engineering Georgia Institute of Technology,
More informationJOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 24, NO. 12, DECEMBER
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 24, NO. 12, DECEMBER 2006 4811 A High-Throughput Scheduling Technique, With Idle Timeslot Elimination Mechanism Panagiotis G. Sarigiannidis, Student Member, IEEE,
More informationWavelength Reuse for Efficient Packet-Switched Transport in an AWG-Based Metro WDM Network
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 21, NO. 6, JUNE 2003 1435 Wavelength Reuse for Efficient Packet-Switched Transport in an AWG-Based Metro WDM Network Michael Scheutzow, Martin Maier, Martin Reisslein,
More informationOptical networking technology
1 Optical networking technology Technological advances in semiconductor products have essentially been the primary driver for the growth of networking that led to improvements and simplification in the
More informationA Survey of Multicasting Protocols For Broadcast-and-Select Single-Hop Networks 1
A Survey of Multicasting Protocols For Broadcast-and-Select Single-Hop Networks 1 Ashraf M. Hamad and Ahmed E. Kamal 2 Department of Electrical and Computer Engineering Iowa State University Ames, IA 50011-3060
More informationTSIN01 Information Networks Lecture 3
TSIN01 Information Networks Lecture 3 Danyo Danev Division of Communication Systems Department of Electrical Engineering Linköping University, Sweden September 10 th, 2018 Danyo Danev TSIN01 Information
More informationA multichannel Ethernet protocol for a WDM local area star network
A multichannel Ethernet protocol for a WDM local area star network D. Rodellar, C. Bungarzeanu, H. Garcia, C. Brisson, A. Küng, Ph. Robert Telecommunications Laboratory (1), Metrology Laboratory Swiss
More informationAWG-based Optoelectronic Router with QoS Support
AWG-based Optoelectronic Router with QoS Support Annette Böhm, Magnus Jonsson, and Kristina Kunert School of Information Science, Computer and Electrical Engineering, Halmstad University Box 823, S-31
More informationRandom Assignment Protocols
Random Assignment Protocols Random assignment strategies attempt to reduce problem occur in fixed assignment strategy by eliminating pre allocation of bandwidth to communicating nodes. Random assignment
More informationCHAPTER 5 PROPAGATION DELAY
98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,
More informationA Token Based Distributed Algorithm for Medium Access in an Optical Ring Network
A Token Based Distributed Algorithm for Medium Access in an Optical Ring Network A. K. Turuk, R. Kumar, and R. Badrinath Department of Computer Science and Engineering Indian Institute of Technology Kharagpur
More information1242 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 22, NO. 5, MAY 2004
1242 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 22, NO. 5, MAY 2004 The AWG PSC Network: A Performance-Enhanced Single-Hop WDM Network With Heterogeneous Protection Chun Fan, Martin Maier, and Martin Reisslein,
More informationRedes de Computadores. Medium Access Control
Redes de Computadores Medium Access Control Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto 1 » How to control the access of computers to a communication medium?» What is the ideal Medium
More informationJOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 23, NO. 3, MARCH
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 23, NO. 3, MARCH 2005 937 The FT 3 FR 3 AWG Network: A Practical Single-Hop Metro WDM Network for Efficient Uni- and Multicasting Chun Fan, Stefan Adams, and Martin
More informationProtocols for Multiaccess Networks
Protocols for Multiaccess Networks Hosts broadcast packets When a collision occurs, all transmitted packets are lost Lost packets have to be retransmitted => Need Multiaccess Protocol Model - Slotted Aloha
More informationMulticonfiguration Multihop Protocols: A New Class of Protocols for Packet-Switched WDM Optical Networks
Multiconfiguration Multihop Protocols: A New Class of Protocols for Packet-Switched WDM Optical Networks Jason P. Jue, Member, IEEE, and Biswanath Mukherjee, Member, IEEE Abstract Wavelength-division multiplexing
More informationThe Arrayed-Waveguide Grating-Based Single-Hop WDM Network: An Architecture for Efficient Multicasting
1414 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 9, NOVEMBER 2003 The Arrayed-Waveguide Grating-Based Single-Hop WDM Network: An Architecture for Efficient Multicasting Martin Maier,
More informationECEN 5032 Data Networks Medium Access Control Sublayer
ECEN 5032 Data Networks Medium Access Control Sublayer Peter Mathys mathys@colorado.edu University of Colorado, Boulder c 1996 2005, P. Mathys p.1/35 Overview (Sub)networks can be divided into two categories:
More informationA Hybrid Multicast Scheduling Algorithm for Single-Hop WDM Networks
A Hybrid Multicast Scheduling Algorithm for Single-Hop WDM Networks Hwa-Chun Lin and Chun-Hsin Wang Abstract This paper shows that, for single-hop WDM networks, a multicast scheduling algorithm which always
More informationRMIT University. Data Communication and Net-Centric Computing COSC 1111/2061/1110. Lecture 8. Medium Access Control Methods & LAN
RMIT University Data Communication and Net-Centric Computing COSC 1111/2061/1110 Medium Access Control Methods & LAN Technology Slide 1 Lecture Overview During this lecture, we will Look at several Multiple
More informationAnalyzing Multi-Channel Medium Access Control Schemes With ALOHA Reservation
Analyzing Multi-Channel Medium Access Control Schemes With ALOHA Reservation Yunghsiang S. Han, Jing Deng and Zygmunt J. Haas Graduate Institute of Communication Engineering National Taipei University,
More informationWireless Medium Access Control Protocols
Wireless Medium Access Control Protocols Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 Classification of wireless MAC protocols Wireless
More informationWAVELENGTH AND TIME DIVISION MULTIPLEXING WITH LIGHTPATH TRESPASSING FOR ALL-OPTICAL STAR LOCAL AREA NETWORKS
WAVELENGTH AND TIME DIVISION MULTIPLEXING WITH LIGHTPATH TRESPASSING FOR ALL-OPTICAL STAR LOCAL AREA NETWORKS A thesis submitted in partial fulfilment of the requirements for the Degree of Master of Science
More informationData and Computer Communications. Chapter 11 Local Area Network
Data and Computer Communications Chapter 11 Local Area Network LAN Topologies Refers to the way in which the stations attached to the network are interconnected Bus Topology Used with multipoint medium
More informationEthernet. Introduction. CSE 3213 Fall 2011
Ethernet CSE 3213 Fall 2011 19 October 2011 1 Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed LAN technologies: Fast and gigabit Ethernet
More informationMarkov Chains and Multiaccess Protocols: An. Introduction
Markov Chains and Multiaccess Protocols: An Introduction Laila Daniel and Krishnan Narayanan April 8, 2012 Outline of the talk Introduction to Markov Chain applications in Communication and Computer Science
More informationLANs. Local Area Networks. via the Media Access Control (MAC) SubLayer. Networks: Local Area Networks
LANs Local Area Networks via the Media Access Control (MAC) SubLayer 1 Local Area Networks Aloha Slotted Aloha CSMA (non-persistent, 1-persistent, p-persistent) CSMA/CD Ethernet Token Ring 2 Network Layer
More informationPower Laws in ALOHA Systems
Power Laws in ALOHA Systems E6083: lecture 7 Prof. Predrag R. Jelenković Dept. of Electrical Engineering Columbia University, NY 10027, USA predrag@ee.columbia.edu February 28, 2007 Jelenković (Columbia
More informationSplitting Algorithms
Splitting Algorithms We have seen that slotted Aloha has maximal throughput 1/e Now we will look at more sophisticated collision resolution techniques which have higher achievable throughput These techniques
More informationWAVELENGTH-DIVISION multiplexing (WDM) partitions
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 5, NO. 5, OCTOBER 1997 719 Channel Sharing in Multi-Hop WDM Lightwave Networks: Do We Need More Channels? Srini B. Tridandapani, Member, IEEE, Biswanath Mukherjee,
More informationPacket multiple access and the Aloha protocol
Packet multiple access and the Aloha protocol Massachusetts Institute of Technology Department of Aeronautics and Astronautics Slide 1 Packet Multiple Access PMA SHARED UPLINK TERMINAL TERMINAL APPL TRANS
More informationMultiple Access Communications. EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department
Multiple Access Communications EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department 1 Multiple Access Satellite systems, radio networks (WLAN), ethernet segment
More information2.1 CHANNEL ALLOCATION 2.2 MULTIPLE ACCESS PROTOCOLS Collision Free Protocols 2.3 FDDI 2.4 DATA LINK LAYER DESIGN ISSUES 2.5 FRAMING & STUFFING
UNIT-2 2.1 CHANNEL ALLOCATION 2.2 MULTIPLE ACCESS PROTOCOLS 2.2.1 Pure ALOHA 2.2.2 Slotted ALOHA 2.2.3 Carrier Sense Multiple Access 2.2.4 CSMA with Collision Detection 2.2.5 Collision Free Protocols 2.2.5.1
More informationUNIT- 2 Physical Layer and Overview of PL Switching
UNIT- 2 Physical Layer and Overview of PL Switching 2.1 MULTIPLEXING Multiplexing is the set of techniques that allows the simultaneous transmission of multiple signals across a single data link. Figure
More informationEdge Switch. setup. reject. delay. setup. setup ack. offset. burst. burst. release. φ l. long burst. short burst. idle. p s
Performance Modeling of an Edge Optical Burst Switching ode Lisong Xu, Harry G Perros, George Rouskas Computer Science Department orth Carolina State University Raleigh, C 27695-7534 E-mail: flxu2,hp,rouskasg@cscncsuedu
More informationLecture 12 December 04, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy
Lecture 12 December 04, 2017 Wireless Access Graduate course in Communications Engineering University of Rome La Sapienza Rome, Italy 2017-2018 Random Medium Access Control Part II - CSMA and Collision
More informationMultiple Access Protocols
Multiple Access Protocols Computer Networks Lecture 2 http://goo.gl/pze5o8 Multiple Access to a Shared Channel The medium (or its sub-channel) may be shared by multiple stations (dynamic allocation) just
More informationSharing Tunable Wavelength Converters in AWG-based IP Optical Switching Nodes
Sharing Tunable Wavelength Converters in AWG-based IP Optical Switching Nodes Achille Pattavina, Marica Rebughini, Antonio Sipone Dept. of Electronics and Information, Politecnico di Milano, Italy {pattavina}@elet.polimi.it
More informationData and Computer Communications
Data and Computer Communications Chapter 16 High Speed LANs Eighth Edition by William Stallings Why High Speed LANs? speed and power of PCs has risen graphics-intensive applications and GUIs see LANs as
More informationThe Medium Access Control Scheme (MAC Layer) Reference: Andrew S. Tanenbaum, Computer Networks, 3rd Edition, Prentice Hall, 1996.
The Medium Access Control Scheme (MAC Layer) Reference: Andrew S. Tanenbaum, Computer Networks, 3rd Edition, Prentice Hall, 1996. 1 Table of Contents Introduction ALOHA Carrier Sense Multiple Sense (CSMA)
More informationA NOVEL DECENTRALIZED ETHERNET-BASED PASSIVE OPTICAL NETWORK ARCHITECTURE
A NOVEL DECENTRALIZED ETHERNET-BASED PASSIVE OPTICAL NETWORK ARCHITECTURE A. Hadjiantonis, S. Sherif, A. Khalil, T. Rahman, G. Ellinas, M. F. Arend, and M. A. Ali, Department of Electrical Engineering,
More informationWhere Are We? Basics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design
Where Are We? Basics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design Layered Architecture Layered Architecture Data Link Layer Functionality
More informationExercise Sensor Networks - (till June 20, 2005)
- (till June 20, 2005) Exercise 8.1: Signal propagation delay A church bell is rang by a digitally triggered mechanics. How long does the sound travel to a sensor node in a distance of 2km if sound travels
More informationChapter 6 Medium Access Control Protocols and Local Area Networks
Chapter 6 Medium Access Control Protocols and Local Area Networks Part I: Medium Access Control Part II: Local Area Networks CSE 3213, Winter 2010 Instructor: Foroohar Foroozan Chapter Overview Broadcast
More informationSimulated SA Throughput vs. p
Problem 1. Simulation of Slotted Aloha network (A) There are n stations in the network that are trying to transmit messages to an access point. (B) All the stations are synchronized and they are using
More informationIntroduction to CDMA ALOHA. 3. Access Control Techniques for CDMA ALOHA
Introduction to CDMA ALOHA 3. Access Control Techniques for CDMA ALOHA Takaya Yamazato Center for Information Media Studies, Nagoya University Nagoya 464-01, Japan yamazato@nuee.nagoya-u.ac.jp CDMA ALOHA
More informationCCM 4300 Lecture 5 Computer Networks, Wireless and Mobile Communications. Dr Shahedur Rahman. Room: T115
CCM 4300 Lecture 5 Computer Networks, Wireless and Mobile Communications Dr Shahedur Rahman s.rahman@mdx.ac.uk Room: T115 1 Recap of Last Session Described the physical layer Analogue and Digital signal
More informationA simple mathematical model that considers the performance of an intermediate node having wavelength conversion capability
A Simple Performance Analysis of a Core Node in an Optical Burst Switched Network Mohamed H. S. Morsy, student member, Mohamad Y. S. Sowailem, student member, and Hossam M. H. Shalaby, Senior member, IEEE
More informationVirtual Circuit Blocking Probabilities in an ATM Banyan Network with b b Switching Elements
Proceedings of the Applied Telecommunication Symposium (part of Advanced Simulation Technologies Conference) Seattle, Washington, USA, April 22 26, 21 Virtual Circuit Blocking Probabilities in an ATM Banyan
More informationLANs Local Area Networks LANs provide an efficient network solution : To support a large number of stations Over moderately high speed
Local Area Networks LANs provide an efficient network solution : To support a large number of stations Over moderately high speed With relatively small bit errors Multiaccess Protocols Communication among
More informationEfficient Control Plane for Passive Optical Burst Switching Network
Efficient Control Plane for Passive Optical Burst Switching Network Ahmed Triki 1, Paulette Gavignet 1, Bernard Arzur 1, Esther Le Rouzic 1, Annie Gravey. 2 1 France Telecom Orange Labs, Lannion, 22307
More informationComputer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis
Computer Network Fundamentals Spring 2008 Week 3 MAC Layer Andreas Terzis Outline MAC Protocols MAC Protocol Examples Channel Partitioning TDMA/FDMA Token Ring Random Access Protocols Aloha and Slotted
More informationPerformance of Multihop Communications Using Logical Topologies on Optical Torus Networks
Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks X. Yuan, R. Melhem and R. Gupta Department of Computer Science University of Pittsburgh Pittsburgh, PA 156 fxyuan,
More informationQoS Provisioning in WDM Ring Networks with Tunable Transceivers
QoS Provisioning in WDM Ring Networks with Tunable Transceivers Ashok K. Turuk and Rajeev Kumar Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Kharagpur, WB 721
More informationRing in the new for WDM resilient packet ring
THE NEW HIGH-PERFORMANCE standard IEEE 802.17 for the resilient packet ring (RPR) aims to combine the appealing functionalities from synchronous optical network/synchronous digital hierarchy (SONET/SDH)
More informationInternet Traffic Characteristics. How to take care of the Bursty IP traffic in Optical Networks
Internet Traffic Characteristics Bursty Internet Traffic Statistical aggregation of the bursty data leads to the efficiency of the Internet. Large Variation in Source Bandwidth 10BaseT (10Mb/s), 100BaseT(100Mb/s),
More informationCS 123: Lecture 12, LANs, and Ethernet. George Varghese. October 24, 2006
CS 123: Lecture 12, LANs, and Ethernet George Varghese October 24, 2006 Selective Reject Modulus failure Example w = 2, Max = 3 0 0 1 3 0 A(1) A(2) 1 0 retransmit A(1) A(2) buffer Case 1 Case 2 reject
More informationCan Multiple Subchannels Improve the Delay Performance of RTS/CTS-based MAC Schemes?
Can Multiple Subchannels Improve the Delay Performance of RTS/CTS-based MAC Schemes? By: Jing Deng, Yunghsiang S. Han, and Sanjeev R. Kulkarni. J. Deng, Y. S. Han, and S. R. Kulkarni, "Can Multiple Subchannels
More informationSENSOR-MAC CASE STUDY
SENSOR-MAC CASE STUDY Periodic Listen and Sleep Operations One of the S-MAC design objectives is to reduce energy consumption by avoiding idle listening. This is achieved by establishing low-duty-cycle
More informationChapter 1 Basic concepts of wireless data networks (cont d)
Chapter 1 Basic concepts of wireless data networks (cont d) Part 2: Medium access methods for mobile data networks Sept 15 2004 1 Fixed assignment access schemes in voice-oriented networks Frequency division
More informationR-MAC: An Energy-Efficient MAC Protocol for Underwater Sensor Networks
R-MAC: An Energy-Efficient MAC Protocol for Underwater Sensor Networks Peng Xie and Jun-Hong Cui UCONN CSE Technical Report: UbiNet-TR06-06 Last Update: June 2007 Abstract Underwater sensor networks are
More informationWavelength conversion in optical packet switching
Downloaded from orbit.dtu.dk on: Aug 18, 2018 Wavelength conversion in optical packet switching Danielsen, Søren Lykke; Hansen, Peter Bukhave; Stubkjær, Kristian Published in: Journal of Lightwave Technology
More information2. Modelling of telecommunication systems (part 1)
2. Modelling of telecommunication systems (part ) lect02.ppt S-38.45 - Introduction to Teletraffic Theory - Fall 999 2. Modelling of telecommunication systems (part ) Contents Telecommunication networks
More informationEECS Introduction to Computer Networking. Local Area Networks / Ethernet. Hub
Ethernet -- Topology: Ethernet MAC: Hub Single collision domain Hub Hub Relay Collision! After a collision, stop for a random time wait for a random time, then try again. (Walrand/Varaiya slides) - computers
More informationHigh Speed LANs. Range of technologies. Fast and Gigabit Ethernet Fibre Channel High Speed Wireless LANs. CS420/520 Axel Krings Page 2
High Speed LANs CS420/520 Axel Krings Page 1 High Speed LANs Range of technologies Fast and Gigabit Ethernet Fibre Channel High Speed Wireless LANs CS420/520 Axel Krings Page 2 1 Why High Speed LANs? Office
More information===================================================================== Exercises =====================================================================
===================================================================== Exercises ===================================================================== 1 Chapter 1 1) Design and describe an application-level
More informationIN distributed random multiple access, nodes transmit
414 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 2, FEBRUARY 2006 Power Levels and Packet Lengths in Random Multiple Access With Multiple-Packet Reception Capability Jie Luo, Member, IEEE, and
More informationGoals. Fundamentals of Network Media. More topics. Topics. Multiple access communication. Multiple access solutions
Fundamentals of Network Media Local Area Networks Ursula Holmström Goals Learn the basic concepts related to LAN technologies, for example use of shared media medium access control topologies Know the
More informationTSIN01 Information Networks Lecture 8
TSIN01 Information Networks Lecture 8 Danyo Danev Division of Communication Systems Department of Electrical Engineering Linköping University, Sweden September 24 th, 2018 Danyo Danev TSIN01 Information
More informationARCHITECTURE AND MAC PROTOCOLS FOR AWG BASED WDM SINGLE HOP NETWORKS. Chun Fan
ARCHITECTURE AND MAC PROTOCOLS FOR AWG BASED WDM SINGLE HOP NETWORKS by Chun Fan Dissertation Presented in Partial Fullfillment of the Requirement for the Degree Doctor of Philosophy ARIZONA STATE UNIVERSITY
More informationOptical networks employing wavelength division
Multidestination communication in broadcast WDM networks: a survey Dhaval Thaker George N. Rouskas North Carolina State University Department of Computer Science Raleigh, North Carolina USA ABSTRACT In
More informationChapter 11 in Stallings 10 th Edition
Local Area Network Overview Chapter 11 in Stallings 10 th Edition CS420/520 Axel Krings Page 1 LAN Applications (1) Personal computer LANs Low cost Limited data rate Back end networks Interconnecting large
More informationComp277 Assignment 1 Fall 2011 Due 20 th December 2011 at 11:00am
Question 1 1. Which of the following are related to two crucial tasks of a network interface cards? a. Establishes and manages the computer s network connection b. Connect the different parts of a motherboard
More informationData Link Layer, Part 5. Medium Access Control
CS 455 Medium Access Control, Page 1 Data Link Layer, Part 5 Medium Access Control These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang s courses at GMU
More informationCARRIER SENSE MULTIPLE ACCESS (CSMA):
Lecture Handout Computer Networks Lecture No. 8 CARRIER SENSE MULTIPLE ACCESS (CSMA): There is no central control management when computers transmit on Ethernet. For this purpose the Ethernet employs CSMA
More informationResource Sharing for QoS in Agile All Photonic Networks
Resource Sharing for QoS in Agile All Photonic Networks Anton Vinokurov, Xiao Liu, Lorne G Mason Department of Electrical and Computer Engineering, McGill University, Montreal, Canada, H3A 2A7 E-mail:
More informationError Control System for Parallel Multichannel Using Selective Repeat ARQ
Error Control System for Parallel Multichannel Using Selective Repeat ARQ M.Amal Rajan 1, M.Maria Alex 2 1 Assistant Prof in CSE-Dept, Jayamatha Engineering College, Aralvaimozhi, India, 2 Assistant Prof
More informationData Link Layer, Part 3 Medium Access Control. Preface
Data Link Layer, Part 3 Medium Access Control These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang's courses at GMU can make a single machine-readable
More informationMedium Access Control Sublayer
Wireless (WLAN) Medium Access Control Sublayer Mahalingam Mississippi State University, MS October 20, 2014 Outline Medium Access Protocols Wireless (WLAN) 1 Medium Access Protocols ALOHA Slotted ALOHA
More informationCOS 140: Foundations of Computer Science
COS 140: Foundations of Computer Science ALOHA Network Protocol Family Fall 2017 Homework 2 Introduction 3 Network Protocols.......................................................... 3 Problem.................................................................
More informationInternetworking is connecting two or more computer networks with some sort of routing device to exchange traffic back and forth, and guide traffic on
CBCN4103 Internetworking is connecting two or more computer networks with some sort of routing device to exchange traffic back and forth, and guide traffic on the correct path across the complete network
More informationCHAPTER 5. QoS RPOVISIONING THROUGH EFFECTIVE RESOURCE ALLOCATION
CHAPTER 5 QoS RPOVISIONING THROUGH EFFECTIVE RESOURCE ALLOCATION 5.1 PRINCIPLE OF RRM The success of mobile communication systems and the need for better QoS, has led to the development of 3G mobile systems
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 2, FEBRUARY
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 2, FEBRUARY 2008 623 Multicast Capacity of Packet-Switched Ring WDM Networks Michael Scheutzow, Martin Reisslein, Senior Member, IEEE, Martin Maier,
More informationLecture 9 November 12, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy
Lecture 9 November 12, 2018 Wireless Access Graduate course in Communications Engineering University of Rome La Sapienza Rome, Italy 2018-2019 Medium Access Control Scheduled access Classification of wireless
More informationChapter 4 (Week 7) The Medium Access Control Sublayer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP CN&DC Dr.
Chapter 4 (Week 7) The Medium Access Control Sublayer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP. 247-292 1 4.1. THE CHANNEL ALLOCATION PROBLEM 4.2. MULTIPLE ACCESS PROTOCOLS 4.3. ETHERNET
More informationOutline. Introduction to Networked Embedded Systems - Embedded systems Networked embedded systems Embedded Internet - Network properties
Outline Introduction to Networked Embedded Systems - Embedded systems Networked embedded systems Embedded Internet - Network properties Layered Network Architectures - OSI framework descriptions of layers
More informationIntroduction Computer Networks. Applications Requiring High Speed LANs. Why High Speed LANs? IEEE802.3 Medium Access Control
168 430 Computer Networks Chapter 16 High Speed LANs Introduction Range of technologies Fast and Gigabit Ethernet Fibre Channel High Speed Wireless LANs Why High Speed LANs? Office LANs used to provide
More informationCHAPTER 15 LOCAL AREA NETWORKS ANSWERS TO QUESTIONS
CHAPTER 15 LOCAL AREA NETWORKS ANSWERS TO QUESTIONS 15.1 Computer room networks require very high data rates and usually are concerned with transfer of large blocks of data. 15.2 Backend LAN: Backend networks
More informationISSN: (Online) Volume 2, Issue 6, June 2014 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 2, Issue 6, June 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online
More informationLAN Systems. Bus topology LANs
Bus topology LANs LAN Systems Design problems: not only MAC algorithm, not only collision domain management, but at the Physical level the signal balancing problem (signal adjustment): Signal must be strong
More informationNetwork Topology Control and Routing under Interface Constraints by Link Evaluation
Network Topology Control and Routing under Interface Constraints by Link Evaluation Mehdi Kalantari Phone: 301 405 8841, Email: mehkalan@eng.umd.edu Abhishek Kashyap Phone: 301 405 8843, Email: kashyap@eng.umd.edu
More informationLecture 5 The Data Link Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 5 The Data Link Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Link Layer: setting the context two physically connected devices: host-router, router-router, host-host,
More informationCOMPUTER NETWORKS - Local area networks
Local area networks Telecommunication Networks Group firstname.lastname@polito.it http://www.telematica.polito.it/ COMPUTER NETWORKS LANs - 1 Copyright Quest opera è protetta dalla licenza Creative Commons
More informationLocal area networks. Copyright
Local area networks Telecommunication Networks Group firstname.lastname@polito.it http://www.telematica.polito.it/ COMPUTER NETWORKS LANs - 1 Copyright Quest opera è protetta dalla licenza Creative Commons
More informationMultiple Access (1) Required reading: Garcia 6.1, 6.2.1, CSE 3213, Fall 2010 Instructor: N. Vlajic
1 Multiple Access (1) Required reading: Garcia 6.1, 6.2.1, 6.2.2 CSE 3213, Fall 2010 Instructor: N. Vlajic Multiple Access Communications 2 Broadcast Networks aka multiple access networks multiple sending
More informationAloha and slotted aloha
CSMA 2/13/06 Aloha and slotted aloha Slotted aloha: transmissions are synchronized and only start at the beginning of a time slot. Aloha sender A sender B collision sender C t Slotted Aloha collision sender
More informationETSN01 Exam Solutions
ETSN01 Exam Solutions March 014 Question 1 (a) See p17 of the cellular systems slides for a diagram and the full procedure. The main points here were that the HLR needs to be queried to determine the location
More informationCS 43: Computer Networks. 27: Media Access Contd. December 3, 2018
CS 43: Computer Networks 27: Media Access Contd. December 3, 2018 Last Class The link layer provides lots of functionality: addressing, framing, media access, error checking could be used independently
More informationPerformance Analysis of DS/SSMA Unslotted ALOHA System With Variable Length Data Traffic
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 19, NO. 11, NOVEMBER 2001 2215 Performance Analysis of DS/SSMA Unslotted ALOHA System With Variable Length Data Traffic Jae-Woo So, Student Member,
More informationCollege of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435
College of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435 Student Name ID Time Allowed: 2.0 Hours. Closed Book, Closed
More information