Telecommunication & Networking

1. Telecommunication & Networking Lesson Six

2. ISO Open System Interconnect (OSI) Move to TCP/IP and VPN HTTP Application Presentation Session Routing Transport Network LLC Data Link MAC Physical

3. Binding Virtual IP Addresses 137.45.192.8 Source IP Address Destination IP Address Address resolution Hardware Address 0A:07:4B:12:BE:3C

4. ARP (Address Resolution Protocol): Who has this IP? • Ultimate communication is by physical address (Internet/Ethernet card) • Map IP to Physical Address (MAC address) • NIC replacement or machine replacement makes easy with same IP address • IP-to-physical binding included in every ARP broadcast • RARP: Who knows my IP address?

5. Network Layer • Routing: end-to-end not node-to-node • Network Control: status information to determine the best path • Congestion Control: balancing act • Collection of Accounting Data

6. TCP Layers Application Application Presentation Session Transport host-to-host Transport Network Internet Network Access Data Link Physical Physical

7. FTP SMTP RPC TFTP Connectionless No re-transmission No time outs No ACKs No Naks TCP UDP IP Class A: 126 max network number; 16,777,124 hosts Class B: 16,384; 65,634 Class C: 2,097,152; 254

8. TCP/IP • TCP was responsible for the integrity of the delivery of information from applications to applications • It was broken off into two parts (1978): TCP and IP • TCP is responsible for accepting information from applications and breaking it into pieces (TCP segments) acceptable to the network and reassembling the segments at the other end and deliver to applications as ‘information’ • IP simply forward datagrams from source host to destination host

9. IP Data Unit • Version (bit 0-3): IPv4 for example • H-Length (4-7): Header length; usually is 20 Octets (5 32-bit words) • Type of Service (8-15): first three bits indicate “precedence,” next bit is the delay bit (1 indicates a short delay request), next bit (bit 4) is the throughput bit (1 indicates a high throughput request), next bit is the reliability bit, bit 6 is the cost bit and bit 7 is not used. • Total Length (16-31): max length is 65,535 Octets • Time-to-Live (TTL): 8 bits; the number of hops to traverse in the internet; routers are required to check this field and throw away the datagram if the value is 0

10. Classes of IP Address Space • Primary Classes • Class A: 0 + 7-bit prefix/128 networks (24-bit suffix - 16,777,216 hosts)[0 thru 127] • Class B: 10 + 14-bit prefix/16384 networks (16-bit suffix - 65536 hosts)[128 thru 191] • Class C: 110 + 21-bit prefix (netid)/2,097,152 networks (8-bit suffix - 256 hosts)[192 thru 223] • Class D: 11102 multicast address

11. Weaknesses of IP Addressing • IP identifies the network and the host (machine) • If a host computer moves from one network to another, its IP address must change • Normadic computing makes difficult • Expansion (class C to class B) implies complete halt of all machines to effect the change

12. TCP • Sequence number: either the sequence number of the first octet in the data field or the initial send sequence (ISS) number • Acknowledgement number: set to a value that acknowledges data previously received and the next expected octet (sequence number)

13. Each node (a computer or a printer) has a unique IP address • Address - assignment could be different; e.g., AppleTalk addresses are chosen randomly at startup by each host • But each computer performs many functions • Need different sessions, each session is assigned a logical ‘address’ or port number • There are 65,535 ports • Port 80 is usually for the Web Server • Check out /etc/services file in UNIX

14. Port Assignments in UNIX

15. Sockets • Datagrams - finite size packets • Header + Payload • A message could be broken down into a number of payloads with the header indicating the source/destination nodes and port numbers respectively • The receiving end will rearrange the packets back to a message • Socket is born

16. Socket Operations • Connect to a remote host • Send data • Receive data • Close a connection • Bind to a port • Listen for incoming data • Accept connections from remote machines on the bound port

17. The development of technologies for LANs and WANs were not coordinated and was never considered to be meshed together • The push of Internet is to transform it from a data-network to multimedia-network using the existing infrastructure which has moved from 9600 kbps to magnitude of Gbps transmission rate • What are the requirements to support data, voice, and video applications

18. Voice & Video have a high tolerance for errors versus Data; loss of video packets demands no resend; loss of voice packets delivers poor fidelity; loss of data packets renders the communication useless. • Yet network delay is acceptable to data packets, the information just arrived ‘late.’ But for voice & video packets, high network delay renders inefficient communications that may lead to communication breakdown due to annoyance.

19. A speaks, reaches B, B listens, B responds, reaches A, A listens • “Voice and video transmissions require a short queue length at the network nodes in order to reduce delay, or at least to make the delay more predictable. The short voice packet queue lengths can experience overflow occasionally, with the resulting packet loss. However, data packets require longer queue lengths to prevent packet loss in overflow conditions.”

20. VBR vs CBR • Variable Bit Rate: does not require a constant and continuous allocation of bandwidth; bursty, asynchronous, no time or timing constraint • Constant Bit Rate • IGMP (Internet Group Management Protocol): multicasting • RSVP (Resource Reservation Protocol): establishes a path (versus connectionless IP) and guarantee bandwidth of the path

21. UDP • UDP (User Datagram Protocol): connectionless protocol with no retransmissions, no time outs, no ACKs and NAKs • NTP (Network Time Protocol): • RTP (Real Time Protocol): sits on top of UDP to support transmission of data within a defined (very short) time period • Voice over IP (VoIP)??

23. Internetworking Devices Application • Networking Devices • Repeaters • Bridges • Internetworking Devices • Routers • Gateways Presentation Session Gateway Transport Network Router Bridge Data Link Repeater Physical

