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.
In Application-Layer Multicast (ALM) tree, when a parent node leaves, all its descendent nodes must adjust their positions resulting in the interruption of multicast connections. This is called stability problem of ALM trees which may degrade the continuity of multicast data transmission. In this paper, we analyze the stability problem of ALM trees and propose the Instantaneous Stability Degree Model...
Application Layer Multicast (ALM) has resolved the issue of deployment, but effectiveness inferiors to IP multicast. To build a high efficient multicast tree, this research focuses on the distributed spanning tree algorithm by using nearest physical topology node selection strategy, which is based on a new group communication model named MixCast. The average delay and average join time of the tree...
Application Layer Multicast (ALM) is considered as an alternative approach to IP multicast. Topology awareness is an important metric for ALM because it reduces link stress and delay stretch considerably. This work describes a novel, stable and low overhead ALM approach using binning technique to cluster nearby receivers, referred to as Bincast. Bincast uses a constant number of landmarks to cluster...
We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the form of a tree topology, where the root corresponds to the sink node, and the rest of the network detects an event and transmits data to the sink over one or more hops. We assume a time-slotted synchronized system and a node-exclusive...
This paper presents a scheduling and topology control scheme for wireless sensor networks. It uses time trees for sending data from the sensor node to the base station. For an energy efficient operation of the sensor networks in a distributed manner, time trees are built in order to reduce the collision probability and to minimize the total energy required to send data to the base station. A time...
One of the main parts of peer-to-peer multicast is the structure of overlay network. Most of the existing works utilize some common parameters for constructing overlay tree. These parameters are bandwidth and delay. The mismatch between current overlay structure and underlying network topology causes severe link stress and then leads to high end to end latency. According to these problems, we propose...
Application layer multicast (ALM) has resolved the issue of deployment, but effectiveness inferiors to IP multicast. In this paper, the research is focused upon the influence on the communication efficiency of the multicast tree using three kinds of node selection strategy, which are based on min-delay, max-bandwidth, and nearest network topology. This paper presents NNT, a distributed spanning tree...
When simulation aims at evaluating the scalability of new protocols and applications, it is indispensable to work with large scale network topologies. It has important practical significance and benefits for improving the behaviors of network planning and design, system optimized design and project risk reduction. The technique of modeling our safe communication protocol of communication based train...
Peer-to-peer networks are an increasingly popular solution for the distribution of media content to a large number of users, with limited investments for network infrastructures. The distribution of a real time video stream imposes strict performance requirements such as small playback delays and few frame losses. In this paper, we focus on peer-to-peer video streaming systems with tree or forest...
Point of presence (PoP) level Internet maps are promising for tasks such as reasoning about the Internet evolution in time or Internet delay estimation. We thus suggest an efficient algorithm for generating PoP level Internet maps directly from the traceroute measurement results. The algorithm avoids the noisy process of interface aggregation to routers. The PoP level maps we obtain are annotated...
Immediate notification of urgent but rare events and delivery of time sensitive actuation commands appear in many practical wireless sensor and actuator network applications. Multi-parent wake-up scheduling was presented as a technique which can provide bi-directional end-to-end latency guarantees while optimizing the node battery lifetime. This method takes a cross-layer approach where multiple routes...
There have been many time synchronization protocols proposed for sensor networks. However, the security problems related to time synchronization have not been fully solved yet. If malicious entities manipulate time synchronization, failures of many functionalities in the sensor networks would occur. In this paper, we identify various attacks against time synchronization and then develop a detection...
Many distribution algorithms have been proposed up to now for P2P real time streaming. However, due to the lack of basic theoretical results and bounds, common sense and intuitions and heuristics have driven their design so far. The consequence is that we can find in the literature a large variety of different choices about the main aspects of a P2P system, such as overlay topology, scheduling process...
Application layer multicast is probably the most efficient scheme to sustain the group communication for delay sensitive applications in Internet due to its rapid deployment. However, the problem of building a degree-constrained minimum delay application layer multicast tree is proven to be NP-hard. In this paper, we investigate this optimization problem and propose a distributed protocol to explore...
Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are not always taken into consideration. This paper proposes a novel wavelength routing algorithm, which tries to avoid the multicast incapable branching nodes (MIB, branching nodes without splitting capability) to diminish the...
In order to improve scalability and reduce maintenance overhead for structured peer-to-peer systems, researchers design optimal architectures with constant degree and logarithmical diameter. The expected topologies, however, require the number of peers to be some given values determined by the average degree and the diameter. Hence, existing designs fail to address the issue due to the fact that (1)...
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.