IEEE

Novel disjoint graph based algorithm for multi-field range-based packet classification

Abstract: Packet classification is necessary for flow-based network services in Internet routers, such as NAPT, IPsec, ACL, etc. The range-based packet classification function maps input packets to ...
GitHub

Cost-Aware and Resilient Placement of Parallel Service Function Chains Using Multi-Stage Graph Modeling

MSG_SFC_Placement.py Python implementation of the Multi-Stage Graph (MSG) heuristic for cost-aware, delay-constrained, and reliable placement of parallel SFCs (Service Function Chains) with active and ...
Scientific Research Publishing

Z. Y. Wu, X. J. Dong, and L. Cui, “A grid-based energy aware node-disjoint multipath routing algorithm for MANETs,” in Proceedings of International Conference on Natural ...

ABSTRACT: With the advance of wireless communication technologies, small-size and high-performance computing and communication devices are increasingly used in daily life. After the success of second ...
TechRepublic

A New Scalable Parallel DBSCAN Algorithm Using the Disjoint-Set Data Structure

DBSCAN is a well-known density based clustering algorithm capable of discovering arbitrary shaped clusters and eliminating noise data. However, parallelization of DBSCAN is challenging as it exhibits ...
Scientific Research Publishing

X. Fang, S. Shi and J. Li, “A Disjoint Multi-Path Routing Algorithm in Wireless Sensor Network,” Journal of Computer Research and Development, Vol. 46, No. 12, 2009, pp ...

ABSTRACT: In a wireless sensor network, routing messages between two nodes s and t with multiple disjoint paths will increase the throughput, robustness and load balance of the network. The existing ...