We proposed a novel solution schema called the Hierarchical Labeling Schema （HLS） to answer reachability queries in directed graphs. Different from many existing approaches that focus on static directed acyclic grap...We proposed a novel solution schema called the Hierarchical Labeling Schema （HLS） to answer reachability queries in directed graphs. Different from many existing approaches that focus on static directed acyclic graphs （DAGs）, our schema focuses on directed cyclic graphs （DCGs） where vertices or arcs could be added to a graph incrementally. Unlike many of the traditional approaches, HLS does not require the graph to be acyclic in constructing its index. Therefore, it could, in fact, be applied to both DAGs and DCGs. When vertices or arcs are added to a graph, the HLS is capable of updating the index incrementally instead of re-computing the index from the scratch each time, making it more efficient than many other approaches in the practice. The basic idea of HLS is to create a tree for each vertex in a graph and link the trees together so that whenever two vertices are given, we can immediately know whether there is a path between them by referring to the appropriate trees. We conducted extensive experiments on both real-world datasets and synthesized datasets. We compared the performance of HLS, in terms of index construction time, query processing time and space consumption, with two state-of-the-art methodologies, the path-tree method and the 3-hop method. We also conducted simulations to model the situation when a graph is updated incrementally. The performance comparison of different algorithms against HLS on static graphs has also been studied. Our results show that HLS is highly competitive in the practice and is particularly useful in the cases where the graphs are updated frequently.展开更多
Multi-protocol label switching（MPLS） has the advantage of high efficiency in the second layer, which improves the performance of data packets routing. In this paper, a new structure to implement optical MPLS is prop...Multi-protocol label switching（MPLS） has the advantage of high efficiency in the second layer, which improves the performance of data packets routing. In this paper, a new structure to implement optical MPLS is proposed. We construct a code family for spectral-amplitude coding（SAC） labels in the optical MPLS networks. SAC labels are suitable for optical packet switching because they can be constructed and recognized quickly at each router. We use the label stacking to provide hierarchical routing to avoid swapping labels at each forwarding node and reduce system complexity. However, the phase-induced intensity noise（PIIN） appears due to the incoherent property of the light source when the stacked labels set makes the correlation decoding with the local node label,which degrades system performance.展开更多
文摘We proposed a novel solution schema called the Hierarchical Labeling Schema （HLS） to answer reachability queries in directed graphs. Different from many existing approaches that focus on static directed acyclic graphs （DAGs）, our schema focuses on directed cyclic graphs （DCGs） where vertices or arcs could be added to a graph incrementally. Unlike many of the traditional approaches, HLS does not require the graph to be acyclic in constructing its index. Therefore, it could, in fact, be applied to both DAGs and DCGs. When vertices or arcs are added to a graph, the HLS is capable of updating the index incrementally instead of re-computing the index from the scratch each time, making it more efficient than many other approaches in the practice. The basic idea of HLS is to create a tree for each vertex in a graph and link the trees together so that whenever two vertices are given, we can immediately know whether there is a path between them by referring to the appropriate trees. We conducted extensive experiments on both real-world datasets and synthesized datasets. We compared the performance of HLS, in terms of index construction time, query processing time and space consumption, with two state-of-the-art methodologies, the path-tree method and the 3-hop method. We also conducted simulations to model the situation when a graph is updated incrementally. The performance comparison of different algorithms against HLS on static graphs has also been studied. Our results show that HLS is highly competitive in the practice and is particularly useful in the cases where the graphs are updated frequently.
文摘Multi-protocol label switching（MPLS） has the advantage of high efficiency in the second layer, which improves the performance of data packets routing. In this paper, a new structure to implement optical MPLS is proposed. We construct a code family for spectral-amplitude coding（SAC） labels in the optical MPLS networks. SAC labels are suitable for optical packet switching because they can be constructed and recognized quickly at each router. We use the label stacking to provide hierarchical routing to avoid swapping labels at each forwarding node and reduce system complexity. However, the phase-induced intensity noise（PIIN） appears due to the incoherent property of the light source when the stacked labels set makes the correlation decoding with the local node label,which degrades system performance.
