Abstract-Over the past few years, many scientists have envisioned an Internet generation that will not only provide voice and data communications but can also support Haptic communications. This new Internet dimension can be beneficial for the society by facilitating the development of new technologies and applications that will improve our standards of living. In this study, we propose a novel traffic engineering policy that can satisfy the extremely strict requirements of the new traffic class associated with Haptic communications. Our proposed policy is based on Multi-Plane Routing (MPR) that consolidates various aspects in all-IP access infrastructures and enables networkwide path diversity. To this end, MPR has been remodeled and extended to facilitate Haptic communications. Our simulation results demonstrate that our proposed policy outperforms intradomain routing protocols namely Open Shortest Path First (OSPF) and performs near-optimally. It will also become apparent that shortest-path solutions such as OSPF can not be used in order to handle Haptic communications in typical Internet network topologies. Finally, we formulate a binary optimization problem for the selection of the optimal Routing Plane (RP) in terms of the network effects such as delay, jitter and packet loss.

If citing, it is advised that you check and use the publisher's definitive version for pagination, volume/issue, and date of publication details. And where the final published version is provided on the Research Portal, if citing you are again advised to check the publisher's website for any subsequent corrections.

No abstract

No abstract

The expected variable nature of future access network structures calls for network providers to adapt accordingly in order to facilitate loss free networks supported with the developing IP infrastructure. To this end, a routing optimization mechanism applicable to randomly shaped all-IP access networks must be developed. In this paper, Multi-Plane Routing (MPR) that consolidates various aspects in all-IP infrastructure as a whole is redesigned and reformulated to provide a comprehensive solution in consideration of the randomness of future access networks. We prove the offline Routing Plane (RP) construction problem as being the generalization of the Minimum Set Cover (MSC) problem which is NP and also NP-complete. To this end, we propose a novel MSC-based paths-diverse offline TE algorithm which is comprehensively applicable to random wireless access network structures. Our simulation results demonstrate the constructed RPs for complex random networks of different sizes and sparseness (i.e. meshing). Hence, the comprehensive applicability of our novel approach is verified. Moreover, we propose a new optimization framework along with a dynamic cost function (considering capacity and correlation of paths) that formally describe our novel offline TE mechanism for future randomly shaped wireless IP access networks.