>>> SOLUTIONS <<< Answer the following questions regarding the basics of computer networks and the Internet.

Size: px
Start display at page:

Download ">>> SOLUTIONS <<< Answer the following questions regarding the basics of computer networks and the Internet."

Transcription

1 Mid-Term Exam for Computer Networks Fall 2010 >>> SOLUTIONS <<< Welcome to the Mid-Term Exam for Computer Networks. Read each problem carefully. There are eight required problems (each worth 12 points you get 4 points for correctly following these instructions). There is also an additional extra credit question worth 10 points. You may have with you a calculator, pencils and/or pens, erasers, blank paper, and one 8.5 x 11 inch formula sheet. On this formula sheet you may have anything you want (definitions, formulas, homework answers, old exam answers, etc.) as handwritten by you in pencil or ink on both sides of the sheet. Photocopies, scans, or computer generated and/or printed text are not allowed on this sheet. Note to tablet PC users you may not print-out your handwritten text for the formula sheet. You have 75 minutes for the exam. Please use a separate sheet of paper for the answer to each question. Good luck and be sure to show your work! Problem #1 Answer the following questions regarding the basics of computer networks and the Internet. a) What are the basics tasks of a communications system? 0.25 each and round-up (2 pts total) Message formatting, error detection and recovery, addressing, routing, flow control, system management, security, and QoS b) What are the fundamental challenges to improve communications systems (hint: think about the fundamental measures of a communications system)? 0.25 each and round-up (2 pts total) Greater throughput, less delay, less loss, lower cost, more mobility, greater robustness, and better secrecy c) Think about the OSI reference model and the 5-layer Internet reference model we are using in this class. Identify what is different between these two models (be more specific than just saying two layers!). 1 each layer noted (2 pts total) The key difference is that the 5-layer Internet model does not have the presentation and session layers found in the OSI model. Otherwise the models are essentially the same. d) In the 5-layer Internet reference model which layers handle point-to-point functions and which layers handle end-to-end functions? 0.5 each and round-up (2 pts total) Note: Will accept layer 3 as point-to-point Layers 1 and 2 are point-to-point and layers 3 and 4 are end-to-end. e) Is sockets a protocol or interface? Carefully explain why. 1 each for key point (2 pts total) An interface is a complete set of rules for information exchange between adjacent layers in a single site and this is the function that sockets provides as an applications programming interface (API) where the underlying protocol is TCP or UDP. So, sockets is an interface. f) What problems do Information Theory and Coding Theory address? In what department are these areas typically studied. 1 each (2 pts total) Information theory deals with the channel itself to determine the maximum capacity of the channel. Coding theory is the study of coding techniques for the channel (to achieve high data rate approaching the maximum capacity). Information Theory and Coding Theory are usually studied in Electrical Engineering.

2 Problem #2 Answer the following general questions, each question requiring some simple calculation: a) Consider a 100 meter 100 Mb/s Ethernet link transporting 1500 byte frames. What is the transmission delay for a frame? What is the approximate propagation delay of this link? Which delay dominates for this link? 2 for each delay (4 pts total) A meter is roughly 3 feet. Signal propagates about 1 foot in 1 nanosecond, so the propagation delay is about 300 nanoseconds. The transmission delay is bits per frame divided by 10 million bits per second, which is 120 microseconds per frame. The transmission delay is about 3 orders of magnitude greater than the propagation delay. b) Consider a buffer with 100 packets queued, each packet is 1500 bytes in length. The buffer is for an intermediate node with a 100 Mb/s egress (output) link with no throttling. How long will it take for all packets to be transmitted (that is, for the buffer to empty out)? 2 for each calculation (4 pts total) The transmission delay is bits per frame divided by 10 million bits per second, which is 120 microseconds per frame. The last frame in the queue must wait for 100 transmissions, so 100 x 120 microseconds is 12 milliseconds. c) It is about 2500 miles to Seattle from here. Is the round-trip-time from here to Seattle and back (assuming no queueing delays) greater or less than the human perception threshold? 2 for each calculation (4 pts total) Signal propagates about 1 foot in 1 nanosecond, there are 5280 feet in a mile, so roughly 5 microseconds delay per mile. Thus, 5000 miles (2500 miles there and back) is about 25 milliseconds, this is less than the human delay threshold of about 100 milliseconds (so, the RTT from here to Seattle will appear instantaneous ). Problem #3 Answer the following questions regarding the Application Layer. a) An application layer protocol typically defines four things. What are these four things? 1 pt each (4 pts total) Types of messages, syntax of messages, semantics of messages, and timing (when and how). b) What are ping and traceroute used for? Describe the output from each program. 2 each (4 pts total) Ping is used to determine the presence (liveliness) of a remote host and the RTT to this host. The output is host not found (if the host is not there) or a list of RTTs for each ping packet sent. Traceroute is used to determine the hops (by IP address) from a source to a destination. For each hop listed, three sample RTTs are reported. c) What is a web cache used for (i.e., what benefits are derived from using a web cache)? Where can a web cache be located or placed? 2 pt each subquestion (4 pts total) A web cache may be used to reduce response time as experienced by a user, reduce load on a link, and/or reduce load on a web server. A web cache may be placed in the user client (e.g., within the browser application), at my network edge (we call this a proxy server), and/or at the edge of the network containing the server (we call this a transparent cache). d) What is DNS and what is it used for? If all DNS servers could be crashed (taken offline), what would happen to the Internet (be precise). 2 pts each for DNS use and for what would happen (4 pts total) DNS is Domain Name Service and is used to associate host names (as in say, or christen@csee.usf.edu) with IP addresses. If all DNS servers were to be crashed one would be unable to use hostnames and could only use IP addresses when using Internet services.

