2394010
Efficient broadcasting in ad hoc wireless networks using directional antennas
Using directional antennas to conserve bandwidth and energy consumption in ad hoc wireless networks (or simply ad hoc networks) is becoming popular. However, applications of directional antennas for broadcasting have been limited. We propose a novel broadcast protocol called directional self-pruning (DSP) for ad hoc wireless networks using directional antennas. DSP is a nontrivial generalization of an existing localized deterministic broadcast protocol using omnidirectional antennas. Compared with its omnidirectional predecessor, DSP uses about the same number of forward nodes to relay the broadcast packet, while the number of forward directions that each forward node uses in transmission is significantly reduced. With the lower broadcast redundancy, DSP is more bandwidth and energy-efficient. DSP is based on 2-hop neighborhood information and does not rely on location or angle-of-arrival (AoA) information. Two special cases of DSP are discussed: the first one preserves shortest paths in reactive routing discoveries; the second one uses the directional reception mode to minimize broadcast redundancy. DSP is a localized protocol. Its expected number of forward nodes is O(1) times the optimal value. An extensive simulation study using both custom and ns2 simulators show that DSP significantly outperforms both omnidirectional broadcast protocols and existing directional broadcast protocols.
16257632
XYZ: a scalable, partially centralized lookup service for large-scale peer-to-peer systems
Peer-to-peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the Internet, allowing users to easily contribute, search and obtain content. P2P systems can be categorized by the degrees of centralization. For fully centralized systems, the lookup service will not be available when the central directory server is down. For purely decentralized and unstructured systems, since there is no information about which nodes are likely to have the relevant files, searching essentially amounts to random search. This makes the lookup service unscalable and unpredictable. The objective of this paper is to design a partially centralized, scalable and self-organizing lookup service (XYZ) for wide area P2P systems. A clustering method is used to create the system backbone by connecting the cluster heads together and a color clustering method is adopted to create color overlays and minimize the searching space. Simulations and analysis are also provided. Extensions are proposed to achieve better performance
7582647
On self-similarity and hamiltonicity of dual-cubes
The dual-cube is a newly proposed topology for interconnection networks, which uses low dimensional hypercubes as building blocks. The primary advantages of the dual-cube over the hypercube are that, with the same node degree n, the dual-cube contains 2/sup n-1/ times more nodes than the hypercube and, with the same amount of nodes, the dual-cube has approximately 50% less links than the hypercube. This paper was focused on the investigations of the structural self-similarity and the Hamiltonian property of the dual-cube. It was shown that a dual-cube can be recursively constructed from lower dimensional dual-cubes and, conversely, a dual-cube can be recursively decomposed into lower dimensional dual-cubes. It was also proved that all dual-cubes are Hamiltonian. There exist multiple Hamiltonian cycles on a dual-cube, among which, [(n-1)/2] cycles are edge-disjoint. It was illustrated that rings and linear arrays can be effectively emulated on dual-cubes. Some strategies for track sharing in efficient VLSI layout design were also discussed.
17371165
QoS Routing in Hypercube Multicomputers
In this paper, we present a coding method to capture QoS information in hypercube multicomputers. The coding method is based on a localized algorithm where each node interacts with its neighbors to gather QoS information. Specifically, each node maintains a QoS vector where the k-th element represents the guaranteed QoS performance to a destination that is k hops away. The localized algorithm exhibits desirable properties of self-stabilizing, self-optimizing, and self-healing. Simulation results show that this coding method provides a good approximation of the minimum QoS value to a k-hop destination and, at the same time, uses a relatively small number of packets to propagate a change in link state (QoS value) compared with the classical distributed Bellman-Ford method.
27746153
Broadcasting in Faulty Cube-Connected-Cycles with Minimum Recovery Time
We propose a broadcasting algorithm for a faulty Cube-Connected-Cycles multiprocessor. The broadcasting algorithm delivers a message to all the nodes non-redundantly using a binomial tree. The traffic generated because of the recovery is guaranteed to be minimum.
2254959
Local-Safety-Information-Based Broadcasting in Hypercube Multicomputers with Node and Link Faults
This paper presents a method to cope with fault-tolerant broadcasting in hypercube multicomputers with both node and link faults. The local safety concept is extended to faulty hypercubes with both node and link faults. The local-safety-based algorithm is used in a fully unsafe hypercube, where there is no safe node. A fully unsafe hypercube can be split into a set of maximal safe subcubes. We show that if these maximal safe subcubes meet certain requirements given in the paper, broadcasting can still be carried out successfully and in some case optimal broadcast is still possible. The method is extended to fault-tolerant routing and multicasting when the system contains both node and link faults.
62540784
Customer-managed end-to-end lightpath provisioning
Customer-owned and managed optical networks bring new cost-saving benefits. Two types of such networks are becoming widely used: metro dark fiber networks and long-haul leased wavelength networks. Customers may invoke a special QoS mechanism where end-to-end (E2E) lightpaths are dynamically established across multiple independently managed customer domains. The cost of bandwidth is substantially reduced since it largely becomes a capital cost rather than an ongoing service charge. Customers can optimize the overall resource consumption by utilizing resources from different suppliers. Remote peering and transit reduce the Internet connectivity cost. Bandwidth and quality of service are guaranteed because customers directly peer with each other using transport networks. An architecture for a customer-managed E2E lightpath provisioning system is presented. Integration with Grid applications is discussed and a prototype demonstration is described.
412675
Linear Asymmetric Classifier for cascade detectors
The detection of faces in images is fundamentally a rare event detection problem. Cascade classifiers provide an efficient computational solution, by leveraging the asymmetry in the distribution of faces vs. non-faces. Training a cascade classifier in turn requires a solution for the following subproblems: Design a classifier for each node in the cascade with very high detection rate but only moderate false positive rate. While there are a few strategies in the literature for indirectly addressing this asymmetric node learning goal, none of them are based on a satisfactory theoretical framework. We present a mathematical characterization of the node-learning problem and describe an effective closed form approximation to the optimal solution, which we call the Linear Asymmetric Classifier (LAC). We first use AdaBoost or AsymBoost to select features, and use LAC to learn a linear discriminant function to achieve the node learning goal. Experimental results on face detection show that LAC can improve the detection performance in comparison to standard methods. We also show that Fisher Discriminant Analysis on the features selected by AdaBoost yields better performance than AdaBoost itself.
59008197
A cycle-based rerouting scheme for wavelength-routed WDM networks
In this paper, we propose a cycle-based rerouting scheme (CRS) for link restoration in wavelength-routed WDM networks. The CRS is based on a scalable set of Pcycles covering a mesh network. Instead of using these Pcycles as enhanced self-healing rings as in traditional approaches, the CRS decomposes these P-cycles into rerouting paths for the links that the P-cycles cover. In this way, flexible and cost-effective link restoration is achieved. Simulation results show that the rerouting performance of the CRS can be very close to the theoretical upper bound.
10351800
Identification of functional links between genes using phylogenetic profiles
MOTIVATION
Genes with identical patterns of occurrence across the phyla tend to function together in the same protein complexes or participate in the same biochemical pathway. However, the requirement that the profiles be identical (i) severely restricts the number of functional links that can be established by such phylogenetic profiling; (ii) limits detection to very strong functional links, failing to capture relations between genes that are not in the same pathway, but nevertheless subserve a common function and (iii) misses relations between analogous genes. Here we present and apply a method for relaxing the restriction, based on the probability that a given arbitrary degree of similarity between two profiles would occur by chance, with no biological pressure. Function is then inferred at any desired level of confidence.


