in this paper, analysis and simulation of media gateway controller (megaco) based cops (common open policy server) which is a protocol defined in ietf (internet engineering task force) to transport configuration requests and deliver the policies is presented. for this scenario, three queuing models include m/m/1, m/m/c and m/d/c were applied . then, some of the key performance benchmarks look l...

The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify the minimum number of cops sufficient to catch the visible and very fast robber. To catch the robber, at least one of the cops should be within at most r edges from him. We give a constant factor approximation algorithm...

Several variants of the cops and robbers (CR) game have been studied in the past. In this paper we examine a novel variant, which is played between two cops, each one independently trying to catch a " passive robber ". We will call this the Selfish Cops and Passive Robber (SCPR) game. In short, SCPR is a stochastic two-player, zero-sum game where the opponents are the two cop players. We study ...

Aigner and Fromme initiated the systematic study of the cop number of a graph by proving the elegant and sharp result that in every connected planar graph, three cops are sufficient to win a natural pursuit game against a single robber. This game, introduced by Nowakowski and Winkler, is commonly known as Cops and Robbers in the combinatorial literature. We extend this study to directed planar ...

The Cops and Robbers game is played on undirected graphs where a group of cops tries to catch a robber. The game was defined independently by Winkler-Nowakowski and Quilliot in the 1980s and since that time has been studied intensively. Despite of that, its computation complexity is still an open question. In this paper we prove that computing the minimum number of cops that can catch a robber ...

The COP400 single-chip controller family members provide computational ability and speed which is more than adequate to intelligently manage power control. These controllers provide digital control while low cost and short turnaround enhance COPSTM desirability. The COPS controllers are capable of 4 ms cycle times which can provide more than adequate computational ability when controlling 60 Hz...

We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we call the lazy cop number. Lazy Cops and Robbers was recently introduced by Offner and Ojakian, who provided asymptotic upper and lower bounds on the lazy cop number of the hypercube. By coupling th...

Introduction The second International Workshop on Collaborative Peer-to-Peer Information Systems, COPS06 was held in Manchester University as part of WETICE-2006. It was the second meeting devoted to the study of the emerging field of Cooperative Information Systems and P2P networks or Cooperative P2Pbased Information Systems (COPS). The first edition has been focused on trust management and mi...