Volume2, Number1, 2001


 

 

Title:

Methods for Improving the Reliability Simulation and Modelling of Message Passing Networks

Author:

Hamid Abachi, Junaid Walker, Narayan Debnath

Abstract:

This paper presents a new computer network routing methodology through simulation based on optimal path planning. This routing technique forms a robust and optimal solution to routing in diverse message passing networks. To counteract unfavourable simulation times, an exponential, and refined exponential least square modeling technique is derived to reduce measurement noise and dramatically shrink sample sizes. The system of network evaluation developed in this research work will be extremely useful to network designers, and end-users for both hardware and software improvements. This in turn would assist the user in the selection of the most reliable architecture discussed in this paper.

 

 

Title:

Secure Data Networking for Enterprises

Author:

E.K. Park, Kia Makki, Niki Pissinou, Sujeet Bambawale

Abstract:

This paper proposes an e-commerce process model that is focussed on higher security and fault-tolerance. The security of the client database is a subject that has been prone to heated debate in the wake of recent intrusion incidents, and the recommendations detailed herein aim to provide online vendors with guidelines towards securing this aspect of their e-commerce operations. The fault-tolerance of the server is also highlighted, with an onus on electronic attacks and steps that can be taken to recognize and/or thwart the same. 

 

 

Title:

Implementing the Dynamic Behavior Represented as Multiple State Diagrams and Activity Diagrams

Author:

Jauhar Ali, Jiro Tanaka

Abstract:

A system is introduced which automatically generates implementation code from the object and dynamic models of an application. We found that the behavior of active objects can well be represented by activity diagrams rather than state diagrams. The paper first explains our approach to convert state diagrams as well as activity diagrams into implementation code. The paper then describes our system, dCode, which automatically generates executable Java code from the object diagram, state diagrams and activity diagrams of an application. The paper also presents the results of the experiment in which the code generated by dCode was compared to that of Rhapsody.

 

 

Title:

Dynamic Slicing Object-Oriented Programs using Dynamic Object Relationship Diagrams

Author:

Yeong-Tae Song, Dung Huynh

Abstract:

Object-oriented programming has been considered a most promising method in program development and maintenance. An important feature of object-oriented programs (OOPS) is their reusability that can be achieved through the inheritance of classes or reusable components. In this paper we propose an algorithm to decompose OOPs with respect to some variables or objects of interest using the forward dynamic slicing technique. The algorithm recursively decomposes constructors and member functions with respect to the specified variables in a slicing criterion. Decomposing constructors implies decomposing the inheritance hierarchy of the class, if any, and the possibility of reusing the slices for the instance variables without recomputation during the construction of the slices. It is an extension of the interprocedural program slicing algorithm by Song and Huynh[18] which is based on the forward slicing technique by Korel and Yalamanchili [14]. The algorithm analyzes message passings and parameter passings and constructs dynamic objects relationship diagrams (DORD). As results, the algorithm produces not only the statement level slice (called traditional slice) when used with the algorithm in [18], but also the DORD that is the class level slice and it shows the relationships among the objects with respect to the specified variables in a slicing criterion. The algorithm eliminates unnecessary parts that cause difficulty in understanding OOPs. Hence it provides an efficient way to comprehend the behavior of OOPs.