The University of Kansas

Similar documents
Lecture 1 Overview - Data Communications, Data Networks, and the Internet

The Network Layer and Routers

Lecture 16: Network Layer Overview, Internet Protocol

Performance Comparison Between AAL1, AAL2 and AAL5

Rapidly Deployable Radio Network - Phase II

Network Management & Monitoring

Code No: RR Set No. 1

Asynchronous Transfer Mode (ATM) ATM concepts

Goals and topics. Verkkomedian perusteet Fundamentals of Network Media T Circuit switching networks. Topics. Packet-switching networks

Wireless Networks. Communication Networks

CCNA Exploration1 Chapter 7: OSI Data Link Layer

In-Band Flow Establishment for End-to-End QoS in RDRN. Saravanan Radhakrishnan

Performance of Lucent CDMA2000 3G1X Packet Data Experimental System

Networks Overview. Dr. Yingwu Zhu

E&CE 358: Tutorial 1. Instructor: Sherman (Xuemin) Shen TA: Miao Wang

Internetworking Part 1

Internet Architecture & Performance. What s the Internet: nuts and bolts view

Computer Networks and the internet. Daniel Graham Ph.D

Internet Architecture and Protocol

Data and Computer Communications Chapter 1 Data Communications, Data Networks, and the Internet

Data Link Control Protocols

Introduction to Wireless Networking ECE 401WN Spring 2008

Chapter 4 Network Layer: The Data Plane

Lecture 2: Internet Structure

Announcements. TAs office hours: Mohamed Grissa: Mohamed Alkalbani:

Need For Protocol Architecture

Need For Protocol Architecture

Network Superhighway CSCD 330. Network Programming Winter Lecture 13 Network Layer. Reading: Chapter 4

The Diffie-Hellman Key Exchange

Ch. 4 - WAN, Wide Area Networks

Lecture 22 Overview. Last Lecture. This Lecture. Next Lecture. Internet Applications. ADSL, ATM Source: chapter 14

AAL2 Transmitter Simulation Study: Revised

Review of Topology and Access Techniques / Switching Concepts

Asynchronous. nous Transfer Mode. Networks: ATM 1

IP Packet Switching. Goals of Todayʼs Lecture. Simple Network: Nodes and a Link. Connectivity Links and nodes Circuit switching Packet switching

Integrated t Services Digital it Network (ISDN) Digital Subscriber Line (DSL) Cable modems Hybrid Fiber Coax (HFC)

Chapter 1. Computer Networks and the Internet

Communication Networks - 3 general areas: data communications, networking, protocols

Data Networks. Lecture 1: Introduction. September 4, 2008

Internet Routing. Review of Networking Principles. What s the Internet: nuts and bolts view. Communication links

Internet Routing. Review of Networking Principles

Fragmenting and Interleaving Real-Time and Nonreal-Time Packets

Talk Spurt. Generator. In Assembler. Size of samples collected Delay = Voice coding rate SSCS PDU CPCS SDU CPCS CPCS PDU SAR SDU SAR SAR PDU.

Chapter 5.6 Network and Multiplayer

OSI Layer OSI Name Units Implementation Description 7 Application Data PCs Network services such as file, print,

CIS 777 Telecommunications Networks

Data and Computer Communications. Chapter 2 Protocol Architecture, TCP/IP, and Internet-Based Applications

QoS in multiservice IP networks Vodafone-Italy s point of view

Survivability Architectures for Service Independent Access Points to Multiwavelength Optical Wide Area Networks

Lecture 3. The Network Layer (cont d) Network Layer 1-1

Operating Systems CS 571

Networks. Computer Technology

Switching Networks (Fall 2010) EE 586 Communication and. August 27, Lecture 2. (modified by Cheung for EE586; based on K&R original) 1-1

Performance Challenge of 3G over Satellite Methods for Increasing Revenue & Quality of Experience. February 2018

precise rules that govern communication between two parties TCP/IP: the basic Internet protocols IP: Internet protocol (bottom level)

Introduction to Networking

Outline. Circuit Switching. Circuit Switching : Introduction to Telecommunication Networks Lectures 13: Virtual Things

Chapter 11: Wide-Area Networks and the Internet

Point-to-Point Network Switching. Computer Networks Term B10

Network and Mobile Compu4ng in the 20 th Century and Beyond. COMP 1400 Memorial University Winter 2015

Next Steps Spring 2011 Lecture #18. Multi-hop Networks. Network Reliability. Have: digital point-to-point. Want: many interconnected points

Digital Communication Networks

Module 10 Frame Relay and ATM

Chapter 7 CONCLUSION

WiFi Networks: IEEE b Wireless LANs. Carey Williamson Department of Computer Science University of Calgary Winter 2018

Announcements. CS 5565 Network Architecture and Protocols. Outline for today. The Internet: nuts and bolts view. The Internet: nuts and bolts view

Dr Markus Hagenbuchner CSCI319 SIM. Distributed Systems Chapter 4 - Communication

