Sun, 27 Jul 2008 08:21:05 BST CiteULike: mediallo's library [61 articles] http://www.citeulike.org/user/mediallo CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/mediallo/article/2826719 <i>(2004), pp. 254-273.</i> Meghdoot: content-based publish/subscribe over P2P networks Abhishek Gupta Ozgur Sahin Divyakant Agrawal Amr Abbadi (2004), pp. 254-273. 2008-05-23T17:54:10-00:00 2004 254 273 Springer-Verlag New York, Inc. dht pubsub http://www.citeulike.org/user/mediallo/article/2813153 <i>Developing an Infrastructure for Mobile and Wireless Systems (2002), pp. 59-68.</i><br /><br />We argue that the needs of many classes of modern applications, especially those targeted at mobile or wireless computing, demand the services of content-based publish/subscribe middleware, and that this middleware in turn demands a new kind of communication infrastructure for its proper implementation. We refer to this new communication infrastructure as content-based networking. The service model of this network must directly support the interface of an advanced contentbased publish/subscribe middleware service. At the same time, the implementation must be architected as a true distributed network, providing appropriate guarantees of reliability, security, and performance. We do not propose content-based networking as a replacement for IP, nor do we advocate an implementation of a publish/subscribe middleware at the network level (i.e., within routers). Instead, we argue that contentbased networking must be designed according to established networking principles and techniques. To this end, in this paper, we formulate the foundational concepts of content-based networking, and relate them to the corresponding concepts in traditional networking. We also briefly review our experience with content-based publish/subscribe middleware and suggest some open research problems in the area of content-based networking. Content-Based Networking: A New Communication Infrastructure Antonio Carzaniga Alexander Wolf doi:10.1007/3-540-36257-6_6 Developing an Infrastructure for Mobile and Wireless Systems (2002), pp. 59-68. 2008-05-19T13:10:30-00:00 2002 Developing an Infrastructure for Mobile and Wireless Systems 59 68 cbr pubsub http://www.citeulike.org/user/mediallo/article/270732 <i>Commun. ACM, Vol. 18, No. 11. (November 1975), pp. 613-620.</i> A vector space model for automatic indexing G Salton A Wong CS Yang doi:10.1145/361219.361220 Commun. ACM, Vol. 18, No. 11. (November 1975), pp. 613-620. 2005-08-01T11:57:21-00:00 1975 Commun. ACM 0001-0782 18 11 613 620 ACM Press indexing vsm http://www.citeulike.org/user/mediallo/article/2776363 <i>(2006), pp. 35-35.</i> Efficient query subscription processing for prospective search engines Utku Irmak Svilen Mihaylov Torsten Suel Samrat Ganguly Rauf Izmailov (2006), pp. 35-35. 2008-05-09T17:33:52-00:00 2006 35 35 USENIX Association prospective search http://www.citeulike.org/user/mediallo/article/910879 <i>IEEE Micro, Vol. 23, No. 02. (March 2003), pp. 22-28.</i> Web Search for a Planet: The Google Cluster Architecture Luiz Barroso Jeffrey Dean Urs H&\#246;lzle doi:10.1109/MM.2003.1196112 IEEE Micro, Vol. 23, No. 02. (March 2003), pp. 22-28. 2006-10-24T08:41:15-00:00 2003 IEEE Micro 0272-1732 23 02 22 28 IEEE Computer Society Press cluster google search http://www.citeulike.org/user/mediallo/article/2755752 <i>Aerospace Conference, 2007 IEEE (2007), pp. 1-8.</i><br /><br />We have implemented a new network information processing system using reconfigurable hardware that scans volumes of data in real-time. One of the key functions of the system is to extract semantic information. Before we can determine the meaning of text, we must identify its language. In a previous project, we have implemented an N-gram based language identifier that can process up to 1 Gbps throughput. However, a large percentage of computer network traffic, such as email and Web data, consists of markup information such as tags and protocol specific options. This additional data interferes with the language identification process causing decreased accuracy. Thus, we developed a hardware architecture for configurable application level processing. Our Application Level Processing System (ALPS) is a custom processor that is automatically generated using syntactic structure of the content. The resulting circuit is mapped on to a reconfigurable device to efficiently extract only the relevant data for the language identifier. To illustrate the effectiveness of the architecture, we have implemented a system that can process electronic mail. Our experiments show that ALPS can improve the accuracy of the hardware language identifier by up to a factor of 200 as compared to a system that does not decode the application-level protocol data. Hardware-Accelerated Parser for Extraction of Metadata in Semantic Network Content J Moscola YH Cho JW Lockwood doi:10.1109/AERO.2007.352793 Aerospace Conference, 2007 IEEE (2007), pp. 1-8. 2008-05-05T08:56:22-00:00 2007 Aerospace Conference, 2007 IEEE 1 8 content hardware metadata semantic http://www.citeulike.org/user/mediallo/article/2755716 <i>Annals of the History of Computing, IEEE, Vol. 28, No. 1. (2006), pp. 56-71.</i><br /><br />BBN has an illustrious history of contributions to data networking, and has made repeated contributions in the development of networking protocols, network operations, router design, and wireless and satellite networks. Because so much of BBN's early Arpanet work has been documented elsewhere, this history focuses on post-Arpanet contributions that led to the Internet. Arpanet was a continuing source of inspiration, frustration, and innovation, both as a stand-alone network and then as the core of the Internet. Data networking at BBN C Partridge S Blumenthal doi:10.1109/MAHC.2006.7 Annals of the History of Computing, IEEE, Vol. 28, No. 1. (2006), pp. 56-71. 2008-05-05T08:36:51-00:00 2006 Annals of the History of Computing, IEEE 28 1 56 71 data networing http://www.citeulike.org/user/mediallo/article/1726714 <i>(2006)</i> Query-driven document partitioning and collection selection Diego Puppin Fabrizio Silvestri Domenico Laforenza doi:10.1145/1146847.1146881 (2006) 2007-10-04T10:06:38-00:00 2006 ACM Press indexing log partitioning query http://www.citeulike.org/user/mediallo/article/2734550 <i>Information Processing & Management, Vol. 43, No. 3. (May 2007), pp. 592-608.</i><br /><br />The performance of parallel query processing in a cluster of index servers is crucial for modern web search systems. In such a scenario, the response time basically depends on the execution time of the slowest server to generate a partial ranked answer. Previous approaches investigate performance issues in this context using simulation, analytical modeling, experimentation, or a combination of them. Nevertheless, these approaches simply assume balanced execution times among homogeneous servers (by uniformly distributing the document collection among them, for instance)--a scenario that we did not observe in our experimentation. On the contrary, we found that even with a balanced distribution of the document collection among index servers, correlations between the frequency of a term in the query log and the size of its corresponding inverted list lead to imbalances in query execution times at these same servers, because these correlations affect disk caching behavior. Further, the relative sizes of the main memory at each server (with regard to disk space usage) and the number of servers participating in the parallel query processing also affect imbalance of local query execution times. These are relevant findings that have not been reported before and that, we understand, are of interest to the research community. Analyzing imbalance among homogeneous index servers in a web search system CS Badue R Baeza-Yates B Ribeiro-Neto A Ziviani N Ziviani doi:10.1016/j.ipm.2006.09.002 Information Processing & Management, Vol. 43, No. 3. (May 2007), pp. 592-608. 2008-04-29T14:55:47-00:00 2007 Information Processing & Management 43 3 592 608 indexing partitioning searching http://www.citeulike.org/user/mediallo/article/2734511 <i>(2006), pp. 348-355.</i> Load balancing for term-distributed parallel retrieval Alistair Moffat William Webber Justin Zobel doi:10.1145/1148170.1148232 (2006), pp. 348-355. 2008-04-29T14:43:42-00:00 2006 348 355 ACM balancing load partitioning retrieval http://www.citeulike.org/user/mediallo/article/2713532 <i>Handbook of Nature-Inspired and Innovative Computing (2006), pp. 521-551.</i> Cluster Computing: High-Performance, High-Availability, and High-Throughput Processing on a Network of Computers Chee Yeo Rajkumar Buyya Hossein Pourreza Rasit Eskicioglu Peter Graham Frank Sommers doi:10.1007/0-387-27705-6_16 Handbook of Nature-Inspired and Innovative Computing (2006), pp. 521-551. 2008-04-24T17:10:51-00:00 2006 Handbook of Nature-Inspired and Innovative Computing 521 551 availability cluster computing performance throughput http://www.citeulike.org/user/mediallo/article/1325689 <i>Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on (2001), pp. 492-499.</i><br /><br />In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. There is no dichotomy between a central server and distributed clients. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and fragmentation into disconnected pieces separated by choke-points with inadequate bandwidth. The authors propose a simple scheme for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. It does so with no global knowledge of all the nodes in the network. In the most common P2P application to date (search), these properties are important. Building low-diameter P2P networks G Pandurangan P Raghavan E Upfal Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on (2001), pp. 492-499. 2007-05-24T19:13:13-00:00 2001 Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on 492 499 p2p topology http://www.citeulike.org/user/mediallo/article/2713388 <i>Peer-to-Peer Networking and Applications, Vol. 1, No. 1. (7 March 2008), pp. 3-17.</i><br /><br />Abstract  Challenges for content-based publish/sub scribe systems include efficient subscription management and event matching, load balancing, and efficient and scalable event delivery. This paper presents an efficient and scalable framework for content-based publish/subscribe systems. We propose using K-D trees to dynamically partition and organize subscriptions, thereby preserving subscription locality, minimizing event matching load and ensuring load balance across nodes. We propose an efficient event delivery mechanism that cleverly exploits embedded trees in distributed hash tables to disseminate events. We show that the latency of event publication and delivery is low. The event delivery mechanism can deliver events to a large number of subscribers at low latency and overhead, consuming modest bandwidth. An efficient and scalable framework for content-based publish/subscribe systems Yingwu Zhu Haiying Shen doi:10.1007/s12083-007-0001-3 Peer-to-Peer Networking and Applications, Vol. 1, No. 1. (7 March 2008), pp. 3-17. 2008-04-24T15:39:30-00:00 2008 Peer-to-Peer Networking and Applications 1 1 3 17 pubsub http://www.citeulike.org/user/mediallo/article/2713337 <i>Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE, Vol. 2 (2005), 5 pp..</i><br /><br />Publish/subscribe has become a prevalent model for distributed content delivery due to its ability to decouple communication between participants. It has remained a challenge to design a scalable overlay supporting the complexity of content-based publish/subscribe systems, while satisfying the desirable properties large distributed systems should have. This paper presents the design of Mirinae, a new structured peer-to-peer overlay mesh based on the interests of peers. To fulfil the gap between the rich subscription language of publish/subscribe and the logical address of overlay network, we devise a bloom-filter based mapping scheme. Given an event, Mirinae provides a flexible and efficient dissemination tree minimizing the participation of non-matching nodes. Our evaluation demonstrates that Mirinae is able to achieve its goals of scalability, efficiency, and adaptiveness. New peer-to-peer overlay network for content-based publish/subscribe systems Yongjin Choi Hyunbin Lee Keuntae Park Daeyeon Park doi:10.1109/GLOCOM.2005.1577775 Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE, Vol. 2 (2005), 5 pp.. 2008-04-24T15:23:07-00:00 2005 Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE 2 5 pp. overlay p2p pubsub http://www.citeulike.org/user/mediallo/article/1704035 <i>(2007), pp. 238-249.</i> Prefix forwarding for publish/subscribe Zbigniew Jerzak Christof Fetzer doi:10.1145/1266894.1266939 (2007), pp. 238-249. 2007-09-28T06:34:34-00:00 2007 238 249 ACM Press pubsub http://www.citeulike.org/user/mediallo/article/2713293 <i>Middleware 2005 (2005), pp. 292-313.</i><br /><br />Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and diversified content-based pub-sub communication, we propose a new architectural design called MEDYM - Match-Early with DYnamic Multicast. MEDYM follows the End-to-End distributed system design principle. It decouples a pub-sub service into two functionalities: complex, application-specific matching at network edge, and simple, generic multicast routing in the network. This architecture achieves low computation cost in event matching and high network efficiency and flexibility in event routing. For higher scalability, we describe a novel approach to extend MEDYM to a hierarchy structure called H-MEDYM, which effectively balances the trade-off between event delivery efficiency and server states maintenance. We evaluate MEDYM and H-MEDYM using detailed simulations and real-world experiments, and compare them with major existing design approaches. Results show that MEDYM and H-MEDYM achieve high event delivery efficiency and system scalability, and their advantages are most prominent when user subscriptions are highly selective and diversified. MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks Fengyun Cao Jaswinder Singh doi:10.1007/11587552_15 Middleware 2005 (2005), pp. 292-313. 2008-04-24T15:03:24-00:00 2005 Middleware 2005 292 313 matching multicast pubsub http://www.citeulike.org/user/mediallo/article/2713262 <i>SIGCOMM Comput. Commun. Rev., Vol. 33, No. 1. (January 2003), pp. 89-94.</i> pSearch: information retrieval in structured overlays Chunqiang Tang Zhichen Xu Mallik Mahalingam doi:10.1145/774763.774777 SIGCOMM Comput. Commun. Rev., Vol. 33, No. 1. (January 2003), pp. 89-94. 2008-04-24T14:49:11-00:00 2003 SIGCOMM Comput. Commun. Rev. 0146-4833 33 1 89 94 ACM dht retrieval http://www.citeulike.org/user/mediallo/article/1447246 <i>(2003)</i><br /><br />The Internet has changed considerably the scale of distributed systems, motivating the demand for more flexible communication models and systems. Individual point-to-point and synchronous communications, which tend to lead to rigid and static applications, are making way for the more loosely coupled interaction such as is supported by a publish-subscribe paradigm. Survey of publish subscribe event systems Y Liu B Plale (2003) 2007-07-10T19:28:13-00:00 2003 pubsub http://www.citeulike.org/user/mediallo/article/201597 <i>Commun. ACM, Vol. 35, No. 12. (December 1992), pp. 29-38.</i> Information filtering and information retrieval: two sides of the same coin? Nicholas Belkin Bruce Croft doi:10.1145/138859.138861 Commun. ACM, Vol. 35, No. 12. (December 1992), pp. 29-38. 2005-05-16T17:35:32-00:00 1992 Commun. ACM 0001-0782 35 12 29 38 ACM Press filtering retrieval http://www.citeulike.org/user/mediallo/article/2713169 <i>(1996), pp. 262-269.</i> Document filtering with inference networks Jamie Callan doi:10.1145/243199.243273 (1996), pp. 262-269. 2008-04-24T14:24:00-00:00 1996 262 269 ACM filtering inroute http://www.citeulike.org/user/mediallo/article/2713120 <i>ACM Trans. Database Syst., Vol. 24, No. 4. (December 1999), pp. 529-565.</i> The SIFT information dissemination system Tak Yan Hector Garcia-Molina doi:10.1145/331983.331992 ACM Trans. Database Syst., Vol. 24, No. 4. (December 1999), pp. 529-565. 2008-04-24T14:08:42-00:00 1999 ACM Trans. Database Syst. 0362-5915 24 4 529 565 ACM filtering http://www.citeulike.org/user/mediallo/article/2662714 <i>(2007), pp. 171-179.</i> Modelling performance optimizations for content-based publish/subscribe Alex Wun Hans-Arno Jacobsen doi:10.1145/1266894.1266927 (2007), pp. 171-179. 2008-04-13T02:54:03-00:00 2007 171 179 ACM model performance pubsub http://www.citeulike.org/user/mediallo/article/2660857 <i>IEEE/ACM Trans. Netw., Vol. 4, No. 5. (October 1996), pp. 743-757.</i> Packet network simulation: speedup and accuracy versus timing granularity Jong Ahn Peter Danzig doi:10.1109/90.541322 IEEE/ACM Trans. Netw., Vol. 4, No. 5. (October 1996), pp. 743-757. 2008-04-12T16:38:53-00:00 1996 IEEE/ACM Trans. Netw. 1063-6692 4 5 743 757 IEEE Press simulation tradeoffs http://www.citeulike.org/user/mediallo/article/2660827 <i>Performance, Computing, and Communications Conference, 2000. IPCCC '00. Conference Proceeding of the IEEE International (2000), pp. 181-189.</i><br /><br />Cluster computing imposes heavy demands on the communication network. Gigabit Ethernet technology can provide the required bandwidth to meet these demands. However, it has also shifted the communication bottleneck from network media to protocol processing. In this paper, we present an overview of Gigabit Ethernet technology and study the end-to-end Gigabit Ethernet communication bandwidth and latency. Performance graphs are collected using Net Pipe which clearly show the performance characteristics of TCP/IP over Gigabit Ethernet. These indicate the impact of a number of factors such as processor speeds, network adaptors, versions of the Linux Kernel and device drivers, and TCP/IP tuning on the performance of Gigabit Ethernet between two Pentium 11/350 PCs. Among the important conclusions are the marked superiority of the 2.1.121 and later development kernels and 2.2x production kernels of Linux and that the ability to increase the MTU beyond the Ethernet standard of 1500 could significantly enhance the throughput attainable Communication performance over a gigabit Ethernet network PA Farrell Hong Ong doi:10.1109/PCCC.2000.830317 Performance, Computing, and Communications Conference, 2000. IPCCC '00. Conference Proceeding of the IEEE International (2000), pp. 181-189. 2008-04-12T16:18:21-00:00 2000 Performance, Computing, and Communications Conference, 2000. IPCCC '00. Conference Proceeding of the IEEE International 181 189 ethernet performance http://www.citeulike.org/user/mediallo/article/495591 <i>Combinatorica, Vol. 24, No. 1. (January 2004), pp. 5-34.</i> The Diameter of a Scale-Free Random Graph B&\#x00e9;laa Bollob&\#x00e1;s Oliver Riordan doi:10.1007/s00493-004-0002-2 Combinatorica, Vol. 24, No. 1. (January 2004), pp. 5-34. 2006-02-07T12:38:43-00:00 2004 Combinatorica 0209-9683 24 1 5 34 Springer-Verlag New York, Inc. diameter graph scame-free http://www.citeulike.org/user/mediallo/article/2660785 <i>Networking, IEEE/ACM Transactions on, Vol. 5, No. 6. (1997), pp. 770-783.</i><br /><br />Graphs are commonly used to model the topological structure of internetworks in order to study problems ranging from routing to resource reservation. A variety of graphs are found in the literature, including fixed topologies such as rings or stars, “well-known” topologies such as the ARPAnet, and randomly generated topologies. While many researchers rely upon graphs for analytic and simulation studies, there has been little analysis of the implications of using a particular model or how the graph generation method may affect the results of such studies. Further, the selection of one generation method over another is often arbitrary, since the differences and similarities between methods are not well understood. This paper considers the problem of generating and selecting graphs that reflect the properties of real internetworks. We review generation methods in common use and also propose several new methods. We consider a set of metrics that characterize the graphs produced by a method, and we quantify similarities and differences among several generation methods with respect to these metrics. We also consider the effect of the graph model in the context of a specific problem, namely multicast routing A quantitative comparison of graph-based models for Internet topology EW Zegura KL Calvert MJ Donahoo doi:10.1109/90.650138 Networking, IEEE/ACM Transactions on, Vol. 5, No. 6. (1997), pp. 770-783. 2008-04-12T15:47:28-00:00 1997 Networking, IEEE/ACM Transactions on 5 6 770 783 graph internet topology http://www.citeulike.org/user/mediallo/article/2660704 <i>Commun. ACM, Vol. 23, No. 12. (December 1980), pp. 711-721.</i> Measured performance of an Ethernet local network John Shoch Jon Hupp doi:10.1145/359038.359044 Commun. ACM, Vol. 23, No. 12. (December 1980), pp. 711-721. 2008-04-12T15:19:49-00:00 1980 Commun. ACM 0001-0782 23 12 711 721 ACM ethernet performance http://www.citeulike.org/user/mediallo/article/2649913 <i>(2007), pp. 57-64.</i> Load balancing distributed inverted files Mauricio Marin Carlos Gomez doi:10.1145/1316902.1316912 (2007), pp. 57-64. 2008-04-10T16:41:29-00:00 2007 57 64 ACM balancing load http://www.citeulike.org/user/mediallo/article/2649804 <i>Networks, Vol. 36, No. 3. (2000), pp. 147-155.</i><br /><br />A set V and a collection of (possibly nondisjoint) subsets are given. Also given is a real matrix describing distances between elements of V. A cover is a subset of V containing at least one representative from each subset. The multiple-choice minimum-diameter problem is to select a cover of minimum diameter. The diameter is defined as the maximum distance between any pair of elements in the cover. The multiple-choice dispersion problem, which is closely related, asks us to maximize the minimum distance between any pair of elements in the cover. The problems are NP-hard. We present polynomial time algorithms for approximating special cases and generalizations of these basic problems, and we prove in other cases that no such algorithms exist (assuming P Minimum-diameter covering problems Esther Arkin Refael Hassin doi:10.1002/1097-0037(200010)36:3<147::AID-NET1>3.0.CO;2-M Networks, Vol. 36, No. 3. (2000), pp. 147-155. 2008-04-10T15:39:35-00:00 2000 Networks 36 3 147 155 diameter graph spanning-tree http://www.citeulike.org/user/mediallo/article/2649330 <i>Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems] (2003), pp. 283-334.</i> Design and evaluation of a wide-area event notification service A Carzaniga DS Rosenblum AL Wolf Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems] (2003), pp. 283-334. 2008-04-10T13:55:38-00:00 2003 Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems] 283 334 event notification pubsub service http://www.citeulike.org/user/mediallo/article/1404182 <i>ACM Comput. Surv., Vol. 39, No. 1. (2007)</i> Compressed full-text indexes Gonzalo Navarro Veli M&\#228;kinen doi:10.1145/1216370.1216372 ACM Comput. Surv., Vol. 39, No. 1. (2007) 2007-06-22T07:55:48-00:00 2007 ACM Comput. Surv. 0360-0300 39 1 ACM Press compression indexing search http://www.citeulike.org/user/mediallo/article/1475941 <i>SIGCOMM Comput. Commun. Rev., Vol. 30, No. 2. (April 2000), pp. 18-28.</i> On the origin of power laws in Internet topologies Alberto Medina Ibrahim Matta John Byers doi:10.1145/505680.505683 SIGCOMM Comput. Commun. Rev., Vol. 30, No. 2. (April 2000), pp. 18-28. 2007-07-23T22:36:03-00:00 2000 SIGCOMM Comput. Commun. Rev. 0146-4833 30 2 18 28 ACM Press power-law topology http://www.citeulike.org/user/mediallo/article/2637157 <i>NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet (2007), pp. 714-725.</i><br /><br />Overlay topology design has been one of the most challenging research areas over the past few years. In this paper, we consider the problem of finding the overlay topology that minimizes a cost function which takes into account the overlay link creation cost and the routing cost. First, we formulate the problem as an Integer Linear Programming (ILP) given a traffic matrix in case of cooperative and non cooperative node behavior. Then, we propose some heuristics to find near-optimal overlay topologies with a reduced complexity. The solutions of the ILP problem in average-size networks have been analyzed, showing that the traffic demands between the nodes affects the decision of creating new overlay links. The heuristics are also compared through extensive numerical evaluation, and guidelines for the selection of the best heuristic as a function of the cost parameters are also provided. Optimal Topology Design for Overlay Networks Mina Kamel Caterina Scoglio Todd Easton doi:10.1007/978-3-540-72606-7_61 NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet (2007), pp. 714-725. 2008-04-07T11:26:20-00:00 2007 NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet 714 725 design overlay topology http://www.citeulike.org/user/mediallo/article/2637156 <i>Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE (2007), pp. 75-80.</i><br /><br />Service Overlay Network (SON) was proposed to alleviate the difficulties encountered in providing end-to-end Quality of Service (QoS) guarantees. SON is able to provide QoS guarantees by purchasing bandwidth from individual network domains and building a logical end-to-end data delivery infrastructure on top of the existing Internet. We focus on SON topology design problems under a generalized cost model. Earlier research in this topic considered two distinct cost models - fixed (leased) cost model and variable (usage-based) cost model. However in most applications, the costs of both nodes and links have a fixed component as well as a variable component that often depends on usage. Our generalized cost model takes this fact into account and our topology design algorithm uses this cost model to And the optimal topology. Since the SON topology design problem is NP-complete, we provide approximation algorithm with guaranteed performance bound. We validate the effectiveness of our algorithm through extensive simulation. Topology Design of Service Overlay Network with a Generalized Cost Model Ling Zhou A Sen doi:10.1109/GLOCOM.2007.22 Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE (2007), pp. 75-80. 2008-04-07T11:25:30-00:00 2007 Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE 75 80 design overlay topology http://www.citeulike.org/user/mediallo/article/2186762 <i>ACM Comput. Surv., Vol. 38, No. 2. (2006)</i> Inverted files for text search engines Justin Zobel Alistair Moffat ACM Comput. Surv., Vol. 38, No. 2. (2006) 2008-01-02T03:01:48-00:00 2006 ACM Comput. Surv. 0360-0300 38 2 ACM indexing search http://www.citeulike.org/user/mediallo/article/2619454 <i>Networking, Architecture, and Storage, 2007. NAS 2007. International Conference on (2007), pp. 225-232.</i><br /><br />In cluster-based storage systems, the metadata server cluster must be able to adaptively distribute responsibility for metadata to maintain high system performance and long-term load balance, due to workload skew and metadata servers' heterogeneity. In this paper, we describe a simple and adaptive metadata load management scheme, called Self-Balancing Uniform (SBU) randomization, to efficiently and continually adapt the metadata distribution to current demands in heterogeneous metadata server cluster. We implement our system within a discrete event driven simulation environment, along with two other systems, simple randomization (SR) and performance aware distribution (PAD) to serve as points of comparison, and evaluate the performance of our SBU algorithms against SR and PAD algorithms by both a trace workload and a synthetic workload. Simulation results verify that our SBU algorithm achieves load self-balance, provides consistent response latencies and resource utilization. Simulation results also indicate that SR cannot cope with skew and heterogeneity and PAD requires a larger shared state to achieve optimal performance. Performance Evaluation of A Load Self-Balancing Method for Heterogeneous Metadata Server Cluster Using Trace-Driven and Synthetic Workload Simulation Bin Cai Changsheng Xie Guangxi Zhu doi:10.1109/NAS.2007.41 Networking, Architecture, and Storage, 2007. NAS 2007. International Conference on (2007), pp. 225-232. 2008-04-01T11:08:19-00:00 2007 Networking, Architecture, and Storage, 2007. NAS 2007. International Conference on 225 232 balancing cluster heterogeneity load http://www.citeulike.org/user/mediallo/article/1641433 <i>INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 4 (2004), pp. 2253-2262 vol.4.</i><br /><br />Most P2P systems that provide a DHT abstraction distribute objects randomly among "peer nodes" in a way that results in some nodes having /spl theta/(log N) times as many objects as the average node. Further imbalance may result due to non-uniform distribution of objects in the identifier space and a high degree of heterogeneity in object loads and node capacities. Additionally, a node's load may vary greatly over time since the system can be expected to experience continuous insertions and deletions of objects, skewed object arrival patterns, and continuous arrival and departure of nodes. We propose an algorithm for load balancing in such heterogeneous, dynamic P2P systems. Our simulation results show that in the face of rapid arrivals and departures of objects of widely varying load, our algorithm achieves load balancing for system utilizations as high as 90% while moving only about 8% of the load that arrives into the system. Similarly, in a dynamic system where nodes arrive and depart, our algorithm moves less than 60% of the load the underlying DHT moves due to node arrivals and departures. Finally, we show that our distributed algorithm performs only negligibly worse than a similar centralized algorithm, and that node heterogeneity helps, not hurts, the scalability of our algorithm. Load balancing in dynamic structured P2P systems B Godfrey K Lakshminarayanan S Surana R Karp I Stoica INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 4 (2004), pp. 2253-2262 vol.4. 2007-09-10T11:58:11-00:00 2004 INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies 4 2253 2262 vol.4 balancing load p2p http://www.citeulike.org/user/mediallo/article/2557848 <i>(1996)</i> Design Decision Trees Alexander Ran Juha Kuusela (1996) 2008-03-19T10:07:36-00:00 1996 IEEE Computer Society design model http://www.citeulike.org/user/mediallo/article/2557844 <i>Development and Evolution of Software Architectures for Product Families (1998), pp. 223-234.</i><br /><br />Software system has to face many changes during its life cycle. Some of these changes can be anticipated some come as surprises. Software systems can be designed to be flexible in terms of anticipated changes. Flexibility is achieved by structuring the system utilizing abstraction, indirection, late binding or some other variance mechanism. Surprising changes are still a problem. Partially this problem can be alleviated by proper management of design knowledge. We propose a mechanism to organize design decision so that this organization can be used to analyze change requests and determine their impact on system architecture. We demonstrate this using an industrial example. Structuring Design Decisions for Evolution Anssi Karhinen Juha Kuusela doi:10.1007/3-540-68383-6_31 Development and Evolution of Software Architectures for Product Families (1998), pp. 223-234. 2008-03-19T10:06:16-00:00 1998 Development and Evolution of Software Architectures for Product Families 223 234 design model http://www.citeulike.org/user/mediallo/article/2551307 <i>(2000), pp. 26-26.</i> Scalable content-aware request distribution in cluster-based networks servers Mohit Aron Darren Sanders Peter Druschel Willy Zwaenepoel (2000), pp. 26-26. 2008-03-18T14:30:39-00:00 2000 26 26 USENIX Association based cluster content request routing web http://www.citeulike.org/user/mediallo/article/2550026 <i>(2006), pp. 42-47.</i> A churn and mobility resistant approach for DHTs Olaf Landsiedel Stefan Götz Klaus Wehrle doi:10.1145/1161252.1161263 (2006), pp. 42-47. 2008-03-18T10:36:50-00:00 2006 42 47 ACM churn dht mobility p2p http://www.citeulike.org/user/mediallo/article/364650 <i>Vol. 34, No. 4. (October 2004), pp. 3-14.</i> A first-principles approach to understanding the internet's router-level topology Lun Li David Alderson Walter Willinger John Doyle doi:10.1145/1015467.1015470 Vol. 34, No. 4. (October 2004), pp. 3-14. 2005-10-25T14:49:21-00:00 2004 34 4 3 14 ACM Press internet measurement http://www.citeulike.org/user/mediallo/article/910160 <i>IEEE/ACM Trans. Netw., Vol. 13, No. 6. (December 2005), pp. 1205-1218.</i> Understanding internet topology: principles, models, and validation David Alderson Lun Li Walter Willinger John Doyle doi:10.1109/TNET.2005.861250 IEEE/ACM Trans. Netw., Vol. 13, No. 6. (December 2005), pp. 1205-1218. 2006-10-23T13:46:42-00:00 2005 IEEE/ACM Trans. Netw. 1063-6692 13 6 1205 1218 IEEE Press internet topology http://www.citeulike.org/user/mediallo/article/2435766 <i>(2007), pp. 91-96.</i> Adapting publish-subscribe routing to traffic demands Matteo Migliavacca Gianpaolo Cugola doi:10.1145/1266894.1266911 (2007), pp. 91-96. 2008-02-27T11:44:18-00:00 2007 91 96 ACM model optimization pubsub reconfiguration http://www.citeulike.org/user/mediallo/article/2506755 <i>(2007), pp. 1-14.</i> I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system Meeyoung Cha Haewoon Kwak Pablo Rodriguez Yong-Yeol Ahn Sue Moon doi:10.1145/1298306.1298309 (2007), pp. 1-14. 2008-03-11T10:21:39-00:00 2007 1 14 ACM content measurement youtube http://www.citeulike.org/user/mediallo/article/2472131 <i>(2005)</i><br /><br />Syndication of micronews, frequently-updated content on the Web, is currently accomplished with RSS feeds and client applications that poll those feeds. However, providers of RSS content have recently become concerned about the escalating bandwidth demand of RSS readers. Current efforts to address this problem by optimizing the polling behavior of clients sacrifice timeliness without fundamentally improving the scalability of the system. In this paper, we argue for a micronews distribution... FeedTree: Sharing Web Micronews with Peer-to-Peer Event Notification D Sandler A Mislove A Post P Druschel (2005) 2008-03-05T11:14:58-00:00 2005 optimization pubsub rss http://www.citeulike.org/user/mediallo/article/2465022 <i>Communications, 2007. ICC '07. IEEE International Conference on (2007), pp. 2064-2069.</i> Scheduling Feed Retrieval W van Wanrooij A Pras doi:10.1109/ICC.2007.342 Communications, 2007. ICC '07. IEEE International Conference on (2007), pp. 2064-2069. 2008-03-04T14:44:14-00:00 2007 Communications, 2007. ICC '07. IEEE International Conference on 2064 2069 rss http://www.citeulike.org/user/mediallo/article/2464973 <i>(2006), pp. 2-2.</i> Corona: a high performance publish-subscribe system for the world wide web Venugopalan Ramasubramanian Ryan Peterson Emin Sirer (2006), pp. 2-2. 2008-03-04T14:23:00-00:00 2006 2 2 USENIX Association pubsub http://www.citeulike.org/user/mediallo/article/2463798 <i>(2006), pp. 432-439.</i> A Semantic Publish/subscribe System for Selective Dissemination of the RSS Documents Jiangang Ma Gang Xu Jinling Wang Tao Huang doi:10.1109/GCC.2006.19 (2006), pp. 432-439. 2008-03-04T10:07:53-00:00 2006 432 439 IEEE Computer Society owl pubsub rdf rss semantic http://www.citeulike.org/user/mediallo/article/2460491 <i>SIGMOD Rec., Vol. 30, No. 2. (June 2001), pp. 115-126.</i> Filtering algorithms and implementation for very fast publish/subscribe systems Fran\ccoise Fabret Arno Jacobsen Fran\ccois Llirbat Jo\uao Pereira Kenneth Ross Dennis Shasha doi:10.1145/376284.375677 SIGMOD Rec., Vol. 30, No. 2. (June 2001), pp. 115-126. 2008-03-03T10:06:48-00:00 2001 SIGMOD Rec. 0163-5808 30 2 115 126 ACM filtering pubsub