1 Evaluation of applications over an intranet. 2 FDDI 100 Mbps Lan 5 R1 R3 R2 R4 Lan 1 10 Mbps Eth Lan 2 10 Mbps Eth Lan 3 10 Mbps Eth Lan 4 16 Mbps TR.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
EE:450 – Computer Networks
EuroCondens SGB E.
Feichter_DPG-SYKL03_Bild-01. Feichter_DPG-SYKL03_Bild-02.
Supplemental Web Fig. 2 mos10/mos10, grown on 100 mm plate SLAS27 medium, day 1.
Chapter 1 The Study of Body Function Image PowerPoint
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 38.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Chapter 1 Image Slides Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING Think Distributive property backwards Work down, Show all steps ax + ay = a(x + y)
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
Learning to show the remainder
£1 Million £500,000 £250,000 £125,000 £64,000 £32,000 £16,000 £8,000 £4,000 £2,000 £1,000 £500 £300 £200 £100 Welcome.
ZMQS ZMQS
Streaming Video over the Internet
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
1 EE 122: Networks Performance & Modeling Ion Stoica TAs: Junda Liu, DK Moon, David Zats (Materials with thanks.
Break Time Remaining 10:00.
PP Test Review Sections 6-1 to 6-6
ABC Technology Project
ULC: An Unified Placement and Replacement Protocol in Multi-level Storage Systems Song Jiang and Xiaodong Zhang College of William and Mary.
1 Sizing the Streaming Media Cluster Solution for a Given Workload Lucy Cherkasova and Wenting Tang HPLabs.
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
© S Haughton more than 3?
15. Oktober Oktober Oktober 2012.
Twenty Questions Subject: Twenty Questions
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
Squares and Square Root WALK. Solve each problem REVIEW:
We are learning how to read the 24 hour clock
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
: 3 00.
5 minutes.
Week 1.
We will resume in: 25 Minutes.
Clock will move after 1 minute
A SMALL TRUTH TO MAKE LIFE 100%
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
Select a time to count down from the clock above
Ó 1998 Menascé & Almeida. All Rights Reserved.1 Part IV Capacity Planning Methodology.
1 Part IV Capacity Planning Methodology © 1998 Menascé & Almeida. All Rights Reserved.
1 Part II Web Performance Modeling: basic concepts © 1998 Menascé & Almeida. All Rights Reserved.
1 Web Performance Modeling Chapter New Phenomena in the Internet and WWW Self-similarity - a self-similar process looks bursty across several time.
1 Multiple class queueing networks Mean Value Analysis - Open queueing networks - Closed queueing networks.
Service time evaluation (transfer) for a message sent over a LAN through TCP protocol Network Routers service time.
1 Components performance modelling - Outline of queue networks - Mean Value Analisys (MVA) for open and close queue networks.
1 Part VII Component-level Performance Models for the Web © 1998 Menascé & Almeida. All Rights Reserved.
Ó 1998 Menascé & Almeida. All Rights Reserved.1 Part II System Performance Modeling: basic concepts, operational analysis (book, chap. 3)
Ó 1998 Menascé & Almeida. All Rights Reserved.1 Part VIII Web Performance Modeling (Book, Chapter 10)
Presentation transcript:

1 Evaluation of applications over an intranet

2 FDDI 100 Mbps Lan 5 R1 R3 R2 R4 Lan 1 10 Mbps Eth Lan 2 10 Mbps Eth Lan 3 10 Mbps Eth Lan 4 16 Mbps TR File server 4 File server 2 Web server 100 Windows NT clients File server Windows NT clients File server 1 50 Unix Workstation Intranet architecture 100 Windows NT clients

3 Workload analysis Intranet applications (there different classes): 1)Corporate training: web based applicatin 2) Access to local file system

4 Infrastructure hypothesis All file server and web server have a single CPU and a single disk The FDDI and the router are very fast versus the Lan Ethernet, then can be modelled as a simple delay, therefore they are server without queue All the other components can be modelled as queues with service time independent by the load.

5 User hypotheses Finite number of users An user generates a new request, after having received an answer to the previous request, after a time equal to its thinking time 85% of users is working with the local file system 15% of users is working with the Web Server

6 Queueing network Multiclass closed queue model, each class is charaterized by: client group, application, server client group: CLi: clients in Lan i (i: 1 to 4) application: –FS for local file server access, –TR for Training server: –FSi: i-th NFS server (i: 1 to 4) –WebS: Web Server

