—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
In this paper, we examine changes in Internet inter-domain traffic demands and interconnection policies. We analyze more than 200 Exabytes of commercial Internet traffic over a tw...
Craig Labovitz, Scott Iekel-Johnson, Danny McPhers...
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...