3 Problem #4 Appendix A contains tcpclient.c with some bugs and Appendix B contains tcpserver.c with some bugs. Identify the bugs and explain how to fix them. Note that the programs compile and link successfully (using bcc32 in Windows, at least). The bugs are all quite major in scope and may be related and/or common between the two programs. Write your answer directly on the code listings (i.e., in Appendix A and B) of this exam handout. 1 each (12 pts total) The following are the bugs in tcpclient.c: #define IP_ADDR "grad.csee.usf.edu" is wrong (should be an IP address, not host name) client_s = socket(af_inet, SOCK_DGRAM, 0); should contain SOCK_STREAMS if (client_s > 0) should be < The block of code to receive from the server must come after the connect retcode = send(server_s, out_buf, (strlen(out_buf) + 1), 0); must be to client_s (server_s makes no sense) The following are the bugs in tcpserver.c: welcome_s = socket(af_inet, SOCK_DGRAM, 0); should contain SOCK_STREAMS if (welcome_s > 0) should be < bind() and error check for successful binding is missing after filling-in of server address information listen(connect_s, 1); must be listening on welcome_s connect_s = accept(connect_s, (struct sockaddr *)&client_addr, &addr_len); must accept for welcome_s and not itself retcode = send(welcome_s, out_buf, (strlen(out_buf) + 1), 0); must send on connect_s and not welcome_s retcode = recv(welcome_s, in_buf, sizeof(in_buf), 0); must send on connect_s and not welcome_s Problem #5 Answer the following questions about the transport layer: a) What are the fundamental services provided by the transport layer? Very briefly, how does TCP implement each of these services. 1 pt each service and TCP implementation (6 pts total) The fundamental services are 1) multiplexing/demultiplexing, 2) reliable data transfer (assured delivery), and congestion control. TCP provides service (1) using port numbers, a port for each application, (2) by checksumming for error detection, time-outs for loss detections, and resend to recover from an error or loss, (3) by using a sliding windows and decreasing the window size on time-out (implicit detection of overflow packet loss). b) There are two ways to terminate a TCP connection, what are they? What are the implications (that is, what happens) of each way? 1 pt each (2 pts total) The normal way to terminate a TCP connection is with a FIN/ACK sequence a two-way close with all sent bytes being delivered and ACKed. Another way to terminate a TCP connection is with a reset (RST flag set). In this case, any data in transit may not be fully delivered (i.e., may be lost unknown to the sender). c) What are the goals of congestion control? List at last four key goals. 1 pt each (4 pts total)

4 Problem #6 Key goals include: minimize frame discard, maintain agreed-upon QoS, minimize possibility that on end user can monopolize, be simple to implement, create minimal additional traffic, and limit the spread of congestion. Sketch the FSMs for the sender and receiver of RDT 1.0 from the textbook and lecture. RDT 1.0 is a reliable data transfer protocol where one assumes that there are no bit errors and no packet loss. 6 pts each need to show basic transitions (12 pts total) SENDER call > rdt_send(data) packet = make_pkt(data) udt_send(packet) +< Waits for a call from above (application layer) Problem #7 RECEIVER call > rdt_rcv(packet) extract(packet,data) deliver_data(data) +< Waits for a call from below (network layer) What window size (in bytes) would a TCP connection need to maintain 100% throughput for a connection from Earth to Mars. The distance from Earth to Mars is about 36 million miles in the best case (the exact distance depends on the relative orbital positions of the two planets and can be much more). Assume a link rate of 1 Mb/s and packet length of 1500 bytes. Can the window size you computed be used with the current TCP standard (why or why not)? 5 pts for set-up, 5 pts for calculation, 2 pts for use with TCP (12 pts total) The sliding window formula is U W t fr 2 t pr t fr where we want U to be 1.0. We first compute t pr and t fr as follows. Light propagates about 1 foot in 1 nanosecond, so 1 mile is about 5 microseconds (5280 feet in a mile), and then 36 million miles would be about 180 seconds, to t pr 180 s. The transmit time is packet length divided by link rate, which is t fr s. The only unknown now is W, which we can solve for and we get W = packets. Each packet is 1500 bytes, so the windows size would be bytes. The window

5 Problem #8 size file is 16 bits and is great than 2 16, thus this large window size could not be achieved using existing TCP. Answer the following questions about the network layer. a) What are the two key functions of the network layer 1 each (2 pts total) Forwarding of packets and routing b) What is the fundamental difference between virtual circuit and datagram service? 1 each (2 pts total) In a virtual circuit the path is set-up at connection establishment and all packets in a connection flow across this route, in datagram service each packet in a connection is routed indvidiually. c) What are the criteria for a good routing algorithm? List at least four key criteria. 0.5 each and round-up (4 pts total) Key criteria are fast, simple, not generate much network traffic, not create loops, stable, and converges to an optimum solution. d) Describe Dijkstra s shortest path algorithm. Which routing protocol uses Dijkstra s shortest path algorithm? 2 pts total To determine that shortest path from node A to node B in a connected graph add edges (hops) starting at A in order of least path cost from node A until node B is reached. This will be the lowest cost path. OSPF (also Cisco s IGRP) uses Dijkstra s shortest path algorithm. e) IP addresses are split into net_id and host_id. Why is this done? 2 pts (2 pts total) This is done to reduce the size of routing tables (routers have only to route by net_id). Extra Credit In the ARP protocol the ARP request is broadcast and the ARP response is unicast (that is, sent directly and only to the sender of the ARP request). What might the advantages and disadvantages be of broadcasting the ARP response? 5 pts for each (10 pts total) Advantages: Allow all hosts on a subnet to learn about a given IP-MAC address relationship and enter it into their ARP cache. This may be useful for future use by a host (and the host will not need to send an ARP request because the desired IP-MAC is already in its ARP cache courtesy of another host). Thus, this may reduce ARP request traffic on the subnet. So, in short, less traffic. Disadvantage: The processing load on all hosts is now increased and many hosts may never need the IP-MAC address associations learned. So, in short, more processing at hosts.

