A Study of Upper and Lower Bounds for Minimum Congestion Routing in Lightwave Networks
INFOCOM(1994)
摘要
In this paper we study the minimum congestion routing problem for local and metropolitanlight-wave networks, where congestion is defined as the maximum flow carried on anylink. We consider algorithms for computing both the upper and lower bounds on the congestion.For the lower bound, we discuss a new technique based on minimization of the total flowcarried in the network and present an efficient algorithm to compute it. This algorithmallows us to have an instance specific bound which can...
更多查看译文
关键词
optical links,simulated annealing,telecommunication network routing,trees (mathematics),algorithms,approximate solutions,flow trees,heuristic algorithms,lightwave networks,lower bounds,minimization,minimum congestion routing,simulated annealing,simulation studies,termination criteria,total flow,upper bounds,variable depth local search
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络