Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing pat...

Two important factors must be considered when selecting a restoration scheme in MPLS networks. Firstly, the restoration time, and consequentially the packet latency of the restored trafiic, has to satisfy the requirements of realtime services. Secondly, the spare capacity requirement should be costeffective. This paper proposes a novel proactive restoration scheme that is both fast-acting and r...

In the path minimum query problem, we preprocess a tree on n weighted nodes, such that given an arbitrary path, we can locate the node with the smallest weight along this path. We design novel succinct indices for this problem; one of our index structures supports queries in O(α(m,n)) time, and occupiesO(m) bits of space in addition to the space required for the input tree, where m is an intege...

Larval dispersal is a crucial factor for fish recruitment. For fishes with relatively small-bodied larvae, drift has the potential to play a more important role than active habitat selection in determining larval dispersal; therefore, we expect small-bodied fish larvae to be poorly associated with habitat characteristics. To test this hypothesis, we used as model yellow perch (Perca flavescens)...

This paper describes an algorithm which finds the smallest set of smallest rings of a ring system without the necessity of finding all rings in the ring system. The algorithm first finds the smallest rings in which unused atoms occur and then progresses to find the smallest rings in which unused edges and faces occur until the smallest set of rings required to describe the complete ring system ...