Routing subject to quality of service constraints in integrated communication networks

WC Lee, MG Hluchyi, PA Humblet - IEEE Network, 1995 - ieeexplore.ieee.org
With increasingly diverse QOS requirements, it is impractical to continue to rely on
conventional routing paradigms that emphasize the search for an optimal path based on a …

A genetic algorithm for designing distributed computer network topologies

S Pierre, G Legault - IEEE Transactions on Systems, Man, and …, 1998 - ieeexplore.ieee.org
The topological design of distributed packet switched networks consists of finding a topology
that minimizes the communication costs by taking into account a certain number of …

Topological design of computer communication networks using simulated annealing

S Pierre, MA Hyppolite, JM Bourjolly… - Engineering Applications of …, 1995 - Elsevier
This paper presents an application of the simulated annealing heuristic to the problem of
designing computer communication networks. This problem essentially consists in finding …

Fairness issues in the networking environment

C Douligeris, LN Kumar - computer communications, 1995 - Elsevier
Network users and designers are frequently concerned about the fairness of service
achieved either in local networking or in internetworking. However, because of its subjective …

Polling period controlling apparatus

K Yoshihara, H Horiuchi, K Sugiyama… - US Patent …, 2004 - Google Patents
(57) ABSTRACT A polling period controlling apparatus capable of polling with a period
traceable temporal variations of management information values of a managed unit is …

Fairness in QoS guaranteed networks

RH Hwang, CF Chi - IEEE International Conference on …, 2003 - ieeexplore.ieee.org
The Internet protocol, based on packet switching technique, provides an efficient sharing of
network bandwidth. However, fairness is always an important issue when resources are …

Access to a network channel: a survey into the unfairness problem

C Douligeris, LN Kumar - … /ICC'92 Discovering a New World of …, 1992 - ieeexplore.ieee.org
Network users and designers are frequently concerned about the fairness of service
achieved either in the local network or in internetworking. The authors compile the basic …

Routing in computer networks using artificial neural networks

S Pierre, H Said, WG Probst - Artificial Intelligence in Engineering, 2000 - Elsevier
This paper proposes a heuristic approach based on Hopfield model of neural networks to
solve the problem of routing which constitutes one of the key aspects of the topological …

A routing algorithm for distributed communication networks

R Beaubrun, S Pierre - … of 22nd Annual Conference on Local …, 1997 - ieeexplore.ieee.org
As the speed and number of LANs continue to increase higher and higher demand is placed
on wide area networks. To support the tremendous traffic and to avoid link congestion, such …

Inferring new design rules by machine learning: a case study of topological optimization

S Pierre - IEEE Transactions on Systems, Man, and …, 1998 - ieeexplore.ieee.org
This paper presents a machine learning approach to the topological optimization of
computer networks. Traditionally formulated as an integer program, this problem is well …