Search

The object-oriented approach has been the most popular software design methodology for the past twenty-five years. Several design patterns and principles are defined to improve the design quality of object-oriented software systems. In addition, designers can use unique design motifs that are designed for the specific application domains. Another commonly used technique is cloning and modifying some parts of the software while creating new modules. Therefore, object-oriented programs can include many identical design structures. This work proposes a sub-graph mining-based approach for detecting identical design structures in object-oriented systems. By identifying and analyzing these structures, we can obtain useful information about the design, such as commonly-used design patterns, most frequent design defects, domain-specific patterns, and reused design clones, which could help developers to improve their knowledge about the software architecture. Furthermore, problematic parts of frequent identical design structures are appropriate refactoring opportunities because they affect multiple areas of the architecture. Experiments with several open-source and industrial projects show that we can successfully find many identical design structures within a project (intra-project) and between different projects (inter-project). We observe that usually most of the detected identical structures are an implementation of common design patterns; however, we also detect various anti-patterns, domain-specific patterns, reused design parts and design-level clones. [ABSTRACT FROM AUTHOR]

With the development of agile optical switches, dynamic optical circuit switching has become possible and connections are set up and torn down on demand basis. The explosive growth of different traffic types such as data, voice and video requires the support of differentiated services in terms of survivability measures and timing requirements. In order to guarantee a specific level of survivability, availability-guaranteed bandwidth provisioning is considered. On the other hand, connections are set up and released for specific time durations, with sliding or fixed setup times. Connection requests arrive to the network provider with specified holding times, delay tolerances and availability requirements which need to be satisfied. Delay tolerance is defined as the maximum time which a request can tolerate before the connection is set up. Future network carriers need to meet strict SLA (Service Level Agreement) guidelines, thus guaranteeing a level of service, as well as achieving efficient resource utilization. Connection availability is an important metric to measure the quality of service (QoS) in a survivable network. It is defined as the probability that a connection will be found in the operating state at a random time in the future (Clouqueur et al., 2002). It is affected by many factors such as network component failure probabilities, failure repair times, etc. Usually, the availability target for a connection is specified in a Service Level Agreement (SLA), which is a contract between a service provider (e.g., a network operator) and one of its customers (e.g., a large institutional user of bandwidth). An SLA violation may result in a penalty to be paid by the network operator to the customer according to the contract (Grover, 1999). In order to provide the appropriate level of availability stated in the SLAs, different recovery mechanisms can be used to provision different connection requests. In this study, we consider unprotected, shared-path protected and dedicated-path protected provisioning mechanisms at the same time to satisfy different QoS requirements in a dynamic manner. Previous studies, while maximizing sharability by routing backup paths in a dynamic traffic environment, do not make any estimation on future sharability of resources. They take the current link states into consideration to choose sharable links. Reference (Tornatore et al., 2005a,b) shows that resource overbuild (RO) in shared-path protection can be decreased by exploiting the holding-time information of connections which have already been provisioned in the network. Since holding times of incoming traffic demands may be known in advance for a variety of applications, this information about the future states of the links makes the route decision more intelligent by allowing the choice of more sharable paths. In this paper, unprotected, shared-path, and dedicated-path protection techniques are used to meet the differentiated availability requirements. Recently, among the other Service Level Specifications (SLSs), many new applications are identified by known in advance holding time and delay tolerance. So, in this paper, for dynamic provisioning of availability guaranteed connections in an optical mesh network, we propose two new algorithms which exploit 1 the knowledge of connection holding times to accomplish minimum backup capacity allocation as compared to the previous holding time unaware approach and 2 the knowledge of delay tolerances to degrease the blocking probability in the conditions that the system resources are not available to satisfy the SLS demands of connection requests. Here we also propose a new routing mechanism for backup paths optimizing backup resources considering the future departure time of existing connections. In order to show the performance gain; the first proposal, AGSDP_HT (Holding time aware Availability Guaranteed Service Differentiated Provisioning) is compared by a base line algorithm AGSDP. The second proposal ADT (Availability guaranteed, service differentiated provisioning with Delay Tolerance) is compared by a base line approach which does not consider delay tolerance. For the second proposal, both algorithms dedicated protection is not used as a choice, since blocking is decreased by delay tolerance. [ABSTRACT FROM AUTHOR]