Tutorial 1.

Slides:



Advertisements
Similar presentations
Replication. Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.
Advertisements

Consistency and Replication Chapter 7 Part II Replica Management & Consistency Protocols.
Distributed Systems Fall 2010 Replication Fall 20105DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Chapter 6 Errors, Error Detection, and Error Control.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
1 Fibre Distributed Data Interface 100Mbps –1986 ANSI - X3T9.5 committee –Supports IEEE Access Methodology = Modified token-passing Logical topology.
Analysis of Web Caching Architectures: Hierarchical and Distributed Caching Pablo Rodriguez, Christian Spanner, and Ernst W. Biersack IEEE/ACM TRANSACTIONS.
Distributed Systems Fall 2009 Replication Fall 20095DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Calculating “a”. a Used as a term in analyzing many network characteristics Has a physical interpretation Represents the number of frames on a link.
1 Internet Management and Security We will look at management and security of networks and systems. Systems: The end nodes of the Internet Network: The.
Chapter 3 Data and Signals
Lesson 1: Configuring Network Load Balancing
1 ENHANCHING THE WEB’S INFRASTUCTURE: FROM CACHING TO REPLICATION ECE 7995 Presented By: Pooja Swami and Usha Parashetti.
Chapter 3 part II Data and Signals
1 Chapter Overview Creating Sites and Subnets Configuring Intersite Replication Troubleshooting Active Directory Replication.
Basic Concepts of Computer Networks
Chapter 4.  Understand network connectivity.  Peer-to-Peer network & Client-Server network  Understand network topology  Star, Bus & Ring topology.
3.1 Figure 3.16 Two digital signals: one with two signal levels and the other with four signal levels.
Part 2 Physical Layer and Media
Network Design Essentials
1 Cache Me If You Can. NUS.SOC.CS5248 OOI WEI TSANG 2 You Are Here Network Encoder Sender Middlebox Receiver Decoder.
All the components of network are connected to the central device called “hub” which may be a hub, a router or a switch. There is no direct traffic between.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Computing Infrastructure for Large Ecommerce Systems -- based on material written by Jacob Lindeman.
Understanding the Performance of Web Caching System with an Analysis Model and Simulation Xiaosong Hu Nur Zincir-Heywood Sep
Lecture 35: Chapter 6 Today’s topic –I/O Overview 1.
UNIT -1. DATA COMMUNICATIONS The term telecommunication means communication at a distance. The word data refers to information presented in whatever form.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 7.
Cisco 3 - Switching Perrine. J Page 16/4/2016 Chapter 4 Switches The performance of shared-medium Ethernet is affected by several factors: data frame broadcast.
Replication (1). Topics r Why Replication? r System Model r Consistency Models – How do we reason about the consistency of the “global state”? m Data-centric.
COSC 3330/6308 Solutions to the Third Problem Set Jehan-François Pâris November 2012.
Chapter 3 Data and Signals. 3.2 Last Lecturer Summary Bit Rate Bit Length Digital Signal as a Composite Analog Signal Application Layer Distortion Noise.
Fault Tolerant Services
Replication (1). Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.
Lecture Focus: Data Communications and Networking  Transmission Impairment Lecture 14 CSCS 311.
Prepared by:Ronnel P. Agulto, CpE Objectives Different types of topologies; Their advantages & disadvantages How to choose an appropriate topologies in.
1 COMP 431 Internet Services & Protocols HTTP Persistence & Web Caching Jasleen Kaur February 11, 2016.
Chapter 2 : Data Communications BENG 4522 Data Communications & Computer Networks Transmission Impairment Signals travel through the transmission.
Chapter 3 TRANSMISSION IMPAIRMENT. 3-4 TRANSMISSION IMPAIRMENT Signals travel through transmission media, which are not perfect. The imperfection causes.
PERFORMANCE MANAGEMENT IMPROVING PERFORMANCE TECHNIQUES Network management system 1.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 8 TCP/IP Suite Error and Control Messages.
INTRODUCTION TO COMPUTER NETWORKS BY: SAIKUMAR III MSCS, Nalanda College.
Reliable multicast Tolerates process crashes. The additional requirements are: Only correct processes will receive multicasts from all correct processes.
Computer Communication & Networks
Network management system
Part II Physical Layer.
Computer Data Communication
Department of Computer Science University of Calgary
Exploring the Functions of Networking
PART II Physical Layer.
70-293: MCSE Guide to Planning a Microsoft Windows Server 2003 Network, Enhanced Chapter 6: Planning, Configuring, And Troubleshooting WINS.
Cluster Communications
A Technical Overview of Microsoft® SQL Server™ 2005 High Availability Beta 2 Matthew Stephen IT Pro Evangelist (SQL Server)
PRESENTATION ON Sky X TECH. SUBMETTED TO:- SUBMETTED BY:-
2 Basic Concepts: data and computer networking
Distributed Systems CS
COP 5611 Operating Systems Fall 2011
Distributed P2P File System
COP 5611 Operating Systems Spring 2010
Slides for Chapter 15: Replication
Propagation & Transmission delay
Sample Network Performance Problems
by Mikael Bjerga & Arne Lange
Slides for Chapter 18: Replication
Overview Multimedia: The Role of WINS in the Network Infrastructure
Tutorial 1.
Chapter 2: Basic Concepts
Sample Network Performance Problems
Network management system
Host and Small Network Relaying Howard C. Berkowitz
Presentation transcript:

