* Motivation * Objective Find out proper fairness schemes/metrics to meet the customers’ needs to a great extent. Customer : various energy requirement.

Slides:

Advertisements

Similar presentations

Exploring the Potential of CMP Core Count Management on Data Center Energy Savings Ozlem Bilgir * Margaret Martonosi * Qiang Wu * Princeton University.

Advertisements

Waiting Line Management

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.

1 1 Slide © 2009 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.

Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks Jie BaoChi-Yin ChowMohamed F. Mokbel Department of Computer Science and Engineering.

Abhay.K.Parekh and Robert G.Gallager Laboratory for Information and Decision Systems Massachusetts Institute of Technology IEEE INFOCOM 1992.

1 1 Slide IS 310 – Business Statistics IS 310 Business Statistics CSU Long Beach.

Continuous Probability Distributions

Voting, Spatial Monopoly, and Spatial Price Regulation Economic Inquiry, Jan, 1992, MH Ye and M. J. Yezer Presentation Date: 06/Jan/14.

1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.

Submitters: Erez Rokah Erez Goldshide Supervisor: Yossi Kanizo.

CTC-340 Signals - Basics. Terms & Definitions (review) Cycle - Cycle Length - Interval -. change interval - clearance interval- change + clearance = Yi.

The Domain of a Point Set Surface Nina Amenta and Yong J. Kil University of California at Davis.

OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.

ASIC vs. FPGA – A Comparisson Hardware-Software Codesign Voin Legourski.

MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide.

20 10 School of Electrical Engineering &Telecommunications UNSW UNSW 1 2 3b 3a 1 10 Author – Joshua Weston Supervisor – Dr. Iain MacGill.

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

OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.

10th Workshop on Information Technologies and Systems 1 A Comparative Evaluation of Internet Pricing Schemes: Smart Market and Dynamic Capacity Contracting.

TVA Generates Power and sends it down Transmission Lines to Newport Utilities Distribution Substations TVA Newport Utilities Substations Distributes the.

* Power distribution becomes an important issue when power demand exceeds power supply. * As electric vehicles get more popular, for a period of time,

Spatial and Temporal Model of Electric Vehicle Charging Demand Presented by: Hao Liang Broadband Communications Research (BBCR) Lab Smart Grid.

Chapter 3, Part B Continuous Probability Distributions

1 1 Slide © 2009 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.

Starter The following times are all in hours. Change them into hours and minutes… a)0.5 hours b)2.5 hours c)3.5 hours d)1.25 hours e)3.75 hours How would.

QueueTraffic and queuing theory +. 2 Queues in everyday life You have certainly been in a queue somewhere. –Where? –How were they different?  We encounter.

Efficient Scheduling of Heterogeneous Continuous Queries Mohamed A. Sharaf Panos K. Chrysanthis Alexandros Labrinidis Kirk Pruhs Advanced Data Management.

EShare: A Capacitor-Driven Energy Storage and Sharing Network for Long-Term Operation(Sensys 2010) Ting Zhu, Yu Gu, Tian He, Zhi-Li Zhang Department of.

Transport-Based Load Modeling and Sliding Mode Control of Plug-In Electric Vehicles for Robust Renewable Power Tracking Presenter: qinghua shen BBCR SmartGrid0.

Plug-In Cars Powering America Toward a Cleaner Future Environment Texas Research and Policy Center McCall Johnson Plug-In Cars Nov. 4, 2009 McCall Johnson.

4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.

M16 Poisson Distribution 1  Department of ISM, University of Alabama, Lesson Objectives  Learn when to use the Poisson distribution.  Learn.

ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.

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.

Autonomous Distributed V2G (Vehicle- to-Grid) Satisfying Scheduled Charging Authors: H. Taniguchi, T. Nakajima, K.M. Liyanage, J. Baba Presenter: Jian.

Fair Queueing. 2 First-Come-First Served (FIFO) Packets are transmitted in the order of their arrival Advantage: –Very simple to implement Disadvantage:

Incentive-Oriented Downlink Scheduling for Wireless Networks with Real-Time and Non-Real-Time Flows I-Hong Hou, Jing Zhu, and Rath Vannithamby.

OPERETTA: An Optimal Energy Efficient Bandwidth Aggregation System Karim Habak†, Khaled A. Harras‡, and Moustafa Youssef† †Egypt-Japan University of Sc.

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 24 Simulation.

Simulation and Analysis of Entrance to Dahlgren Naval Base Jennifer Burke MSIM 752 Final Project December 7, 2007.

Hongyu Fu, Trigger group The Monte Carlo for Trigger Design of BES3 Scintillating Fibre BEMC Outline: Introduction to BES3 Scin-fibre BEMC Trigger.

Simulation Continuous Vars Dr. Satish Nargundkar 1 Monte Carlo Simulation Continuous Variables.

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 25 Simulation.

Doc.: IEEE /374r0 Submission March 2012 Anna Pantelidou, Renesas Mobile CorporationSlide 1 Grouping For.11ah Networks Date: Authors:

Scheduling Determines which packet gets the resource. Enforces resource allocation to each flows. To be “Fair”, scheduling must: –Keep track of how many.

BOUNDS ON QOS- CONSTRAINED ENERGY SAVINGS IN CELLULAR ACCESS NETWORKS WITH SLEEP MODES - Sushant Bhardwaj.

Wireless Cache Invalidation Schemes with Link Adaptation and Downlink Traffic Presented by Ying Jin.

1 Battery Comparison NanoSafe™ Possesses Disruptive Combination of Features No Other Battery Type Comes Close.

