{"63987":{"#nid":"63987","#data":{"type":"event","title":"Control policies for dynamical queues and flow networks","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ETITLE:\u0026nbsp; \u003C\/strong\u003EControl policies for dynamical queues and flow networks\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003ESPEAKER:\u0026nbsp; \u003C\/strong\u003EKetan Savla, Faculty Candidate\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EABSTRACT:\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003EQueueing systems, along with flow network approximations, provide a  fruitful framework\u003Cbr \/\u003Efor several applications such as transportation, production and data  networks. In this talk,\u003Cbr \/\u003Ewe present a novel generalization of this framework that explicitly  incorporates dynamical\u003Cbr \/\u003Easpects inspired by well-known empirical findings. In particular, two  scenarios will be\u003Cbr \/\u003Ediscussed. First, we present a novel dynamical queue model in which  the service times\u003Cbr \/\u003Edepend on the utilization history of the server. For such a queue, we  show that a simple\u003Cbr \/\u003Ethreshold policy, that releases a task to the server only if its state  is below a certain fixed\u003Cbr \/\u003Evalue, is throughput-optimal. Second, we consider a dynamical flow  network where the flow\u003Cbr \/\u003Edynamics is driven by the difference between the inflow and outflow on  the links. For such a\u003Cbr \/\u003Eflow network, we show that the node-wise routing policies that respond  cooperatively to\u003Cbr \/\u003Evariations in flow densities on local links in fact provide maximum  global robustness\u003Cbr \/\u003Eguarantees under local information constraint. These results rely on  technical tools at the\u003Cbr \/\u003Eintersection of dynamical systems, queues and network flows, and  provide key insights into\u003Cbr \/\u003Ethe fundamental performance limits in presence of dynamical effects.\u003Cbr \/\u003E\u003Cbr \/\u003E(joint work with E. Frazzoli, G. Como, D. Acemoglu and M. A. Dahleh)\u003Cbr \/\u003E\u003Cbr \/\u003EBio\u003Cbr \/\u003E----\u003Cbr \/\u003EKetan Savla is a research scientist at the Laboratory for Information  and Decision Systems at MIT. He obtained his Ph.D. in Electrical Engineering and M.A. in Applied Mathematics, both in 2007, from UCSB, as well as  M.S. in Mechanical Engineering from UIUC in 2004. His current research  interest is in control and optimization techniques with applications in mobile  robotic networks, humans-in-loop systems, intelligent transportation systems and computational neuroscience. His awards include CDC-ECC\u002705 best student paper finalist and best CCDC thesis award from UCSB.\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Control policies for dynamical queues and flow networks"}],"uid":"27187","created_gmt":"2011-02-01 11:57:37","changed_gmt":"2016-10-08 01:53:24","author":"Anita Race","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2011-03-01T10:00:00-05:00","event_time_end":"2011-03-01T11:00:00-05:00","event_time_end_last":"2011-03-01T11:00:00-05:00","gmt_time_start":"2011-03-01 15:00:00","gmt_time_end":"2011-03-01 16:00:00","gmt_time_end_last":"2011-03-01 16:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"1242","name":"School of Industrial and Systems Engineering (ISYE)"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}