New User Special Price Expires in

Let's log you in.

Sign in with Facebook


Don't have a StudySoup account? Create one here!


Create a StudySoup account

Be part of our community, it's free to join!

Sign up with Facebook


Create your account
By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here

Metamaterials & Adv Ant Theory

by: Shyanne Lubowitz

Metamaterials & Adv Ant Theory ECE 6962

Shyanne Lubowitz
The U
GPA 3.85


Almost Ready


These notes were just uploaded, and will be ready to view shortly.

Purchase these notes here, or revisit this page.

Either way, we'll remind you when they're ready :)

Preview These Notes for FREE

Get a free preview of these Notes, just enter your email below.

Unlock Preview
Unlock Preview

Preview these materials now for free

Why put in your email? Get access to more of this material and other relevant free materials for your school

View Preview

About this Document

Class Notes
25 ?




Popular in Course


This 3 page Class Notes was uploaded by Shyanne Lubowitz on Monday October 26, 2015. The Class Notes belongs to ECE 6962 at University of Utah taught by Staff in Fall. Since its upload, it has received 37 views. For similar materials see /class/230011/ece-6962-university-of-utah in ELECTRICAL AND COMPUTER ENGINEERING at University of Utah.

Similar to ECE 6962 at The U



Reviews for Metamaterials & Adv Ant Theory


Report this Material


What is Karma?


Karma is the currency of StudySoup.

You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 10/26/15
ECE 6962003 queue size and queuing delay revisited 1 Introduction this document we review the behavior of an MMl queuing system as shown in Figure 1 In the MMl model one assumes that the packet arrivals into the queue as well as the departures out of the queue are random and occur with exponentially distributed interarrival timesl Therefore in any xed time interval the number of packets arrivals as well as packet departures is Poisson We further assume that ackets are serviced on a rstcome rstserve basis and that the system is in steady state We address queue sizes as well as queuing delays 1 v oru Figure 1 Queuing system with 3 packets in queue 2 Number of packets in the queue For the discussion on queuing systems the book uses the term quottmf c intensity I I 11L 1 R where L is the packet size R is the link speed and a is the offered load in packetssecond Note that is de ned to lie between 0 and 1 In the case of11 there are exactly as many packets arriving per unit of time say 1 second as can be serviced in that same unit of time say 1 second In other words since IaJR and according to the above de nition a is lower bounded by 0 and upper bounded by RL Clearly to know what values of a make sense for a given queuing system we need to know the packet size L and the link speed R The de nition of A is similar but also much more general at the same time Under the assumption of a certain arrival and service process the only relevant parameters to merely scalars that affect the shape of the delay curve not its geneml form Just like in the de nition of I we can now de ne an quotarrival mtequot Ian into the queue which lies between 0 and the rate out of the queue service rate Am Again we are not interested in In this notation the rst letter refers to the arrival process the second one to the departure process and the number equals the number of servers that service the queue Hence MMl stands for a Markovian input processMarkovian output process1 server queue Page 1 of3 ECE 6962003 queue size and queuing delay revisited values of km gt Am since they are guaranteed to cause in nite delay In the next step we can further simplify our de nition by expressing NH in terms of km such that Am lies in between Aquot LO and Aquot l 0M out On a side note whenever traf c is modeled with exponentially distributed interarrival times typically 9 not I is used for the performance evaluation of queuing systems and channel accessing techniques However you will nd all kinds of notations for example the utilization factor I as used in the hyperlink below Even if the variables have different names they all mean the same thing and lie between 0 and I From the derivation of the NUlVUl queue we are left with the nding that the average number of packets n in the queue follows from the average of the geometric distribution and can be expressed purely in terms of km according to aL A I 3 n m 77 2 1 tm 1 1 bag 0 You can nd the mathematical details that lead to this result at httpwwwmcsvuwacnzvignauddocsmmlhtmltth7sEc2 Note that I do not expect you to know the derivation In Figure 2 we compare simulation results of n to Eq 2 as a function of NH The following observations are made 39 The mean number of packets n in the system is greater than 0 even if the load measured by Mn is small 39 The mean number of packets n in the system tends to in nity as NH tends to 1 even though the service rate hm is still greater than the arrival rate kin quot theoretical value Figure 2 Simulation versus theoretical results of the queue size n as a function of km for an NUlVUl queuing system Page 2 of 3 ECE 6962003 queue size and queuing delay revisited 3 Queuing delay as a function of the offered load To nd the queuing delay that the packets have to face as a function of the offered load we can multiply n by the transmission speed LR out of the queue and the queuing delay dqueue follows immediately as d MEME 2 E q 1 Al R respectively aL LJE K E queue 1 I R 1 R R Page 3 of 3


Buy Material

Are you sure you want to buy this material for

25 Karma

Buy Material

BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.


You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

Why people love StudySoup

Bentley McCaw University of Florida

"I was shooting for a perfect 4.0 GPA this semester. Having StudySoup as a study aid was critical to helping me achieve my goal...and I nailed it!"

Amaris Trozzo George Washington University

"I made $350 in just two days after posting my first study guide."

Steve Martinelli UC Los Angeles

"There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."


"Their 'Elite Notetakers' are making over $1,200/month in sales by creating high quality content that helps their classmates in a time of need."

Become an Elite Notetaker and start selling your notes online!

Refund Policy


All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email


StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here:

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.