6 Appendix A Program tcpclient.c with some bugs << SNIP SNIP header removed >> #define WIN // WIN for Winsock and BSD for BSD sockets //----- Include files #include <stdio.h> // Needed for printf() #include <string.h> // Needed for memcpy() and strcpy() #include <windows.h> // Needed for all Winsock stuff #ifdef BSD #include <sys/types.h> // Needed for sockets stuff #include <netinet/in.h> // Needed for sockets stuff #include <sys/socket.h> // Needed for sockets stuff #include <arpa/inet.h> // Needed for sockets stuff #include <fcntl.h> // Needed for sockets stuff #include <netdb.h> // Needed for sockets stuff //----- Defines #define PORT_NUM 1050 // Port number used at the server #define IP_ADDR "grad.csee.usf.edu" // IP address of server (HARDWIRED) //===== Main program ========================================================== void main(void) WORD wversionrequested = MAKEWORD(1,1); // Stuff for WSA functions WSADATA wsadata; // Stuff for WSA functions int client_s; // Client socket descriptor int server_s; // Server socket descriptor struct sockaddr_in server_addr; // Server Internet address char out_buf[4096]; // Output buffer for data char in_buf[4096]; // Input buffer for data int retcode; // Return code // This stuff initializes winsock WSAStartup(wVersionRequested, &wsadata); // Create a client socket // - AF_INET is Address Family Internet and SOCK_STREAM is streams client_s = socket(af_inet, SOCK_DGRAM, 0); if (client_s > 0) printf("*** ERROR - socket() failed \n"); // Receive from the server retcode = recv(client_s, in_buf, sizeof(in_buf), 0); printf("*** ERROR - recv() failed \n");

7 // Fill-in the server's address information and do a connect with the // listening server using the client socket - the connect() will block. server_addr.sin_family = AF_INET; // Address family to use server_addr.sin_port = htons(port_num); // Port num to use server_addr.sin_addr.s_addr = inet_addr(ip_addr); // IP address to use retcode = connect(client_s, (struct sockaddr *)&server_addr, sizeof(server_addr)); printf("*** ERROR - connect() failed \n"); // Output the received message printf("received from server: %s \n", in_buf); // Send to the server strcpy(out_buf, "This is a reply message from CLIENT to SERVER"); retcode = send(server_s, out_buf, (strlen(out_buf) + 1), 0); printf("*** ERROR - send() failed \n"); // Close the client socket retcode = closesocket(client_s); printf("*** ERROR - closesocket() failed \n"); #ifdef BSD retcode = close(client_s); printf("*** ERROR - close() failed \n"); // Clean-up winsock WSACleanup();

8 Appendix B Program tcpserver.c with some bugs << SNIP SNIP header removed >> #define WIN // WIN for Winsock and BSD for BSD sockets //----- Include files #include <stdio.h> // Needed for printf() #include <string.h> // Needed for memcpy() and strcpy() #include <windows.h> // Needed for all Winsock stuff #ifdef BSD #include <sys/types.h> // Needed for sockets stuff #include <netinet/in.h> // Needed for sockets stuff #include <sys/socket.h> // Needed for sockets stuff #include <arpa/inet.h> // Needed for sockets stuff #include <fcntl.h> // Needed for sockets stuff #include <netdb.h> // Needed for sockets stuff //----- Defines #define PORT_NUM 1050 // Arbitrary port number for the server //===== Main program ========================================================== void main(void) WORD wversionrequested = MAKEWORD(1,1); // Stuff for WSA functions WSADATA wsadata; // Stuff for WSA functions int welcome_s; // Welcome socket descriptor struct sockaddr_in server_addr; // Server Internet address int connect_s; // Connection socket descriptor struct sockaddr_in client_addr; // Client Internet address struct in_addr client_ip_addr; // Client IP address int addr_len; // Internet address length char out_buf[4096]; // Output buffer for data char in_buf[4096]; // Input buffer for data int retcode; // Return code // This stuff initializes winsock WSAStartup(wVersionRequested, &wsadata); // Create a welcome socket // - AF_INET is Address Family Internet and SOCK_STREAM is streams welcome_s = socket(af_inet, SOCK_DGRAM, 0); if (welcome_s > 0) printf("*** ERROR - socket() failed \n"); // Fill-in server (my) address information server_addr.sin_family = AF_INET; // Address family to use server_addr.sin_port = htons(port_num); // Port number to use server_addr.sin_addr.s_addr = htonl(inaddr_any); // Listen on any IP address

9 // Listen for a connection listen(connect_s, 1); // Accept a connection. The accept() will block and then return with // connect_s assigned and client_addr filled-in. printf("waiting for accept() to complete... \n"); addr_len = sizeof(client_addr); connect_s = accept(connect_s, (struct sockaddr *)&client_addr, &addr_len); if (connect_s < 0) printf("*** ERROR - accept() failed \n"); // Copy the four-byte client IP address into an IP address structure memcpy(&client_ip_addr, &client_addr.sin_addr.s_addr, 4); // Print an informational message that accept completed printf("accept completed (IP address of client = %s port = %d) \n", inet_ntoa(client_ip_addr), ntohs(client_addr.sin_port)); // Send to the client strcpy(out_buf, "This is a message from SERVER to CLIENT"); retcode = send(welcome_s, out_buf, (strlen(out_buf) + 1), 0); printf("*** ERROR - send() failed \n"); // Receive from the client retcode = recv(welcome_s, in_buf, sizeof(in_buf), 0); printf("*** ERROR - recv() failed \n"); printf("received from client: %s \n", in_buf); // Close the welcome and connect sockets retcode = closesocket(welcome_s); printf("*** ERROR - closesocket() failed \n"); retcode = closesocket(connect_s); printf("*** ERROR - closesocket() failed \n"); #ifdef BSD retcode = close(welcome_s); printf("*** ERROR - close() failed \n");

10 retcode = close(connect_s); printf("*** ERROR - close() failed \n"); // Clean-up winsock WSACleanup();

CSE/EE 461 Lecture 14. Connections. Last Time. This Time. We began on the Transport layer. Focus How do we send information reliably?

CSE/EE 461 Lecture 14. Connections. Last Time. This Time. We began on the Transport layer. Focus How do we send information reliably? CSE/EE 461 Lecture 14 Connections Last Time We began on the Transport layer Focus How do we send information reliably? Topics ARQ and sliding windows Application Presentation Session Transport Network

More information

Socket Programming. Sungkyunkwan University. Hyunseung Choo Copyright Networking Laboratory

Socket Programming. Sungkyunkwan University. Hyunseung Choo Copyright Networking Laboratory Socket Programming Sungkyunkwan University Hyunseung Choo choo@skku.edu Copyright 2000-2019 Networking Laboratory Contents Goals Client-Server mechanism Introduction to socket Programming with socket on

More information

THE UNIVERSITY OF NEW SOUTH WALES

THE UNIVERSITY OF NEW SOUTH WALES Name of Candidate: Student ID: Signature: THE UNIVERSITY OF NEW SOUTH WALES COMP3331/93331 Computer Networks and Applications Sample Mid-session Examination INSTRUCTIONS TO CANDIDATES: (1) Time allowed:

