Member Login

E-mail:    Password:  




 TitleDate AddedCompany
whitepaper A Scalable Peer-to-Peer System for Music Content and Information Retrieval2008-01-01 Johns Hopkins University
  Currently a large percentage of Internet traffic consists of music files, typically stored in MP3 compressed audio format, shared and exchanged over Peer-to-Peer (P2P) networks. Searching for music is performed by specifying keywords and naive string matching techniques. In the past years the emerging research area of Music Information Retrieval (MIR) has produced a variety of new ways of looking at the problem of music search. Such MIR techniques can significantly enhance the ways user search for music over P2P networks. In order for that to happen there are two main challenges that need to be addressed: scalability to large collections and number of peers, richer set of search semantics that can support MIR especially when retrieval is content-based.

Tags: Network Management		   
whitepaper BGP Routing Scalability: Reflectors Vs. Route Servers2008-01-01 University of Alberta
  Autonomous systems need to be connected using BGP servers. To reduce the complexity of connecting these systems together, researchers have suggested that route servers or routing databases be used. While both route reflectors and routing databases offer significant scalability advantages over standard full mesh BGP, they also introduce problems in routing and survivability. This paper explores the relative advantages and disadvantages of full mesh BGP, route reflectors, and routing databases.

Tags: Network Management, Data Infrastructure		   
whitepaper Scalable Hybrid Search on Distributed Databases2008-01-01 Florida State University
  A hybrid keyword search that combines metadata search with a traditional keyword search over unstructured context data has been previously described. This hybrid search paradigm provides the inquirer additional options to narrow the search with some semantic aspect from the XML metadata query. But in earlier work, the scalability limitations of a single-machine implementation was experienced. This paper describes a scalable hybrid search on distributed databases. This scalable hybrid search provides a total query result from the collection of individual inquiries against independent data fragments distributed in a computer cluster. The paper demonstrates the architecture extends the scalability of a native XML query limited in a single machine and improves the performance for some queries.

Tags: Internet and Web, Data Infrastructure		   
whitepaper VDCBPI: An Approximate Scalable Algorithm for Large POMDPs2008-01-01 University of Toronto
  Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability: the curse of dimensionality and the policy space complexity. This paper describes a new algorithm (VDCBPI) that mitigates both sources of intractability by combining the Value Directed Compression (VDC) technique with Bounded Policy Iteration (BPI). The scalability of VDCBPI is demonstrated on synthetic network management problems with up to 33 million states.

Tags: Software Development Tools		   
whitepaper Linux Virtual Server for Scalable Network Services2008-01-01 Institute of Electrical and Electronics Engineers
  This paper describes the motivation, design, internal implementation of Linux Virtual Server. The goal of Linux Virtual Server is to provide a basic framework to build highly scalable and highly available network services using a large cluster of commodity servers. The TCP/IP stack of Linux kernel is extended to support three IP load balancing techniques, which can make parallel services of different kinds of server clusters to appear as a service on a single IP address. Scalability is achieved by transparently adding or removing a node in the cluster, and high availability is provided by detecting node or daemon failures and reconfiguring the system appropriately.

Tags: Network Management, Server Platforms - OS		   
whitepaper Pastis: A Highly-Scalable Multi-User Peer-to-Peer File System2008-01-01 French National Institute for Research in Computer Science and Control
  This paper introduces Pastis, a completely decentralized multi-user read-write peer-to-peer file system. In Pastis every file is described by a modifiable inode-like structure which contains the addresses of the immutable blocks in which the le contents are stored. All data are stored using the Past Distributed Hash Table (DHT), which the paper has modified in order to reduce the number of network messages it generates, thus optimizing replica retrieval. Pastis' design is simple compared to other existing systems, as it does not require complex algorithms like Byzantine-Fault Tolerant (BFT) replication or a central administrative authority. It is also highly scalable in terms of the number of network nodes and users sharing a given file or portion of the file system.

Tags: Network Management, Server Hardware		   
whitepaper Scalability and Robustness of Virtual Multicast for Synchronous Multimedia Distribution2008-01-01 Masaryk University
  A simple UDP packet reflector for virtual multicast multimedia transfer is extended to form a distributed system of active elements that solves the scalability problem of otherwise centralistic approach. The robustness of such virtual multicast delivery system is also discussed and shown to be better than the native multicast can offer. The maximum latency, important for multimedia transfer and related to the number of hops through the network of active elements, can be kept bounded. Possible support for synchronized multi-stream transfer is also discussed.

Tags: Network Management, Software Development Tools		   
whitepaper Shared Receive Queue Based Scalable MPI Design for InfiniBand Clusters2008-01-01 Ohio State University
  Clusters of several thousand nodes interconnected with InniBand, an emerging high-performance interconnect, have already appeared in the Top 500 list. The next-generation InniBand clusters are expected to be even larger with tens-of-thousands of nodes. A high-performance scalable MPI design is crucial for MPI applications in order to exploit the massive potential for parallelism in these very large clusters. MVAPICH is a popular implementation of MPI over InniBand based on its reliable connection oriented model. The requirement of this model to make communication buffers available for each connection imposes a memory scalability problem. In order to mitigate this issue, the latest InniBand standard includes a new feature called Shared Receive Queue (SRQ) which allows sharing of communication buffers across multiple connections.

Tags: Network Management		   
whitepaper Testing the Scalability of Overlay Routing Infrastructures2008-01-01 University of North Carolina
  Recent studies have demonstrated the utility of alternate paths in improving connectivity of two end hosts. However studies that comprehensively evaluate the tradeoff between its effectiveness and overhead are lacking. This paper carefully characterizes and evaluates the trade-off between the efficacies of alternate path routing in improving end-to-end delay and loss, and the overheads introduced by alternate routing methodology. This would help to test the scalability of an overlay network. The authors collected ping data on PlanetLab and studied the above trade-off under different parameter settings such as path sampling frequency, overlay-connectivity, number of overlay hops etc.

Tags: Network Management		   
whitepaper Scalable Load-Distance Balancing2008-01-01 Israel Institute of Technology
  This paper introduces the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. The paper models the service delay experienced by a user as a sum of a network-incurred delay, which depends on its network distance from the server, and a server-incurred delay, stemming from the load on the server. The problem is to minimize the maximum service delay among all users. The paper addresses the challenge of finding a near-optimal assignment in a scalable distributed manner. The key to achieving scalability is using local solutions, whereby each server only communicates with a few close servers.

Tags: Network Management