All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 21

Showing per page

A chaos-based secure cluster protocol for wireless sensor networks

Qian Fang, Ying Liu, Xiaoqun Zhao (2008)

Kybernetika

Security mechanisms for wireless sensor networks (WSN) face a great challenge due to the restriction of their small sizes and limited energy. Hence, many protocols for WSN are not designed with the consideration of security. Chaotic cryptosystems have the advantages of high security and little cost of time and space, so this paper proposes a secure cluster routing protocol based on chaotic encryption as well as a conventional symmetric encryption scheme. First, a principal-subordinate chaotic function...

A model and an algorithm for the grouping problem in telecom networks.

F. García, K. D. Hackbarth (1991)

Qüestiió

This paper deals with the so called grouping problem which arises in telecommunication network optimization when transmission equipment with a certain hierarchy is used. It is shown how this problem is embedded in the complete scheme of network optimization and a general combinatorial model is developed to derive afterwards a solution procedure. The implementation of this procedure forms part of a software tool for the complete problem of transmission network planning. Some results deriving from...

ABR traffic control over multisource single-bottleneck ATM networks

Andrzej Bartoszewicz, Tomasz Molik (2004)

International Journal of Applied Mathematics and Computer Science

The problem of flow control in fast, connection-oriented communication networks supporting the traffic generated by multiple sources is considered. A novel sampled time strategy governing the behaviour of the sources is proposed. The strategy combines the Smith principle with the conventional sampled time proportional controller. It guarantees an equal resource allocation between various users, full bottleneck link utilisation and no cell loss in the controlled network. Consequently, the need for...

An approach to robust network design in telecommunications

Georgios Petrou, Claude Lemaréchal, Adam Ouorou (2007)

RAIRO - Operations Research

In telecommunications network design, one of the most frequent problems is to adjust the capacity on the links of the network in order to satisfy a set of requirements. In the past, these requirements were demands based on historical data and/or demographic predictions. Nowadays, because of new technology development and customer movement due to competitiveness, the demands present considerable variability. Thus, network robustness w.r.t demand uncertainty is now regarded as a major consideration....

Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies

Yuliya Gaidamaka, Alexander Pechinkin, Rostislav Razumchik, Konstantin Samouylov, Eduard Sopin (2014)

International Journal of Applied Mathematics and Computer Science

Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system M [ X ] | G | 1 ⟨ L , H ⟩ | ⟨ H , R ⟩ with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered....

Ant algorithm for flow assignment in connection-oriented networks

Krzysztof Walkowiak (2005)

International Journal of Applied Mathematics and Computer Science

This work introduces ANB (bf Ant Algorithm for bf Non-bf Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern the use...

Approximation algorithms for the design of SDH/SONET networks

Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants (2003)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.

Approximation algorithms for the design of SDH/SONET networks

Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants (2010)

RAIRO - Operations Research

In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.

Currently displaying 1 – 20 of 21

Page 1 Next