Sat, 26 Jul 2008 04:38:12 BST CiteULike: Tag scalable http://www.citeulike.org/tag/scalable CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/xsu/article/775004 <i>Circuits and Systems for Video Technology, IEEE Transactions on, Vol. 16, No. 7. (2006), pp. 889-895.</i><br /><br />Scalable video coding is an ongoing standard, and the current working draft (WD) is an extension of H.264/AVC. In the WD, an exhaustive search technique is employed to select the best coding mode for each macroblock. This technique achieves the highest possible coding efficiency, but it results in extremely large encoding time which obstructs it from practical use. This paper proposes a fast mode decision algorithm for inter-frame coding for spatial, coarse grain signal-to-noise ratio, and temporal scalability. It makes use of the mode-distribution correlation between the base layer and enhancement layers. Specifically, after the exhaustive search technique is performed at the base layer, the candidate modes for enhancement layers can be reduced to a small number based on the correlation. Experimental results show that the fast mode decision scheme reduces the computational complexity significantly with negligible coding loss and bit-rate increases. Fast Mode Decision Algorithm for Inter-Frame Coding in Fully Scalable Video Coding H Li ZG Li C Wen Circuits and Systems for Video Technology, IEEE Transactions on, Vol. 16, No. 7. (2006), pp. 889-895. 2006-07-26T21:13:12-00:00 2006 Circuits and Systems for Video Technology, IEEE Transactions on 16 7 889 895 coding scalable video http://www.citeulike.org/user/willbyrne/article/264930 <i>(1999), pp. 52-66.</i> Scalable and Flexible Location-Based Services for Ubiquitous Information Access Rui José Nigel Davies (1999), pp. 52-66. 2005-07-26T11:01:35-00:00 1999 52 66 Springer-Verlag context location scalable ubiquitous http://www.citeulike.org/user/vandywutj/article/4300 <i>Vol. 31, No. 4. (October 2001), pp. 161-172.</i> A scalable content-addressable network Sylvia Ratnasamy Paul Francis Mark Handley Richard Karp Scott Schenker doi:10.1145/383059.383072 Vol. 31, No. 4. (October 2001), pp. 161-172. 2004-12-20T08:37:21-00:00 2001 31 4 161 172 ACM Press content-addressable-network multicast scalable http://www.citeulike.org/user/vandywutj/article/345317 <i>Vol. 32, No. 4. (October 2002), pp. 205-217.</i> Scalable application layer multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy doi:10.1145/633025.633045 Vol. 32, No. 4. (October 2002), pp. 205-217. 2005-10-08T02:35:59-00:00 2002 32 4 205 217 ACM Press application-level multicast scalable http://www.citeulike.org/user/tvanas/article/157604 <i>Design & Test of Computers, IEEE, Vol. 22, No. 2. (2005), pp. 136-148.</i><br /><br />Editor's note: Coarse-grained reconfigurable platforms are good for parallel data-intensive applications but inefficient for sequential control-dominated code. This article (selected from the best of the SBCCI 2003 papers) explores the integration of the general-purpose, Sparc-compliant Leon processor with the Extreme Processing Platform reconfigurable data path. The integration's goal is to optimize the execution of complex multimedia applications such as MPEG-4.--Fadi J. Kurdahi, University of California, Irvine Scalable Processor Instruction Set Extension J Becker A Thomas Design & Test of Computers, IEEE, Vol. 22, No. 2. (2005), pp. 136-148. 2005-04-10T15:38:49-00:00 2005 Design & Test of Computers, IEEE 22 2 136 148 processor scalable http://www.citeulike.org/user/thiagomanel/article/2308511 <i>ACM Trans. Comput. Syst., Vol. 6, No. 1. (February 1988), pp. 51-81.</i> Scale and performance in a distributed file system John Howard Michael Kazar Sherri Menees David Nichols M Satyanarayanan Robert Sidebotham Michael West doi:10.1145/35037.35059 ACM Trans. Comput. Syst., Vol. 6, No. 1. (February 1988), pp. 51-81. 2008-01-30T21:18:18-00:00 1988 ACM Trans. Comput. Syst. 0734-2071 6 1 51 81 ACM andrew-benchmark distributed filesystem performance scalable http://www.citeulike.org/user/sqazi/article/695022 <i>SIGOPS Oper. Syst. Rev., Vol. 40, No. 1. (January 2006), pp. 49-61.</i> Scalable routing overlay networks Akihiro Nakao Larry Peterson Andy Bavier doi:10.1145/1113361.1113372 SIGOPS Oper. Syst. Rev., Vol. 40, No. 1. (January 2006), pp. 49-61. 2006-06-13T16:01:41-00:00 2006 SIGOPS Oper. Syst. Rev. 0163-5980 40 1 49 61 ACM Press monitoring networks overlay scalable http://www.citeulike.org/user/sqazi/article/826179 <i>(2004), pp. 55-66.</i> An algebraic approach to practical and scalable overlay network monitoring Yan Chen David Bindel Hanhee Song Randy Katz doi:10.1145/1015467.1015475 (2004), pp. 55-66. 2006-09-03T03:47:07-00:00 2004 55 66 ACM Press diversity internet monitoring networks overlay path scalable spatial http://www.citeulike.org/user/scottmoody/article/478986 <i></i><br /><br />In this paper, we aim to develop a framework for continuous query processing in spatio-temporal databases. The proposed framework distinguishes itself from other query processors by employing two main paradigms: (1) Scalability in terms of the number of concurrent continuous spatio-temporal queries. (2) Incremental evaluation of continuous spatio-temporal queries. Scalability is achieved thorough employing a shared execution paradigm. Incremental evaluation is achieved through computing... Continuous Query Processing in Spatio-temporal Databases Mohamed Department 2006-01-24T19:04:21-00:00 continuous-query geospatial scalable http://www.citeulike.org/user/scottmoody/article/384299 <i></i><br /><br />In this paper, we identify and analyze a set of characteristics that increasingly distinguish today's complex software systems from "traditional" ones. Several examples in different areas show that these characteristics are not limited to a few application domains but are widespread. Then, we discuss how these characteristics are likely to impact dramatically the very way software systems are modeled and engineered. In particular, we appear to be on the edge of a radical shift of paradigm, ... Towards a Paradigm Change in Computer Science and Software Engineering: A Synthesis Franco Zambonelli Van Dyke 2005-11-08T20:24:30-00:00 3rd-generation ad-hoc affinity agents folksonomy multi-agents paradigm-shift routing scalable http://www.citeulike.org/user/scottmoody/article/478982 <i></i><br /><br />This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA is designed with two goals in mind: (1) Scalability in terms of the number of concurrent continuous spatiotemporal queries, and (2) Incremental evaluation of continuous spatio-temporal queries. SINA achieves scalability by employing a shared execution paradigm where the execution of continuous spatio-temporal queries... SINA: Scalable Incremental Processing of Continuous Queries 2006-01-24T18:50:49-00:00 continuous-query scalable http://www.citeulike.org/user/scottmoody/article/381342 <i>(2001)</i><br /><br />Pervasive networks of micro-sensors and actuators offer to revolutionize the ways in which we understand and construct complex physical systems. Sensor networks must be scalable, long-lived and robust systems, overcoming energy limitations and a lack of pre-installed infrastructure. We explore three themes in the design of self-configuring sensor networks: tuning density to trade operational quality against lifetime; using multiple sensor modalities to obtain robust measurements; and exploiting ... Scalable coordination for wireless sensor networks: Self-conguring localization systems L Nirupama B Deborah E Deborah (2001) 2005-11-05T05:13:56-00:00 2001 ad-hoc directed-diffusion routing scalable sensor-networks sensors wireless http://www.citeulike.org/user/scottmoody/article/276216 <i>(1999), pp. 263-270.</i><br /><br />Networked sensors -- those that coordinate amongst themselves to achieve a larger sensing task -- will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present unique challenges in the design of unattended autonomous sensor networks. These challenges lead us to hypothesize that sensor network coordination applications may need to be structured differently... Next Century Challenges: Scalable Coordination in Sensor Networks Deborah Estrin Ramesh Govindan John Heidemann Satish Kumar (1999), pp. 263-270. 2005-08-07T08:31:08-00:00 1999 263 270 directed-diffusion routing scalable sensor-networks sensors http://www.citeulike.org/user/scottmoody/article/386066 <i></i><br /><br />This paper describes a new peer-to-peer protocol that integrates DHT routing, aggregation, allto -all multicast, as well as both topic- and content-based publish/subscribe. In spite of this extensive set of features, the Willow protocol is simple, scalable, balances the load well across the members, is proximity-aware, adapts to network conditions, and recovers quickly and gracefully from network partitions and subsequent repairs. Willow: DHT, Aggregation, and Publish/Subscribe in One Protocol Robbert van Renesse Adrian Bozdog 2005-11-09T20:20:26-00:00 aggregation dht protocol pub-sub scalable http://www.citeulike.org/user/scottmoody/article/279834 <i>(2001)</i><br /><br />This paper discusses fault-tolerant, scalable solutions to the problem of accurately and scalably calculating global aggregate functions in large process groups communicating over unreliable networks. These groups could represent sensors or processes communicating over a network that is either fixed (eg., the Internet) or dynamic (eg., multihop ad-hoc). Group members are prone to failures. The ability to evaluate global aggregate properties (eg., the average of sensor temperature readings) is... Scalable Fault-tolerant Aggregation in Large Process Groups I Gupta R van Renesse K Birman (2001) 2005-08-12T05:54:12-00:00 2001 aggregation fault-tolerant scalable http://www.citeulike.org/user/scottmoody/article/386056 <i></i><br /><br />This paper addresses fundamental tradeo#s in event systems between scalability (in terms of event filtering, routing, and delivery), expressiveness (when describing interests in events), and event safety (ensuring encapsulation of polymorphic events and type-safe handling of these). We point out some ramifications underlying these tradeo#s and we propose a pragmatic approach to handle them. We achieve scalability using a multi-stage filtering strategy that combines approximate and perfect... Tradeoffs in Event Systems Th P Felber R Guerraoui SB Handurukande 2005-11-09T20:09:40-00:00 content-routing event-notificaiton filtering scalable http://www.citeulike.org/user/scottmoody/article/276789 <i>ACM Transactions on Computer Systems, Vol. 19, No. 3. (2001), pp. 332-383.</i><br /><br />This paper presents SIENA, an event notification service that we have designed and implemented to exhibit both expressiveness and scalability. We describe the service's interface to applications, the algorithms used by networks of servers to select and deliver event notifications, and the strategies used Effort sponsored by the Defense Advanced Research Projects Agency, and Air Force Research Laboratory, Air Force Materiel Command,USAF, under agreement numbers F30602-94-C-0253, F3060297... Design and evaluation of a wide-area event notification service Antonio Carzaniga David Rosenblum Alexander Wolf ACM Transactions on Computer Systems, Vol. 19, No. 3. (2001), pp. 332-383. 2005-08-08T11:47:39-00:00 2001 ACM Transactions on Computer Systems 19 3 332 383 content-addressable content-routing routing scalable semantic-multicast http://www.citeulike.org/user/scottmoody/article/386054 <i>(1998)</i><br /><br />Gryphon is a distributed computing paradigm for message brokering, which is the transferring of information in the form of streams of events from information providers to information consumers. This abstract outlines the major problems in message brokering and Gryphon's approach to solving them. In Gryphon, the flow of streams of events is described via an information flow graph. The information flow graph specifies the selective delivery of events, the transformation of events, and the... Gryphon: An information flow based approach to message brokering R Strom G Banavar T Chandra M Kaplan K Miller B Mukherjee D Sturman M Ward (1998) 2005-11-09T20:06:50-00:00 1998 content-routing event-notificaiton scalable http://www.citeulike.org/user/scottmoody/article/384187 <i>No. TR-00-010. (2000)</i><br /><br />A Scalable Content-Addressable Network by Sylvia Paul Ratnasamy Doctor of Philosophy in Computer Science University of California at Berkeley Dr. Scott Shenker, Co-Chair Prof. Ion Stoica, Co-Chair In May 1999, Shawn Fanning, then a freshman at Northeastern University, launched the rst \peer-to-peer" or P2P le-sharing application Napster. Napster allowed individual end-users (called peers) to share the MP3-encoded music stored on their local computers directly with one another over the ... A Scalable Content Addressable Network Sylvia Ratnasamy Paul Francis Mark Handley Richard Karp Scott Shenker No. TR-00-010. (2000) 2005-11-08T18:55:43-00:00 2000 TR-00-010 content-addressable scalable semantic semantics http://www.citeulike.org/user/scottmoody/article/386049 <i>(2003)</i><br /><br />In content networks, messages are routed on the basis of their content and the interests (subscriptions) of the message consumers. This form of routing offers an interesting alternative to unicast or multicast communication in loosely coupled distributed systems with large number of consumers, with diverse interests, wide geographical dispersion, and heterogeneous resources (e.g., CPU, bandwidth). In this paper, we propose a novel protocol for content-based routing in overlay networks. This... A scalable protocol for content based routing in overlay networks R Chand P Felber (2003) 2005-11-09T20:00:41-00:00 2003 content-routing overlay scalable http://www.citeulike.org/user/scottmoody/article/386045 <i>(2003)</i><br /><br />This paper proposes a routing scheme for contentbased networking. A content-based network is a communication network that features a new advanced communication model where messages are not given explicit destination addresses, and where the destinations of a message are determined by matching the content of the message against selection predicates declared by nodes. Routing in a content-based network amounts to propagating predicates and the necessary topological information in order to... A routing scheme for content-based networking A Carzaniga M Rutherford A Wolf (2003) 2005-11-09T19:58:18-00:00 2003 content-routing scalable http://www.citeulike.org/user/scottmoody/article/380598 <i>(2002)</i><br /><br />With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important research challenge. To indicate the type of content that they are interested in, data consumers typically specify their subscriptions using some XML pattern specification language (e.g., XPath). Tree Pattern Aggregation for Scalable XML Data Dissemination C Chan W Fan P Felber M Garofalakis R Rastogi (2002) 2005-11-04T14:30:26-00:00 2002 routing scalable xml http://www.citeulike.org/user/scottmoody/article/386131 <i>(1999)</i> An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems (1999) 2005-11-10T00:47:22-00:00 1999 1063-6927 IEEE Computer Society affinity content-routing protocol scalable semantic-multicast http://www.citeulike.org/user/scottmoody/article/386008 <i></i><br /><br />The EYES project (IST-2001-34734) is a three years European research project on self-organizing and collaborative energy-efficient sensor networks. It will address the convergence of distributed information processing, wireless communications, and mobile computing. Semantic Addressing for Wireless Sensor Networks Vlado Handziski Andreas Köpke Et 2005-11-09T19:37:25-00:00 content-addressable dht scalable sensor-networks wireless http://www.citeulike.org/user/scottmoody/article/368051 <i>(26 September 2005)</i><br /><br />How do you find your way in an age of information overload? How can you filter streams of complex information to pull out only what you want? Why does it matter how information is structured when Google seems to magically bring up the right answer to your questions? What does it mean to be "findable" in this day and age? This eye-opening new book examines the convergence of information and connectivity. Written by Peter Morville, author of the groundbreaking <i>Information Architecture for the World Wide Web</i>, the book defines our current age as a state of unlimited findability. In other words, anyone can find anything at any time. Complete navigability. <p> Morville discusses the Internet, GIS, and other network technologies that are coming together to make unlimited findability possible. He explores how the melding of these innovations impacts society, since Web access is now a standard requirement for successful people and businesses. But before he does that, Morville looks back at the history of wayfinding and human evolution, suggesting that our fear of being lost has driven us to create maps, charts, and now, the mobile Internet.</p> <p> The book's central thesis is that information literacy, information architecture, and usability are all critical components of this new world order. Hand in hand with that is the contention that only by planning and designing the best possible software, devices, and Internet, will we be able to maintain this connectivity in the future. Morville's book is highlighted with full color illustrations and rich examples that bring his prose to life.</p> <p> <i>Ambient Findability</i> doesn't preach or pretend to know all the answers. Instead, it presents research, stories, and examples in support of its novel ideas. Are we truly at a critical point in our evolution where the quality of our digital networks will dictate how we behave as a species? Is findability indeed the primary key to a successful global marketplace in the 21st century and beyond. Peter Morville takes you on a thought-provoking tour of these memes and more -- ideas that will not only fascinate but will stir your creativity in practical ways that you can apply to your work immediately.</p> <p> <i>"A lively, enjoyable and informative tour of a topic that's only going to become more important."</i><br> --David Weinberger, Author, <i>Small Pieces Loosely Joined</i> and <i>The Cluetrain Manifesto</i></br></p> <p> <i>"I envy the young scholar who finds this inventive book, by whatever strange means are necessary. The future isn't just unwritten--it's unsearched."</i><br> --Bruce Sterling, Writer, Futurist, and Co-Founder, The Electronic Frontier Foundation</br></p> <p> <i>"Search engine marketing is the hottest thing in Internet business, and deservedly so. Ambient Findability puts SEM into a broader context and provides deeper insights into human behavior. This book will help you grow your online business in a world where being found is not at all certain."</i><br> --Jakob Nielsen, Ph.D., Author, <i>Designing Web Usability: The Practice of Simplicity</i></br></p> <p> <i>"Information that's hard to find will remain information that's hardly found--from one of the fathers of the discipline of information architecture, and one of its most experienced practitioners, come penetrating observations on why findability is elusive and how the act of seeking changes us."</i><br> --Steve Papa, Founder and Chairman, Endeca</br></p> <p> <i>"Whether it's a fact or a figure, a person or a place, Peter Morville knows how to make it findable. Morville explores the possibilities of a world where everything can always be found--and the challenges in getting there--in this wide-ranging, thought-provoking book."</i><br> --Jesse James Garrett, Author, <i>The Elements of User Experience</i></br></p> <p> <i>"It is easy to assume that current searching of the World Wide Web is the last word in finding and using information. Peter Morville shows us that search engines are just the beginning. Skillfully weaving together information science research with his own extensive experience, he develops for the reader a feeling for the near future when information is truly findable all around us. There are immense implications, and Morville's lively and humorous writing brings them home."</i><br> --Marcia J. Bates, Ph.D., University of California Los Angeles</br></p> <p> <i>"I've always known that Peter Morville was smart. After reading Ambient Findability, I now know he's (as we say in Boston) wicked smart. This is a timely book that will have lasting effects on how we create our future.</i><br> --Jared Spool, Founding Principal, User Interface Engineering</br></p> <p> <i>"In Ambient Findability, Peter Morville has put his mind and keyboard on the pulse of the electronic noosphere. With tangible examples and lively writing, he lays out the challenges and wonders of finding our way in cyberspace, and explains the mutually dependent evolution of our changing world and selves. This is a must read for everyone and a practical guide for designers."</i><br> --Gary Marchionini, Ph.D., University of North Carolina</br></p> <p> <i>"Find this book! Anyone interested in making information easier to find, or understanding how finding and being found is changing, will find this thoroughly researched, engagingly written, literate, insightful and very, very cool book well worth their time. Myriad examples from rich and varied domains and a valuable idea on nearly every page. Fun to read, too!</i><br> --Joseph Janes, Ph.D., Founder, Internet Public Library</br></p> Ambient Findability Peter Morville (26 September 2005) 2005-10-27T18:31:13-00:00 2005 O'Reilly Media, Inc. affinity folksonomy scalable scale-free http://www.citeulike.org/user/scottmoody/article/350487 <i>Lecture Notes in Computer Science, Vol. 2218 (2001), pp. 329-??.</i><br /><br />This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems Antony Rowstron Peter Druschel Lecture Notes in Computer Science, Vol. 2218 (2001), pp. 329-??. 2005-10-14T07:27:11-00:00 2001 Lecture Notes in Computer Science 2218 329 ?? peer-to-peer routing scalable http://www.citeulike.org/user/scottmoody/article/381864 <i>(2003)</i><br /><br />Middleware components are becoming increasingly important as applications share computational resources in distributed environments, such as high-end clusters with ever larger number of processors, computational grids and increasingly large server farms. One of the main challenges in such environments is to achieve scalability of synchronization. In general, concurrency services arbitrate resource requests in distributed systems. But concurrency protocols currently lack scalability. Adding such ... Scalable hierarchical locking for distributed systems N Desai F Mueller (2003) 2005-11-05T16:13:17-00:00 2003 aggregation distributed scalable http://www.citeulike.org/user/scottmoody/article/386105 <i>(2002), pp. 59-68.</i> Content-Based Networking: A New Communication Infrastructure Antonio Carzaniga Alexander Wolf (2002), pp. 59-68. 2005-11-09T22:23:29-00:00 2002 59 68 Springer-Verlag content-addressable content-routing scalable semantic-multicast http://www.citeulike.org/user/scottmoody/article/101878 <i>(2002)</i> Linked Albert-Laszlo Barabasi (2002) 2005-02-23T08:12:07-00:00 2002 Perseus Publishing affinity aggregation scalable scale-free http://www.citeulike.org/user/scottmoody/article/819776 <i>(2005), pp. 82-85.</i> Scalable interest management for multidimensional routing space Elvis Liu Milo Yip Gino Yu doi:10.1145/1101616.1101633 (2005), pp. 82-85. 2006-08-28T15:50:55-00:00 2005 82 85 ACM Press interest-management scalable http://www.citeulike.org/user/scottmoody/article/478991 <i>(2003)</i><br /><br />QRK(S T(UVHL64 L?W6XR4Y"J+L"*64H!HL"*N*XZ6H L "4 L?[ 4 !HL"*N*XZ6H 29050 - LT4HLT, T4HLT 23100-4 X^, 060-46520 23100-47570 H 2 LHL]EFc1 16570-46520 L"Pfe*(H!L( \(-d"G"!"]L G 0-45480 Towards Scalable Location-aware Services: Requirements and Research Issues M Mokbel W Aref S Hambrusch S Prabhakar (2003) 2006-01-24T19:09:55-00:00 2003 continuous-query geospatial scalable http://www.citeulike.org/user/scottmoody/article/478990 <i></i><br /><br />Real-time spatio-temporal query processing needs to e#ectively handle a large number of moving objects and continuous spatio-temporal queries. In this paper, we use shared execution as a mechanism to support scalability in location-aware servers. Our main idea is to maintain a query table that stores information about continuous spatio-temporal queries. Then, answering spatio-temporal queries is abstracted as a spatial join among the moving objects and queries. Three query join policies are... Scalable Spatio-temporal Continuous Query Processing for Location-Aware Services Xiaopeng Xiong Mohamed Mokbel Walid Aref Susanne Hambrusch Sunil Prabhakar 2006-01-24T19:07:51-00:00 continuous-query geospatial scalable http://www.citeulike.org/user/scottmoody/article/389123 <i>(2002)</i><br /><br />In the span of only a few years, the Internet has experienced an astronomical increase in the use of specialized content delivery systems, such as content delivery networks and peer-to-peer file sharing systems. Therefore, an understanding of content delivery on the Internet now requires a detailed understanding of how these systems are used in practice. An analysis of internet content delivery systems S Saroiu K Gummadi R Dunn S Gribble H Levy (2002) 2005-11-11T19:24:01-00:00 2002 content-addressable content-delivery internet scalable http://www.citeulike.org/user/scottmoody/article/364580 <i></i><br /><br />Experimentally it has been found that any two people in the world, chosen at random, are connected to one another by a short chain of intermediate acquaintances, of typical length about six. This phenomenon, colloquially referred to as the six degrees of separation, has been the subject of a considerable amount of recent research and modeling, which we review here. Small worlds: The structure of social networks M Newman 2005-10-25T13:51:54-00:00 scalable http://www.citeulike.org/user/scottmoody/article/300020 <i>(2003), pp. 29-43.</i> The Google file system Sanjay Ghemawat Howard Gobioff Shun-Tak Leung doi:10.1145/945445.945450 (2003), pp. 29-43. 2005-08-21T12:10:11-00:00 2003 29 43 ACM Press discovery dissemination event-notificaiton scalable http://www.citeulike.org/user/scottmoody/article/92972 <i>(2001), pp. 149-160.</i><br /><br />Efficiently determining the node that stores a data item in a distributed network is an important and challenging problem. This paper describes the motivation and design of the Chord system, a decentralized lookup service that stores key/value pairs for such networks. The Chord protocol takes as input an m-bit identifier (derived by hashing a higher-level application specific key), and returns the node that stores the value corresponding to that key. Each Chord node is identified by an m-bit... Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications Ion Stoica Robert Morris David Karger Frans Kaashoek Hari Balakrishnan (2001), pp. 149-160. 2005-02-11T05:09:41-00:00 2001 149 160 dht peer-to-peer scalable http://www.citeulike.org/user/scottmoody/article/398088 <i></i><br /><br />In this work, we propose a Two-tier Overlay Multicast Architecture (TOMA) to provide scalable and efficient multicast support for a variety of group communication applications. In TOMA, Multicast Service Overlay Network (MSON) is advocated as the backbone service domain, while end users in the access domains form a number of small clusters, in which an application-layer multicast protocol is used for the communication between the clustered end users. Our two-tier architecture is able to provide ... A Viable Solution for Large Scale Multicast Support Jun Cui Li Lao Orang Dialameh 2005-11-17T05:42:30-00:00 multicast overlay scalable http://www.citeulike.org/user/scottmoody/article/472571 <i>(1998)</i><br /><br />this paper we briefly outline our achievements to date. In Section 2, we define more precisely what we mean by the notion of "Internet scale". In Section 3, we describe our design framework for an event observation and notification facility; this framework identifies a spectrum of design choices, which are organized according to seven models. In Section 4 we evaluate one existing technology, the CORBA Event Service, with respect to this design framework. We conclude in Section 5 with a... Critical Considerations and Designs for Internet-Scale D Rosenblum A Wolf A Carzaniga (1998) 2006-01-20T15:53:40-00:00 1998 content-routing scalable http://www.citeulike.org/user/scottmoody/article/279818 <i>(2002)</i><br /><br />We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data delivery trees with desirable properties. Scalable application layer multicast S Banerjee B Bhattacharjee C Kommareddy (2002) 2005-08-12T04:58:18-00:00 2002 overlay scalable http://www.citeulike.org/user/scottmoody/article/387527 <i>(2004)</i><br /><br />Publish/subscribe systems have demonstrated the ability to scale to large numbers of users and high data rates when providing content-based data dissemination services on the Internet. However, their services are limited by the data semantics and query expressiveness that they support. On the other hand, the recent work on selective dissemination of XML data has made significant progress in moving from XML filtering to the richer functionality of transformation for result customization, ... Towards an Internet-Scale XML Dissemination Service Y Diao S Rizvi M Franklin (2004) 2005-11-11T00:28:46-00:00 2004 scalable semantic-multicast xml http://www.citeulike.org/user/scis0000001/article/849696 <i>(94)</i><br /><br />this paper we describe the BSP model and discuss some of the developments in architecture, algorithms and programming languages which are currently being pursued as part of this new, unified approach to scalable parallel computing. Keyword Codes: C.1.2; D.1.3; F.1.1 Keywords: Multiprocessors; Concurrent Programming; Models of Computation Scalable Parallel Computing: A Grand Unified Theory and its Practical Development WF Mccoll (94) 2006-09-19T12:15:07-00:00 Elsevier computing parallel parallelity scalability scalable scale theory http://www.citeulike.org/user/p2pstreaming/article/695313 <i>Multimedia Systems, Vol. 10, No. 5. (2005), pp. 413-421.</i> Optimizing transmission time of scalable coded images in peer-to-peer networks Xiao Su Rod Fatoohi Tao Wang doi:10.1007/s00530-005-0170-y Multimedia Systems, Vol. 10, No. 5. (2005), pp. 413-421. 2006-06-13T23:09:39-00:00 2005 Multimedia Systems 10 5 413 421 optimization peer-to-peer scalable http://www.citeulike.org/user/p2pstreaming/article/2831646 <i>Circuits and Systems for Video Technology, IEEE Transactions on, Vol. 17, No. 9. (2007), pp. 1103-1120.</i><br /><br />With the introduction of the H.264/AVC video coding standard, significant improvements have recently been demonstrated in video compression capability. The Joint Video Team of the ITU-T VCEG and the ISO/IEC MPEG has now also standardized a Scalable Video Coding (SVC) extension of the H.264/AVC standard. SVC enables the transmission and decoding of partial bit streams to provide video services with lower temporal or spatial resolutions or reduced fidelity while retaining a reconstruction quality that is high relative to the rate of the partial bit streams. Hence, SVC provides functionalities such as graceful degradation in lossy transmission environments as well as bit rate, format, and power adaptation. These functionalities provide enhancements to transmission and storage applications. SVC has achieved significant improvements in coding efficiency with an increased degree of supported scalability relative to the scalable profiles of prior video coding standards. This paper provides an overview of the basic concepts for extending H.264/AVC towards SVC. Moreover, the basic tools for providing temporal, spatial, and quality scalability are described in detail and experimentally analyzed regarding their efficiency and complexity. Overview of the Scalable Video Coding Extension of the H.264/AVC Standard H Schwarz D Marpe T Wiegand doi:10.1109/TCSVT.2007.905532 Circuits and Systems for Video Technology, IEEE Transactions on, Vol. 17, No. 9. (2007), pp. 1103-1120. 2008-05-25T21:05:24-00:00 2007 Circuits and Systems for Video Technology, IEEE Transactions on 17 9 1103 1120 coding h264 scalable video http://www.citeulike.org/user/p2pstreaming/article/2776603 <i>Packet Video 2007 (2007), pp. 173-181.</i><br /><br />Peer-to-peer (P2P) networks represent a valuable architecture for streaming video over the Internet. In these systems, users contribute their resources to relay the media to others and no dedicated infrastructure is required. In order to ensure a low end-to-end delay, P2P overlay networks are often organized as a set of complementary multicast trees. The source of the stream multiplexes the data on top of these trees and the routing of packets is statically defined. In this scenario, the reliability of the overlay links is critical for the performance of the system since temporary link failure or network congestion can cause a significant disruption of the end-user quality. The novel Scalable Video Coding (SVC) standard enables efficient usage of the network capacity by allowing intermediate high capacity nodes in the overlay network to dynamically extract layers from the scalable bit stream to serve less capable peers. On the other hand, SVC incurs a certain loss in terms of coding efficiency with respect to H.264/AVC single-layer coding. We propose a simple model that allows to evaluate the trade-off of using a scalable codec with respect to single-layer coding, given the distribution of the receivers&#x2019; capacities in an error-free network. We also report experimental results obtained by using SVC on top of a real-time implementation of the Stanford Peer-to-Peer Multicast (SPPM) protocol that clearly show the benefits of a prioritization mechanism to react to network congestion. Low-delay peer-to-peer streaming using scalable video coding Pierpaolo Baccichet Thomas Schierl Thomas Wiegand Bernd Girod doi:10.1109/PACKET.2007.4397039 Packet Video 2007 (2007), pp. 173-181. 2008-05-09T20:50:52-00:00 2007 Packet Video 2007 173 181 delay peer-to-peer scalable http://www.citeulike.org/user/ovuncozturk/article/2943785 <i>Ontology Management (2008), pp. 89-128.</i><br /><br />Reasoning with large amounts of data together with ontological knowledge is becoming a pertinent issue. In this chapter, we will give an overviewof wellknown ontology repositories, including native stores and database based stores, and highlight strengths and limitations of each store. We take Minerva as an example to analyze ontology storage in databases in depth, as well as to discuss efficient indexes for scaling up ontology repositories. We then discuss a scalable reasoning method for handling expressive ontologies, as well as summarize other similar approaches. We will subsequently delve into the details of one particular ontology language based on Description Logics called WSML-DL and show that reasoning with this language can be done by a transformation from WSML-DL to OWL DL and support all main DL-specific reasoning tasks. Finally, we illustrate reasoning and its relevance by showing a reasoning example in a practical business context by presenting the Semantic Business Process Repository (SBPR) for systemical management of semantic business process models. As part of this, we analyze the main requirements on a such a repository. We then compare different approaches for storage mechanisms for this purpose and show how a RDBMS in combination with the IRIS inference engine provides a suitable solution that deals well with the expressiveness of the query language and the required reasoning capabilities even for large amounts of instance data. Keywords: business repository; IRIS; OWL DL; reasoning with large datasets; Semantic Business Process Management; WSML DL Ontology Reasoning with Large Data Repositories Stijn Heymans Li Ma Darko Anicic Zhilei Ma Nathalie Steinmetz Yue Pan Jing Mei Achille Fokoue Aditya Kalyanpur Aaron Kershenbaum Edith Schonberg Kavitha Srinivas Cristina Feier Graham Hench Branimir Wetzstein Uwe Keller doi:10.1007/978-0-387-69900-4_4 Ontology Management (2008), pp. 89-128. 2008-06-30T11:42:18-00:00 2008 Ontology Management 89 128 reasoning scalable http://www.citeulike.org/user/nus-soc-cs6282/article/276869 <i>IEEEash ACM Transactions on Networking, Vol. 8, No. 3. (2000), pp. 281-293.</i><br /><br />The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we demonstrate the benefits of cache sharing, measure the overhead of the existing protocols, and propose a new protocol called "summary cache." In this new protocol, each proxy keeps a summary of the cache directory of each participating proxy, and checks these summaries for... Summary cache: a scalable wide-area Web cache sharing protocol Li Fan Pei Cao Jussara Almeida Andrei Broder IEEEash ACM Transactions on Networking, Vol. 8, No. 3. (2000), pp. 281-293. 2005-08-08T14:32:38-00:00 2000 IEEEash ACM Transactions on Networking 8 3 281 293 caching scalable http://www.citeulike.org/user/nus-soc-cs6282/article/292942 <i>(2002)</i><br /><br />Epidemic-style (gossip-based) techniques have recently emerged as a scalable class of protocols for peer-to-peer reliable multicast dissemination in large process groups. These protocols provide probabilistic guarantees on reliability and scalability. However, popular implementations of epidemic-style dissemination are reputed to suffer from two major drawbacks: (a) (Network Overhead) when deployed on a WAN-wide or VPN-wide scale they generate a large number of packets that transit across the... Efficient epidemic-style protocols for reliable and scalable multicast I Gupta A Kermarrec A Ganesh (2002) 2005-08-16T03:57:09-00:00 2002 gossip mcast reliable scalable http://www.citeulike.org/user/missiongiraffe/article/1014360 <i>Ad Hoc Networks, Vol. In Press, Uncorrected Proof</i><br /><br />By binding logic addresses to the network topology, routing can be carried out without going through route discovery. This eliminates the initial route discovery latency, saves storage space otherwise needed for routing table, and reduces the communication overhead and energy consumption. In this paper, an adaptive block addressing (ABA) scheme is first introduced for logic address assignment as well as network auto-configuration purpose. The scheme takes into account the actual network topology and thus is fully topology-adaptive. Then a distributed link state (DLS) scheme is further proposed and put on top of the block addressing scheme to improve the quality of routes, in terms of hop count or other routing cost metrics used, robustness, and load balancing. The network topology reflected in logic addresses is used as a guideline to tell towards which direction (rather than next hop) a packet should be relayed. The next hop is derived from each relaying node's local link state table. The routing scheme, named as topology-guided DLS (TDLS) as a whole, scales well with regard to various performance metrics. The ability of TDLS to provide multiple paths also precludes the need for explicit route repair, which is the most complicated part in many wireless routing protocols. While this paper targets low rate wireless mesh personal area networks (LR-WMPANs), including wireless mesh sensor networks (WMSNs), the TDLS itself is a general scheme and can be applied to other non-mobile wireless mesh networks. A resource-efficient and scalable wireless mesh routing protocol Jianliang Zheng Myung Lee doi:10.1016/j.adhoc.2006.11.003 Ad Hoc Networks, Vol. In Press, Uncorrected Proof 2006-12-26T08:06:05-00:00 Ad Hoc Networks In Press, Uncorrected Proof mesh networks routing scalable wireless wmn http://www.citeulike.org/user/MatsKindahl/article/1802395 <i>No. TRCS99-32. (JanuaryMay, 1999)</i><br /><br />In the epidemic model an update is initiated on a single site, and is propagated to other sites in a lazy manner. When combined with version vectors and event logs, this propagation mechanism delivers updates in causal order despite communication failures. We integrate quorums into the epidemic model to processes transactions on replicated data. Causal order helps establish the global serialization order on transactions. Our approach enforces serializability by aborting transactions that may... Epidemic Quorums for Managing Replicated Data J Holliday R Steinke D Agrawal El Abbadi No. TRCS99-32. (JanuaryMay, 1999) 2007-10-21T19:35:39-00:00 1999 TRCS99-32 algorithm algorithms based concurrency concurrent database databases distributed epidemic gossip protocol protocols replicated replication scalable http://www.citeulike.org/user/MatsKindahl/article/1798357 <i>(2000), pp. 117-128.</i><br /><br />Parallel, multithreaded C and C++ programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these applications, the memory allocator is often a bottleneck that severely limits program performance and scalability on multiprocessor systems. Previous allocators suffer from problems that include poor performance and scalability, and heap organizations that introduce false sharing. Worse, many allocators exhibit a dramatic... Hoard: A Scalable Memory Allocator for Multithreaded Applications Emery Berger Kathryn Mckinley Robert Blumofe Paul Wilson (2000), pp. 117-128. 2007-10-20T20:06:35-00:00 2000 117 128 allocation allocator concurrency concurrent memory multi multi-threaded scalable threaded