More information

Lecture 11: IP routing, IP protocols

Lecture 11: IP routing, IP protocols Lecture 11: IP routing, IP protocols Contents Routing principles Local datagram delivery ICMP Protocol UDP Protocol TCP/IP Protocol Assuring requirements for streaming TPC Building and terminating TCP

More information

Computer Networks. 19 December This exam consists of 6 questions with subquestions. Every subquestion counts for 10 points.

Computer Networks. 19 December This exam consists of 6 questions with subquestions. Every subquestion counts for 10 points. Computer Networks 19 December 2014 This exam consists of 6 questions with subquestions. Every subquestion counts for 10 points. Mark every page with name and student number. Use of books, additional course

More information

First Exam for ECE671 Spring /22/18

First Exam for ECE671 Spring /22/18 ECE67: First Exam First Exam for ECE67 Spring 208 02/22/8 Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 75 minutes to complete the exam. Be a

More information

CS 428/528 Computer Networks Lecture 01. Yan Wang

CS 428/528 Computer Networks Lecture 01. Yan Wang 1 CS 428/528 Computer Lecture 01 Yan Wang 2 Motivation: Why bother? Explosive growth of networks 1989, 100,000 hosts on the Internet Distributed Applications and Systems E-mail, WWW, multimedia, distributed

More information

Your Name: Your student ID number:

Your Name: Your student ID number: CSC 573 / ECE 573 Internet Protocols October 11, 2005 MID-TERM EXAM Your Name: Your student ID number: Instructions Allowed o A single 8 ½ x11 (front and back) study sheet, containing any info you wish

More information

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START MIDTERM EXAMINATION #2 NETWORKING CONCEPTS 03-60-367-01 U N I V E R S I T Y O F W I N D S O R - S c h o o l o f C o m p u t e r S c i e n c e Fall 2011 Question Paper NOTE: Students may take this question

More information

Question Score 1 / 19 2 / 19 3 / 16 4 / 29 5 / 17 Total / 100

Question Score 1 / 19 2 / 19 3 / 16 4 / 29 5 / 17 Total / 100 NAME: Login name: Computer Science 461 Midterm Exam March 10, 2010 3:00-4:20pm This test has five (5) questions. Put your name on every page, and write out and sign the Honor Code pledge before turning

More information

CS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes

CS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes CS 4: COMPUTER NETWORKS SPRING 03 FINAL May 6, 03 50 minutes Name: Student No: Show all your work very clearly. Partial credits will only be given if you carefully state your answer with a reasonable justification.

More information

WinSock. What Is Sockets What Is Windows Sockets What Are Its Benefits Architecture of Windows Sockets Network Application Mechanics

WinSock. What Is Sockets What Is Windows Sockets What Are Its Benefits Architecture of Windows Sockets Network Application Mechanics WinSock What Is Sockets What Is Windows Sockets What Are Its Benefits Architecture of Windows Sockets Network Application Mechanics What Is Sockets Standard API (Application Programming Interface) for

More information

Tutorial on Socket Programming

Tutorial on Socket Programming Tutorial on Socket Programming Computer Networks - CSC 458 Department of Computer Science Hao Wang (Slides are mainly from Seyed Hossein Mortazavi, Monia Ghobadi, and Amin Tootoonchian, ) 1 Outline Client-server

More information

Interprocess Communication Mechanisms

Interprocess Communication Mechanisms Interprocess Communication 1 Interprocess Communication Mechanisms shared storage These mechanisms have already been covered. examples: shared virtual memory shared files processes must agree on a name

More information

Interprocess Communication Mechanisms

Interprocess Communication Mechanisms Interprocess Communication 1 Interprocess Communication Mechanisms ffl shared storage These mechanisms have already been covered. examples: Λ shared virtual memory Λ shared files processes must agree on

More information

Chapter 6. What happens at the Transport Layer? Services provided Transport protocols UDP TCP Flow control Congestion control

Chapter 6. What happens at the Transport Layer? Services provided Transport protocols UDP TCP Flow control Congestion control Chapter 6 What happens at the Transport Layer? Services provided Transport protocols UDP TCP Flow control Congestion control OSI Model Hybrid Model Software outside the operating system Software inside

More information

Sirindhorn International Institute of Technology Thammasat University

Sirindhorn International Institute of Technology Thammasat University Name.............................. ID............... Section...... Seat No...... Thammasat University Final Exam: Semester, 205 Course Title: Introduction to Data Communications Instructor: Steven Gordon

More information

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START Page 1 of 20 MIDTERM EXAMINATION #1 - B COMPUTER NETWORKS : 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Fall 2008-75 minutes This examination document

More information

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START Page 1 of 20 MIDTERM EXAMINATION #1 - A COMPUTER NETWORKS : 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Fall 2008-75 minutes This examination document

More information

CS164 Final Exam Winter 2013

