Advanced Data Communications CA528

2. Advanced Data Communications CA528 MSc in eCommerce (Technical) MSc in Security & Forensic Computing

3. Protocol Stack Digital Encoding Sliding Windows Switching 802.3, 11(b,g) Bluetooth TCP\IP Socket Programming and RPC Slip, PPP and ADSL ICMP SNMP & Management Tools The DNS and BIND Cisco Router Configuration Traffic Capture & Analysis Labs Course Outline

4. Project Possibilities I • Marshal arguments for RPC (Strings & Floats). • Applications of ping, traceroute and tcpdump & tcptrace • Analysis of TCP\UDP traffic with netperf. • Query SNMP router using UDP • Workbook on SNMP tools

5. Project Possibilities II • Implement a port knocker with challenge\response authentication. • Present a lecture ! • Demo port scanner, sniffers and other dodgy stuff . • Write a ping programme with spoofed IP using raw sockets and use for DOS. • Workbook on SW Cisco router incl. ACL.

6. OSI Application Presentation Session Transport Network Data link Physical TCP\IP Application (1) Transport (2) Internet (3) Host - Network (4) } Not present

7. Meet Some of the TCP/IP Family FTP SMTP SNMP Telnet 1 2 3 4 TCP UDP IP Pkt radio 802 lan Arpanet

8. Standards • A number of standards bodies exist • IEEE • OSI • ITU (the organisation formerly known as CCITT) • TCP/IP standards set by RFCs, controlled by IAB -> {IRTF, IETF} • ISO

9. Digital Encoding • NRZ- L • NRZ- I • Manchester • Differential Manchester • 4B\5B • 8B6T • Issues of efficiency and clocking.

11. Encoding (Notes) • NRZ-L is used for short connections (RS232) but not for longer connections. Positive denotes a ‘0’ and negative denotes a ‘1’. (L refers to level). • NRZ-I (Inverted) is a differential scheme where a transition denotes a ‘1’, and no transition denotes a ‘0’. With differential coding schemes a signal is decoded by comparrison of the polarity of adjacent signal elements, rather than determining the absolute value of a signal element.

12. An advantage of this scheme is that it may be more reliable to detect a transition, in the presence of noise, rather than to compare a value to a threshold. Differential encoding on a twisted pair medium is also immune to the wires being crossed as the thresholds are not being examined, but the transitions are. After all a transition from +’ive to -’ive is just as much a transition as from -’ive to +’ive. • There is a requirement for clocking information to be embedded in the data. One technique which does this is called Manchester Encoding, and a variation on it is called Differential Manchester Encoding. These schemes are called biphase codes. • In the binary encoded signal there is no clock information, i.e. nothing to differentiate repeating digits.

13. In Manchester Encoding, each bit period is divided into two equal intervals, thus the name biphase. There is always a transition between these intervals (thus clocking). A binary ‘0’ is represented as having the first interval set high and the second interval set low. A binary ‘1’ is the reverse -- the first interval is low and the second high. • Advantage: always a transition in each bit, thus making synchronisation between sender and receiver possible. • Disadvantage: requires twice as much bandwidth as plain binary coding. • Differential Manchester Encoding scheme distinguishes 1’s and 0’s by using a transition at the start of a period to indicate a ‘0’ and no transition to represent a ‘1’. A transition in the middle of the period between the two intervals is still used to help provide clocking information, just as in Manchester Encoding.

14. This differential scheme is more complex to operate but is more immune to noise. An error must invert the signal before and after expected transitions to cause undetected errors. It also requires twice the bandwidth of ordinary binary encoding. • In differential encoding schemes, it is the transition from one voltage level to another that distinguishes bit values, not the voltage levels. This makes the coding scheme more immune to noise. • If there are two wires carrying a signal from one device to another and the wires are accidentally confused, then this does not affect the interpretation of the data as the transitions in voltage levels will still be correctly interpreted. The signal levels are not important, only the transition from one state to another.

15. Pipelining • When propagation delay is not negligible, these previous methods are wasteful of bandwidth. • The solution is to ‘fill up the pipe’. However, doing this entails sending off frames before ACKs for previous frames have arrived.

16. Sliding Window Protocol • Each outbound frame is given a sequence number in the range of 2n-1 using an n-bit field, e.g. if n=1, then range is 0.....1 as in ABP or PAR protocols. • Both sender and receiver keep windows informing them of which frames can be validly sent and which validly received.

17. Rules • Sender :- The upper edge of sender is advanced when a frame is sent (up to max. window size). The lower edge advanced when ACK received for lowest numbered frame in the window. • Receiver :- Both edges are advanced when the lowest numbered frame in window is correctly received and ACK sent.

18. Notes • Buffering requirements at both sender and receiver depend on the size of the sending and receiving windows respectively. • Each transmitted frame has its own separate timeout clock.

19. Notes (cont.) • In these protocols, an acknowledgement for frame N is accepted as acknowledging all transmitted frames numbered up to N (counting circularly). • Thus, if ACK(0) and ACK(1) were both destroyed, but ACK(2) now arrives, it implicitly acknowledges 0 and 1 also.

21. Example Session with Recovery |----------------Timeout-----| 0 1 2 3 4 5 6 7 8 2 3 4 5 9 10 11 12 13 8 8 8 8 9 10 1 2 0 1 E 3 4 5 6 7 8 2 3 4 5 9 10 11 |--------Buffered--------| ACK# Pass 2-8 to NW Layer PAK#

22. The Stopping Problem • A Data-Link cannot be stopped. • Consider a session termination. • Neither terminal knows that other has sent last packet, the last packet must be ACK’d. • In practice the data-link is dropped after the link is sensed as being dead for a prolonged period.

23. Switching • Packets must be sent from host to host across a directed network. • Three types of switching are employed. • Circuit Switching • Message Switching • Packet Switching

24. Circuit Switching • Like old fashioned terrestrial telephone system. • Try to form dedicated physical path from source to destination. • Path remains dedicated until session is terminated. • Not typical operation of bursty comms.

25. Message Switching • No physical path established. • Large bursts of data transmitted from sender to receiver. • Each burst stored and forwarded from host to host throughout network. • No limit to burst size, may encounter memory\buffering and link availability problems.

26. Packet Switching • Upper limit set on size of blocks to be transmitted. • Ideal for bursty computer communications. • May utilise pipelining to improve throughput. • Large packet size will emulate message switching, small emulates circuit switching.

27. Switching Call request signal Trunk hunting Pkt1 Msg Pkt2 Pkt1 Call accept signal Pkt3 Msg Pkt2 Pkt1 Pkt4 Pkt3 Msg Pkt2 Pkt5 Data Pkt4 Pkt3 Pkt5 Pkt4