Communications Networking: End-users, Applications and Network Service Classes

Professor Izhak Rubin rubin@ee.ucla.edu Electrical Engineering Department UCLA

2013 by Professor Izhak Rubin

Communications and Telecommunications Networking

Objective: transport of information from source end users to destination end users Communications network

End users (stationary, mobile) Nodes (switches / routers, relays) Links (multiple communications media; wireline; wireless) Topological layout (tree; mesh; kconnected graph) Quantity, Accuracy, timeliness, reliability, availability, security

Quality of transport

Prof. Izhak Rubin

ARPANET: Network Layout

Prof. Izhak Rubin

Cyber-geo Map of Internet layouts

Visualization Study of the NSFNET, undertaken by Donna Cox and Robert Patterson from the NCSA in 1992.

Prof. Izhak Rubin

Illustrative Network Layout and Network Flows

A screenshot of a 3D model of the vBNS network which connects universities and laboratories in the USA. The model was created by Jeff Brown, a researcher at MOAT, National Laboratory for Applied Network Research (NLANR), USA. The model is animated to show how traffic flows over the links.

Prof. Izhak Rubin

Internet MCI Backbone Layout

Prof. Izhak Rubin

Network coverage using WLANs

Abstract map of some of the 802.11b wireless base station nodes in central London

Prof. Izhak Rubin

Wireless Mesh Network

Wired Network Mesh AP Mesh AP

Mesh AP

Mesh AP

Prof. Izhak Rubin

Mobile Ad hoc Wireless Networks

Internet
Prof. Izhak Rubin 9

UV aided Autonomous Mobile Backbone Network

Reference: MBNP-Simulator
Prof. Izhak Rubin 10

MBN with Multiple UAVs

Reference: MBNP-Simulator
Prof. Izhak Rubin 11

Networking Using Swarms of UAVs

SWARM 2

SWARM 1

GROUND SENSORS Prof. Izhak Rubin 12

Hierarchical Configuration of UV-aided Mobile Backbone Network (UV-MBN)

ANet 1
Backbone Node Gateway

ANet 2

ASPN 1

ANet 3 ASPN 2

Prof. Izhak Rubin

13



The protocol operates in the license-free ISM band at 2.402-2.480 GHz. To avoid interfering with other protocols that use the 2.45 GHz band, the Bluetooth protocol divides the band into 79 channels (each 1 MHz wide) and changes channels up to 1600 times per second. Implementations with versions 1.1 and 1.2 reach speeds of 723.1 kbit/s. Version 2.0 implementations feature Bluetooth Enhanced Data Rate (EDR) and reach 2.1 Mbit/s. Technically, version 2.0 devices have a higher power consumption, but the three times faster rate reduces the transmission times, effectively reducing power consumption to half that of 1.x devices (assuming equal traffic load).

Prof. Izhak Rubin

14

Bluetooth Networking

Bluetooth is a packet-based protocol with a master-slave structure. One master may communicate with up to 7 slaves in a piconet; all devices share the master's clock. Packet exchange is based on the basic clock, defined by the master, which ticks at 312.5 s intervals. Two clock ticks make up a slot of 625 s; two slots make up a slot pair of 1250 s. In the simple case of single-slot packets the master transmits in even slots and receives in odd slots; the slave, conversely, receives in even slots and transmits in odd slots. Packets may be 1, 3 or 5 slots long but in all cases the master transmit will begin in even slots and the slave transmit in odd slots. A master Bluetooth device can communicate with up to seven devices in a Wireless User Group. This network group of up to eight devices is called a piconet. The devices can switch roles, by agreement, and the slave can become the master at any time. At any given time, data can be transferred between the master and one other device. The master switches rapidly from one device to another in a round-robin fashion. Simultaneous transmission from the master to multiple other devices is possible via broadcast mode, but not used much. The Bluetooth Core Specification allows connecting two or more piconets together to form a scatternet, with some devices acting as a bridge by simultaneously playing the master role in one piconet and the slave role in another. Prof. Izhak Rubin

15

Bluetooth Uses

Bluetooth is a standard communications protocol primarily designed for low power consumption, with a short range (power-class-dependent: 100 m, 10 m and 1 m, but ranges vary in practice) based on low-cost transceiver microchips in each device. The devices do not have to be in line of sight of each other. While the Bluetooth Core Specification does mandate minimums for range, the range of the technology is application specific and is not limited. Manufacturers may tune their implementations to the range needed to support individual use cases.
Maximum Permitted Power Range (approximate) mW dBm 100 20 ~100 meters Class 1 2.5 4 ~10 meters Class 2 1 0 ~1 meters Class 3 Class

Version Data Rate 1 Mbit/s Version 1.2 Version 2.0 + EDR 3 Mbit/s Version 3.0 + HS 24 Mbit/s

Prof. Izhak Rubin

16

Communications Networking: End-User

End user

