Perfect matchings via uniform sampling in regular bipartite graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Perfect matchings via uniform sampling in regular bipartite graphs
ACM Transactions on Algorithms (TALG)
Perfect matchings in o(n log n) time in regular bipartite graphs
Proceedings of the forty-second ACM symposium on Theory of computing
A 1.43-competitive online graph edge coloring algorithm in the random order arrival model
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Contention-free many-to-many communication scheduling for high performance clusters
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
| Hi-index | 0.00 |
The essence of an Internet router is an n 脳 n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output ports as the two vertex sets. Packets arriving at input port i and destined for output port j can be modeled as an edge from i to j. Current switch scheduling algorithms view the routing of packets at each time step as a selection of a bipartite matching. We take the view that the switch scheduling problem across a sequence of time-steps is an instance of the edge coloring problem for a bipartite multigraph. Implementation considerations lead us to seek edge coloring algorithms for bipartite multigraphs that are fast, decentralized, and online. We present a randomized algorithm which has the desired properties, and uses only a near-optimal \Delta+ 0(\Delta) colors on dense bipartite graphs arising in the context of switch scheduling. This algorithm extends to nonbipartite graphs as well. It leads to a novel switch scheduling algorithm which, for stochastic online edge arrivals, is stable, i.e., the queue length at each input port is bounded at all times. We note that this is the first decentralized switch scheduling algorithm that is also guaranteed to be stable.