Online Spectrum Allocation for Cognitive Cellular Network Supporting Scalable Demands Jianfei Wang 2011-5-23.

Slides:

Advertisements

Similar presentations

Waiting Line Management

Advertisements

Introduction to Queuing Theory

IE 429, Parisay, January 2003 Review of Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete, continuous.

DBLA: D ISTRIBUTED B LOCK L EARNING A LGORITHM F OR C HANNEL S ELECTION I N C OGNITIVE R ADIO N ETWORKS Chowdhury Sayeed Hyder Department of Computer Science.

1 ELEN 602 Lecture 8 Review of Last lecture –HDLC, PPP –TDM, FDM Today’s lecture –Wavelength Division Multiplexing –Statistical Multiplexing –Preliminary.

Queueing Model 박희경.

Previously Optimization Probability Review Inventory Models Markov Decision Processes.

Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.

Waiting Lines and Queuing Theory Models

Continuous Probability Distributions Introduction to Business Statistics, 5e Kvanli/Guynes/Pavur (c)2000 South-Western College Publishing.

Decentralized resource management for a distributed continuous media server Cyrus Shahabi and Farnoush Banaei-Kashani IEEE Transactions on Parallel and.

OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.

1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.

Waiting Lines Students should be able to:

Data Communication and Networks Lecture 13 Performance December 9, 2004 Joseph Conron Computer Science Department New York University

Performance Evaluation

Queueing Network Model. Single Class Model Open - Infinite stream of arriving customers Closed - Finite population eg Intranet users Indistinguishable.

1 Multiple class queueing networks Mean Value Analysis - Open queueing networks - Closed queueing networks.

Simulating Single server queuing models. Consider the following sequence of activities that each customer undergoes: 1.Customer arrives 2.Customer waits.

Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.

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.

On G-network and resource allocation in multimedia systems 報告者 : 王敬育.

Chapter 18 Management of Waiting Lines

OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.

Introduction to Queuing Theory. 2 Queuing theory definitions  (Kleinrock) “We study the phenomena of standing, waiting, and serving, and we call this.

Lecture 4 Mathematical and Statistical Models in Simulation.

WINTER 2012IE 368. FACILITY DESIGN AND OPERATIONS MANAGEMENT 1 IE 368: FACILITY DESIGN AND OPERATIONS MANAGEMENT Lecture Notes #3 Production System Design.

Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.

Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.