Host, terminal, computer, station, laptop, wireless handset, etc. Time domain and spatial distribution (scope) Traffic descriptor: average rate, peak rate, maximum burst duration Per application, per traffic class
Prof. Izhak Rubin 17

Application

Traffic Class

Quality of Service (QoS) requirements

Multi Level Traffic Model

Prof. Izhak Rubin

18

Traffic Engineering

Random Arrival of flows, calls, bursts, messages, packets Random duration of underlying activity Sharing of network storage, processing, computing, demand networking and communications resources leading to:

Duration of activity

t demand demand Resourc e demand

Resource contentions Buffering / Queueing delays Delay throughput performance limitations

Prof. Izhak Rubin

demand

19

Performance Measures

Statistical; over specified period of time Throughput: average number of information units received by destination per units time

Gross and net throughput measures Goodput = throughput of correctly (no errors) received data units Robust Throughput = received correctly uninterrupted (credit gained upon completion of transaction [Rubin] ); e.g., no (or limited) premature breakup of route
Prof. Izhak Rubin 20

Performance Measures (cont.)

Delay

Message and packet delay; interface boundaries (e.g., UNI) Access delay; network (system) delay; end to end delay Delay mean, standard deviation, jitter, packet delay variation, 99-percentile, distribution Offered message rate vs. departing message rate (throughput) Blocking probability (Grade of Service, GOS, for CS telephone networks and others that employ Call Admission Controls)

Packet / message discard rate; call blocking ratio

Error Rate Reliability; availability

Prof. Izhak Rubin 21

Communications Network: Service Classes

Network offered Service Classes (for QoS transport of corresponding Applications)

Constant Bit Rate (CBR) Real time Variable Bit Rate (rtVBR) Non Real time Variable Bit Rate (nrtVBR) Available Bit Rate (ABR) Unspecified Bit Rate (UBR) Best effort service
Prof. Izhak Rubin 22

Communications Network: Service Classes (cont.)

Service Class Features

QoS measures: packet delay, packet delay jitter, packet discard rate; error rate; availability and reliability QoS guarantees tied to loading by flow in accordance with traffic descriptor

Call / flow admission control Traffic policing at the User-to-Network Interface (UNI); rate control, traffic shaping Priorities; differentiated services.

Connection oriented and connectionless operation

Prof. Izhak Rubin 23

Illustrative Applications and Services over the Internet

Prof. Izhak Rubin

24

Broadcast and Multicast

Single message received at multiple stations Physical layer Physical layer broadcast Bus networks Link Induced broadcast Logical bus Examples: local area networks

Prof. Izhak Rubin

25

Broadcast and Multicast (cont.)

Network layer Broadcast: from a source node to all network nodes Multicast: from a source host to hosts that join a designated group Application layer Multicast destination group by group membership protocol

receivers sender

receivers sender

Prof. Izhak Rubin

26

Geographical Categorization

Computer Bus Local Area Networks (LANs) Metropolitan Area Networks (MANs) Wide Area Networks (WANs) Key parameter: propagation delay of signal across the communications media

Per link and end-to-end

Prof. Izhak Rubin 27

Multi-Media

Physical layer

Different types of communications links Twisted pair (copper wire), coaxial, fiberoptic, radio-terrestrial, radio-satellite Real-time applications: voice and video

Application layer

Integrated services network Broadband-ISDN

Prof. Izhak Rubin 28

Topology and Connectivity

Mesh Graph 5-connected

Loop Graph (Cycle) 2-connected

Tree Graph = Connected, no cycles 1-connected

Star Graph 1-connected Tree

Prof. Izhak Rubin

29

Topology and Connectivity (conti.)

Graph = G = (V,E) k (line / node) connected = requires at least k lines/nodes to fail to disconnect Observe: fully connected graph with n nodes uses n(n-1)/2 (FDX) point-to-point lines. Need to use nodal switching to make connections on demand.

Prof. Izhak Rubin

30

Graph Layouts

Prof. Izhak Rubin

31

Topological Layout Graphs

(1)

Graph = G = (V,E) Connected graph has at least one path between any pair of nodes k (line / node) connected = remains connected under failures of k-1 (or less) lines/nodes; Requires at least k lines/nodes to fail to disconnect Mengers theorem: k-connected graph iff it has k (line/node) disjoint paths between any pair of nodes

Prof. Izhak Rubin

32

Topological Layout - Graphs (2)

d(i,j) distance between nodes i and j = length of i-j shortest path Diameter (G) = max d(i,j) over all nodes. Degree of node i = deg(i) = number of lines attached to I = number of its neighbors Number of lines = m(G) = m; number of nodes = n(G) =n Eulers Theorem: 2*m = sum [deg(i)] over all nodes For graph where deg(i) = k, m = nk/2 For k-connected graph, we have deg(i) >=k, for each node i, so that m >= nk/2. Other connectivity measures: probabilistically based.
Prof. Izhak Rubin 33