2008 |
69 | EE | Matthew Andrews:
Optimization via communication networks.
CISS 2008: 1205-1209 |
68 | EE | Matthew Andrews,
Lisa Zhang:
Satisfying Arbitrary Delay Requirements in Multihop Networks.
INFOCOM 2008: 116-120 |
67 | EE | Umut Akyol,
Matthew Andrews,
Piyush Gupta,
John D. Hobby,
Iraj Saniee,
Alexander L. Stolyar:
Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks.
INFOCOM 2008: 619-627 |
66 | EE | Matthew Andrews,
Lisa Zhang:
Creating Templates to Achieve Low Delay in Multi-Carrier Frame-Based Wireless Data Systems.
INFOCOM 2008: 861-869 |
65 | EE | Matthew Andrews,
Aleksandrs Slivkins:
Oscillations with TCP-like Flow Control in Networks of Queues
CoRR abs/0812.1321: (2008) |
64 | EE | Robert W. Heath Jr.,
David James Love,
Bhaskar D. Rao,
Vincent Lau,
David Gesbert,
Matthew Andrews:
Exploiting limited feedback in tomorrow's wireless communication networks.
IEEE Journal on Selected Areas in Communications 26(8): 1337-1340 (2008) |
63 | EE | David James Love,
Robert W. Heath Jr.,
Vincent K. N. Lau,
David Gesbert,
Bhaskar D. Rao,
Matthew Andrews:
An overview of limited feedback in wireless communication systems.
IEEE Journal on Selected Areas in Communications 26(8): 1341-1365 (2008) |
62 | EE | Matthew Andrews,
Lisa Zhang:
Almost-tight hardness of directed congestion minimization.
J. ACM 55(6): (2008) |
2007 |
61 | EE | Matthew Andrews:
Load Balancing in the Internet with Strict Delay Constraints.
INFOCOM 2007: 1280-1288 |
60 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling algorithms for multi-carrier wireless data systems.
MOBICOM 2007: 3-14 |
59 | EE | Matthew Andrews:
Instability of FIFO in the permanent sessions model at arbitrarily small network loads.
SODA 2007: 219-228 |
58 | EE | Matthew Andrews,
Kyomin Jung,
Alexander L. Stolyar:
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads.
STOC 2007: 145-154 |
57 | EE | Matthew Andrews,
Lisa Zhang:
Routing and scheduling in multihop wireless networks with time-varying channels.
ACM Transactions on Algorithms 3(3): (2007) |
56 | EE | Matthew Andrews,
Julia Chuzhoy,
Venkatesan Guruswami,
Sanjeev Khanna,
Kunal Talwar,
Lisa Zhang:
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs.
Electronic Colloquium on Computational Complexity (ECCC) 14(113): (2007) |
55 | EE | Matthew Andrews,
Lisa Zhang:
Hardness of the Undirected Congestion Minimization Problem.
SIAM J. Comput. 37(1): 112-131 (2007) |
2006 |
54 | EE | Matthew Andrews,
Lisa Zhang:
Complexity of Wavelength Assignment in Optical Network Optimization.
INFOCOM 2006 |
53 | EE | Matthew Andrews,
Jin Cao,
Jim McGowan:
Measuring Human Satisfaction in Data Networks.
INFOCOM 2006 |
52 | EE | Matthew Andrews,
Aleksandrs Slivkins:
Oscillations with TCP-Like Flow Control in Networks of Queues.
INFOCOM 2006 |
51 | EE | Matthew Andrews,
Lisa Zhang:
Logarithmic hardness of the directed congestion minimization problem.
STOC 2006: 517-526 |
50 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling over nonstationary wireless channels with finite rate sets.
IEEE/ACM Trans. Netw. 14(5): 1067-1077 (2006) |
49 | EE | Matthew Andrews,
Lisa Zhang:
Logarithmic hardness of the undirected edge-disjoint paths problem.
J. ACM 53(5): 745-761 (2006) |
48 | EE | Matthew Andrews,
Lisa Zhang:
Minimizing maximum fiber requirement in optical networks.
J. Comput. Syst. Sci. 72(1): 118-131 (2006) |
2005 |
47 | EE | Matthew Andrews,
Julia Chuzhoy,
Sanjeev Khanna,
Lisa Zhang:
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion.
FOCS 2005: 226-244 |
46 | EE | Matthew Andrews:
Maximizing profit in overloaded networks.
INFOCOM 2005: 217-224 |
45 | EE | Matthew Andrews,
Lijun Qian,
Alexander L. Stolyar:
Optimal utility based multi-user throughput allocation subject to throughput constraints.
INFOCOM 2005: 2415-2424 |
44 | EE | Matthew Andrews,
Lisa Zhang:
Bounds on fiber minimization in optical networks with fixed fiber capacity.
INFOCOM 2005: 409-419 |
43 | EE | Matthew Andrews,
Lisa Zhang:
Hardness of the undirected edge-disjoint paths problem.
STOC 2005: 276-283 |
42 | EE | Matthew Andrews,
Lisa Zhang:
Hardness of the undirected congestion minimization problem.
STOC 2005: 284-293 |
41 | EE | Matthew Andrews,
Antonio Fernández,
Ashish Goel,
Lisa Zhang:
Source routing and scheduling in packet networks.
J. ACM 52(4): 582-601 (2005) |
40 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data.
J. ACM 52(5): 809-834 (2005) |
2004 |
39 | EE | Matthew Andrews:
Hardness of Buy-at-Bulk Network Design.
FOCS 2004: 115-124 |
38 | EE | Matthew Andrews,
Lisa Zhang:
Wavelength Assignment in Optical Networks with Fixed Fiber Capacity.
ICALP 2004: 134-145 |
37 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling over non-stationary wireless channels with finite rate sets.
INFOCOM 2004 |
36 | EE | Matthew Andrews,
Lisa Zhang:
Routing and scheduling in multihop wireless networks with time-varying channels.
SODA 2004: 1031-1040 |
35 | EE | Matthew Andrews:
Instability of FIFO in session-oriented networks.
J. Algorithms 50(2): 232-245 (2004) |
34 | EE | Matthew Andrews,
Lisa Zhang:
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule.
J. Algorithms 52(1): 57-81 (2004) |
33 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling Protocols for Switches with Large Envelopes.
J. Scheduling 7(3): 171-186 (2004) |
32 | EE | Matthew Andrews,
Lisa Zhang:
The Effects of Temporary Sessions on Network Performance.
SIAM J. Comput. 33(3): 659-673 (2004) |
2003 |
31 | EE | Matthew Andrews,
Milan Vojnovic:
Scheduling reserved traffic in input-queued switches: New delay bounds via probabilistic techniques.
INFOCOM 2003 |
30 | EE | Matthew Andrews,
Lisa Zhang:
Achieving stability in networks of input-queued switches.
IEEE/ACM Trans. Netw. 11(5): 848-857 (2003) |
2002 |
29 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data.
FOCS 2002: 293-302 |
28 | EE | Matthew Andrews,
F. Bruce Shepherd,
Aravind Srinivasan,
Peter Winkler,
Francis Zane:
Clustering and Server Selection using Passive Monitoring.
INFOCOM 2002 |
27 | EE | Matthew Andrews,
Lisa Zhang:
Scheduling protocols for switches with large envelopes.
SODA 2002: 443-452 |
26 | EE | Matthew Andrews,
Michael A. Bender,
Lisa Zhang:
New Algorithms for Disk Scheduling.
Algorithmica 32(2): 277-301 (2002) |
25 | EE | Matthew Andrews,
Lisa Zhang:
Approximation Algorithms for Access Network Design.
Algorithmica 34(2): 197-215 (2002) |
24 | EE | Matthew Andrews,
Antonio Fernández,
Ashish Goel,
Lisa Zhang:
Source Routing and Scheduling in Packet Networks
CoRR cs.NI/0203030: (2002) |
2001 |
23 | | Matthew Andrews,
Antonio Fernández,
Ashish Goel,
Lisa Zhang:
Source Routing and Scheduling in Packet Networks.
FOCS 2001: 168-177 |
22 | EE | Matthew Andrews,
Lisa Zhang:
Achieving Stability in Networks of Input-Queued Switches.
INFOCOM 2001: 1673-1679 |
21 | EE | Matthew Andrews,
Baruch Awerbuch,
Antonio Fernández,
Frank Thomson Leighton,
Zhiyong Liu,
Jon M. Kleinberg:
Universal-stability results and performance bounds for greedy contention-resolution protocols.
J. ACM 48(1): 39-69 (2001) |
2000 |
20 | | Matthew Andrews,
Kamesh Munagala:
Online Algorithms for Caching Multimedia Streams.
ESA 2000: 64-75 |
19 | EE | Matthew Andrews:
Probabilistic End-to-End Delay Bounds for Earliest Deadline First Scheduling.
INFOCOM 2000: 603-612 |
18 | EE | Matthew Andrews:
Instability of FIFO in session-oriented networks.
SODA 2000: 440-447 |
17 | EE | Matthew Andrews,
Lisa Zhang:
The effects of temporary sessions on network performance.
SODA 2000: 448-457 |
16 | EE | Matthew Andrews,
Antonio Fernández,
Mor Harchol-Balter,
Frank Thomson Leighton,
Lisa Zhang:
General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate).
SIAM J. Comput. 30(5): 1594-1623 (2000) |
1999 |
15 | | Matthew Andrews,
Sanjeev Khanna,
Krishnan Kumaran:
Integrated Scheduling of Unicast and Multicast Traffic in an Input-Queued Switch.
INFOCOM 1999: 1144-1151 |
14 | | Matthew Andrews,
Lisa Zhang:
Minimizing End-to-End Delay in High-Speed Networks with a Simple Coordinated Schedule.
INFOCOM 1999: 380-388 |
13 | EE | Matthew Andrews,
Lisa Zhang:
Packet Routing with Arbitrary End-to-End Delay Requirements.
STOC 1999: 557-565 |
12 | EE | Matthew Andrews,
Michel X. Goemans,
Lisa Zhang:
Improved Bounds for On-Line Load Balancing.
Algorithmica 23(4): 278-301 (1999) |
11 | | Matthew Andrews,
Frank Thomson Leighton,
Panagiotis Takis Metaxas,
Lisa Zhang:
Automatic Methods for Hiding Latency in Parallel and Distributed Computation.
SIAM J. Comput. 29(2): 615-647 (1999) |
1998 |
10 | EE | Matthew Andrews,
Lisa Zhang:
The Access Network Design Problem.
FOCS 1998: 40-59 |
9 | EE | Matthew Andrews,
Lisa Zhang:
Stability Results for Networks with Input and Output Blocking.
STOC 1998: 369-377 |
8 | | Kalyan S. Perumalla,
Matthew Andrews,
Sandeep N. Bhatt:
TED Models for ATM Internetworks.
SIGMETRICS Performance Evaluation Review 25(4): 12-21 (1998) |
1997 |
7 | EE | Matthew Andrews,
Antonio Fernández,
Mor Harchol-Balter,
Frank Thomson Leighton,
Lisa Zhang:
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate).
FOCS 1997: 294-302 |
6 | EE | Kalyan S. Perumalla,
Matthew Andrews,
Sandeep N. Bhatt:
A Virtual PNNI Network Testbed.
Winter Simulation Conference 1997: 1057-1064 |
1996 |
5 | | Matthew Andrews,
Michel X. Goemans,
Lisa Zhang:
Improved Bounds for On-line Load Balancing.
COCOON 1996: 1-10 |
4 | | Matthew Andrews,
Baruch Awerbuch,
Antonio Fernández,
Jon M. Kleinberg,
Frank Thomson Leighton,
Zhiyong Liu:
Universal Stability Results for Greedy Contention-Resolution Protocols.
FOCS 1996: 380-389 |
3 | | Matthew Andrews,
Michael A. Bender,
Lisa Zhang:
New Algorithms for the Disk Scheduling Problem.
FOCS 1996: 550-559 |
2 | | Matthew Andrews,
Frank Thomson Leighton,
Panagiotis Takis Metaxas,
Lisa Zhang:
Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).
SPAA 1996: 52-61 |
1 | EE | Matthew Andrews,
Frank Thomson Leighton,
Panagiotis Takis Metaxas,
Lisa Zhang:
Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).
STOC 1996: 257-265 |