Abstract For the problem to find an m -clique in -partite graph, staircase compatibility has recently been introduced as a polynomial-time solvable special case. It is property of graph together with -partition vertex set and total orders on each subset partition. In optimization problems involving -cliques graphs subproblem, it allows for totally unimodular linear programming formulations, whi...

To cope with the ever growing availability of training data, there have been several proposals to scale machine learning computation beyond a single server and distribute it across a cluster. While this enables reducing the training time, the observed speed up is often limited by network bottlenecks. To address this, we design MLNET, a host-based communication layer that aims to improve the net...

IP-transport is a vehicle for integration of networks of different origins into a single entity. A new step in this evolution is the integration of fixed and mobile networks, not just at the service layer, but also at the infrastructure layer. Where such an integration for packet-based, non-real-time services looks evident, concerns exist about backward compatibility. In particular, the potenti...

Mobile adhoc network is an emerging standard or wireless communication. Due to the impendence in infrastructure dependencies these networks are rapidly emerging. These networks are since evolving has to develop methodologies for the compatibility of current services in such an environment. Various services compatibilities were studied and methodologies were proposed for the same. One basic prob...

Address resolution protocol (ARP) is widely used tomaintainmapping between data link (e.g.MAC) and network (e.g. IP) layer addresses. Although most hosts rely on automated and dynamic management of ARP cache entries, current implementation is well-known to be vulnerable to spoofing or denial of service (DoS) attacks. There are many tools that exploit vulnerabilities of ARP protocols, and past p...