Search Results - "Karger, D.R."

Chord: a scalable peer-to-peer lookup protocol for Internet applications by Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.

“…A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents…”
Get full text

A Random Linear Network Coding Approach to Multicast by Ho, T., Medard, M., Koetter, R., Karger, D.R., Effros, M., Jun Shi, Leong, B.

“…We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks…”
Get full text

Using linear programming to Decode Binary linear codes by Feldman, J., Wainwright, M.J., Karger, D.R.

“…A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on observations received from any…”
Get full text

The benefits of coding over routing in a randomized setting by Ho, T., Koetter, R., Medard, M., Karger, D.R., Effros, M.

“…A novel randomized network coding approach for robust, distributed transmission and compression of information in networks is presented, and its advantages…”
Get full text

Minimum-cost multicast over coded packet networks by Lun, D.S., Ratnakar, N., Medard, M., Koetter, R., Karger, D.R., Ho, T., Ahmed, E., Fang Zhao

“…We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing…”
Get full text

Byzantine Modification Detection in Multicast Networks With Random Network Coding by Tracey Ho, Ben Leong, Koetter, R., Medard, M., Effros, M., Karger, D.R.

“…An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each…”
Get full text

Network coding from a network flow perspective by Ho, T., Karger, D.R., Medard, M., Koetter, R.

“…Precise connections between algebraic network coding and network flows are explained in this article. Our combinatorial formulations offer new insights,…”
Get full text

Byzantine modification detection in multicast networks using randomized network coding by Ho, T., Leong, B., Koetter, R., Medard, M., Effros, M., Karger, D.R.

“…Distributed randomized network coding, a robust approach to multicasting in distributed network settings, can be extended to provide Byzantine modification…”
Get full text

Toward using the network as a switch: on the use of TDM in linear optical networks by Karger, D.R., Medard, M.

“…A common problem in optical networking is that the large quantity of raw bandwidth available in such networks is often difficult to access. We show that…”
Get full text

On the Expected VCG Overpayment in Large Networks by Karger, D.R., Nikolova, E.

“…Motivated by the increasing need to price networks, we study the prices resulting from of a variant of the VCG mechanism, specifically defined for networks by…”
Get full text

Sharing information in time-division duplexing channels: A network coding approach by Lucani, D.E., Medard, M., Stojanovic, M., Karger, D.R.

“…We study random linear network coding for time-division duplexing channels for sharing information between nodes. We assume a packet erasure channel with nodes…”
Get full text

(De)randomized construction of small sample spaces in /spl Nscr//spl Cscr by Karger, D.R., Koller, D.

“…D. Koller and N. Megiddo (1993) introduced the paradigm of constructing compact distributions that satisfy a given set of constraints, and showed how it can be…”
Get full text

Approximation algorithms for orienteering and discounted-reward TSP by Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.

“…In this paper, we give the first constant-factor approximation algorithm for the rooted orienteering problem, as well as a new problem that we call the…”
Get full text

Decoding turbo-like codes via linear programming by Feldman, J., Karger, D.R.

“…We introduce a novel algorithm for decoding turbo-like codes based on linear programming. We prove that for the case of repeat-accumulate (RA) codes, under the…”
Get full text

Finding the hidden path: time bounds for all-pairs shortest paths by Karger, D.R., Koller, D., Phillips, S.J.

“…The all-pairs shortest paths problem in weighted graphs is investigated. An algorithm called the hidden paths algorithm, which finds these paths in time O(m*+n…”
Get full text