C.44 Routing with Blinkers: Online Throughput Maximization without Queue Length Information

G. S. Paschos, M. Leconte, and A. Destounis – ISIT 2016 [pdf]

Post navigation

Previous Previous post: C.43 Dynamic Control for Failure Recovery and Flow Reconfiguration in SDN

Next Next post: C.45 Dynamic pilot allocation over Markovian fading channels: A restless bandit approach

About Me

Welcome to my homepage! I am head of Research Science group at Amazon Transportation Services, Luxembourg, working in optimization and machine learning algorithms, with applications to automated and sustainable transportation.

Venues
Applications
Tools

ComMag ComputerNetworks GLOBECOM ICML INFOCOM JSAC MOBIHOC TNSM TransInformationTheory TransNetworking TransWirelessComm WIOPT

Caching Cloud computing Energy Saving Fairness Game Theory ICN Localization Machine Learning Markov Decision Process Mobile communications Multicast Network Coding Network Slicing SDN URLLC User Association Video Streaming WiFi

ADMM Backpressure Coded caching Data-driven Optimization Evacuation Mirror Descent Network Optimization Online Convex Optimization Optimization Percolation Performance Analysis Routing Scaling Laws Scheduling Stochastic Modeling

Search for: