Member Login

E-mail:    Password:  




 TitleDate AddedCompany
whitepaper Common Gateway Architecture for Mobile Ad-Hoc Networks2008-01-01 Universitat Bern
  Ad-hoc networks are by definition created on demand, without any infrastructure. On the other hand, they are often considered as an extension of the range of Internet access points, providing multihop wireless access to them. This paper tries to examine the situation where there exist several Internet access points in a single ad-hoc network. The paper presents a Common Gateway Architecture which allows to use multiple access points and send traffic using the closest one.

Tags: Gateways - Hubs, Mobile - Wireless Communications		   
whitepaper SASHA: Toward a Self-Healing Hybrid Sensor Network Architecture2008-01-01 Portland State University
  For widespread adoption of sensor technology, robustness in the event of abnormal behavior such as a network intrusion, or failures of components or nodes is critical. Current research on robust and resilient sensor networking is focused on specific tasks - secure broadcast, secure aggregation, secure localization or fault-tolerant feature extraction. While these primitives provide useful functionality, what has been lacking is a comprehensive, holistic approach to sensor network robustness across various failure modalities. This paper proposes a self-healing hybrid sensor network architecture called SASHA, that is inspired by and co-opts several mechanisms from the Acquired Natural Immune System to attain its autonomy, robustness, diversity and adaptability to unknown pathogens, and compactness.

Tags: Network Design, Mobile - Wireless Communications		   
whitepaper RAIN: A Reliable Wireless Network Architecture2008-01-01 Seoul National University
  Despite years of research and development, pioneering deployments of multihop wireless networks have not proven successful. The performance of routing and transport is often unstable due to contention-induced packet losses, especially when the network is large and the offered load is high. This paper proposes RAIN, a reliable wireless network architecture for large-scale multihop wireless networks. A RAIN network enforces contention control by limiting the queue length at intermediate wireless routers to the minimum. To keep the queue short a RAIN network enforces congestion control through in-network implicit back-pressure.

Tags: Mobile - Wireless Communications		   
whitepaper A Service Network Architecture for a Multi-Vehicle Search Mission2008-01-01 University of California
  Multi-vehicle applications rely on the dynamic allocation of resources such as vehicles, CPUs, bandwidth and storage, and must exhibit robustness to failures or to service degradation in general. The paper presents a model for such applications, called the Service Network Model (SNM). The entities of this model are services and service providers. Services are defined by standard names and interfaces, and are described by attributes. Service providers export services with certain quality of service guarantees. They may also need to import services from other providers. An application is modeled as a directed graph, where nodes represent service providers and edges represent services imported by the source node and exported by the destination node.   
whitepaper A Multipath Background Network Architecture2008-01-01 University of Massachusetts
  Background transfers, or transfers that humans do not actively wait on, dominate the Internet today. In today's best-effort Internet, background transfers can interfere with foreground transfers causing long wait times, thereby hurting human productivity. This paper presents the design and implementation of a background network, Harp, that addresses this problem. Harp has three significant advantages over recent end-host based background transport protocols; Harp uses multiple paths to exploit path diversity and load imbalance in the Internet to tailor network resource allocation to human needs, provides better fairness and utilization compared to unipath end-host protocols, and can be deployed at either end-hosts or enterprise gateways, thereby aligning the incentive for deployment with the goals of network customers.

Tags: Gateways - Hubs		   
whitepaper Controlling Thin Clients Using Peer-to-Peer Symmetries2008-01-01 Hall of Arts
  Hackers worldwide agree that atomic epistemologies are an interesting new topic in the field of stenography, and mathematicians concur. This paper proves the synthesis of object-oriented languages, which embodies the robust principles of algorithms. The focus in this paper is not on whether courseware can be made knowledge-based, heterogeneous, and semantic, but rather on describing a knowledge-based tool for exploring telephony (Abime).

Tags: Object-Oriented, Network Design		   
whitepaper QoS Routing for P2P Networking2008-01-01 Helsinki University of Technology
  "Peer-to-peer" concept is the core of today's Internet but it will become even greater factor in the future Internet. P2P-networks grow on their own by flooding and updating the information using peer-to-peer concept. The peers (storage and computing power) are used to make the routing and data-searching faster. This paper focuses to QoS routing and to P2P networking. Techniques like Resource Reservation (RSVP), Differential Services (DiffServ) and MultiProtocol Label Switching (MPLS) are briefly introduced.

Tags: File and Network Servers, Network Design		   
whitepaper Performance Comparison of Wormhole-Routing Priority Switch Architectures2008-01-01 University of Missouri
  Temporary nonuniform traffic patterns can severely degrade the performance of wormhole-routing multistage interconnection networks in multiprocessor systems. Temporary saturation trees build up inside the network under these traffic patterns that result in a temporary network overload with increased packet delay. Recently, enhanced switch box architectures and priority mechanisms were proposed that are able to alleviate or control the degrading effects of these saturation trees. In this paper, it is studied how these different mechanisms influence the lengths of hot-spot and overload phases, and message delay. All mechanisms are able to alleviate performance degradation. The switch box design proposed in conjunction with an alternating priority mechanism is able reduce network overload and message delay the most while the hot-spot phase is increased moderately only.

Tags: Network Design		   
whitepaper Towards Data Mining in Large and Fully Distributed Peer-to-Peer Overlay Networks2008-01-01 Vrije Universiteit
  The Internet, which is becoming a more and more dynamic, extremely heterogeneous network has recently became a platform for huge fully distributed peer-to-peer overlay networks containing millions of nodes typically for the purpose of information dissemination and file sharing. This paper targets the problem of analyzing data which are scattered over a such huge and dynamic set of nodes, where each node is storing possibly very little data but where the total amount of data is immense due to the large number of nodes. The paper presents distributed algorithms for effectively calculating basic statistics of data using the recently introduced newscast model of computation and the paper demonstrates how to implement basic data mining algorithms based on these techniques.

Tags: Data Mining - Analysis, Network Design		   
whitepaper Distributed Data Mining in Peer-to-Peer Networks2008-01-01 university of maryland
  Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new distributed computing paradigm for many novel applications that involve exchange of information among a large number of peers with little centralized coordination. Peer-to-peer file sharing, peer-to-peer electronic commerce, and peer-to-peer monitoring based on a network of sensors are some examples. This paper offers an overview of distributed data mining applications and algorithms for peer-to-peer environments. It describes both exact and approximate distributed data mining algorithms that work in a decentralized manner.

Tags: Data Mining - Analysis, Network Design		   


Recognizing technology companies that matter

ZDNet Asia Top Tech Index

Find out who you should be spending your IT budget with