Kowalewskiella totani n. sp. (Cestoda: Dilepididae) from Totanus flavipes

Totanus flavipes (Gmelin) 1789 (lesser yellowlegs) collected from the Cheyenne Bottoms Waterfowl Management area, Barton County, Kansas was parasitized by cestodes belonging to the poorly known genus Kowalewskiella Baczynska 1914 and constituting a species new to science. Kowalewskiella totani n. sp. is described from Totanus flavipes from Barton County, Kansas. It differs from K. cingulifera (Krabbe 1869) Sandeman 1959 in being much larger and having roughly twice as many testes as the latter species.

Optical Communication Networks for the Next-Generation Internet

Computer and telecommunication networks are changing the world dramatically and will continue to do so in the foreseeable future. The Internet, primarily based on packet switches, provides very flexible data services such as e-mail and access to the World Wide Web. The Internet is a variable-delay, variable- bandwidth network that provides no guarantee on quality of service (QoS) in its initial phase. New services are being added to the pure data delivery framework of yesterday. Such high demands on capacity could lead to a “bandwidth crunch” at the core wide-area network, resulting in degradation of service quality. Fortunately, technological innovations have emerged which can provide relief to the end user to overcome the Internet’s well-known delay and bandwidth limitations. At the physical layer, a major overhaul of existing networks has been envisaged from electronic media (e.g., twisted pair and cable) to optical fibers - in wide-area, metropolitan-area, and even local-area settings. In order to exploit the immense bandwidth potential of optical fiber, interesting multiplexing techniques have been developed over the years.

Scalable Web Server Clustering Technologies

The exponential growth of the Internet, coupled with the increasing popularity of dynamically generated content on the World Wide Web, has created the need for more and faster Web servers capable of serving the over 100 million Internet users. Server clustering has emerged as a promising technique to build scalable Web servers. In this article we examine the seminal work, early products, and a sample of contemporary commercial offerings in the field of transparent Web server clustering. We broadly classify transparent server clustering into three categories.

A Rubber Band Around an Atlantic Croaker

A rubber band permanently girdled an Atlantic croaker, Micropogon undulatus, resulting in considerable malformation and pathological alterations of the fish. On 12 July 1973 at Graveline Bayou, Jackson County, Mississippi, Mrs. Buster Blades caught on hook and line a 175 mm standard length (102.1 g) croaker that she immediately separated from the rest of her catch as a suspected parasitized fish. Later upon closer examination, she realized that a rubber band encircled the fish, and so she brought the fish to us. The band had deformed the prepelvic isthmus, restricted movement of the pectoral fins, and permanently encircled the fish through a hole in the dorsum. Much of the elasticity was lost, but the band was entire and free to rotate through the perforation below the first dorsal fin. The tissue above the perforation, including the tissue of the dorsal fin, was complete and not severed, although several scales were regenerated. These observations, in addition to the malformed ventral area, suggest a lengthy association between band and fish.

Dynamic Traffic Grooming Algorithms for Reconfigurable SONET Over WDM Networks

The emergence of wavelength-division multiplexing (WDM) technology provides the capability for increasing the bandwidth of synchronous optical network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add–drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom the traffic, and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently. Moreover, the traffic pattern of the optical network changes from time to time. How to develop dynamic reconfiguration algorithms for traffic grooming is an important issue. In this paper, two cases (best fit and full fit) for handling reconfigurable SONET over WDM networks are proposed. For each approach, an integer linear programming model and heuristic algorithms (TS-1 and TS-2, based on the tabu search method) are given. The results demonstrate that the TS-1 algorithm can yield better solutions but has a greater running time than the greedy algorithm for the best fit case. For the full fit case, the tabu search heuristic yields competitive results compared with an earlier simulated annealing based method and it is more stable for the dynamic case.

Survivable Traffic Grooming With Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Dynamic Routing in Translucent WDM Optical Networks: The Intradomain Case

Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.

Routing and Wavelength Assignment (RWA) with Power Considerations In All- Optical Wavelength-Routed Networks

Routing and wavelength assignment (RWA) is an important problem that arises in wavelength division multiplexed (WDM) optical networks. Previous studies have solved many variations of this problem under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate this problem while allowing for degradation of routed signals by components such as taps, multiplexers, and fiber links. We assume that optical amplifiers are preplaced. We investigate the problem of routing the maximum number of connections while maintaining proper power levels. The problem is formulated as a mixed-integer nonlinear program and two-phase hybrid solution approaches employing two different heuristics are developed

Cetacean Notes. I. Sei and Rorqual Whales on the Mississippi Coast, a Correction. II. A Dwarf Sperm Whale in Mississippi Sound and Its Helminth Parasites

