Multiple-Way Network Partitioning with Different Cost Functions
IEEE Transactions on Computers
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
VISI Physical Design Automation: Theory and Practice
VISI Physical Design Automation: Theory and Practice
Dynamic Iterative Method for Fast Network Partitioning
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Load Balancing Using Modified Cost Function for Constraint-Based Routing over MPLS Networks
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part I
Multilevel Hierarchical Mobility Management Scheme in Complicated Structured Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
A repartitioning hypergraph model for dynamic load balancing
Journal of Parallel and Distributed Computing
An adaptive mobility anchor point selection scheme in Hierarchical Mobile IPv6 networks
Computer Communications
Scalable inter-area handovers for hierarchical wireless networks
IEEE Wireless Communications
Two novel multiway circuit partitioning algorithms using relaxed locking
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
In HMIPv6-based network architecture, Mobile Nodes (MNs) generate excessive signalling overhead, where they move at borders of different Mobility Anchor Point (MAP) domains. Furthermore all the traffic originated or destined to MNs must traverse through the MAPs. Thus, MAPs are potential points of bottlenecks in the network, as the traffic load grows. To mitigate these drawbacks, division of the access network domain into overlapping partitions (MAP domains) is proposed in order to provide more scalable and robust mobile services. Partitioning problem is an NP-hard problem. In this paper, we propose three, heuristic, Kernighan-Lin based partitioning algorithms to minimise the total inter-area handover rate as well as bottleneck effect of MAPs. Our proposed algorithms adopt the proposed scheme of multiple MAP deployment per domain, where each AR can be assigned to more than one MAP in the same level of hierarchy. The proposed algorithms dynamically adapt to traffic and mobility changes. We devise a cost function for each algorithm and formulate optimisation problems, accordingly. Then we evaluate the performance of the algorithms in terms of dynamic adaptation to mobility and load changes, and also to the degree of load-balance, and mean amount of bandwidth blocking and dropping rates. A simulation evaluation and comparison study with Sanchis algorithm, demonstrates that the proposed overlapping scheme outperforms the conventional non-overlapping scheme. Furthermore, all proposed algorithms obtain improved performance implementation of Sanchis algorithm.