TOC: Switching & Forwarding

Part 1: Introduction. Goal: Review of how the Internet works Overview

CS610- Computer Network Solved Subjective From Midterm Papers

TOC: Switching & Forwarding

Reminder: Datalink Functions Computer Networking. Datalink Architectures

Hands-On Metro Ethernet Carrier Class Networks

Networking interview questions

A Hybrid Systems Modeling Framework for Fast and Accurate Simulation of Data Communication Networks. Motivation

Convergence of communication services

Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ

ET4254 Communications and Networking 1

Lecture 4 Wide Area Networks - Asynchronous Transfer Mode

CSE 123A Computer Networks

What Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control

Applications and Performance Analysis of Bridging with Layer-3 Forwarding on Wireless LANs

Introduction to computer networking

Part 5: Link Layer Technologies. CSE 3461: Introduction to Computer Networking Reading: Chapter 5, Kurose and Ross

Real-Time Protocol (RTP)

White Paper. Massive Capacity Can Be Easier with 4G-Optimized Microwave Backhaul

1-1. Switching Networks (Fall 2010) EE 586 Communication and. October 25, Lecture 24

Overview. Performance metrics - Section 1.5 Direct link networks Hardware building blocks - Section 2.1 Encoding - Section 2.2 Framing - Section 2.

CS162 Operating Systems and Systems Programming Lecture 21. Networking. Page 1

CS419: Computer Networks. Lecture 10, Part 3: Apr 13, 2005 Transport: TCP performance

4.2 Virtual Circuit and Datagram Networks

Flow-Based Routing: Towards New QoS Models Dr. Riad Hartani Caspian Networks

3. (a) Explain WDMA protocol. (b) Explain wireless LAN protocol. [8+8]

Kommunikationssysteme [KS]

Chapter 3 Packet Switching

CT 1502 Planning and Design of Communication Networks Storeand-Forward. Chapter 4. Nada Al Dosary

Performance Evaluation of FDDI, ATM, and Gigabit Ethernet as Backbone Technologies Using Simulation

Quality of Service Monitoring and Delivery Part 01. ICT Technical Update Module

Not all SD-WANs are Created Equal: Performance Matters

ACE Connection Interface Specification Version 0.9

Transcription:

The University of Kansas Technical Report Rapidly Deployable Radio Network ATM/IP Analysis Gary J. Minden, Joseph B. Evans Information & Telecommunication Technology Center Department of Electrical Engineering & Computer Science The University of Kansas Lawrence, Kansas ITTC-FY2003-13380-14 September 2002 Copyright 2002: The University of Kansas Center for Research, Inc. 2335 Irving Hill Road, Lawrence, KS 66045-7612. All Rights Reserved.

The rapidly deployable network is an integrated mobile networking system (see Figure 1). It supports mobile switching nodes, interconnected over point to point radio frequency links, and supports applications with both Internet protocol (IP) and asynchronous transfer mode (ATM) communication services. The RDRN system can also interoperate with wired infrastructure over fiber optic links and satellite systems over radio frequency links. RDRN is a self organizing mobile network. Figure 1 illustrates the Rapidly Deployable Radio Network. RDRN consists of mobile nodes that form a back-bone network. The mobile network can interconnect with wired services as shown on the left. When RDRN was first proposed, the Internet protocol (IP) offered ubiquitous interconnectivity between a multitude of applications. Asynchronous Transfer Mode (ATM) offered the ability to shape and control traffic flows in a low bandwidth wireless network. Hence, RDRN combined both ATM and IP in the switching nodes; ATM providing traffic shaping and IP providing interconnectivity. An RDRN switching node contained a software ATM switch, multiple virtual ATM devices and perhaps some real ATM devices. The real ATM devices would interconnect to fiber optic networks. The virtual ATM devices would connect to wireless links. The overall software architecture is shown in Figure 2. As ATM cells arrived at a switching node, they could either be switched through the software ATM switch and rerouted back out a different port or be collected into a IP package and forwarded to the IP processing layer. 1

Figure 2 illustrates the RDRN software structure. In the IP processing layer, packets could either be routed through a normal IP routing mechanism or collected and sent to a higher level such as UDP, TCP and other applications. Using this combination of ATM and IP seemed a reasonable idea. ATM provided traffic shaping and quick access to link capacity due to the small cell size and IP provided interoperability with numerous operations. However, questions continuously arose as to the efficiency of ATM, particularly over low bandwidth wireless links. There were additional concerns about the delays induced if only larger IP packets were sent over the RF links. This paper attempts to illicit some of the trade-offs between using ATM and IP protocols and some recommendations for future mobile networking systems. In Figure 3, we show the efficiency of sending different size packets over an ATM only link. Packet sizes are shown from one byte through 8,192 bytes. The analysis shows for very small packets below 32 bytes, ATM is, of course, very inefficient because you must send the entire 48 byte payload plus 5 byte header. For packets between approximately 48 bytes and 256 bytes, ATM is between 60-80% efficient. Above about 512 bytes, ATM reaches its maximum efficiency of about 90%. 2

