@conference {19452,
	title = {Helping Users Shop for ISPs with Internet Nutrition Labels},
	booktitle = {ACM SIGCOMM Workshop on Home Networks {\textquoteright}11},
	series = {HomeNets {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {13 - 18},
	publisher = {ACM},
	organization = {ACM},
	abstract = {When purchasing home broadband access from Internet service providers (ISPs), users must decide which service plans are most appropriate for their needs. Today, ISPs advertise their available service plans using only generic upload and download speeds. Unfortunately, these metrics do not always accurately reflect the varying performance that home users will experience for a wide range of applications. In this paper, we propose that each ISP service plan carry a "nutrition label" that conveys more comprehensive information about network metrics along many dimensions, including various aspects of throughput, latency, loss rate, and jitter. We first justify why these metrics should form the basis of a network nutrition label. Then, we demonstrate that current plans that are superficially similar with respect to advertised download rates may have different performance according to the label metrics. We close with a discussion of the challenges involved in presenting a nutrition label to users in a way that is both accurate and easy to understand.},
	keywords = {access networks, benchmarking, bismark, broadband networks, gateway measurements},
	isbn = {978-1-4503-0798-7},
	url = {http://doi.acm.org/10.1145/2018567.2018571},
	author = {Sundaresan, Srikanth and Feamster, Nick and Teixeira, Renata and Tang, Anthony and Edwards, W. Keith and Grinter, Rebecca E. and Marshini Chetty and de Donato, Walter}
}
@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}
}