I. Gunter and Christmas (1973) described the events leading to the stranding of a baleen whale on Ship Island, Mississippi, in 1968, giving the species as Balaenopteru physalus, the Rorqual. Unfortunately the identification was in error, but fortunately good photographs were shown. The underside of the tail was a splotched white, but there was no black margin. The specimen also had fewer throat and belly grooves than the Rorqual, as a comparison with True’s (1904) photograph shows. Dr. James Mead (in litt.) pointed out that the animal was a Sei Whale, Balaenoptera borealis. This remains a new Mississippi record and according to Lowery’s (1974) count, it is the fifth specimen reported from the Gulf of Mexico. The stranding of a sixth Sei Whale on Anclote Keys in the Gulf, west of Tarpon Springs, Florida on 30 May 1974, was reported in the newspapers and by the Smithsonian Institution (1974). II. Gunter, Hubbs and Beal (1955) gave measurements on a Pygmy Sperm Whale, Kogia breviceps, which stranded on Mustang Island on the Texas coast and commented upon the recorded variations of proportional measurements in this species. Then according to Raun, Hoese and Moseley (1970) these questions were resolved by Handley (1966), who showed that a second species, Kogia simus, the Dwarf Sperm Whale, is also present in the western North Atlantic. Handley’s argument is based on skull comparisons and it seems to be rather indubitable. According to Raun et al. (op. cit.), the stranding of a species of Kogia on Galveston Island recorded by Caldwell, Ingles and Siebenaler (1960) was K. simus. They also say that Caldwell (in litt.) had previously come to the same conclusion. Caldwell et al. also recorded another specimen from Destin, Florida, which is now considered to have been a specimen of simus. The known status of these two little sperm whales in the Gulf is summarized by Lowery (op. cit.).

An Estuarine Low Temperature Fish Kill in Mississippi, with Remarks on Restricted Necropsies

In January 1973, large numbers of Mugil cephalus (striped mullet), weighing approximately 250 gm each, died in two freshwater localities in tidewater bayous of Jackson County, Mississippi. Fish identified as Mugil curema, M. cephalus, Megalops atlantica, Dormitator maculatus, and Fundulus grandis were found dead in other low saline estuarine areas. Fish-kills during cold periods are less commonly encountered in Mississippi than in Texas or Florida. This particular incident is attributed to conditions of stress for fishes incompletely acclimated to the encountered low temperatures. The most deleterious stress was the low saline water which probably allowed a breakdown in the fishes' ion-osmoregulatory mechanisms. Striped mullet and other euryhaline fishes in salinities greater than 6 ppt survived, as did freshwater centrarchids and ictalurids in areas with dying mullet. Other stresses thought to contribute to the weakening of striped mullet in Paige Bayou during the period of rapidly decreasing temperatures include starvation and high levels of pesticide residues. In examined fish, the alimentary tracts were devoid of food, the gall bladders were distended and leaking bile, the livers contained excess lipid material and were often stained throughout with bile pigments, and the levels of DDT metabolites and endrin residues in the liver were higher than in control fish. Stress caused by low levels of dissolved oxygen, toxic substances in the water, or disease was discounted as a cause of death.

LSMAC and LSNAIT: Two Approaches for Cluster-based Scalable Web Servers

Server responsiveness and scalability are more important than ever in today’s client/server dominated network environments. Recently, researchers have begun to consider cluster-based computers using commodity hardware as an alternative to expensive specialized hardware for building scalable Web servers. In this paper, we present performance results comparing two cluster-based Web servers based on different server infrastructures: MAC-based dispatching (LSMAC) and IP-based dispatching (LSNAT). Both cluster-based server systems were implemented as application-space programs running on commodity hardware. We point out the advantages and disadvantages of both systems. We also identify when servers should be clustered and when clustering will not improve performance.

A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.

BER-Based Call Admission In Wavelength-Routed Optical Networks

Consider a wavelength-routed optical network in which nodes, i.e., multiwave length cross-connect switches (XCSs), are connected by fiber to form an arbitrary physical topology. A new call is admitted into the network if an all-optical lightpath can be established between the call’s source and destination nodes. Wavelength converters are assumed absent in this work.

Agent Based Intrusion Detection and Response System for Wireless LANs

Wireless LAN technology, despite the numerous advantages it has over competing technologies, has not seen widespread deployment. A primary reason for markets not adopting this technology is its failure to provide adequate security. Data that is sent over wireless links can be compromised with utmost ease. In this project, we propose a distributed agent based intrusion detection and response system for wireless LANs that can detect unauthorized wireless elements like access points, wireless clients that are in promiscuous mode etc. The system reacts to intrusions by either notifying the concerned personnel, in case of rogue access points and promiscuous nodes, or by blocking unauthorized users from accessing the network resources.

Hierarchy-Based Access Control in Distributed Environments

Access control is a fundamental concern in any system that manages resources, e.g., operating systems, file systems, databases and communications systems. The problem we address is how to specify, enforce, and implement access control in distributed environments. This problem occurs in many applications such as management of distributed project resources, e-newspaper and payTV subscription services. Starting from an access relation between users and resources, we derive a user hierarchy, a resource hierarchy, and a unified hierarchy. The unified hierarchy is then used to specify the access relation in a way that is compact and that allows efficient queries. It is also used in cryptographic schemes that enforce the access relation. We introduce three specific cryptography based hierarchical schemes, which can effectively enforce and implement access control and are designed for distributed environments because they do not need the presence of a central authority (except perhaps for set- UP).