Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
An important challenge in the domain of vehicular ad hoc networks (VANET) is the scalability of data dissemination. Under dense traffic conditions, the large number of communicating vehicles can easily result in a congested wireless channel. In that situation, delays and packet losses increase to a level where the VANET cannot be applied for road safety applications anymore. This...
Recommendation systems become essential in web applications that provide mass services, and aim to suggest automatic items (services) of interest to users. The most popular used technique in such systems is the collaborative filtering (CF) technique, which suffer from some problems such as the cold-start problem, the privacy problem, the user identification problem, the scalability problem, etc. In...
In this paper, we propose a new naming system to split an address into separate Identifier and Locator and a network architecture based on our naming concept, in order to support mobility and seamless communication. Also our solution aims to solve the scalability problem as well as provide the way to control the traffic under the multi-homing condition. Our solution consists of three core concepts...
Resource discovery is an important aspect of computational Grid. Locating resources in a Grid environment is difficult because of the geographic dispersion and dynamic nature of its resources. In this paper, a center-distributed virtual community model is designed. Based on his model, a novel grid resource discovery method is presented. Its simulation experiment shows the present algorithm can solve...
Wireless multi-hop networks with infrastructure support have been actively studied to solve the scalability problem in large scale vehicular and sensor networks that the end-to-end throughput and other performance metrics decrease sharply with the increase in the number of nodes in the network. In the infrastructure-based networks, wireless nodes are allowed to access the base stations either directly...
Most existing works on data partitioning techniques simply consider to partition data objects and distribute the shares to servers. Such pure data partitioning approaches may bring potential performance and scalability problems when used in widely distributed systems. First, it is difficult to apply lazy update. Second, the share consistency verification may incur costly communications among widely...
Traditional multicast technology faces a serious state scalability problem when there are large numbers of concurrent groups in the network. As a new approach to solve this scalability problem, aggregated multicast forces multiple multicast groups to share a common distribution tree. This can be defined as a minimum grouping problem and is proved to be an NPC problem. An ant colony optimization algorithm...
With more applications move to the Internet, scalability, both in time and space, has become one of the biggest concerns. There are two basic techniques for solving the scalability problem: hierarchy, such as the ones used in, and hashing, such as used in. Using hierarchy to achieve scalability has been well studied. But the application of hashing techniques in network area is still at the beginning...
When dimensioning GMPLS-controlled NG-SDH networks several SDH and GMPLS specific requirements must be fulfilled. In SDH there are two different ways for concatenating VC-4 containers, which determine the packing rules of the service inside a frame. GMPLS handles each concatenated SDH connection as a single GMPLS service, thus it has to be placed entirely into one STM frame. To add a new service to...
In this paper, a correlation-based clustering hierarchical P2P network model is proposed,which overcomes the problems of poor scalability and low search efficiency in unstructured P2P networks.This model devides the whole unstructured P2P network into clusters formed by a number of nodes through correlation.Each cluster elects a master node to be responsible for managing the entire cluster.The whole...
The continued explosion in the growth of image and video databases makes automatic image search and retrieval an extremely important problem. Among the various approaches to Content-based Image Retrieval (CBIR), image similarity based on local point descriptors has shown promising performance. However, this approach suffers from the scalability problem. Although bag-of-words model resolves the scalability...
The success of a negative selection algorithm depends on its detectors. A shape space, conceptually, is where selves, detectors, and antigens reside. These detectors are expected to fully cover the whole shape space. The better the coverage; the better the detection rate. However, this assumption brings a major challenge to negative selection experiments - the scalability problem, where the experiments...
The existing designs for providing anycast services are either to confine each anycast group to a preconfigured topological region or to globally distribute routes to individual anycast group, both of which are all confronted with two problems: scalability and security. A new kind of Anycast communication model is proposed in this paper, which not only solves Anycast existing scalability and security...
This paper looks at the scalability problems inherent in the Active Bat system: an outside-in ultrasonic location system. Such systems are typically associated with higher positioning accuracies and longer tag battery lifetimes relative to comparable inside-out systems. However, they are often criticised for a lack of scalability since multiple tags must be addressed in series to prevent interference...
Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralized behavior requiring a lot of messages to operate, thus causing scalability problems. A solution to improve scalability is to define a decentralized algorithm, avoiding the generation of bottlenecks. DLML (Data List Management Library)...
Static program analysis is promising as a complement to conventional testing methods relying on program executions. This paper introduces VARVEL, a SAT-based bounded model-checker for C programs. It has a notion of Design by Contract (DbC) explicitly and therefore modular checking of large C programs is achieved to resolve the scalability problem that model-checkers are usually faced with. Further,...
In the distributed network environment, delegation is increasingly necessary, so a delegation model based on UCON and Dynamic Fuzzy-Neural-Network (UCONDFNND) is proposed. The model considers the delegation and the credibility. The delegation solves scalability problem of distributed authorization, such as distracted implementation of a task. The delegation based on UCON makes the process of access...
Collaborative filtering has been very successful in both research and applications. Current collaborative filtering based on clustering compute the whole set of items during the process of clustering or selecting nearest-neighbors, because the researchers believed if users have similar preferences on some of items, they will have the similar preferences on other items. But we think that users have...
Although RED has been widely used with TCP, however it has several known drawbacks [1]. The BLUE algorithm that benefits from a different structure has tried to compensate some of them in a successful way [2]. A quick review on active queue management algorithms from the very beginning indicates that most of them tried to improve classic algorithms. Some of them use network traffic history to achieve...
Several coordinate bases embedding schemes have been proposed for scalable estimation of network distance (round trip time) among Internet hosts. These schemes may be broadly categorized into Landmark and distributed peer-to-peer based. While Landmark based approaches suffer from scalability due to the large amount of measurement loads, distributed schemes suffer from stability and accuracy issues...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.