Introduction to the First International Workshop on Empirical Research in Business Process Management (ER-BPM 2009)

Providing effective IT support for business processes has become crucial for enterprises to stay competitive. In response to this need numerous process support paradigms (e.g., workflow management, service flow management, case handling), process specification standards (e.g., WS-BPEL, BPML, BPMN), process tools (e.g., ARIS Toolset, Tibco Staffware, FLOWer), and supporting methods have emerged in recent years. Summarized under the term “Business Process Management” (BPM), these paradigms, standards, tools, and methods have become a success-critical instrument for improving process performance.

Proceedings of the International Workshop on age determination of oceanic pelagic fishes: Tunas, billfishes, and sharks, Miami, Florida, February 15-18,1982

Accurate and precise estimates of age and growth rates are essential parameters in understanding the population dynamics of fishes. Some of the more sophisticated stock assessment models, such as virtual population analysis, require age and growth information to partition catch data by age. Stock assessment efforts by regulatory agencies are usually directed at specific fisheries which are being heavily exploited and are suspected of being overfished. Interest in stock assessment of some of the oceanic pelagic fishes (tunas, billfishes, and sharks) has developed only over the last decade, during which exploitation has increased steadily in response to increases in worldwide demand for these resources. Traditionally, estimating the age of fishes has been done by enumerating growth bands on skeletal hardparts, through length frequency analysis, tag and recapture studies, and raising fish in enclosures. However, problems related to determining the age of some of the oceanic pelagic fishes are unique compared with other species. For example, sampling is difficult for these large, highly mobile fishes because of their size, extensive distributions throughout the world's oceans, and for some, such as the marlins, infrequent catches. In addition, movements of oceanic pelagic fishes often transect temperate as well as tropical oceans, making interpretation of growth bands on skeletal hardparts more difficult than with more sedentary temperate species. Many oceanic pelagics are also long-lived, attaining ages in excess of 30 yr, and more often than not, their life cycles do not lend themselves easily to artificial propagation and culture. These factors contribute to the difficulty of determining ages and are generally characteristic of this group-the tunas, billfishes, and sharks. Accordingly, the rapidly growing international concern in managing oceanic pelagic fishes, as well as unique difficulties in ageing these species, prompted us to hold this workshop. Our two major objectives for this workshop are to: I) Encourage the interchange of ideas on this subject, and 2) establish the "state of the art." A total of 65 scientists from 10 states in the continental United States and Hawaii, three provinces in Canada, France, Republic of Senegal, Spain, Mexico, Ivory Coast, and New South Wales (Australia) attended the workshop held at the Southeast Fisheries Center, Miami, Fla., 15-18 February 1982. Our first objective, encouraging the interchange of ideas, is well illustrated in the summaries of the Round Table Discussions and in the Glossary, which defines terms used in this volume. The majority of the workshop participants agreed that the lack of validation of age estimates and the means to accomplish the same are serious problems preventing advancements in assessing the age and growth of fishes, particularly oceanic pelagics. The alternatives relating to the validation problem were exhaustively reviewed during the Round Table Discussions and are a major highlight of this workshop. How well we accomplished our second objective, to establish the "state of the art" on age determination of oceanic pelagic fishes, will probably best be judged on the basis of these proceedings and whether future research efforts are directed at the problem areas we have identified. In order to produce high-quality papers, workshop participants served as referees for the manuscripts published in this volume. Several papers given orally at the workshop, and included in these proceedings, were summarized from full-length manuscripts, which have been submitted to or published in other scientific outlets-these papers are designated as SUMMARY PAPERS. In addition, the SUMMARY PAPER designation was also assigned to workshop papers that represented very preliminary or initial stages of research, cursory progress reports, papers that were data shy, or provide only brief reviews on general topics. Bilingual abstracts were included for all papers that required translation. We gratefully acknowledge the support of everyone involved in this workshop. Funding was provided by the Southeast Fisheries Center, and Jack C. Javech did the scientific illustrations appearing on the cover, between major sections, and in the Glossary. (PDF file contains 228 pages.)

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

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).

Routing Algorithms for All-Optical Networks with Power Considerations: The Unicast Case

In this paper, we investigate the problem of routing connections in all-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation and (b) the genetic solution quality was much better than that of SGF, especially when the conflict graph of the connections generated by the linear solver is denser.

Router and Firewall Redundancy with OpenBSD and CARP