24. Repeaters A repeater is a device that regenerates the original bit pattern (before the signals become too weak or corrupted).

25. Bridges Bridges bring together two segments of the same type of network together and relay frames across only if necessary.

26. Bridges • A complete and valid frame must be received before it forwards to other segment • At the Data Link Layer, e.g., follows CSMA/CD in a Ethernet; thus isolated collisions and delays within a segment • Computers are not aware the existence of bridges

27. Bridges

28. Routers Routers determine where a transmission should continue by looking at addresses at the network layer.

29. Gateways Gateways are typically software installed in a router that supports connectivity between two different kinds of network.

30. Simple Switching Network Switching Node

31. Switching Networks • Transmission between stations is accomplished via the network of switching nodes • Switched Communication Networks • Node-to-node links are TDM or FDM • Circuit-switching vs Packet-switching

32. Circuit-Switching Networks • A complete path is established before data is being transmitted • Transmission can be analog and/or digital depending on the nature of the network • Path will be discontinued after the completion of the transmission • Examples are telephone networks and PBX • subscribers (telecommunication device), local loops, exchanges, and trunks

33. Switching Concepts • A Typical Circuit-Switching Node • Control Unit • establishes connections • maintain connections • shut down connections • Blocking vs Non-blocking • blocking occurs when a request for connection cannot be satisfied due to existing connections in the switching node

34. Switching Concepts (cont’d) • Space-division Switching • Crossbar switch - costly (n2); not fault-tolerant; non-blocking • Multiple-stage switch - less costly; more complex control; blocking; multiple paths between two points • Time-division Switching • Virtually all modern circuit switches use digital TDM • TDM bus switching

35. Routing in Circuit-Switched Networks • Routing : must be efficiency and resilience • Able to handle the busiest traffic load • Static routing with crossover in a hierarchical structure to improve fault tolerance • Dynamic routing - peer relationship at the switches (no hierarchical relationship and all are ‘equal’)

36. Dynamic Routing in Circuit-Switched Networks • Two classes: • Alternate Routing • predefined routes between two switches • select according to predetermined order (order in which reflects the best use of network resources given historical data) • fixed vs dynamic alternate-routing scheme • fixed offer one route per two nodes; dynamic cycles through a pre-defined set of routes per two nodes • Adaptive Routing • reacts to changing patterns in network traffic • one example : Dynamic Traffic Management (DTM) - developed by Northern Telecom

37. DTM • Central controller finds the best alternate routes • Analysis is performed (say, every 10 seconds) to evaluate the traffic load for all the alternate routes if the direct link is not available • Central controller uses information such as utilization at the switch (only 2 out of 5 trunks are used), CPU load, overflow traffic.

38. Packet Switching • Datagram Approach • The relationship between two or more packets of the same message, even on the same circuit does not exist. • Virtual Circuit Approach • Relationship between all packets belonging to a message is preserved • Switched Virtual Circuit (SVC) • circuit creates for the exchange and exits when the exchange is complete • Permanent Virtual Circuit (PVC) • circuit creates for the exchange remains the same

39. Performance • Propagation Delay : time it takes a signal to propagate from one node to the next • Transmission Time : time it takes for a transmitter to send out a block of data • Node delay : time it takes for a node to perform the necessary processing as it switches data

40. Characteristics of Packet Switching • Connection-oriented service • a logical connection is set up between two stations • all packets for that connection are numbered and out in the sequence • all packets are received in the same sequence (order) • external vs internal virtual-circuit service

41. Characteristics of Packet Switching • Connectionless service • No logical connection is set up between two stations • all packets for that connection are numbered and go out independent of each other • all packets are received in the same sequence (order) • external vs internal datagram service

42. Routing • What do we look for ? • Correctness, simplicity, robustness, stability, fairness, optimality and efficiency • Elements of routing techniques : how many hops, cost, delay, distributed vs central vs originating decision place;

43. Routing Considerations • Decision Time • Routing decision made per packet or per virtual circuit • Decision Place • Distributed routing • Centralized routing by some network control center (NCC) • Source routing

44. Routing with no new information • Flooding • send from a source node to every one of its neighbors • this repeats at other nodes - to all outgoing links other than the sender link • use diameter, if known, of the network to control packets propagation • ADVANTAGES • all possible routes are tried • high probability of a packet getting to its destination in a timely manner

45. Routing with no new information • Random Routing • selects only one outgoing path for retransmission of an incoming packet • variation: probability to each outgoing link

46. Routing with network information • Adaptive Routing - routing decisions made as conditions on the network change • state of network must be exchanged between nodes • the more frequent the exchange the better the routing decisions • information exchange put load on network, may affect overall performance • Fixed Routing - next slide

47. Packet Switched Network 8 3 5 2 3 6 3 5 2 8 1 2 3 2 1 6 3 1 1 2 7 4 1 4 5 1

48. Fixed Routing

49. Minimum Hops • or least-cost routing… • Dijkstra’s Algorithm • Find the shortest paths from a given source node to all other nodes by developing the paths in order of increasing path length • Bellman-Ford Algorithm • Find the shortest paths from a given source node subject to the constraint that the paths contain, at most, one link, then two links and so on

50. Frame Relay Packet Switching with Acknowledgement 3 5 7 1 4 6 8 2 Control and data packets are carried on the same circuit Frame Relay 1 2 3 4 Control packet is carried on a separate logical connection from data packet; no hop-to-hop flow control and error control; end-to-end flow and error controls are handled at a higher layer (transport)