7 Tipi di classi e numero di utenti (CL1, FS, FS1)120 x 0.85 = 102 (CL2, FS, FS2)50 X 0.85 = 43 (CL3, FS, FS3)100 x 0.85 = 85 (CL4, FS, FS4)100 x 0.85 = 85 (CL1, TR, WebS)120 x 0.15 = 18 (CL2, TR, WebS)50 x 0,15 = 7 (CL3, TR, WebS)100 x 0,15 = 15 (CL4, TR, WebS)100 x 0,15 = 15

8 Server types Routers: low delay, given its low latency FDDI ring: low delay, given high bandwidth CPU Disks servers with load independ service time LANs Service Demands: D i,r = V i,r x S i,r where V i,r = Visit Ratio S i,r = Service Time

9 FDDIR3R1 R4 R2 L2 D D D D C C C C (CL1, Tr, Web) (CL2, Tr, Web) (CL4, Tr, Web) (CL3, FS, Fs3) L1L3 (CL1,TR, Web) (CL1, FS, Fs1) (CL2,TR, Web)(CL2, FS, Fs2) (CL3, TR, Web) (CL1,TR, Web) (CL2,TR, Web) (CL3,TR, Web) (CL4,TR, Web) (CL1, FS, Fs1) QN model Web S

10 Web server workload characterization (for a training session) Avg request document size per HTTP request –20 rqs for txt documents (2.000 bytes per doc) –100 rqs for inline images ( bytes each) (20 text pages x 5 inline/text pages) –15 rqs for other multi-media (mm) obj ( bytes each)

11 Web server workload characterization % request for: –txt documents = 20/( ) = 15 % –inline images = 100/( ) = 74 % –other mm obj = 15/( ) = 11 %

12 Web server workload characterization Average document size 0.15 x x x = = bytes Note it is an average, the overhead associated to the three document sizes is different

13 Web server workload characterization Document request arrival rate is function of the think time and of the number of users in the system (CLi, TR, Web) #Users i think time Max # Users i 18 per Lan 1 7 per Lan 2 15 per Lan 3 15 per Lan 4 45 sec

14 Web server workload characterization Device service time –CPU: 1 msec processing time x HTTP request –Disk: We need to consider Seekrand= avg time to position at a random cylinder DiskRevTIme = time for a complete disk revolution TransferTime = BlockSize/ 10 6 x TransferRate ControllerTime = time spent at the controller for an I/O req. S d = ControllerTime +Pmiss x (SeekRand + DiskRevolutionTime/2+TransferTime)

15 Web server workload characterization Lan hp: no fragmentation i.e. max data area 1500 bytes; hp no data overhead for HTTP request NDatagrams = ServiceTime n = MessageSize + TCPOvhd min n MTU n - IPOvhd Overhead n = TCPOvhd+Ndatagrams x (IPOvhd + FrameOvhd n ) 8 x (MessageSize + Overhead n ) 10 6 x Bandwidth

16 Web server workload characterization Lan hp: no fragmentation i.e. max data area 1500 bytes; hp no data overhead for HTTP request Ethernet NDatagrams = ServiceTime n = Overhead n = 20 + Ndatagrams x ( ) 8 x ( ) 10 6 x Bandwidth

17 Web server workload characterization Lan hp: no fragmentation i.e. max data area 1500 bytes; hp no data overhead for HTTP request Token ring NDatagrams = ServiceTime n = Overhead n = 20 + Ndatagrams x ( ) 8 x ( ) 10 6 x Bandwidth

18 Web server workload characterization Router delay 134 sec x packet (approximated in total to 1 msec) FDDI delay with ServiceTime n = 8 x (MessageSize + Overhead n ) 10 6 x Bandwidth

19 Local file system workload characterization File dimension 8192 bytes avg NFS request arrival rate is function of the think time and number od users in the system (CLi, FS, FSi) #Users i think time Max #Users i 102 per Lan 1 43 per Lan 2 85 per Lan 3 85 per Lan 4 10 sec

20 Local file system workload characterization Device service time –CPU: 1 msec per file request –Disk: We need to consider Seekrand= avg time to position at a random cylinder DiskRevTIme = time for a complete disk revolution TransferTime = BlockSize/ 10 6 x TransferRate ControllerTime = time spent at the controller for an I/O req. N blocks to read = 8192/2048 = 4 –Lan i with 8192 bytes

21 Throughput & response time ClassThroughput Response time (req/sec)(sec) CL1, FS, FS1 10,12 0,08 CL2, FS, FS24,230,06 CL3, FS, FS38,440,08 CL4, FS, FS48,440,07 CL1, TR, WebS0,348,58 CL2, TR, WebS0,148,55 CL3, TR, WebS0,287,96 CL4, TR, WebS0,288,35

22 Throughput & response time Max#Users i response time + think time Throughput =