As more reliance is placed on computing and networking systems, the need for redundancy increases. The Common Address Redundancy Protocol (CARP) protocol and OpenBSD’s pfsync utility provide a means by which to implement redundant routers and firewalls. This paper details how CARP and pfsync work together to provide this redundancy and explores the performance one can expect from the open source solutions. Two experiments were run: one showing the relationship between firewall state creation and state synchronization traffic and the other showing how TCP sessions are transparently maintained in the event of a router failure. Discussion of these simulations along with background information gives an overview of how OpenBSD, CARP, and pfsync can provide redundant routers and firewalls for today’s Internet.

Priority-based Lambda Scheduler

Optical networks provide a new dimension to meet the demands of exponentially growing traffic. Optical packet switching requires a good switch architecture, which eliminates the O/E/O conversion as much as possible. Wavelength Division Multiplexing (WDM) provides a breakthrough to exploit the huge bandwidth of the optical fiber. Different applications have different requirements, which necessitate employing differentiated services. This paper presents the idea of a priority-based λ-scheduler, where the packets are differentiated into different classes and services are provided accordingly. For example, class 0 can correspond to non real time applications like email and ftp, while class 1 can correspond to real-time audio and video communications. The architecture is based on that of the λ-scheduler and hence it has the added advantage of reduced component cost by using WDM internally.

Survivable Waveband Switching in WDM Mesh Networks under Dedicated Path-Protection

This paper considers the problem of dedicated path-protection in wavelength-division multiplexed (WDM) mesh networks with waveband switching functionality under shared risk link group (SRLG) constraints. Two dedicated path protection schemes are proposed, namely the PBABL scheme and the MPABWL scheme. The PBABL scheme protects each working waveband-path through a backup waveband-path. The MPABWL scheme protects each working waveband-path by either a backup waveband-path or multiple backup lightpaths. Heuristic algorithms adopting random optimization technique are proposed for both the schemes. The performance of the two protection schemes is studied and compared. Simulation results show that both the heuristics can obtain optimum solutions and the MPABWL scheme leads to less switching and transmission costs than the PBABL scheme.

Same-Destination-Intermediate Grouping vs. End-to-End Grouping for Waveband Switching in WDM Mesh Networks

We investigate waveband switching (WBS) with different grouping strategies in wavelength-division multiplexing (WDM) mesh networks. End-to-end waveband switching (ETEWBS) and same-destination-intermediate waveband switching (SD-IT-WBS) are analyzed and compared in terms of blocking probability and cost savings. First, an analytical model for ETEWBS is proposed to determine the network blocking probability in a mesh network. For SD-IT-WBS, a simple waveband switching algorithm is presented. An analytical model to determine the network blocking probability is proposed for SD-IT-WBS based on the algorithm. The analytical results are validated by comparing with simulation results. Both results match well and show that ETE-WBS slightly outperforms SD-IT-WBS in terms of blocking probability. On the other hand, simulation results show that SD-IT-WBS outperforms ETE-WBS in terms of cost savings.

A Novel Cost-Efficient On-Line Intermediate Waveband-Switching Scheme in WDM Mesh Networks

Waveband switching (WBS) is an important technique to save switching and transmission cost in wavelength -division multiplexed (WDM) optical networks. A cost-efficient WBS scheme would enable network carriers to increase the network throughput (revenue) while achieving significant cost savings. We identify the critical factors that determine the WBS network throughput and switching cost and propose a novel intermediate waveband switching (IT-WBS) algorithm, called the minimizing-weighted-cost (MWC) algorithm. The MWC algorithm defines a cost for each candidate route of a call. By selecting the route with the smallest weighted cost, MWC balances between minimizing the call blocking probability and minimizing the network switching cost. Our simulations show that MWC outperforms other wavelength/waveband switching algorithms and can enhance the network throughput at a reduced cost.

Discontinuous Waveband Switching in WDM Optical Networks

Routing techniques used in wavelength routed optical networks (WRN) do not give an efficient solution with Waveband routed optical networks (WBN) as the objective of routing in WRN is to reduce the blocking probability and that in WBN is to reduce the number of switching ports. Routing in WBN can be divided two parts, finding the route and grouping the wavelength assigned into that route with some existing wavelengths/wavebands. In this paper, we propose a heuristic for waveband routing, which uses a new grouping strategy called discontinuous waveband grouping to group the wavelengths into a waveband. The main objective of our algorithm is to decrease the total number of ports required and reduce the blocking probability of the network. The performance of the heuristic is analyzed using simulation on a WBN with non-uniform wavebands.