Consider a network in which for any two nodes directly connected with a link, a message either reaches its destination within T time or gets lost. (a)

Slides:

Advertisements

Similar presentations

CSE 413: Computer Networks

Advertisements

Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.

Answers of Exercise 7 1. Explain what are the connection-oriented communication and the connectionless communication. Give some examples for each of the.

(4.4) Internet Protocols Layered approach to Internet Software 1.

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)

James 1:5 If any of you lacks wisdom, he should ask God, who gives generously to all without finding fault, and it will be given to him.

EE 4272Spring, 2003 Chapter 10 Packet Switching Packet Switching Principles  Switching Techniques  Packet Size  Comparison of Circuit Switching & Packet.

Wide Area Networks School of Business Eastern Illinois University © Abdou Illia, Spring 2007 (Week 11, Thursday 3/22/2007)

Lecture 2 Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit.

Oct 21, 2004CS573: Network Protocols and Standards1 IP: Addressing, ARP, Routing Network Protocols and Standards Autumn

EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering.

EEC 688/788 Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University

ACN: Congestion Control1 Congestion Control and Resource Allocation.

1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.

CS335 Networking & Network Administration Tuesday, April 20, 2010.

1 CCNA 2 v3.1 Module Intermediate TCP/IP CCNA 2 Module 10.

Each computer and router interface maintains an ARP table for Layer 2 communication The ARP table is only effective for the broadcast domain (or LAN)

Lect3..ppt - 09/12/04 CIS 4100 Systems Performance and Evaluation Lecture 3 by Zornitza Genova Prodanoff.

1 Transport Layer Computer Networks. 2 Where are we?

CIS 725 Wireless networks. Low bandwidth High error rates.

Introduction 1-1 Lecture 3 Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 CS3516: These slides.

Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,

Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.

1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.

A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks By Kiana Karimpour.

Data Comm. & Networks Instructor: Ibrahim Tariq Lecture 3.

Brierley 1 Module 4 Module 4 Introduction to LAN Switching.

جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.

© 2002, Cisco Systems, Inc. All rights reserved..

CONGESTION CONTROL and RESOURCE ALLOCATION. Definition Resource Allocation : Process by which network elements try to meet the competing demands that.

Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.

1 Flow Identification Assume you want to guarantee some type of quality of service (minimum bandwidth, maximum end-to-end delay) to a user Before you do.

TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.

 Circuit Switching  Packet Switching  Message Switching WCB/McGraw-Hill  The McGraw-Hill Companies, Inc., 1998.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.

Overview of computer communication and Networking Communication VS transmission Computer Network Types of networks Network Needs Standards.

COP 4930 Computer Network Projects Summer C 2004 Prof. Roy B. Levow Lecture 3.

1 Week 5 Lecture 2 IP Layer. 2 Network layer functions transport packet from sending to receiving hosts transport packet from sending to receiving hosts.

CS 164: Slide Set 2: Chapter 1 -- Introduction (continued).

Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.

Computer Security Workshops Networking 101. Reasons To Know Networking In Regard to Computer Security To understand the flow of information on the Internet.

Service time evaluation (transfer) for a message sent over a LAN through TCP protocol Network Routers service time.

1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 4 Switching Concepts.

COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM.

Networking Fundamentals. Basics Network – collection of nodes and links that cooperate for communication Nodes – computer systems –Internal (routers,

Network Security7-1 Today r Reminder Ch7 HW due Wed r Finish Chapter 7 (Security) r Start Chapter 8 (Network Management)

Chapter 24 Transport Control Protocol (TCP) Layer 4 protocol Responsible for reliable end-to-end transmission Provides illusion of reliable network to.

CSE 461 University of Washington1 Topic How do we connect nodes with a switch instead of multiple access – Uses multiple links/wires – Basis of modern.

Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.

Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.

 2004 Deitel & Associates, Inc. All rights reserved. Chapter 16 – Networking Outline 16.1Introduction 16.2Network Topology 16.3Network Types 16.4TCP/IP.

Midterm Review Chapter 1: Introduction Chapter 2: Application Layer

1 Version 3.1 Module 10 Intermediate TCP/IP (Layer 4)

© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.

CIS 825 Review session. P1: Assume that processes are arranged in a ring topology. Consider the following modification of the Lamport’s mutual exclusion.

© 2002, Cisco Systems, Inc. All rights reserved..

2005/12/14 1 Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Xin Yu Department of Computer Science.

Day 13 Intro to MANs and WANs. MANs Cover a larger distance than LANs –Typically multiple buildings, office park Usually in the shape of a ring –Typically.

11.1 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

1. Layered Architecture of Communication Networks: Circuit Switching & Packet Switching.

CSEN 404 Introduction to Networks Amr El Mougy Lamia AlBadrawy.

IP: Addressing, ARP, Routing

Chapter 16 – Networking Outline 16.1 Introduction

The Transport Layer (TCP)

Chapter 6: Transport Layer (Part I)

Transport Layer Unit 5.

Chapter 9 Introduction To Data-Link Layer 9.# 1

Distributed Systems CS

Congestion Control Reasons:

Distributed Systems CS

Presentation transcript:

Consider a network in which for any two nodes directly connected with a link, a message either reaches its destination within T time or gets lost. (a) Give an efficient handshake protocol for connection establishment for this network between two nodes which are directly connected to each other. (b) Discuss the problems which may arise to the protocol in (a) if the two nodes are not directly connected to each other.

Consider the arrangement of hosts shown in the Figure. All links are full-duplex, can transmit up to 2Mbps, and all routers are faster and all routers are faster than their links. A wants to send data to D at rate 1Mpbs and E wants to send data to F at rate 2Mbps. What is the throughput for A and E (how much data can they transfer per sec) under the following conditions: (a) The congestion control policy at B employs a single input queue for data coming from both A and E and forwards using the FIFO discipline. (b) The congestion control policy at B employs separate input queues of equal size for A and E and forwards using round robin. Give reasons for your answers.

Consider the case where A is connected to B via a wired link and B is connected to C via a wireless link. The bandwidth of the link from A to B is 10 6 bytes/sec and for the link from B to C is 10 5 bytes/sec. The round trip delay is 1sec from A to B and 5 secs from B to C. Assume that A needs to send data to C using B as an intermediate hop. If a standard sliding window protocol is used from A to C, what would be the type of protocol used? If a split-TCP approach is used, what would be the types of protocol used.

Assume that you have a set of 4 nodes, A, B, C and D arranged in a ring with A as the requester and B, C and D as responder. The execution proceeds in a sequence of iteration. In each iteration, A asks a question which is to be sent in the clockwise direction in the ring to all responders. On receiving this question, each responder send a response message back to A (which is again sent in the clockwise direction). After receiving all of the responses, A proceeds with the next iteration by asking the next question. You need to design a protocol stack to support this application. Describe the data link layer and routing protocol in sufficient detail for this protocol stack (e.g., type of sliding window protocol, window size, routing strategy). The protocols must be efficient in terms of minimizing the execution/response time.

Consider the following protocol for public key distribution. There exists a central authority, CA, whose public key is known to everyone. If Bob wants to obtain Alice’s public key, it sends a message containing the tuple,. to CA, where R is a random number, asking for Alice’s public key. In response, (a) CA sends the message containing the pair,. Is it possible to Trudy to attack this protocol and provide Bob with her public key instead of Alice’s public key? (b) CA sends a the message. Is it possible to Trudy to attack this protocol and provide Bob with her public key instead of Alice’s public key?