@conference {13385,
	title = {Minimizing Communication Cost in Distributed Multi-query Processing},
	booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09},
	year = {2009},
	month = {2009/04/29/March},
	pages = {772 - 783},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in the area of distributed query processing and optimization. In this paper we address a general, distributed multi-query processing problem motivated by the need to minimize the communication cost in these environments. Specifically we address the problem of optimally sharing data movement across the communication edges in a distributed communication network given a set of overlapping queries and query plans for them (specifying the operations to be executed). Most of the problem variations of our general problem can be shown to be NP-Hard by a reduction from the Steiner tree problem. However, we show that the problem can be solved optimally if the communication network is a tree, and present a novel algorithm for finding an optimal data movement plan. For general communication networks, we present efficient approximation algorithms for several variations of the problem. Finally, we present an experimental study over synthetic datasets showing both the need for exploiting the sharing of data movement and the effectiveness of our algorithms at finding such plans.},
	keywords = {Approximation algorithms, Communication networks, Computer science, Cost function, Data engineering, distributed communication network, distributed databases, distributed multi-query processing, grid computing, Large-scale systems, NP-hard, optimisation, Polynomials, Publish-subscribe, publish-subscribe systems, Query optimization, Query processing, sensor networks, Steiner tree problem, Tree graphs, trees (mathematics)},
	isbn = {978-1-4244-3422-0},
	doi = {10.1109/ICDE.2009.85},
	author = {Li,Jian and Deshpande, Amol and Khuller, Samir}
}
@conference {17588,
	title = {Efficient algorithms for location and sizing problems in network design},
	booktitle = {IEEE Global Telecommunications Conference, 2001. GLOBECOM {\textquoteright}01},
	volume = {4},
	year = {2001},
	month = {2001///},
	pages = {2586-2590 vol.4 - 2586-2590 vol.4},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Large-scale location, sizing and homing problems of distributed network elements, have received much attention recently due to the massive deployment of broadband communication networks for services like Internet telephony and Web caching. Key considerations in designing these networks include modularity of capacity, economies of scale in cost, and reliability. We formulate a general class of such network design problems as Mixed-Integer Programs. These problems are computationally intractable in general; under various asymptotic conditions, we show how to compute near-optimal solutions. To deal with arbitrary instances, we develop new algorithms based on linear programming, as well as greedy randomized adaptive search. These algorithms achieved near-optimal solutions with reasonable computation time for our experiments},
	keywords = {Algorithm design and analysis, Broadband communication, broadband communication networks, broadband networks, capacity modularity, Communication networks, computer network reliability, distributed network elements, Economies of scale, greedy randomized adaptive search, homing, integer programming, Intelligent networks, Internet telephony, large-scale location problems, Large-scale systems, Linear programming, mixed-integer programs, near-optimal solutions, network design, Optical switches, randomised algorithms, reliability, search problems, sizing, Technological innovation, telecommunication network planning, Web caching},
	isbn = {0-7803-7206-9},
	doi = {10.1109/GLOCOM.2001.966243},
	author = {Kumaran,K. and Srinivasan, Aravind and Qiong Wang and Lanning,S. and Ramakrishnan,K. G}
}
@conference {14576,
	title = {A distributed algorithm for ear decomposition},
	booktitle = {, Fifth International Conference on Computing and Information, 1993. Proceedings ICCI {\textquoteright}93},
	year = {1993},
	month = {1993/05/27/29},
	pages = {180 - 184},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A distributed algorithm for finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented. At the completion of the algorithm either the ears are correctly labeled or the nodes are informed that there exists no ear decomposition. First we present a novel algorithm to check the existence of an ear decomposition which uses O(m) messages. We also present two other algorithms, one which is time-optimal and the other which is message-optimal to determine the actual ears and their corresponding numbers after determining the existence of an ear decomposition},
	keywords = {Asynchronous communication, asynchronous communication network, Automata, Communication networks, computational complexity, Computer networks, Computer science, decomposition graph, distributed algorithm, distributed algorithms, Distributed computing, Ear, ear decomposition, graph theory, message-optimal, network decomposition, sorting, Testing, time-optimal},
	isbn = {0-8186-4212-2},
	doi = {10.1109/ICCI.1993.315382},
	author = {Hannenhalli, Sridhar and Perumalla,K. and Chandrasekharan,N. and Sridhar,R.}
}
@article {16735,
	title = {MANDATE: managing networks using database technology},
	journal = {IEEE Journal on Selected Areas in Communications},
	volume = {11},
	year = {1993},
	month = {1993/12//},
	pages = {1360 - 1372},
	abstract = {There has been a growing demand for the development of tools to manage enterprise communication networks. A management information database is the heart of a network management system-it provides the interface between all functions of the network management system and, therefore, has to provide sophisticated functionality allied with high performance. The authors introduce the design of MANDATE (MAnaging Networks using DAtabase TEchnology), a proposed database system for effectively supporting the management of large enterprise networks. The MANDATE design makes a conscious attempt to take advantage of the special characteristics of network data and transactions, and of advances in database technology, to efficiently derive some of the required management functionality},
	keywords = {Communication networks, database management systems, enterprise communication networks, Heart, Information management, interface, internetworking, Local area networks, management functionality, management information database, managing networks using database technology, MANDATE, Manufacturing, network operating systems, open systems, Optical fiber cables, Research and development management, Technology management, telecommunication network management, Transaction databases, wide area networks},
	isbn = {0733-8716},
	doi = {10.1109/49.257929},
	author = {Haritsa,J. R and Ball,M. O and Roussopoulos, Nick and Datta,A. and Baras,J. S}
}
