Experience versus Talent Shapes the Structure of the Web (2009)
Kong, Joseph S., Sarshar, Nima, Roychowdhury, Vwani P.
We use sequential large-scale crawl data to empirically investigate and validate the dynamics that underlie the evolution of the structure of the web. We find that the overall structure of the web is...
On Wavelet Compression of Self-Similar Processes (2008)
Self-similar stochastic processes are stochastic counterparts of deterministic fractals. Statistical properties of those processes are the same regardless of the resolution in which they are...
1 A New Method for Clock Recovery in MPEG Decoders ∗ (2008)
Hooman Hassanzadegan, Nima Sarshar
We propose and analyze a new method for reconstruction of the reference clock which is needed for correctly timing the decoding and presentation of video and audio streams in MPEG decoders. Clock...
Optimal Unequal Channel Protection for Multiple-Description Concatenated Codes (2007)
Multiple-description product codes, consisting of an erasure correction row code (e.g. Reed-Solomon code) and an error correction/detection column code (e.g. convolutional codes+CRC) have recently...
Comparison of Image Similarity Queries in P2P Systems (2006)
Mueller, Wolfgang, Boykin, P. Oscar, Sarshar, Nima, Roychowdhury, Vwani P.
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems we ask the following questions: Are there applications where unstructured queries are still...
Sarshar, Nima, Rezaei, Behnam A., Roychowdhury, Vwani P.
This paper is concerned with the scaling of the number of hops in a large scale wireless ad-hoc network (WANET), a quantity we call network latency. A large network latency affects all aspects of...
Finite Percolation at a Multiple of the Threshold (2006)
Sarshar, Nima, Boykin, Patrick Oscar, Roychowdhury, Vwani P.
Bond percolation on infinite heavy-tailed power-law random networks lacks a proper phase transition; or one may say, there is a phase transition at {\em zero percolation probability}. Nevertheless, a...
This work opens up a new line of enquiry into networked signal communications, which we call joint network-source coding (JNSC). JNSC puts the research on network coding in a rate-distortion...
A Practical Approach to Joint Network-Source Coding (2005)
We are interested in how to best communicate a real valued source to a number of destinations (sinks) over a network with capacity constraints in a collective fidelity metric over all the sinks, a...
Joint Network-Source Coding: An Achievable Region with Diversity Routing (2005)
We are interested in how to best communicate a (usually real valued) source to a number of destinations (sinks) over a network with capacity constraints in a collective fidelity metric over all the...
Rezaei, Behnam A., Sarshar, Nima, Boykin, P. Oscar, Roychowdhury, Vwani P.
Susceptibility of scale free Power Law (PL) networks to attacks has been traditionally studied in the context of what may be termed as {\em instantaneous attacks}, where a randomly selected set of...
Let Your CyberAlter Ego Share Information and Manage Spam (2005)
Kong, Joseph S., Boykin, P. Oscar, Rezaei, Behnam A., Sarshar, Nima, Roychowdhury, Vwani P.
Almost all of us have multiple cyberspace identities, and these {\em cyber}alter egos are networked together to form a vast cyberspace social network. This network is distinct from the world-wide-web...
Multiple Scale-Free Structures in Complex Ad-Hoc Networks (2005)
Sarshar, Nima, Roychowdhury, Vwani
This paper develops a framework for analyzing and designing dynamic networks comprising different classes of nodes that coexist and interact in one shared environment. We consider {\em ad hoc} (i.e.,...
Scalable Percolation Search in Power Law Networks (2004)
Sarshar, Nima, Boykin, P. Oscar, Roychowdhury, Vwani P.
We introduce a scalable searching algorithm for finding nodes and contents in random networks with Power-Law (PL) and heavy-tailed degree distributions. The network is searched using a probabilistic...
Percolation Search in Power Law Networks: Making Unstructured Peer-To-Peer Networks Scalable (2004)
Nima Sarshar, P. Oscar Boykin, Vwani P. Roychowdhury
We introduce a scalable searching protocol for locating and retrieving content in random networks with Power-Law (PL) and heavy-tailed degree distributions. The proposed algorithm is capable of...
Percolation-based search on unstructured peer-to-peer networks (2004)
Nima Sarshar, Vwani P. Roychowdury, Oscar Boykin
Abstract. The problem of searching an unstructured peer-to-peer network such as Gnutella is considered. Assuming a skewed degree distribution, we give a local uniform caching and search algorithm...
Scale-Free and Stable Structures in Complex {\em Ad hoc} networks (2003)
Sarshar, Nima, Roychowdhury, Vwani
Unlike the well-studied models of growing networks, where the dominant dynamics consist of insertions of new nodes and connections, and rewiring of existing links, we study {\em ad hoc} networks,...
A Random Structure for Optimum Cache Size Distributed hash table (DHT) Peer-to-Peer design (2002)
Sarshar, Nima, Roychowdhury, Vwani
We propose a new and easily-realizable distributed hash table (DHT) peer-to-peer structure, incorporating a random caching strategy that allows for {\em polylogarithmic search time} while having only...
A random structure for optimum cache size distributed hash table (DHT) peer-to-peer design (2002)
Nima Sarshar, Vwani Roychowdhury
Abstract. We propose a new and easily-realizable distributed hash table (DHT) peer-to-peer structure, incorporating a random caching strategy that allows for polylogarithmic search time while having...
A random structure for optimum cache size distributed hash table (DHT) peer-to-peer design (2002)
Nima Sarshar, Vwani Roychowdhury
Abstract. We propose a new and easily-realizable distributed hash table (DHT) peer-to-peer structure, incorporating a random caching strategy that allows for polylogarithmic search time while having...
Experience versus talent shapes the structure of the Web
Kong, Joseph S., Sarshar, Nima, Roychowdhury, Vwani P.
We use sequential large-scale crawl data to empirically investigate and validate the dynamics that underlie the evolution of the structure of the web. We find that the overall structure of the web is...