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.
Routing and Wavelength Assignment (RWA) is the most concern in wavelength routed optical networks. This paper proposes a novel dynamic RWA scheme inspired by the idea of binary quadratic programming (BQP) formulation for the static RWA problem. Subsequently, a heuristic algorithm namely QP routing and wavelength assignment (QP-RWA) is proposed. In this method, links wavelength occupancy information...
Computing constrained shortest paths is fundamental to some important network functions such as QoS routing and traffic engineering. This paper introduces a polynomial time approximation Quality of Service (QoS) routing algorithm and constructs dynamic state-dependent routing policies. The proposed algorithm uses a bio-inspired approach based on the trial/error paradigm combined with swarm adaptive...
Much work has been done on routing in Ad-Hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an...
QoS routing problem is a typical nonlinear combination optimization problem, which has been proved to be a NP complete problem. According to the defects of solving the problem by Ant Colony Algorithms (ACA), a QoS routing algorithm based on Culture-Ant Colony Algorithms is put forward in this paper. Bringing ACA into the framework of Culture Algorithms, the algorithm adopts the two evolution frame...
In this work, a multiobjective genetic algorithm-based model for multicast flow routing with QoS and Traffic Engineering requirements is discussed. Two heuristics for subtree reconnection are investigated, applicable in crossover and mutation operators. Experiments with three multiobjective evolutionary algorithms (NSGA-II, SPEA and SPEA2) and the proposed heuristics are carried on, whose results...
Multicast transmission corresponds to send data to several destinations often involving requirements of Quality of Service (QoS) and Traffic Engineering (TE). This work investigates new evolutionary models to tackle Multicast Flow Routing in a Pareto multiobjective perspective. Two multiobjective evolutionary algorithms (SPEA and SPEA2) were applied as the underlying search of such models. QoS and...
Cognitive radio network (CRN) is designed to improve the low resource utilization problem caused by the fixed spectrum allocation policy used today. In CRNs, secondary users (SUs) sense spectrum holes and adaptively use the frequency band. In this paper, we tackle the Quality of Service (QoS) routing problem in wireless ad hoc CRNs. We consider such factors as available time, frequency bands, transmission...
QoS routing and multipath routing have been receiving much attention respectively in network communication. However, the research combining those two kinds of routing is rare. This paper integrated the ideas of QoS and multipath, and presented the problem of shortest pair of disjoint paths with bandwidth guaranteed. we proved it to be NP-complete, and then proposed a heuristic algorithm. The analysis...
Admission control and routing are two key mechanisms for advanced Quality of Service (QoS) and Traffic engineering (TE) support in the data networks. However, traditional QoS and TE solutions usually focus exclusively on routing to achieve network resource usage optimization, while often neglect to give adequate attention to admission control. To provide a more comprehensive solution, a novel approach...
It is a challenge to thwart both the passive attacks and active attacks in mobile ad hoc networks for their unique characteristics. The improvement of security often sacrifices the delivery rate or other QoS. We propose secure multipath routing scheme based on modified secret sharing as an effective mechanism to protect data confidentiality and simultaneously enhance data delivery rate in mobile ad...
Qos anycast is a newly rising network communication service, playing an important role in the area of video stream on-demand. Although the DiffServ network QoS anycast routing architecture is very good, the interleaving services problems exist, which makes its service efficiency decline. A QoS anycast network cluster balancing algorithm based on genetic algorithm and scheduler is introduced in this...
The paper has proposed the QoS route mechanism of the sensor network based on task delay and priority. The new control mechanism assigns the network resource proportionately according to the different priorities of tasks. The tasks with a higher priority can obtain more network resource in respect to the tasks with a lower priority, which will guarantee that the information of task occurrence can...
In this paper we consider multi-hop wireless mesh networks intended to provide Internet connectivity to both end users and hotspots. In such networks mechanisms for provisioning QoS for delay sensitive flows arise as an important topic. In this context, we focus on the non-bifurcated (single path) routing of such flows as a means of allowing all packets in any flow to receive uniformly controlled...
Real-time distributed multimedia applications have special requirements in terms of bandwidth, delay, delay jitter, etc. The current network, essentially being a connection-less network, provides only un-reliable, best-effort service. The data packets may follow different paths to the destination. The network resources, viz., switch buffer and link bandwidth, are fairly shared by packets from different...
Actually, various kinds of sources (such as voice, video or data) with diverse traffic characteristics and quality of service requirements (QoS), which are multiplexed at very high rates, leads to significant traffic problems such as packet losses, transmission delays, delay variations, etc, caused mainly by congestion in the networks. The prediction of these problems in real time is quite difficult,...
The real time communication networks are designed to support multimedia applications requiring quality of services (QoS). The multicasting is needed when number of users want to communicate simultaneously. This paper present an approach based on evolutionary programming to solve the QoS constrained multicast routing problem, which is a NP complete problem. The multicast tree is obtained corresponding...
Anycast communication is a new Internet service defined in IPv6, and it can make a host communication with the one "nearest" member in a group of servers. The anycast routing problem with multiple QoS constrained is known to be NP-complete problem and we can't get satisfying results when using the precise method in polynomial time. In this paper, an improved ant colony optimization algorithm...
Packet classification enables network routers to provide advanced network services including network security, quality of service (QoS) routing, and multimedia communications. In order to classify a packet, network nodes must perform a search over a set of filters using multiple fields of the packet as the search key. Viewing the classification problem geometrically, classifying an arriving packet...
High speed modern communication networks are required to integrate and support multimedia application which requires differentiated quality-of-service (QoS) guarantees. Routing mechanism is a key to success of future communication networking. However, it is often complicated by the notion of guaranteed QoS, which can either be related to time, cost, packet loss or bandwidth requirements. Communication...
Under the quality of service (QoS) constraints, control policy for CAC and routing, that is, call admittance criterion and routing policy, is considered to decrease new call rejected probability and increase network utilization. In the paper, a new evaluation function is defined based on the available bandwidth and hop count, by which the policy with the admitted threshold and path selected algorithm...
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.