We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Software prefetching has been demonstrated as a powerful technique to tolerate long load latencies. However, to be effective, prefetching must target the most critical (frequently...
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...
Leonid B. Poutievski, Kenneth L. Calvert, Jim Grif...
— Next-generation mobile communication systems will provide “always best connected” services to mobile users via cellular networks that provide wide area coverage for global ...