Results 1  10
of
5,243
Alternating paths
"... Given two disjoint point sets R y B in the plane (the red points and the blue points, respectively), an alternating path is a noncrossing path of line segments visiting alternatively red and blue points. In this work we study the properties of the longest such paths and give bounds on their length. ..."
Abstract
 Add to MetaCart
Given two disjoint point sets R y B in the plane (the red points and the blue points, respectively), an alternating path is a noncrossing path of line segments visiting alternatively red and blue points. In this work we study the properties of the longest such paths and give bounds on their length
Alternate Path Routing for Multicast
, 2000
"... Alternate path routing has been wellexplored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, aside from some work applying these concepts to unicast flows, alternate path routing has received little attention in the Internet com ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
Alternate path routing has been wellexplored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, aside from some work applying these concepts to unicast flows, alternate path routing has received little attention in the Internet
p. Alternative Path JPMs
"... I. Building a JPM m. EDG JPM (example; all pages) n. Walkthrough Development Category B o. Walkthrough System Coverage Requirements ..."
Abstract
 Add to MetaCart
I. Building a JPM m. EDG JPM (example; all pages) n. Walkthrough Development Category B o. Walkthrough System Coverage Requirements
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 620 (53 self)
 Add to MetaCart
variety of temporal logic: alternatingtime temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves. While lineartime and branchingtime logics are natural specification languages
Experimenting with Alternative Path Tracing Solutions
"... Abstract—Tracing Internet paths is essential for gathering knowledge about the complex, heterogeneous, highly dynamic, and largely opaque ecosystem of networks the Internet is. Currently, only two practical solutions are available: (i) equipping packets with the Record Route IP option to register a ..."
Abstract
 Add to MetaCart
addresses of the traversed routers; (ii) eliciting ICMP Time Exceeded messages by limiting the TimetoLive of the injected packets. In this paper, we investigate three alternative path tracing solutions eliciting ICMP Parameter Problem (PP) messages from the network through the injection of malformed
ZAPPALA 1 Alternate Path Routing for Multicast
"... Alternate path routing has been wellexplored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, aside from some work applying these concepts to unicast flows, alternate path routing has received little attention in the Internet com ..."
Abstract
 Add to MetaCart
Alternate path routing has been wellexplored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, aside from some work applying these concepts to unicast flows, alternate path routing has received little attention in the Internet
Alternate Path Routing and Pinning for Interdomain Multicast Routing
, 1997
"... Many researchers have explored enhancements of the Internet's besteffort service model that allow realtime and other inelastic applications to obtain preferential Quality of Service. However, these applications are limited to utilizing the opportunistic, shortestpath routes provided by the c ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
by the current routing infrastructure. To better support realtime applications, this paper introduces extensions to interdomain multicast routing to scalably compute and install alternate paths and nonopportunistic, or pinned, routes. We present a simple multicast setup protocol for installing alternate paths
A secure alternate path routing in sensor networks
, 2006
"... This paper presents a secure alternate path routing in sensor networks. Our alternate path scheme makes the routing protocol resilient in the presence of malicious nodes that launch selective forwarding attacks. SeRINS (a Secure alternate path Routing IN Sensor networks) detects and isolates the com ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
This paper presents a secure alternate path routing in sensor networks. Our alternate path scheme makes the routing protocol resilient in the presence of malicious nodes that launch selective forwarding attacks. SeRINS (a Secure alternate path Routing IN Sensor networks) detects and isolates
Alternating Paths along Axisparallel Segments
, 2003
"... It is shown that for a set S of n pairwise disjoint axisparallel line segments in the plane there is a simple alternating path of length Ω(√n). This bound is best possible in the worst case. In the special case that the n pairwise disjoint axisparallel line segments are protruded (that is, if the ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
It is shown that for a set S of n pairwise disjoint axisparallel line segments in the plane there is a simple alternating path of length Ω(√n). This bound is best possible in the worst case. In the special case that the n pairwise disjoint axisparallel line segments are protruded (that is
Alternating paths through disjoint line segments
 Inform. Process. Lett
, 2003
"... Abstract. We show that every segment endpoint visibility graph on Ò disjoint line segments in the plane admits an alternating path of length ¢ ÐÓ � Ò, answering a question of Bose. This bound is optimal apart from a constant factor. We also give bounds on the constants hidden by the asymptotic notat ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. We show that every segment endpoint visibility graph on Ò disjoint line segments in the plane admits an alternating path of length ¢ ÐÓ � Ò, answering a question of Bose. This bound is optimal apart from a constant factor. We also give bounds on the constants hidden by the asymptotic
Results 1  10
of
5,243