ATM Efficiency 1.0000 0.8000 0.6000 0.4000 0.2000 00 Figure 3 shows the efficiency of ATM versus packet size. Figure 4 shows IP efficiency for the same packet sizes. Because IP packets can be variable in size, we see a more gradual increase in efficiency up to about 90-93% at 512 bytes. We assume a MTU of 512 bytes. Of course, for very small packets the fixed size of the IP header dominates the efficiency calculation. For very large packets, the overhead of the IP header is amortized over the larger number of bytes and IP efficiency is greater than ATM efficiency. Figure 5 shows an overlay of the two efficiency curves. IP Efficiency 1.00 0.80 0.60 0.40 0.20 Figure 4 shows the efficiency of IP versus packet size. This chart assumes a MTU of 512 bytes. 3

IP vs. ATM Efficiency 1.0000 0.8000 0.6000 0.4000 0.2000 00 Figure 5 compares the efficiency of ATM to IP over packet sizes from 0 to 8192 bytes. An approach to obtain the best of both worlds, the smaller header slides of an ATM cell with the variable packet size of an IP packet, one could conceive of an IP circuit identifier at the beginning of an IP packet. If this IP circuit identifier were, say, a 4-byte value, then you get an efficiency curve shown in Figure 6. In this case, even for small packets, we obtain reasonable efficiency that surpasses both ATM and IP, and the efficiency approaches a value of 1 for very large packets. The concept of a circuit identifier introduces state at each end of the link that must be maintained and managed, but this is not different from the IP header compression that occurs in a SLIP or PPP link. ATM vs IPCkt Efficiency 1.2000 1.0000 0.8000 0.6000 0.4000 0.2000 00 Figure 6 compares the efficiency of an IPCircuits approach to conventional ATM and IP packets. ATM circuits do not appear to have significantly higher efficiency over IP packets for message sizes from one byte to 8192 bytes. However, packet sizes from 32 bytes to 128 bytes are highly 4

probable in mobile networks and particularly, defense oriented mobile networks. Example applications are telnet, which sends a single packet per character typed, and situation awareness messages. The introduction of IP circuit identifiers could significantly increase efficiency in wireless networks and the management of these IP circuit identifiers, the appropriate protocols, associated state, and a dynamic mobile network is a future research problem. An important characteristic of defense mobile networks is the delay in sending high priority messages through the network. An advantage of ATM technology is that, independent of packet size, time to transmit the first cell of a high priority message on the wireless link is at most one cell time. Figure 8 shows the delay in milliseconds for packet sizes from 1 byte to 8192 bytes assuming a one megabit per second radio frequency link. The red line indicates the average delay for an ATM link. The delay for an IP based link will vary as shown with the blue line based on the maximum transmission unit (MTU) of the interface. In the figure, we have assumed an MTU of 512 bytes. Hence, the IP delay peaks at a packet size of 512 bytes. Then the average delay decreases as the packet size is between 512 and 1024 bytes (the reason for this is half of the time you will have a 512 byte packet ahead of you which you must wait for and half of the time you will have a smaller packet ahead of you). As the total message size reaches 8192 bytes, the average delay the next packet experiences goes to an average of 2 milliseconds. For comparison purposes, we also include a graph for fixed size packet of 96 bytes that has an average delay of just under 1 millisecond. Average Time to Next Pkt [1 Mbps Link] 2.500 2.000 0 1.000 0.500 0 Figure 8 shows the average waiting time at the transmitter for a high priority message. It would also be useful to measure the effects on a single, high priority flow through a network where there are additional flows going through the same network. In the ATM case, the variants introduced at each node will be relatively small since all the cells are the same size and a high priority flow will always go to the head of the line. In an IP based network, the variants will increase more rapidly because of each switching node. The size of the packet at the head of the queue, that is, the packet being transmitted, will have more variable size and hence the variance will increase. 5

In summary, for multihop networks short packets or cells will reduce the average delay to the next opportunity to insert traffic and short packets and cells also will reduce the delay variants as the prime packet goes through multihop networks. Conclusion To conclude then, ATM cells offer lower average queuing delay to high priority traffic. For short messages, ATM is only slightly less efficient than IP due to the shorter ATM header. Hence, for shorter messages the shorter ATM headers increase efficiency. For longer packets, there is an increased delay variance through a multihop network as high priority traffic must wait at each node for the packet currently on the link. However, conventional ATM signaling and state maintenance is too complex for a highly mobile network. Circuit set up requires processing at each hop and end-to-end communications. It is extremely difficult to maintain circuit state in mobile switching nodes and the interactions with the Internet Protocol through Classical IP (SEAL IP) and ATMARP are complex. Our recommendation is to consider radio frequency based mobile networks to use a small fixed packet size or small segment size, perhaps with a circuit identifier at the beginning similar to that used in SLIP and PPP. Future work should be invested in exploring methodologies for rapid flow setup and state maintenance, perhaps along the lines of MPLS. 6