CS164 Final Exam Winter 2013 CS164 Final Exam Winter 2013 Name: Last 4 digits of Student ID: Problem 1. State whether each of the following statements is true or false. (Two points for each correct answer, 1 point for each incorrect

More information

Fundamental Questions to Answer About Computer Networking, Jan 2009 Prof. Ying-Dar Lin,

Fundamental Questions to Answer About Computer Networking, Jan 2009 Prof. Ying-Dar Lin, Fundamental Questions to Answer About Computer Networking, Jan 2009 Prof. Ying-Dar Lin, ydlin@cs.nctu.edu.tw Chapter 1: Introduction 1. How does Internet scale to billions of hosts? (Describe what structure

More information

CPSC 441 COMPUTER NETWORKS MIDTERM EXAM

CPSC 441 COMPUTER NETWORKS MIDTERM EXAM CPSC 441 COMPUTER NETWORKS MIDTERM EXAM Department of Computer Science University of Calgary Professor: Carey Williamson March 7, 2018 This is a CLOSED BOOK exam. Textbooks, notes, laptops, personal digital

More information

Introduction to Client-Server Model

Introduction to Client-Server Model Preview Introduction to Client-Server Model Motivation of Client-Server Model Terminologies and Concepts in Client-Server Model Connectionless vs. Connection-Oriented Stateless vs. Stateful Server Identify

More information

CS 3516: Computer Networks

CS 3516: Computer Networks Welcome to CS 3516: Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: AK219 Fall 2018 A-term 1 Some slides are originally from the course materials of the textbook Computer Networking: A Top

More information

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition ELEC / COMP 177 Fall 2014 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Project #1 Starts in one week Is your Linux environment all ready? Bring your laptop Work time after quick

More information

CPSC 213. Introduction to Computer Systems. Inter-Process Communication. Unit 2f

CPSC 213. Introduction to Computer Systems. Inter-Process Communication. Unit 2f CPSC 213 Introduction to Computer Systems Unit 2f Inter-Process Communication 1 Reading For Next Three Lectures Textbook The Client Server Programming Model - Web Servers 2nd ed: 11.1-11.5 1st ed: 12.1-12.5

More information

CSCI 415 Computer Networks Homework 2 Due 02/13/08

CSCI 415 Computer Networks Homework 2 Due 02/13/08 CSCI 415 Computer Networks Homework 2 Due 02/13/08 Saad Mneimneh Computer Science Hunter College of CUNY Problem 1 Consider the following server and client C++ code that we saw in class: server.c #include

More information

School of Engineering Department of Computer and Communication Engineering Semester: Fall Course: CENG415 Communication Networks

School of Engineering Department of Computer and Communication Engineering Semester: Fall Course: CENG415 Communication Networks School of Engineering Department of Computer and Communication Engineering Semester: Fall 2012 2013 Course: CENG415 Communication Networks Instructors: Mr Houssam Ramlaoui, Dr Majd Ghareeb, Dr Michel Nahas,

More information

Programming with TCP/IP. Ram Dantu

Programming with TCP/IP. Ram Dantu 1 Programming with TCP/IP Ram Dantu 2 Client Server Computing Although the Internet provides a basic communication service, the protocol software cannot initiate contact with, or accept contact from, a

More information

ECE 435 Network Engineering Lecture 2

ECE 435 Network Engineering Lecture 2 ECE 435 Network Engineering Lecture 2 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 6 September 2018 Announcements Homework 1 will be posted. Will be on website, will announce

More information

Answers to Sample Questions on Transport Layer

Answers to Sample Questions on Transport Layer Answers to Sample Questions on Transport Layer 1) Which protocol Go-Back-N or Selective-Repeat - makes more efficient use of network bandwidth? Why? Answer: Selective repeat makes more efficient use of

More information

EEC-484/584 Computer Networks

EEC-484/584 Computer Networks EEC-484/584 Computer Networks Lecture 15 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of last lecture The network layer

More information

User Datagram Protocol

User Datagram Protocol Topics Transport Layer TCP s three-way handshake TCP s connection termination sequence TCP s TIME_WAIT state TCP and UDP buffering by the socket layer 2 Introduction UDP is a simple, unreliable datagram

More information

Unix Network Programming

Unix Network Programming Introduction to Computer Networks Polly Huang EE NTU Unix Network Programming The socket struct and data handling System calls Based on Beej's Guide to Network Programming 1 The Unix Socket A file descriptor

More information

CSC209H Lecture 9. Dan Zingaro. March 11, 2015

CSC209H Lecture 9. Dan Zingaro. March 11, 2015 CSC209H Lecture 9 Dan Zingaro March 11, 2015 Socket Programming (Kerrisk Ch 56, 57, 59) Pipes and signals are only useful for processes communicating on the same machine Sockets are a general interprocess

More information

Lecture 13: Transportation layer

Lecture 13: Transportation layer Lecture 13: Transportation layer Contents Goals of transportation layer UDP TCP Port vs. Socket QoS AE4B33OSS Lecture 12 / Page 2 Goals of transportation layer End-to-end communication Distinguish different

More information

Lecture 5. Transport Layer. Transport Layer 1-1

Lecture 5. Transport Layer. Transport Layer 1-1 Lecture 5 Transport Layer Transport Layer 1-1 Agenda The Transport Layer (TL) Introduction to TL Protocols and Services Connectionless and Connection-oriented Processes in TL Unreliable Data Transfer User

More information

Processes communicating. Network Communication. Sockets. Addressing processes 4/15/2013

Processes communicating. Network Communication. Sockets. Addressing processes 4/15/2013 Processes communicating Network Communication Process: program running within a host. within same host, two processes communicate using inter-process communication (defined by OS). processes in different

More information

What s an API? Do we need standardization?

What s an API? Do we need standardization? Network Interface z The network protocol stack is a part of the OS z Need an API to interface applications to the protocol stack. What s an API? Do we need standardization? z The socket interface is the

More information

CSc 450/550 Computer Networks Network Architectures & Client-Server Model

CSc 450/550 Computer Networks Network Architectures & Client-Server Model CSc 450/550 Computer Networks Network Architectures & Client-Server Model Jianping Pan Summer 2007 5/17/07 CSc 450/550 1 Last lectures So far, nuts and bolts views of the Internet Internet evolution and

More information

Distributed Systems. 02. Networking. Paul Krzyzanowski. Rutgers University. Fall 2017

Distributed Systems. 02. Networking. Paul Krzyzanowski. Rutgers University. Fall 2017 Distributed Systems 02. Networking Paul Krzyzanowski Rutgers University Fall 2017 1 Inter-computer communication Without shared memory, computers need to communicate Direct link Direct links aren't practical

More information

Network Software Implementations

Network Software Implementations Network Software Implementations Number of computers on the Internet doubling yearly since 1981, nearing 200 million Estimated that more than 600 million people use the Internet Number of bits transmitted

More information

CS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP

CS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP CS 5520/ECE 5590NA: Network Architecture I Spring 2008 Lecture 13: UDP and TCP Most recent lectures discussed mechanisms to make better use of the IP address space, Internet control messages, and layering

More information

Socket Programming for TCP and UDP

Socket Programming for TCP and UDP CSCI4430 Data Communication and Computer Networks Socket Programming for TCP and UDP ZHANG, Mi Jan. 19, 2017 Outline Socket Programming for TCP Introduction What is TCP What is socket TCP socket programming

More information

Network Communication

Network Communication Network Communication Processes communicating Process: program running within a host. q within same host, two processes communicate using inter- process communica6on (defined by OS). q processes in different

More information

Name Student ID Department/Year. Midterm Examination. Introduction to Computer Networks Class#: Fall 2003

Name Student ID Department/Year. Midterm Examination. Introduction to Computer Networks Class#: Fall 2003 Midterm Examination Introduction to Computer Networks Class#: 901 31110 Fall 2003 10:00-12:00 Tuesday November 11, 2003 Prohibited 1. You are not allowed to write down the answers using pencils. Use only

More information

Data Communication & Networks Final Exam (Fall 2008) Page 1 / 13. Course Instructors: Engr. Waleed Ejaz. Marks Obtained Marks

Data Communication & Networks Final Exam (Fall 2008) Page 1 / 13. Course Instructors: Engr. Waleed Ejaz. Marks Obtained Marks Data Communication & Networks Final Exam (Fall 2008) Page 1 / 13 Data Communication & Networks Fall 2008 Semester FINAL Thursday, 4 th December 2008 Total Time: 180 Minutes Total Marks: 100 Roll Number

More information

1.2 The first Internet (i.e., one of the first packet switched networks) was referred to as the ARPANET.

1.2 The first Internet (i.e., one of the first packet switched networks) was referred to as the ARPANET. CPSC 360 Spring 2011 Exam 1 Solutions This exam is closed book, closed notes, closed laptops. You are allowed to have one 8.5x11 sheets of paper with whatever you like written on the front and back. You

More information

Lecture 3: The Transport Layer: UDP and TCP

Lecture 3: The Transport Layer: UDP and TCP Lecture 3: The Transport Layer: UDP and TCP Prof. Shervin Shirmohammadi SITE, University of Ottawa Prof. Shervin Shirmohammadi CEG 4395 3-1 The Transport Layer Provides efficient and robust end-to-end

More information

Agenda. Before we start: Assignment #1. Routing in a wide area network. Protocols more concepts. Internetworking. Congestion control

Agenda. Before we start: Assignment #1. Routing in a wide area network. Protocols more concepts. Internetworking. Congestion control Agenda Last time (Tues) No class Tuesday Jan 30 (Marty at conference) Will be made up Thurs Feb 8 / Fri Feb 9 This time Continue with Networks (chpt 3) Interprocess Communication (chpt 4) 1 st HW/PA out

More information

Lecture 9: Transpor Layer Overview and UDP

Lecture 9: Transpor Layer Overview and UDP Lecture 9: Transpor Layer Overview and UDP COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F Kurose

More information

Lecture (11) OSI layer 4 protocols TCP/UDP protocols

Lecture (11) OSI layer 4 protocols TCP/UDP protocols Lecture (11) OSI layer 4 protocols TCP/UDP protocols Dr. Ahmed M. ElShafee ١ Agenda Introduction Typical Features of OSI Layer 4 Connectionless and Connection Oriented Protocols OSI Layer 4 Common feature:

More information

CS4700/CS5700 Fundamentals of Computer Networks

CS4700/CS5700 Fundamentals of Computer Networks CS4700/CS5700 Fundamentals of Computer Networks Lecture 14: TCP Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang Alan Mislove amislove at ccs.neu.edu Northeastern

More information

MIDTERM EXAMINATION #2 OPERATING SYSTEM CONCEPTS U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E

MIDTERM EXAMINATION #2 OPERATING SYSTEM CONCEPTS U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E MIDTERM EXAMINATION #2 OPERATING SYSTEM CONCEPTS 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Intersession 2008 Last Name: First Name: Student ID: PLEASE

More information

CSE 461 The Transport Layer

CSE 461 The Transport Layer CSE 461 The Transport Layer The Transport Layer Focus How do we (reliably) connect processes? This is the transport layer Topics Naming end points UDP: unreliable transport TCP: reliable transport Connection

More information

Context. Distributed Systems: Sockets Programming. Alberto Bosio, Associate Professor UM Microelectronic Departement

Context. Distributed Systems: Sockets Programming. Alberto Bosio, Associate Professor UM Microelectronic Departement Distributed Systems: Sockets Programming Alberto Bosio, Associate Professor UM Microelectronic Departement bosio@lirmm.fr Context Computer Network hosts, routers, communication channels Hosts run applications

More information

The Fundamentals. Port Assignments. Common Protocols. Data Encapsulation. Protocol Communication. Tevfik Ko!ar

The Fundamentals. Port Assignments. Common Protocols. Data Encapsulation. Protocol Communication. Tevfik Ko!ar CSC 4304 - Systems Programming Fall 2008 Lecture - XXII Network Programming Tevfik Ko!ar Louisiana State University December 2 nd, 2008 1 The Fundamentals The Computer Systems Research Group (CSRG) at

More information

EE-311 Data Communication & Networks

EE-311 Data Communication & Networks National University of Computer & Emerging Sciences, Islamabad, Pakistan Name: Roll No: EE-311 Data Communication & Networks Summer 2007 Final Thursday, 2 nd August 2007 Total Time: 3 Hours Total Marks:

More information

Announcement. Homework 1 due last night, how is that? Will discuss some problems in the lecture next week

Announcement. Homework 1 due last night, how is that? Will discuss some problems in the lecture next week Announcement Homework 1 due last night, how is that? Will discuss some problems in the lecture next week Should have completed at least part II of project 1 Homework 2 will be out next week Review of Previous

More information

ECE 650 Systems Programming & Engineering. Spring 2018

ECE 650 Systems Programming & Engineering. Spring 2018 ECE 650 Systems Programming & Engineering Spring 2018 Networking Transport Layer Tyler Bletsch Duke University Slides are adapted from Brian Rogers (Duke) TCP/IP Model 2 Transport Layer Problem solved:

More information

Simple network applications using sockets (BSD and WinSock) Revision 1 Copyright Clifford Slocombe

Simple network applications using sockets (BSD and WinSock) Revision 1 Copyright Clifford Slocombe Simple network applications using sockets (BSD and WinSock) Revision 1 Copyright 2002 - Clifford Slocombe sockets@slocombe.clara.net COPYRIGHT 2002 - CLIFFORD SLOCOMBE PAGE 1 OF 8 Table of Contents Introduction...3

More information

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START Page 1 of 11 MIDTERM EXAMINATION #1 OCT. 16, 2013 COMPUTER NETWORKS : 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Fall 2013-75 minutes This examination

More information

CS 421: COMPUTER NETWORKS SPRING FINAL May 24, minutes. Name: Student No: TOT

CS 421: COMPUTER NETWORKS SPRING FINAL May 24, minutes. Name: Student No: TOT CS 421: COMPUTER NETWORKS SPRING 2012 FINAL May 24, 2012 150 minutes Name: Student No: Show all your work very clearly. Partial credits will only be given if you carefully state your answer with a reasonable

More information

Department of Computer Science

Department of Computer Science Department of Computer Science Notes on Interprocess Communication in Unix Jean Dollimore,Oct.1990, last revised Feb. 1996 These notes explain how you can write "distributed programs" in C or C++ running

More information

Review. Preview. Closing a TCP Connection. Closing a TCP Connection. Port Numbers 11/27/2017. Packet Exchange for TCP Connection

Review. Preview. Closing a TCP Connection. Closing a TCP Connection. Port Numbers 11/27/2017. Packet Exchange for TCP Connection Review Preview Algorithms and Issues in Client Software Design Client Architecture Identifying the Location of a Parsing an Address Argument Looking Up a Domain Name Looking Up a Well-Known Port by Name

More information

(Refer Slide Time: 1:09)

(Refer Slide Time: 1:09) Computer Networks Prof. S. Ghosh Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecturer # 30 UDP and Client Server Good day, today we will start our discussion

More information

Connectionless and Connection-Oriented Protocols OSI Layer 4 Common feature: Multiplexing Using. The Transmission Control Protocol (TCP)

Connectionless and Connection-Oriented Protocols OSI Layer 4 Common feature: Multiplexing Using. The Transmission Control Protocol (TCP) Lecture (07) OSI layer 4 protocols TCP/UDP protocols By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU Fall2014, Computer Networks II Introduction Most data-link protocols notice errors then discard frames

More information

ECE 435 Network Engineering Lecture 2

ECE 435 Network Engineering Lecture 2 ECE 435 Network Engineering Lecture 2 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 31 August 2017 Announcements Homework 1 will be posted. Will be on website, will announce

More information

NETWORK PROGRAMMING. Instructor: Junaid Tariq, Lecturer, Department of Computer Science

NETWORK PROGRAMMING. Instructor: Junaid Tariq, Lecturer, Department of Computer Science NETWORK PROGRAMMING CSC- 341 Instructor: Junaid Tariq, Lecturer, Department of Computer Science 6 Lecture CHAPTER 2: THE TRANSPORT LAYER : TCP AND UDP Contents Introduction UDP: User Datagram Protocol

More information

CSE 422 Jeopardy. Sockets TCP/UDP IP Routing Link $100 $200 $300 $400. Sockets - $100

CSE 422 Jeopardy. Sockets TCP/UDP IP Routing Link $100 $200 $300 $400. Sockets - $100 CSE 422 Jeopardy Sockets TCP/UDP IP Routing Link $100 $100 $100 $100 $100 $200 $200 $200 $200 $200 $300 $300 $300 $300 $300 $400 $400 $400 $400 $400 $500 $500 $500 $500 $500 Sockets - $100 True or False:

More information

Chapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet

Chapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet Chapter 2 - Part 1 The TCP/IP Protocol: The Language of the Internet Protocols A protocol is a language or set of rules that two or more computers use to communicate 2 Protocol Analogy: Phone Call Parties

More information

===================================================================== Exercises =====================================================================

===================================================================== Exercises ===================================================================== ===================================================================== Exercises ===================================================================== 1 Chapter 1 1) Design and describe an application-level