A bit on Queueing Theory: M/M/1, M/G/1, GI/G/1 Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. (As of Dec 1: Swinburne.

RELIABLE MULTIMEDIA TRANSMISSION OVER COGNITIVE RADIO NETWORKS USING FOUNTAIN CODES Proceedings of the IEEE | Vol. 96, No. 1, January 2008 Harikeshwar.

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

Modeling and Performance Evaluation of Network and Computer Systems Introduction (Chapters 1 and 2) 10/4/2015H.Malekinezhad1.

1 Performance Evaluation of Computer Systems and Networks Introduction, Outlines, Class Policy Instructor: A. Ghasemi Many thanks to Dr. Behzad Akbari.

1 Queuing Analysis Overview What is queuing analysis? - to study how people behave in waiting in line so that we could provide a solution with minimizing.

1 [3] Jorge Martinez-Bauset, David Garcia-Roger, M a Jose Domenech- Benlloch and Vicent Pla, “ Maximizing the capacity of mobile cellular networks with.

Manijeh Keshtgary. Queuing Network: model in which jobs departing from one queue arrive at another queue (or possibly the same queue)  Open and Closed.

Scientific Workflow Scheduling in Computational Grids Report: Wei-Cheng Lee 8th Grid Computing Conference IEEE 2007 – Planning, Reservation,

Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.

Entities and Objects The major components in a model are entities, entity types are implemented as Java classes The active entities have a life of their.

Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.

Modeling and Analysis of Computer Networks

1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.

1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.

Network Design and Analysis-----Wang Wenjie Queuing Theory III: 1 © Graduate University, Chinese academy of Sciences. Network Design and Performance Analysis.

CS352 - Introduction to Queuing Theory Rutgers University.

Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.

Internet Applications: Performance Metrics and performance-related concepts E0397 – Lecture 2 10/8/2010.

1 Forecasting, Planning and Scheduling

(C) J. M. Garrido1 Objects in a Simulation Model There are several objects in a simulation model The activate objects are instances of the classes that.

The Cellular Concept Early Mobile Communications The Cellular Concept

Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.

Author Utility-Based Scheduling for Bulk Data Transfers between Distributed Computing Facilities Xin Wang, Wei Tang, Raj Kettimuthu,

QUEUING THEORY 1.  - means the number of arrivals per second   - service rate of a device  T - mean service time for each arrival   = ( ) Utilization,

WAITING LINES AND SIMULATION

Condor – A Hunter of Idle Workstation

Results for p = 0.1 Graphs at different values of Call Arrival Rate for Call Blocking Probability (in %) System Utilization (Efficiency) (in %) Average.

Queueing Theory What is a queue? Examples of queues:

Analyzing Security and Energy Tradeoffs in Autonomic Capacity Management Wei Wu.

A Scalable Routing Architecture for Prefix Tries

B.Ramamurthy Appendix A

Birth-Death Process Birth – arrival of a customer to the system

Delays Deterministic Stochastic Assumes “error free” type case

System Performance: Queuing

Variability 8/24/04 Paul A. Jensen

Queuing Theory By: Brian Murphy.

Delays Deterministic Stochastic Assumes “error free” type case

Prestented by Zhi-Sheng, Lin

Video Streaming over Cognitive radio networks

VIRTUE MARYLEE MUGURACHANI QUEING THEORY BIRTH and DEATH.

Presentation transcript:

Online Spectrum Allocation for Cognitive Cellular Network Supporting Scalable Demands Jianfei Wang

Outline Introduction Algorithm Target Algorithm Detail Evaluation

Introduction Online Spectrum Allocation Scalable Demands – H.264 Satisfaction Degree

Algorithm Target Zero User Wait Time High Spectrum Utility Rate

Spectrum Model Complete graph Coordinate Network

System Assumption Queue System – Arrival of users’ request Possion process – Customer’s service time Exponential distribution – Queuing rules FCFS – Capacity of the system

State Machine of System

Stabilization of Normal State M/M/N 0 /N 0

State Boundary Boundary between Normal and Poor Boundary between Rich and Normal Frequency Ratio of Normal State – Frequency Utility Ratio vs Block Probability.

Estimation of Arrival Rate ARMA

Estimation of Departure Rate Data Source – The Customers who recently depart – The customers who are active

Evaluation Evaluate Parameters – f 2 = f f f f f f

Evaluation Result Active Consumers vs SatisfactionSystem Free Spectrum Statistics

Reference [1]G.E.P.BoxandG.M.Jenkins. Timeseriesanalysis:forecastingand control.PrenticeHallPTRUpperSaddleRiver,NJ,USA,1994. [2]M.BuddhikotandK.Ryan.Spectrummanagementincoordinated dynamicspectrumaccessbasedcellularnetworks.In Proc.ofIEEE DySPAN,pages299–307,2005. [3]L.Cao,L.Yang,X.Zhou,Z.Zhang,andH.Zheng.Optimus:SINR- DrivenSpectrumDistributionviaConstraintTransformation.In New FrontiersinDynamicSpectrum,2010IEEESymposiumon,pages1–12. IEEE,2010. [4]X.Cheng,C.Dale,andJ.Liu.Statisticsandsocialnetworkofyoutube videos.In QualityofService,2008.IWQoS thInternational workshopon,pages229–238.IEEE,2008. [5]L.Kleinrock.Queueingsystems,volume1:theory,1975. [6]A.Lakhina,K.Papagiannaki,M.Crovella,C.Diot,E.D.Kolaczyk,and N.Taft.Structuralanalysisofnetworktrafficflows. ACMSIGMETRICS Performanceevaluationreview,32(1):61–72,2004. [7]MichaelLenczner,BenoitGrgoire,andFran?oisProulx.CRAWDAD tracesetilesansfil/wifidog/session(v ).Downloadedfrom [8]J.Sachs,I.Maric,andA.Goldsmith.CognitiveCellularSystemswithin theTVSpectrum.In NewFrontiersinDynamicSpectrum,2010IEEE Symposiumon,pages1–12.IEEE,2010. [9]T.Schierl,T.Stockhammer,andT.Wiegand.Mobilevideotransmission usingscalablevideocoding. IEEETransactionsonCircuitsandSystems forVideoTechnology,17(9):1204–1217,2007. [10]J.Sjoberg,M.Westerlund,andA.Lakaniemi.Q.Xie,”RTPPayload FormatandFileStorageFormatfortheAdaptiveMulti- Rate(AMR)and AdaptiveMulti-RateWideband(AMR-WB)AudioCodecs.Technical report,RFC4867,April2007. [11]S.Sodagari,A.Attar,andS.G.Bilen.StrategiestoAchieveTruthful SpectrumAuctionsforCognitiveRadioNetworksBasedonMechanism Design.In NewFrontiersinDynamicSpectrum,2010IEEESymposium on,pages1–6.IEEE,2010.