ComNets, RWTH Aachen University Relays in CDMA2000 Martha Clavijo Chair of Communication Networks RWTH Aachen University, Germany FFV 2007, ,

Scheduling for QoS Management. Engineering Internet QoS2 Outline  What is Queue Management and Scheduling?  Goals of scheduling  Fairness (Conservation.

TRAFFIC LIGHT CONTROL PROGRESS REPORT YITIAN GU ADITI BHAUMICK VIPUL SINGH LIYAN SUN Professor Nicholas F. Maxemchuk.

1 Coping with the Emerging Energy Demand for Charging Plug-in Electric Vehicles background lecture.

1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.

Agenda Background Project goals Project description –General –Implementation –Algorithms Simulation results –Charts –Conclusions.

Advanced Meter School August 18-20,2015 Time of Use and Load Profile Jeremiah Swann.

Charles W. Botsford, P.E. and Andrea L. Edwards AeroVironment, Inc. 800 Royal Oaks Drive, Suite 210 Monrovia, CA An Integrated Global Philosophy.

T-Share: A Large-Scale Dynamic Taxi Ridesharing Service

IEEE CAMAD Dec, Athens, Greece

St. Edward’s University

Special Continuous Probability Distributions

OPERATING SYSTEMS SCHEDULING

Solutions Queueing Theory 1

Integration of EVs with Existing Distributed Energy Resources in Findhorn Ecovillage Craig mcarthur, Georgios PAPOUTSIS, KONSTANTINOS PISOKAS, MARINOS.

BELLWORK What is a hypothesis??? I will be able to:

Solutions Queueing Theory 1

01 DRAW YOUR TIMELINE HERE JAN. MAR. JAN. MAR. FEB. APR. FEB. APR.

Determining When a Second Cart Should Be Added to El Toro

PROBABILITY AND STATISTICS

Average handle time standard

Presentation transcript:

* Motivation * Objective Find out proper fairness schemes/metrics to meet the customers’ needs to a great extent. Customer : various energy requirement & desired departure time Available Energy : limited for some time Fairly distribute energy?

* Use Switch to control power supply (5 min interval) * Information : Energy requirement, desired departure time, battery level, energy available * Cars come to charge in a queue with Poisson dist.. * Each 5 min can only charge limited cars. * Different fairness schemes : Decide who will be charged, update charging queue for every 5 min. * When energy requirement is satisfied, remove the car from the queue.

Charged Not Charged New Arrivals Beginning of the queue

8 units10 units5 units Beginning of the queue

Current time Desired departure time Units of energy required Spare time-N

ParametersData /Distribution Arrival of EV’s Poisson Distribution Arrival rate -> real world data Desired Plug-in time Gaussian distribution [6, 22]: Mean(μ)=14 hrs, StDev(σ)=4 hrs Desired Departure timeArrival time + Desired Plug-in time

ParametersData /Distribution Desired distance Fitting real world data to Exponential dist. [20, 90] R (Supply and demand ratio) Energy Available Function of energy consumption (real world data) and R Current battery level (%) Uniform dist. 0%-30% of full battery level Energy Requirement Calculated from desired distance 100 mile = 28 kwh 1 kwh = 6.67 Units of 5 min Full battery level = 100 miles = Units of 5 min

* MMER fairness scheme does not work well in terms of the metrics we applied because it takes no advantage of the information of departure time. It performs even worse than the baseline Round Robin. * MMDT fairness scheme generally achieves the best performance. * To ensure 95% cars departing without delay, Round Robin: R > 1.8 MMDT: R < 1.1

* MMER shows the worst performance in comparison to other charging schemes.

zoom out

* MMER shows the worst performance in comparison to other charging schemes. zoom out

* MMER shows the worst performance in comparison to other charging schemes.

* Compare Round Robin with two schemes which take the information of departure time into account. * It turns out that using the additional information can improve the performance.

* Compare Round Robin with two schemes which take the information of departure time into account. * It turns out that using the additional information can improve the performance.

* Compare Round Robin with two schemes which take the information of departure time into account. * It turns out that using the additional information can improve the performance.

* In comparison to FDFS, MMDT fairness scheme achieves better performance when the available power is a little bit more than the required energy.

zoom out

* In comparison to FDFS, MMDT fairness scheme achieves better performance when the available power is a little bit more than the required energy.

Car A (Unit of 5 minute)Car B (Unit of 5 minute)Car ACar B Required Energy Desired Depart Time - Current Time Required Energy Desired Depart Time - Current Time MMDT Metric Car A (Unit of 5 minute)Car B (Unit of 5 minute) Required Energy Desired Depart Time - Current Time Required Energy Desired Depart Time - Current Time FDFS:

* MMDT fairness scheme achieves the best performance when the available power is a little bit more than the required energy.

* 1. Lie about Time (2 methods) * a. punish with extra time b. punished by fine DayClaimActuallyPunishDesired departure time 18am10am(10-8)+1=38am 27am10am(10-7)+2=510am 35am10am(10-5)+3=810am 42am10am(10-2)+4=1210am 5…….. * 2. Lie about Distance (2 methods) * a. punish with extra time (convert distance to time) 1 mile = 10 min * b. punished by fine

WeekTasks 1, 2, (Jan 30 – Feb 10)Background reading and literature review. √ 3,4, (Feb 13 – Feb 24)Simulate a baseline charging system. √ 5, 6 (Feb 27 – Mar 9) 8, (Mar 19 – Mar 23) Implement different types of fairness; Each of us is responsible for one specific fairness scheme. √ 9,10, 11 (Mar 26 – Apr 13)Compare the results and make some conclusions. Discuss about lies. √ 12,13, (Apr 16 – Apr 27)Write a technical paper.