More information

Elementary TCP Sockets

Elementary TCP Sockets Elementary TCP Sockets Chapter 4 UNIX Network Programming Vol. 1, Second Ed. Stevens Distributed Computer Systems 1 socket interface Application 1 Application 2 socket interface user kernel user kernel

More information

CS457 Transport Protocols. CS 457 Fall 2014

CS457 Transport Protocols. CS 457 Fall 2014 CS457 Transport Protocols CS 457 Fall 2014 Topics Principles underlying transport-layer services Demultiplexing Detecting corruption Reliable delivery Flow control Transport-layer protocols User Datagram

More information

Lab 0. Yvan Petillot. Networks - Lab 0 1

Lab 0. Yvan Petillot. Networks - Lab 0 1 Lab 0 Yvan Petillot Networks - Lab 0 1 What You Will Do In This Lab. The purpose of this lab is to help you become familiar with the UNIX/LINUX on the lab network. This means being able to do editing,

More information

The TCP Protocol Stack

The TCP Protocol Stack The TCP Protocol Stack Michael Brockway February 16, 2018 Introduction - Layered archtecture Networking software is desgined in a layered fashion The bottom layer is the services offered by the underlying

More information

The Berkeley Sockets API. Networked Systems Architecture 3 Lecture 4

The Berkeley Sockets API. Networked Systems Architecture 3 Lecture 4 The Berkeley Sockets API Networked Systems Architecture 3 Lecture 4 The Berkeley Sockets API Widely used low-level C networking API First introduced in 4.3BSD Unix Now available on most platforms: Linux,

