62583987
Enabling Confidentiality of Data Delivery in an Overlay Broadcasting System
In this paper, we present an extensive study of key dissemination schemes in an overlay multicast context, and the first to involve actual implementation, real traces, and performance in Internet environments. Given that rekey traffic has stronger resilience requirements and is burstier than data traffic, we consider whether data and keys must be distributed using the same overlay or using two separate dissemination structures. Our key findings are: (i) a coupled architecture is effective in achieving resilient key dissemination. Using TCP in each hop of the dissemination structure (an opportunity unique to overlays) is effective in achieving resiliency in end-to-end key delivery. The performance can be further enhanced if convergence properties of overlays are considered; and (ii) a coupled architecture optimized for data delivery has high overheads, while a coupled architecture optimized for key delivery may not honor access bandwidth constraints of nodes. Distributing data and keys using separate overlays achieves low overhead for key dissemination while honoring access bandwidth constraints of nodes.
1697925
The Impact of Heterogeneous Bandwidth Constraints on DHT-Based Multicast Protocols
In this paper, we consider support for bandwidth-demanding applications such as video broadcasting using DHTs. Our investigations focus on the impact of heterogeneity in the outgoing bandwidth capabilities of nodes on Scribe, a representative and relatively mature DHT-based multicast protocol. We expose important issues that arise due to the mismatch between the ID space that underlies the DHT and the outgoing bandwidth constraints on nodes.
7179412
Considering Priority in Overlay Multicast Protocols Under Heterogeneous Environments
Hosts participating in overlay multicast applications have a wide range of heterogeneity in bandwidth and participation characteristics. In this paper, we highlight and show the need to systematically consider prioritization as a key criterion in the design of protocols for overlay multicast. We identify trade-offs in the design of prioritization heuristics in two important contexts. The first part of the paper considers prioritization strategies in the context of heterogeneity in node outgoing bandwidth and node stay time durations, and a lack of correlation between the two dimensions. The second part of the paper considers bandwidth allocation and prioritization policies with multi-tree data delivery in environments with heterogeneity in outgoing bandwidth and a certain degree of altruistic behavior. We conduct a systematic study of the trade-offs using both real trace data, and sensitivity studies using synthetic workloads. To the best of our knowledge, this is the first work to identify and study these trade-offs, and to demonstrate the potential benefits of the resulting prioritization heuristics.
346423
Enabling contribution awareness in an overlay broadcasting system
We consider the design of bandwidth-demanding broadcasting applications using overlays in environments characterized by hosts with limited and asymmetric bandwidth, and significant heterogeneity in outgoing bandwidth. Such environments are critical to consider to extend the applicability of overlay multicast to mainstream Internet environments where insufficient bandwidth exists to support all hosts, but have not received adequate attention from the research community. We leverage the multi-tree framework and design heuristics to enable it to consider host contribution and operate in bandwidth-scarce environments. Our extensions seek to simultaneously achieve good utilization of system resources, performance to hosts commensurate to their contributions, and consistent performance. We have implemented the system and conducted an Internet evaluation on Planet-Lab using real traces from previous operational deployments of an overlay broadcasting system. Our results indicate for these traces, our heuristics can improve the performance of high contributors by 10-240% and facilitate equitable bandwidth distribution among hosts with similar contributions.
383922
Early Experience with an Internet Broadcast System Based on Overlay Multicast
In this paper, we report on experience in building and deploying an operational Internet broadcast system based on Overlay Multicast. In over a year, the system has been providing a cost-effective alternative for Internet broadcast, used by over 4000 users spread across multiple continents in home, academic and commercial environments. Technical conferences and special interest groups are the early adopters. Our experience confirms that Overlay Multicast can be easily deployed and can provide reasonably good application performance. The experience has led us to identify first-order issues that are guiding our future efforts and are of importance to any Overlay Multicast protocol or system. Our key contributions are (i) enabling a real Overlay Multicast application and strengthening the case for overlays as a viable architecture for enabling group communication applications on the Internet, (ii) the details in engineering and operating a fully functional streaming system, addressing a wide range of real-world issues that are not typically considered in protocol design studies, and (iii) the data, analysis methodology, and experience that we are able to report given our unique standpoint.
11142529
Segmentation of hybrid motions via hybrid quadratic surface analysis
In this paper, we investigate the mathematical problem underlying segmentation of hybrid motions: given a series of tracked feature correspondences between two (perspective) images, we seek to segment and estimate multiple motions, possibly of different types (e.g., affine, epipolar, and homography). In order to accomplish this task, we cast the problem into a more general mathematical framework of segmenting data samples drawn from a mixture of linear subspaces and quadratic surfaces. The result is a novel algorithm called hybrid quadratic surface analysis (HQSA). HQSA uses both the derivatives and Hessians of fitting polynomials for the data to separate linear data samples from quadratic data samples. These derivatives and Hessians also lead to important necessary conditions, based on the so-called mutual contraction subspace, to separate data samples on different quadratic surfaces. The algebraic solution we derive is non-iterative and numerically stable. It tolerates moderate noise and can be used in conjunction with outlier removal techniques. We show how to solve the hybrid motion segmentation problem using HQSA, and demonstrate its performance on simulated data with noise and on real perspective images.
17940922
Symmetry-based 3-D reconstruction from perspective images
Symmetry is an important geometric cue for 3-D reconstruction from perspective images. In this paper, we introduce a unified theoretical framework for extracting poses and structures of 2-D symmetric patterns in space from calibrated images. The framework uniformly encompasses all three fundamental types of symmetry, i.e., reflective, rotational, and translational, based on a systematic study of the homography groups in image induced by the symmetry groups in space. We claim that if a planar object admits rich enough symmetry, no 3-D geometric information is lost through perspective imaging. Based on two fundamental principles that utilize common spatial relations among symmetric objects, we have developed a prototype system which can automatically extract and segment multiple 2-D symmetric patterns present in a single perspective image. The result of such a segmentation is a hierarchy of new geometric primitives, called symmetry cells and complexes, whose 3-D structures and poses are fully recovered. Finally, we propose a new symmetry-based matching technique, which can effectively establish correspondences among the extracted symmetry cells across multiple images. We demonstrate the application of the proposed algorithms on image segmentation, matching, and 3-D reconstruction with extensive experimental results. The algorithms and systems are more accurate and easier to implement than existing point-or line-based methods.
7001903
Distributed object location in a dynamic network
Modern networking applications replicate data and services widely, leading to a need for location-independent routing -- the ability to route queries directly to objects using names independent of the objects' physical locations. Two important properties of a routing infrastructure are routing locality and rapid adaptation to arriving and departing nodes. We show how these two properties can be efficiently achieved for certain network topologies. To do this, we present a new distributed algorithm that can solve the nearest-neighbor problem for these networks. We describe our solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton, Rajaraman, and Richa [14].
42405939
Prediction of Bead Geometry in Pulsed Current Gas Tungsten Arc Welding of Aluminum Using Artificial Neural Networks
36356018
Solution of the Hamiltonian problem for self-complementary graphs
Abstract A graph G is said to be highly constricted if there exists a nonempty subset S of vertices such that (i) G − S has more than | S | components, (ii) S induces the complete graph, and (iii) for every u ∈ S and v ∉ S , we have d G ( u ) > d G ( v ), where d G ( u ) denotes the degree of u in G . In this paper it is shown that a non-hamiltonian self-complementary graph G of order p is highly constricted, unless p = 4 N and G is a particular graph G ∗ (4N) . It is also proved that if G is a self-complementary graph of order p (≥8) and π its degree sequence, then G is pancyclic if π has a realization with a hamiltonian cycle, and G has a 2-factor if π has a realization with a 2-factor, unless p = 4 N and G = G ∗ (4N) .