Titlebook: NETWORKING 2004: Networking Technologies, Services, and Protocols; Performance of Computer and Commu; Networking Technolog Nikolas Mitrou,K

heterogeneous

不自然

組成

Traffic Grooming in WDM Ring Networks with the Min-Max Objectiven this work, we consider a ., in which it is desirable to minimize the cost at the node where this cost is maximum. Such an objective is of practical value when dimensioning a network for unknown future traffic demands and/or for dynamic traffic scenarios. We prove that traffic grooming with the Min

刪除

Coronation

刺耳

Overlay Multicast Tree Minimizing Average Time Delayme time, the proposed algorithm considers the computing power and the network condition of each end-system as a control variable and thus we can avoid the disastrous case that loads are concentrated to only several end-systems. The multicast tree is constructed by clustering technique and modified D