More information

CCNA 1 Chapter 7 v5.0 Exam Answers 2013

CCNA 1 Chapter 7 v5.0 Exam Answers 2013 CCNA 1 Chapter 7 v5.0 Exam Answers 2013 1 A PC is downloading a large file from a server. The TCP window is 1000 bytes. The server is sending the file using 100-byte segments. How many segments will the

More information

SC/CSE 3213 Winter Sebastian Magierowski York University CSE 3213, W13 L8: TCP/IP. Outline. Forwarding over network and data link layers

SC/CSE 3213 Winter Sebastian Magierowski York University CSE 3213, W13 L8: TCP/IP. Outline. Forwarding over network and data link layers SC/CSE 3213 Winter 2013 L8: TCP/IP Overview Sebastian Magierowski York University 1 Outline TCP/IP Reference Model A set of protocols for internetworking The basis of the modern IP Datagram Exchange Examples

More information

Hybrid of client-server and P2P. Pure P2P Architecture. App-layer Protocols. Communicating Processes. Transport Service Requirements

Hybrid of client-server and P2P. Pure P2P Architecture. App-layer Protocols. Communicating Processes. Transport Service Requirements Announcements CS 5565 Network Architecture and Protocols Lecture 5 Godmar Back Problem Set 1 due Feb 17 Project 1 handed out shortly 2 Layer The Layer Let s look at some s (in keeping with top-down) architectures:

