Routing optimization in packet switching communication networks

DOI10.1016/0377-2217(85)90180-8MaRDI QIDQ759633zbMATH OpenOpenAlexFDO

Authors Ziny Flikop

Publication date 1985

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(85)90180-8

zbMATH Keywords

adaptive nonlinear optimization algorithmpacket switching communication networksrouting assignments

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Review text

For routing assignments a special model and an optimization algorithm are proposed. The efficiency of the routing assignments is evaluated by the average value of the total cost of delays for all packets in the network. It is the objective function. The main idea is that traffic, which is transmitted from the source node to the destination node, can be split between two or more logical paths. The minimum of the objective function can be found by varying the traffic on every path and simultaneously from all the source nodes to the destination nodes. If this approach is applied, then the objective function is nonseparable and nonlinear. Because its shape is unknown in advance, an adaptive nonlinear optimization algorithm is proposed. For evaluating its efficiency a special set of test functions has been used.

Recommendations

• scientific article; zbMATH DE number 3922330
• scientific article; zbMATH DE number 3887398
• scientific article; zbMATH DE number 3880602
• On the capacity assignment problem in packet-switching computer networks
• scientific article; zbMATH DE number 3891063

Cites work

• A Minimum Delay Routing Algorithm Using Distributed Computation
• scientific article; zbMATH DE number 3307136 (Why is no real title available?)
• Optimal Routing in a Packet-Switched Computer Network
• The Modeling of Adaptive Routing in Data-Communication Networks

Cited in

(18)

• Some problems with the design of self-learning open-loop control systems
• Network optimization for unified packet and circuit switched networks
• Routing and switching a significant number of television signals covering large areas
• On the construction of routing algorithms for packet networks using vector criteria
• scientific article; zbMATH DE number 3887398 (Why is no real title available?)
• Routeing in a Network with Multi-Class Links
• scientific article; zbMATH DE number 3880602 (Why is no real title available?)
• scientific article; zbMATH DE number 3891063 (Why is no real title available?)
• scientific article; zbMATH DE number 4209565 (Why is no real title available?)
• Packet Routing: Complexity and Algorithms
• Adaptive Routing Algorithm in Wireless Communication Networks Using Evolutionary Algorithm
• scientific article; zbMATH DE number 3922330 (Why is no real title available?)
• scientific article; zbMATH DE number 4108464 (Why is no real title available?)
• Routing in packet-switched communication networks with different criticality classes of communicating node pairs
• Routing strategies for fast networks
• Selection of dedicated channels and flow optimization in a packet switched network
• The generalized packet routing problem
• Optimal routing of data flows in wireless sensor networks

This page was built for publication: Routing optimization in packet switching communication networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759633)