The following information was submitted:
Transactions: INTERNATIONAL JOURNAL of MATHEMATICAL MODELS AND METHODS IN APPLIED SCIENCES
Transactions ID Number: 20-254
Full Name: Milan Tuba
Position: Professor
Age: ON
Sex: Male
Address: Faculty of Computer Science, Bulevar umetnost 29, 11070 Belgrade, SERBIA
Country: YUGOSLAVIA
Tel: +381 64 8650052
Tel prefix:
Fax:
E-mail address: tubamilan@ptt.rs
Other E-mails:
Title of the Paper: Guided Maximum Entropy Method Algorithm for the Network Topology and Routing
Authors as they appear in the Paper: Milan Tuba
Email addresses of all the authors: tubamilan@ptt.rs
Number of paper pages: 8
Abstract: This paper presents an algorithm that applies a guided maximum entropy method to the network design problem. Network design problem is a well known NP-hard problem which almost always involves underdetermined systems, especially when routing policy has to be determined. The maximum entropy method is a relatively new technique for solving underdetermined systems. We adjusted the network design problem, primarily the routing feasibility, to the maximum entropy method requirements. Computationally feasible algorithm is developed which includes additional constraints that direct uniformity of the solution in the desirable direction. Proposed algorithm computes a reasonable solution that is robust with respect to often required dynamic changes of the cost function. This modified method exploits the property of the MEM that it can smoothly move from cases where constraints can be satisfied to cases where constraints become desirable goals that are satisfied as much as po!
ssible. A software system was developed which includes all the mentioned features.
Keywords: Maximum entropy method, Network routing, Computer
EXTENSION of the file: .pdf
Special (Invited) Session: An Algorithm for the Network Design Problem Based on the Maximum Entropy Method
Organizer of the Session: 629-242
How Did you learn about congress:
IP ADDRESS: 89.110.232.200
