MINIMAX APPROACH FOR LOGICAL CONFIGURATION IN RECONFIGURABLE VIRTUAL CIRCUIT DATA-NETWORKS

This paper considers a problem of logical configuration in reconfigura ble VCDN (Virtual Circuit Data Networks) which is analyzed through a m imimax approach, and its objective is to minimize the largest delay on any logical link, measured in both queueing delay and propagation del ay. The problem is formulated as a 0/1 mixed integer programming and a nalyzed by decomposing it into two subproblems, called routing and dim ensioning problems, for which an efficient heuristic algorithm is prop osed in an iterating process made between the two subproblems for solu tion improvement. The algorithm is tested for its performance evaluati on.