Abstract: The Brownian web is obtained by a proper scaling of random walks started from vertices of a two-dimensional lattice. We discuss the Brownian web and show how a drainage network model converges weakly to the Brownian web after proper scaling.