• Journal of Digital Convergence
• /
• v.12 no.12
• /
• pp.337-343
• /
• 2014

There have been many efforts to find a new way to combine software reuse and agile software development methods. This paper studies the integration of software reuse techniques in agile methods, such as Scrum. Agile methods have the advantage of accepting frequent requirement changes, while software reuse reduces development time. Despite the rapid acceptance of the Scrum method in industry, not much emphasis has been placed on active reuse in the Scrum method, and most studies have focused on introducing agile practices into software product line engineering. However, the iterative development and backlog refinement activities of the Scrum method present the advantage of facilitating software reuse. In this paper, we identify sprint characteristics and components for reuse and suggest extended backlog refinement steps. Based on the results of this research, we integrate a backlog factoring technique into backlog refinement to support reuse in agile methods. In addition, we apply the proposed technique and demonstrate a prototype of product backlog reuse in backlog refinement for an Internet shopping mall application.

• Journal of Digital Convergence
• /
• v.13 no.12
• /
• pp.171-177
• /
• 2015

The aim of the study is to introduce a software reuse technique into a generalized agile process for a reuse of a product backlog item. The software engineering community has made some efforts to integrate software reuse and agile methods. Most studies have emphasized the use of agile practices in software product line engineering, whereas reuse in agile methods has received little focus. Nevertheless, the activities and artifacts that provided by an agile method exhibit characteristics that promote reuse. In this paper, we identify catalytic activities and characteristics that promote reuse in a generalized agile process, and we suggest a reuse technique for a product backlog item. Based on our results, we integrate a backlog factoring technique into a generalized agile process for reuse. In addition, we apply the proposed technique and demonstrate a prototype of backlog item reuse in agile methods for a restaurant chain application.

• Journal of Digital Convergence
• /
• v.10 no.10
• /
• pp.339-345
• /
• 2012

Despite agile methods and software reuse being distinct approaches, there has been a growing amount of research on combining these approaches. Although Scrum is one of the most popular agile methods, reuse has not been actively supported. In this paper, we identify a new type of reusable Scrum assets, simplify the backlog process and propose a backlog factoring technique by extending task factoring to support reuse in the Scrum method. In addition, we can apply the proposed technique and show prototyping of backlog reuse in e-business applications.

• Journal of Digital Convergence
• /
• v.11 no.12
• /
• pp.439-445
• /
• 2013

There has been a growing amount of research on combining Agile methods and software reuse. Most of it introduces Agile into software product line rather than software reuse into Scrum method. Meanwhile, some assets such as backlogs and incremental artifacts in Scrum development are reusable. In this paper, we identify a backlog binder that aggregates reusable Scrum assets and proposes a backlog binder reuse technique. In addition, we can apply the proposed technique and show prototyping of backlog binder reuse in job matching applications.

• Journal of Korea Multimedia Society
• /
• v.18 no.1
• /
• pp.35-41
• /
• 2015

SDN(Software Defined Networking) has been considered as a new future computer network architecture and DDoS(Distributed Denial of Service) is the biggest threat in the network security. In SDN architecture, we present the technique to defend the DDoS SYN Flooding attack that is one of the DDoS attack method. First, we monitor the Backlog queue in order to reduce the unnecessary monitoring resources. If the Backlog queue of the certain server is occupied over 70%, the sFlow performs packet sampling with the server address as the destination address. To distinguish between the attacker and the normal user, we use the source address. We decide the SYN packet threshold using the remaining Backlog queue that possible to allow the number of connections. If certain sources address send the SYN packet over the threshold, we judge that this address is attacker. The controller will modify the flow table entry to block attack traffics. By using this method, we reduce the resource consumption about the unnecessary monitoring and the protection range is expanded to all switches. The result achieved from our experiment show that we can prevent the SYN Flooding attack before the Backlog queue is fully occupied.

• Communications for Statistical Applications and Methods
• /
• v.7 no.2
• /
• pp.499-511
• /
• 2000

We consider a stable tandem network which consists of two M/M/1 nodes and study the probability that the total backlog exceeds a large level N. Since the excessive backlog is a rare event, it is difficult to estimate this probability efficiently by using the crude Monte Carlo simulation. Instead we perform the ;$h$-transform proposed by McDonald(1999) to obtain the twisted network, in which the node with the larger load is overloaded. Then we use it to run the fast simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.646-663
• /
• 2014

Scrum is one of the most popular and efficient agile development methods. However, like other agile methods such as Extreme Programming (XP), Feature Driven Development (FDD), and the Dynamic Systems Development Method (DSDM), Scrum has been criticized because of lack of support to develop secure software. Thus, in 2011, we published research proposing the idea of a security backlog (SB). This paper represents the continuation of our previous research, with a focus on the evaluation in industry-based case study. Our findings highlight an improved agility in Scrum after the integration of SB. Furthermore, secure software can be developed quickly, even in situations involving requirement changes of software. Based on our experimental findings, we noticed that, when integrating SB, it is quite feasible to develop secure software using an agile Scrum model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.7
• /
• pp.574-580
• /
• 1990

Recently End-User Computing(EUC) is emerging as an alternative to the traditional information systems development approach which cannot cope with users' requirements of systems development because of increase in backlog. It is necessary that appropriate models of EUC to evaluate the expected benefits and risks and to implement should be developed for managers. The main objective of this study is to help managers who need to review their MIS policies by presentinb EUC strategies under the information systems research framework which have concluded through many studies.

• Korean Management Science Review
• /
• v.2
• /
• pp.72-77
• /
• 1985

최근 선진국에서는 S/W 개발의 낮은 생산성에 따른 개발정체현상 (Backlog), 전산운영(System Management)과 관련한 현업의 불만점증과 개 개발된 S/W의 보전업무(Maintenance)의 과다현상등이 심각하게 논의되고 있는데 이는 S/W의 위기라 불리워지며 다음과 같이 설명이 되고 있다.(중략)

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.