Antonis Dimakis

Email: dimakis@eecs.berkeley.edu

Office: 264M Cory Hall

 

I have recently graduated from the department of Electrical Engineering and Computer Sciences at the University of California at Berkeley. My advisor was Prof. Jean Walrand.

 

Research Interests:

  • Analysis and control of networks
  • Stochastic processes
  • Pricing mechanisms for resource allocation

 

Publications:

  1. with C. Courcoubetis and G. D. Stamoulis. "Traffic Equivalence and Substitution in a   Multiplexer". In Proc. of IEEE Infocom'99, New York, USA, March 1999.
  2. with C. Courcoubetis and M.I. Reiman. "Providing bandwidth guarantees over a best-effort network: call-admission and pricing".  In Proc. of Infocom'01, Anchorage, Alaska, USA.
  3. with J. Walrand. “Macroscopic Behavior of  a Lossy Resource Shared by Real- and Non-real-time Customers”. 2001 Allerton Conference, Illinois, USA.
  4. with C. Courcoubetis and G. D. Stamoulis. "Traffic Equivalence and Substitution in a Multiplexer with Applications to Dynamic Available Capacity Estimation". IEEE/ACM Transactions on Networking, 2001.
  5. with R. Jain and P. Varaiya, “On the Existence of Competitive Equilibria in Bandwidth Markets”, 2002 Allerton Conference, Illinois, USA.
  6. with L. He, J. Musacchio, H-S W. So, and T. Tung , Adaptive Quality of Service for a Mobile Ad Hoc Network,, MWCN, Singapore, October 2003.
  7. with J. Walrand, “Stability of Longest Queue First Scheduling”, 2005 Allerton Conference, Illinois, USA.
  8. with R. Jain and J. Walrand, “Mechanisms for efficient allocation in divisible capacity networks”, CDC, 2006.
  9. with J. Walrand, “Sufficient Conditions for Stability of Longest Queue First Scheduling: Second Order properties using Fluid Limits”, in Advances in Applied Probability, 38.2, June 2006.
  10. with J. Walrand, “Approximating queues in slowly varying stationary environments”, submitted, 2006.

 

Thesis:Stability and Approximation of Queueing Networks”, 2006.

 

Other:

Contributed in J. Walrand’sRandom Processes in Systems”, class notes for E226A.