Sciweavers

618 search results - page 23 / 124
» Mechanism design for policy routing
Sort
View
CCS
2009
ACM
16 years 12 days ago
Efficient IRM enforcement of history-based access control policies
Inlined Reference Monitor (IRM) is an established enforcement mechanism for history-based access control policies. IRM enforcement injects monitoring code into the binary of an un...
Fei Yan, Philip W. L. Fong
ECOOPW
1999
Springer
15 years 4 months ago
Providing Policy-Neutral and Transparent Access Control in Extensible Systems
Extensible systems, such as Java or the SPIN extensible operating system, allow for units of code, or extensions, to be added to a running system in almost arbitrary fashion. Exte...
Robert Grimm, Brian N. Bershad
INFOCOM
2007
IEEE
15 years 6 months ago
Cluster-Based Forwarding for Reliable End-to-End Delivery in Wireless Sensor Networks
—Providing efficient and reliable communication in wireless sensor networks is a challenging problem. To recover from corrupted packets, previous approaches have tried to use re...
Qing Cao, Tarek F. Abdelzaher, Tian He, Robin Krav...
CN
2002
127views more  CN 2002»
14 years 11 months ago
Optimal policy for label switched path setup in MPLS networks
An important aspect in designing a multiprotocol label switching (MPLS) network is to determine an initial topology and to adapt it to the traffic load. A topology change in an MP...
Tricha Anjali, Caterina M. Scoglio, Jaudelice Cava...
MINENET
2006
ACM
15 years 5 months ago
How to extract BGP peering information from the internet routing registry
We describe an on-line service, and its underlying methodology, designed to extract BGP peerings from the Internet Routing Registry. Both the method and the service are based on: ...
Giuseppe Di Battista, Tiziana Refice, Massimo Rimo...