More information

Sockets. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

Sockets. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University Sockets Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Internet Connections (1) Connection Clients and servers communicate by sending streams of

More information

Da t e: August 2 0 th a t 9: :00 SOLUTIONS

Da t e: August 2 0 th a t 9: :00 SOLUTIONS Interne t working, Examina tion 2G1 3 0 5 Da t e: August 2 0 th 2 0 0 3 a t 9: 0 0 1 3:00 SOLUTIONS 1. General (5p) a) Place each of the following protocols in the correct TCP/IP layer (Application, Transport,

More information

MSc Integrated Electronics Networks Assignment. Investigation of TCP/IP Sockets and Ports. Gavin Cameron

MSc Integrated Electronics Networks Assignment. Investigation of TCP/IP Sockets and Ports. Gavin Cameron MSc Integrated Electronics Networks Assignment Investigation of TCP/IP Sockets and Ports Gavin Cameron Introduction TCP and IP (Transmission Control Protocol / Internet Protocol) are two protocols from

More information

5105: BHARATHIDASAN ENGINEERING COLLEGE NATTARMPALLI UNIT I FUNDAMENTALS AND LINK LAYER PART A

5105: BHARATHIDASAN ENGINEERING COLLEGE NATTARMPALLI UNIT I FUNDAMENTALS AND LINK LAYER PART A 5105: BHARATHIDASAN ENGINEERING COLLEGE NATTARMPALLI 635 854. NAME OF THE STAFF : R.ANBARASAN DESIGNATION & DEPARTMENT : AP/CSE SUBJECT CODE : CS 6551 SUBJECT NAME : COMPUTER NETWORKS UNIT I FUNDAMENTALS

More information

Internet Applications and the Application Layer Material from Kurose and Ross, Chapter 2: The Application Layer

Internet Applications and the Application Layer Material from Kurose and Ross, Chapter 2: The Application Layer Midterm Study Sheet Below is a list of topics that will be covered on the midterm exam. Some topics may have summaries to clarify the coverage of the topic during the lecture. Disclaimer: the list may

More information

Computer Networks. Homework #4: No Grading

Computer Networks. Homework #4: No Grading Computer Networks Homework #4: No Grading Problem #1. Assume you need to write and test a client-server application program on two hosts you have at home. a. What is the range of port numbers you would

More information

14-740: Fundamentals of Computer and Telecommunication Networks

14-740: Fundamentals of Computer and Telecommunication Networks 14-740: Fundamentals of Computer and Telecommunication Networks Fall 2018 Quiz #2 Duration: 75 minutes ANSWER KEY Name: Andrew ID: Important: Each question is to be answered in the space provided. Material

More information

Data and Computer Communications. Tenth Edition by William Stallings

Data and Computer Communications. Tenth Edition by William Stallings Data and Computer Communications Tenth Edition by William Stallings Data and Computer Communications, Tenth Edition by William Stallings, (c) Pearson Education - Prentice Hall, 2013 CHAPTER 2 Protocol

More information

Hyo-bong Son Computer Systems Laboratory Sungkyunkwan University

Hyo-bong Son Computer Systems Laboratory Sungkyunkwan University Sockets Hyo-bong Son (proshb@csl.skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Client-Server Model Most network application is based on the client-server model: A server

More information

TCP /IP Fundamentals Mr. Cantu

TCP /IP Fundamentals Mr. Cantu TCP /IP Fundamentals Mr. Cantu OSI Model and TCP/IP Model Comparison TCP / IP Protocols (Application Layer) The TCP/IP subprotocols listed in this layer are services that support a number of network functions:

More information

Example questions for the Final Exam, part A

Example questions for the Final Exam, part A ETSF10, ETSF05 Ht 2010 Example questions for the Final Exam, part A 1. In AdHoc routing there are two main strategies, reactive and proactive routing. Describe in a small number of words the concept of

More information

Computer Networks. 5th of February, This exam consists of 6 questions with subquestions. Every subquestion counts for 10 points.

Computer Networks. 5th of February, This exam consists of 6 questions with subquestions. Every subquestion counts for 10 points. Computer Networks 5th of February, 05 This exam consists of 6 questions with subquestions. Every subquestion counts for 0 points. Mark every page with name and student number. Use of books, additional

More information

Transport Layer. Gursharan Singh Tatla. Upendra Sharma. 1

Transport Layer. Gursharan Singh Tatla.   Upendra Sharma. 1 Transport Layer Gursharan Singh Tatla mailme@gursharansingh.in Upendra Sharma 1 Introduction The transport layer is the fourth layer from the bottom in the OSI reference model. It is responsible for message

More information

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START Page 1 of 11 MIDTERM EXAMINATION #1 OCT. 13, 2011 COMPUTER NETWORKS : 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Fall 2011-75 minutes This examination

More information

EITF25 Internet Techniques and Applications L7: Internet. Stefan Höst

EITF25 Internet Techniques and Applications L7: Internet. Stefan Höst EITF25 Internet Techniques and Applications L7: Internet Stefan Höst What is Internet? Internet consists of a number of networks that exchange data according to traffic agreements. All networks in Internet

More information

Networks Fall This exam consists of 10 problems on the following 13 pages.

Networks Fall This exam consists of 10 problems on the following 13 pages. CSCI 466 Final Networks Fall 2011 Name: This exam consists of 10 problems on the following 13 pages. You may use your two- sided hand- written 8 ½ x 11 note sheet during the exam and a calculator. No other

More information

A Client-Server Exchange

A Client-Server Exchange Socket programming A Client-Server Exchange A server process and one or more client processes Server manages some resource. Server provides service by manipulating resource for clients. 1. Client sends

More information

Connections. Topics. Focus. Presentation Session. Application. Data Link. Transport. Physical. Network

Connections. Topics. Focus. Presentation Session. Application. Data Link. Transport. Physical. Network Connections Focus How do we connect processes? This is the transport layer Topics Naming processes Connection setup / teardown Flow control Application Presentation Session Transport Network Data Link

More information