Hybrid path allocation scheme for multilayer networks

We propose a hybrid path allocation scheme for multilayer networks to satisfy different levels of latency, throughput, and cost requirements. No single conventional routing algorithm is able by itself to meet all these requirements. In order to solve this problem, we hybridize multiple routing algorithms using service classification and prioritized path assignment techniques. In this scheme, path setup requests are classified into multiple service classes according to their policy requirements. Then they are served by selection of path routing algorithms according to their classes. They are also assigned appropriate path priority levels. Here, high-priority paths are allocated so as to replace existing low-priority paths that block their setup. Our simulation results have shown that a combination of the minimum-hop routing algorithm (MHA) for the highest priority, the widest shortest-path routing algorithm (WSPA) for the middle priority, and the minimum-interference routing algorithm (MIRA) for the lowest priority are effective in offering low-latency, high-throughput, and low-cost services, simultaneously. © 2010 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.