RESULTS
We derive an expression for the probability distribution of a given number of chance co-occurrences of a pair of non-homologous orthologs across a set of genomes. The method is applied to 2905 clusters of orthologous genes (COGs) from 44 fully sequenced microbial genomes representing all three domains of life. Among the results are the following. (1) Of the 51 000 annotated intrapathway gene pairs, 8935 are linked at a level of significance of 0.01. This is over 30-fold greater than the 271 intrapathway pairs obtained at the same confidence level when identical profiles are used. (2) Of the 540 000 interpathway genes pairs, some 65 000 are linked at the 0.01 level of significance, some 12 standard deviations beyond the number expected by chance at this confidence level. We speculate that many of these links involve nearest-neighbor path, and discuss some examples. (3) The difference in the percentage of linked interpathway and intrapathway genes is highly significant, consistent with the intuitive expectation that genes in the same pathway are generally under greater selective pressure than those that are not. (4) The method appears to recover well metabolic networks. This is illustrated by the TCA cycle which is recovered as a highly connected, weighted edge network of 30 of its 31 COGs. (5) The fraction of pairs having a common pathway is a symmetric function of the Hamming distance between their profiles. This finding, that the functional correlation between profiles with near maximum Hamming distance is as large as between profiles with near zero Hamming distance, and as statistically significant, is plausibly explained if the former group represents analogous genes.
17480069
Similarity-based Web service matchmaking
With the increasing growth in popularity of Web services, matchmaking of relevant Web services becomes a significant challenge. Commonly, Web service is described by WSDL and published on UDDI registers. UDDI provides limited search facilities allowing only a keyword-based search of businesses, services, and the so called tModels based on names and identifiers. This category-based keyword-browsing method is clearly insufficient. Semantic Web service uses DAML-S instead of WSDL to represent capabilities of Web services. This improvement enables software agents or search engines to automatically find appropriate Web services via ontologies and reasoning algorithm enriched methods. However, the high cost of formally defining to the heavy and complicated services makes this improvement widespread adoption unlikely. To cope with these limitations, we have developed a suite of methods which assesses the similarity of Web services to achieve matchmaking. In particular, we present a conceptual model which classifies properties of Web services into four categories. For each category, a similarity assessment method has been given. In Web service matchmaking process, these similarity assessment methods can be used together or individually. Experiments highlight complementary contributions that our work makes to facilitate Web service matchmaking.