Tutorial 1

Q1 1- A company has an internet address 172.30.12.192/22 and want to divide this block of addresses to 8 equal blocks ( subnets). 172.30.12.192/22 172.30.00001100.11000000

In the subnetting, the number of bits added to the mask could be calculated as: #of bits = log2 ( #of subnets) = log2 ( 8) = 3 172.30.00001100.11000000

Subnet1 172.30.00001100.00000000 172.30.12.0/25 27= 256 Subnet2 172.30.00001100.10000000 172.30.12.128/25 Subnet3 172.30.00001101.00000000 172.30.13.0/25 Subnet4 172.30.00001101.10000000 172.30.13.128/25 Subnet5 172.30.00001110.00000000 172.30.14.0/25 Subnet6 172.30.00001110.10000000 172.30.14.128/25 Subnet7 172.30.00001111.00000000 172.30.15.0/25 Subnet8 172.30.00001111.10000000 172.30.15.128/25

Q2 2-Channel with BW = 3 Mbps Calculate the utilization in a go-back-in protocol(with window size =31 ) with a 10KByte packet. Utilization=(total data in bits/bandwidth) *100 =((31*10*1000*8)/3*1000000)*100

How could you increase the utilization in this system By increasing the packet size or increasing the window size or both

Q3 3-In a ring topology : What is the difference between ring and dual ring if one of the links damaged ? Damage in ring topology stops the entire network Link damage in dual ring redirects the traffic in to the opposite side

Show the fault management steps in ring topology? Detecting the damaged link Isolating the fault by removing the damaged link and reconnect the rest of network Correcting the fault by replacing the link and reconnect the network Documenting the fault

Q4 4- A component with a MTBF of 8 days and a MTTR of 3 hours . Calculate the availability. Availability = MTBF / (MTBF + MTTR) = 8*24/(8*24+3) MTBF= mean time between failures MTBF= MTTF+MTTR MTTR Mean time to repair MTTF mean time to failure

How could you increase the availability. prove that How could you increase the availability ?prove that. By decreasing the MTTR

5- Calculate the channel capacity if the Bandwidth is 5KHz and the SNR is 100 and find Two different ways to increase the capacity. C=B * log(1+SNR) =5*1000 log(1+100) bps SNR signal to noise ratio (compared the level of desired signal to the level of background noise)

Q6 6- What is the transmission time if the distance between the two points is 24,000 km, the propagation speed is 2.4 × 108 m/s, queuing time and processing time is zero and latency is 1s? Latency = propagation time + transmission time+ queuing time + processing time Propagation time = distance/propagation speed Transmission time=packet size/ BW propagation time وقت النشر amount of time takes for the head of signal to travel from sender to reciver

7- A system with 5 replica managers : Draw the system if an active replication is applied? Draw the system if a passive replication is applied? Calculate the availability if there is 7% probability of a replica manager failure. Calculate the availability if we use just a single server. Replication is used to provide fault tolerance Active replication :each client request is processed by all servers Passive replication : only one server(called primary) process client request after processing request the primary update the state on the other backup servers and and send back respond to the client

Draw the system if an active replication is applied? RM FE C RM FE means Front ends ===When data is replicated it should be done in a transparent manner: the client should not normally be aware that multiple physical copies of the data exist, either in terms of submitted requests or returned values. This is achieved by interposing a front end between the client and the service. RM

Draw the system if a passive replication is applied? FE C RM Primary Backup RM RM

Calculate the availability if there is 7% probability of a replica manager failure. A=1-Probability(all managers failed or unreachable)=1-pn P=0.07 N=5 A= 1-pn = 1-(0.07)5 =1-0.0000016807=0.999=99.9%

Calculate the availability if we use just a single server. P=0.07 N=1 A=1-Probability(all managers failed or unreachable)=1-pn P=0.07 N=1 A= 1-pn = 1-(0.07)1 =0.93=93%

8- If the time required to open a certain page from the browser cache is 500ms , proxy cache is 2555ms and web server cache is 5000ms fill in the table below Action The proximate time required PC1 requests the page for the first time 5000ms PC2 requests the page for the first time 2555ms PC1 requests the page for the second time 500ms PC2 requests the page for the second time

2- If the time required to open a certain page from the browser cache is 500ms , proxy cache is 2555ms and web server cache is 5000ms fill in the table below