Sciweavers

336 search results - page 38 / 68
» Approximating Transitivity in Directed Networks
Sort
View
ICNP
2009
IEEE
15 years 4 months ago
Principles of Safe Policy Routing Dynamics
—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...
Sam Epstein, Karim Mattar, Ibrahim Matta
CP
2006
Springer
15 years 1 months ago
Towards an Efficient SAT Encoding for Temporal Reasoning
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...
Duc Nghia Pham, John Thornton, Abdul Sattar
SIGCOMM
2010
ACM
14 years 10 months ago
Internet inter-domain traffic
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...
INFOCOM
2008
IEEE
15 years 4 months ago
Cross-Monotonic Multicast
—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...
Zongpeng Li
KAIS
2011
129views more  KAIS 2011»
14 years 4 months ago
Counting triangles in real-world networks using projections
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...
Charalampos E. Tsourakakis