@conference {19281,
	title = {Design and implementation of real-time signal processing applications on heterogeneous multiprocessor arrays},
	booktitle = {2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)},
	year = {2010},
	month = {2010},
	pages = {2121 - 2125},
	abstract = {Processing structures based on arrays of computational elements form an important class of architectures, which includes field programmable gate arrays (FPGAs), systolic arrays, and various forms of multicore processors. A wide variety of design methods and tools have been targeted to regular processing arrays involving homogeneous processing elements. In this paper, we introduce the concept of field programmable X arrays (FPXAs) as an abstract model for design and implementation of heterogeneous multiprocessor arrays for signal processing systems. FPXAs are abstract structures that can be targeted for implementation on application-specific integrated circuits, FPGAs, or other kinds of reconfigurable processors. FPXAs can also be mapped onto multicore processors for flexible emulation. We discuss the use of dataflow models as an integrated application representation and intermediate representation for efficient specification and mapping of signal processing systems on FPXAs. We demonstrate our proposed models and techniques with a case study involving the embedding of an application-specific FPXA system on an off-the-shelf FPGA device.},
	keywords = {application specific integrated circuits, application-specific integrated circuits, computational elements, Computer architecture, decoding, Field programmable gate arrays, field programmable X arrays, FPGA, FPXA, Integrated circuit modeling, Logic Design, microprocessor chips, multicore processors, multiprocessor arrays, real-time signal processing, reconfigurable architectures, reconfigurable processors, Routing, Signal processing, Signal processing systems, systolic arrays, Viterbi algorithm},
	author = {Wu, Hsiang-Huang and Chung-Ching Shen and Bhattacharyya, Shuvra S. and Compton, K. and Schulte, M. and Wolf, M. and Zhang, Tong}
}
@conference {17531,
	title = {Fighting Spam with the NeighborhoodWatch DHT},
	booktitle = {IEEE INFOCOM 2009},
	year = {2009},
	month = {2009/04/19/25},
	pages = {1755 - 1763},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based blacklists (DNSBLs) of IP addresses of mail relays that forward spam. Implementing a blacklist on a DHT improves resilience to DoS attacks and secures message delivery, when compared to DNSBLs. However, due to the sensitive nature of the blacklist, storing the data in a peer-to-peer DHT would invite attackers to infiltrate the system. Typical DHTs can withstand fail-stop failures, but malicious nodes may provide incorrect routing information, refuse to return published items, or simply ignore certain queries. The neighborhoodwatch DHT is resilient to malicious nodes and maintains the O(logiV) bounds on routing table size and expected lookup time. NeighborhoodWatch depends on two assumptions in order to make these guarantees: (1) the existence of an on-line trusted authority that periodically contacts and issues signed certificates to each node, and (2) for every sequence of k + 1 consecutive nodes in the ID space, at least one is alive and non-malicious. We show how NeighborhoodWatch maintains many of its security properties even when the second assumption is violated. Honest nodes in NeighborhoodWatch can detect malicious behavior and expel the responsible nodes from the DHT.},
	keywords = {Communications Society, computer crime, cryptography, Databases, IP addresses, IP networks, on-line trusted authority, Peer to peer computing, peer-to-peer computing, peer-to-peer distributed hash table, Postal services, Relays, Resilience, Routing, Security, table size routing, Unsolicited electronic mail},
	isbn = {978-1-4244-3512-8},
	doi = {10.1109/INFCOM.2009.5062095},
	author = {Bender,A. and Sherwood,R. and Monner,D. and Goergen,N. and Spring, Neil and Bhattacharjee, Bobby}
}
@conference {17570,
	title = {Capacity of Asynchronous Random-Access Scheduling in Wireless Networks},
	booktitle = {IEEE INFOCOM 2008. The 27th Conference on Computer Communications},
	year = {2008},
	month = {2008/04/13/18},
	pages = {1148 - 1156},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question we answer is: how should we set the channel-access probability for each link in the network so that the network operates close to its optimal throughput capacity? We design simple and distributed channel-access strategies for random-access networks which are provably competitive with respect to the optimal scheduling strategy, which is deterministic, centralized, and computationally infeasible. We show that the competitiveness of our strategies are nearly the best achievable via random-access scheduling, thus establishing fundamental limits on the performance of random- access. A notable outcome of our work is that random access compares well with deterministic scheduling when link transmission durations differ by small factors, and much worse otherwise. The distinguishing aspects of our work include modeling and rigorous analysis of asynchronous communication, asymmetry in link transmission durations, and hidden terminals under arbitrary link-conflict based wireless interference models.},
	keywords = {asynchronous random-access scheduling, channel access probability, Computer networks, Computer science, Educational institutions, Interference, Optimal scheduling, Peer to peer computing, probability, Processor scheduling, radio link, radio links, radio networks, Routing, scheduling, Throughput, throughput capacity, wireless channels, Wireless networks},
	isbn = {978-1-4244-2025-4},
	doi = {10.1109/INFOCOM.2008.170},
	author = {Chafekar,D. and Levin,D. and Kumar,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind}
}
@conference {15689,
	title = {Alternative custodians for congestion control in delay tolerant networks},
	booktitle = {Proceedings of the 2006 SIGCOMM workshop on Challenged networks},
	series = {CHANTS {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {229 - 236},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {delay tolerant network, Routing},
	isbn = {1-59593-572-X},
	doi = {10.1145/1162654.1162660},
	url = {http://doi.acm.org/10.1145/1162654.1162660},
	author = {Seligman,Matthew and Fall,Kevin and Mundur, Padma}
}
@article {18577,
	title = {In VINI veritas: realistic and controlled network experimentation},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {36},
	year = {2006},
	month = {2006/08//},
	pages = {3 - 14},
	abstract = {This paper describes VINI, a virtual network infrastructure that allows network researchers to evaluate their protocols and services in a realistic environment that also provides a high degree of control over network conditions. VINI allows researchers to deploy and evaluate their ideas with real routing software, traffic loads, and network events. To provide researchers flexibility in designing their experiments, VINI supports simultaneous experiments with arbitrary network topologies on a shared physical infrastructure. This paper tackles the following important design question: What set of concepts and techniques facilitate flexible, realistic, and controlled experimentation (e.g., multiple topologies and the ability to tweak routing algorithms) on a fixed physical infrastructure? We first present VINI{\textquoteright}s high-level design and the challenges of virtualizing a single network. We then present PL-VINI, an implementation of VINI on PlanetLab, running the "Internet In a Slice". Our evaluation of PL-VINI shows that it provides a realistic and controlled environment for evaluating new protocols and services.},
	keywords = {architecture, experimentation, Internet, Routing, virtualization},
	isbn = {0146-4833},
	doi = {10.1145/1151659.1159916},
	url = {http://doi.acm.org/10.1145/1151659.1159916},
	author = {Bavier,Andy and Feamster, Nick and Huang,Mark and Peterson,Larry and Rexford,Jennifer}
}
@conference {18575,
	title = {Implications of autonomy for the expressiveness of policy routing},
	booktitle = {Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications},
	series = {SIGCOMM {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {25 - 36},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain routing system enables each AS to express policy using rankings that determine how each router inthe AS chooses among different routes to a destination, and filters that determine which routes are hidden from each neighboring AS. Because the Internet is composed of many independent, competing networks, the interdomain routing system should provide autonomy, allowing network operators to set their rankings independently, and to have no constraints on allowed filters. This paper studies routing protocol stability under these conditions. We first demonstrate that certain rankings that are commonly used in practice may not ensure routing stability. We then prove that, when providers can set rankings and filters autonomously, guaranteeing that the routing system will converge to a stable path assignment essentially requires ASes to rank routes based on AS-path lengths. We discuss the implications of these results for the future of interdomain routing.},
	keywords = {autonomy, BGP, Internet, policy, protocol, Routing, Safety, stability},
	isbn = {1-59593-009-4},
	doi = {10.1145/1080091.1080096},
	url = {http://doi.acm.org/10.1145/1080091.1080096},
	author = {Feamster, Nick and Johari,Ramesh and Balakrishnan,Hari}
}
@conference {12280,
	title = {Measurement-based multipath multicast},
	booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE},
	volume = {4},
	year = {2005},
	month = {2005/03//},
	pages = {2803 - 2808 vol. 4 - 2803 - 2808 vol. 4},
	abstract = {We propose a measurement-based routing algorithm to load balance intradomain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application-layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities.},
	keywords = {algorithm;, allocation;, application-layer, approximation, approximation;, balance, communication;, Convergence, convergence;, intradomain, load, measurement-based, methods;, Multicast, multipath, network, numerical, of, overlaying;, perturbation, processes;, resource, Routing, routing;, source;, Stochastic, techniques;, Telecommunication, theory;, traffic;},
	doi = {10.1109/INFCOM.2005.1498566},
	author = {Guven,T. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby}
}
@conference {12291,
	title = {Measurement based optimal multi-path routing},
	booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies},
	volume = {1},
	year = {2004},
	month = {2004/03//},
	pages = {187 - 196},
	abstract = {We propose a new architecture for efficient network monitoring and measurements in a traditional IP network. This new architecture enables establishment of multiple paths (tunnels) between source-destination pairs without having to modify the underlying routing protocol(s). Based on the proposed architecture we propose a measurement-based multipath routing algorithm derived from simultaneous perturbation stochastic approximation. The proposed algorithm does not assume that the gradient of analytical cost function is known to the algorithm, but rather relies on noisy estimates from measurements. Using the analytical model presented in the paper we prove the convergence of the algorithm to the optimal solution. Simulation results are presented to demonstrate the advantages of the proposed algorithm under a variety of network scenarios. A comparative study with an existing optimal routing algorithm, MATE, is also provided},
	keywords = {algorithm;network, approximation;routing, IP, measurement;network, monitoring;optimization;perturbation, multipath, network;measurement-based, networks;Internet;optimisation;routing, processes;, protocol;IP, protocols;stochastic, Routing, Stochastic},
	doi = {10.1109/INFCOM.2004.1354493},
	author = {Guven,T. and Kommareddy,C. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby}
}
@article {18542,
	title = {A model of BGP routing for network engineering},
	journal = {SIGMETRICS Perform. Eval. Rev.},
	volume = {32},
	year = {2004},
	month = {2004/06//},
	pages = {331 - 342},
	abstract = {The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of the Internet can all degrade performance. To maintain good performance, network operators must continually reconfigure the routing protocols. Operators configure BGP to control how traffic flows to neighboring Autonomous Systems (ASes), as well as how traffic traverses their networks. However, because BGP route selection is distributed, indirectly controlled by configurable policies, and influenced by complex interactions with intradomain routing protocols, operators cannot predict how a particular BGP configuration would behave in practice. To avoid inadvertently degrading network performance, operators need to evaluate the effects of configuration changes before deploying them on a live network. We propose an algorithm that computes the outcome of the BGP route selection process for each router in a single AS, given only a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe a BGP emulator based on this algorithm; the emulator exploits the unique characteristics of routing data to reduce computational overhead. Using data from a large ISP, we show that the emulator correctly computes BGP routing decisions and has a running time that is acceptable for many tasks, such as traffic engineering and capacity planning.},
	keywords = {BGP, modeling, Routing, traffic engineering},
	isbn = {0163-5999},
	doi = {10.1145/1012888.1005726},
	url = {http://doi.acm.org/10.1145/1012888.1005726},
	author = {Feamster, Nick and Winick,Jared and Rexford,Jennifer}
}
@conference {13343,
	title = {Using state modules for adaptive query processing},
	booktitle = {19th International Conference on Data Engineering, 2003. Proceedings},
	year = {2003},
	month = {2003/03/05/8},
	pages = {353 - 364},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed adaptively by an eddy routing operator [R. Avnur et al., (2000)]. Breaking the encapsulation of joins serves two purposes. First, it allows the eddy to observe multiple physical operations embedded in a join algorithm, allowing for better calibration and control of these operations. Second, the SteM on a relation serves as a shared materialization point, enabling multiple competing access methods to share results, which can be leveraged by multiple competing join algorithms. Our architecture extends prior work significantly, allowing continuously adaptive decisions for most major aspects of traditional query optimization: choice of access methods and join algorithms, ordering of operators, and choice of a query spanning tree. SteMs introduce significant routing flexibility to the eddy, enabling more opportunities for adaptation, but also introducing the possibility of incorrect query results. We present constraints on eddy routing through SteMs that ensure correctness while preserving a great deal of flexibility. We also demonstrate the benefits of our architecture via experiments in the Telegraph dataflow system. We show that even a simple routing policy allows significant flexibility in adaptation, including novel effects like automatic "hybridization " of multiple algorithms for a single join.},
	keywords = {adaptive query processing, Bandwidth, Calibration, data encapsulation, data structure, Data structures, Databases, Dictionaries, eddy routing, eddy routing operator, Encapsulation, join operator, multiple algorithm automatic hybridization, multiple competing join algorithm, query architecture, Query processing, query spanning tree, Routing, routing policy, Runtime, shared materialization point, State Module, SteMs, Telegraph dataflow system, Telegraphy, Tree data structures},
	isbn = {0-7803-7665-X},
	doi = {10.1109/ICDE.2003.1260805},
	author = {Vijayshankar Raman and Deshpande, Amol and Hellerstein,J. M}
}
@article {17555,
	title = {Approximating low-congestion routing and column-restricted packing problems},
	journal = {Information Processing Letters},
	volume = {74},
	year = {2000},
	month = {2000/04//},
	pages = {19 - 25},
	abstract = {We contribute to a body of research asserting that the fractional and integral optima of column-sparse integer programs are {\textquotedblleft}nearby{\textquotedblright}. This yields improved approximation algorithms for some generalizations of the knapsack problem, with applications to low-congestion routing in networks, file replication in distributed databases, and other packing problems.},
	keywords = {algorithms, Approximation algorithms, integer programming, Packing, Routing},
	isbn = {0020-0190},
	doi = {10.1016/S0020-0190(00)00033-8},
	url = {http://www.sciencedirect.com/science/article/pii/S0020019000000338},
	author = {Baveja,Alok and Srinivasan, Aravind}
}
@article {17560,
	title = {Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems},
	journal = {Mathematics of Operations ResearchMathematics of Operations Research},
	volume = {25},
	year = {2000},
	month = {2000/05/01/},
	pages = {255 - 280},
	abstract = {Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests. We present improved approximation algorithms and/or integrality gaps for all problems considered; the central theme of this work is the underlying multicommodity flow relaxation. Applications of these techniques to approximating families of packing integer programs are also presented.},
	keywords = {Approximation algorithms, Disjoint paths, integer programming, Linear programming, multicommodity flow, Packing, randomized algorithms, rounding, Routing, unsplittable flow},
	isbn = {0364-765X, 1526-5471},
	doi = {10.1287/moor.25.2.255.12228},
	url = {http://mor.journal.informs.org/content/25/2/255},
	author = {Baveja,Alok and Srinivasan, Aravind}
}
@conference {17627,
	title = {Multicommodity flow and circuit switching},
	booktitle = {, Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998},
	volume = {7},
	year = {1998},
	month = {1998/01/06/9},
	pages = {459-465 vol.7 - 459-465 vol.7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Given a set of request pairs in a network, the problem of routing virtual circuits with low congestion is to connect each pair by a path so that few paths use the same link in the network. We build on an earlier multicommodity flow based approach of Leighton and Rao (1996) to show that short flow paths lead to path selections with low congestion. This shows that such good path selections exist for constant-degree expanders with strong expansion, generalizing a result of (Broder et al., 1994). We also show, for infinitely many n, n-vertex undirected graphs Gn along with a set T of connection requests, such that: T is fractionally realizable using flow-paths that impose a (fractional) congestion of at most 1; but any rounding of such a flow to the given set of flow-paths, leads to a congestion of Ω(log n/log log n). This is progress on a long-standing open problem},
	keywords = {Application software, Bandwidth, circuit switching, Computer science, constant-degree expanders, graph theory, High speed integrated circuits, Integrated circuit technology, Laboratories, low congestion, MATHEMATICS, multicommodity flow, National electric code, network routing, path selections, Routing, short flow paths, Switching circuits, switching theory, undirected graphs, virtual circuit routing},
	isbn = {0-8186-8255-8},
	doi = {10.1109/HICSS.1998.649241},
	author = {Leighton,T. and Rao,S. and Srinivasan, Aravind}
}
@conference {17607,
	title = {Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems},
	booktitle = {, 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings},
	year = {1997},
	month = {1997/10/20/22},
	pages = {416 - 425},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present improved approximation algorithms for a family of problems involving edge-disjoint paths and unsplittable flow, and for some related routing problems. The central theme of all our algorithms is the underlying multi-commodity flow relaxation},
	keywords = {Approximation algorithms, Bandwidth, Channel allocation, computational complexity, Computer science, edge-disjoint paths, graph theory, High speed integrated circuits, IEL, Image motion analysis, Information systems, multi-commodity flow relaxation, Multiprocessor interconnection networks, network routing, Optical fiber networks, Routing, routing problems, unsplittable flow},
	isbn = {0-8186-8197-7},
	doi = {10.1109/SFCS.1997.646130},
	author = {Srinivasan, Aravind}
}
