• Journal of information and communication convergence engineering
• /
• v.14 no.2
• /
• pp.84-88
• /
• 2016

As good example of potential application-specific requirement, (m,k)-firm real-time streams have been recently introduced to deliver multimedia data efficiently in wireless sensor networks. In addition to stream model, communication protocols to meet specific (m,k)-firm real-time streams have been newly developed or extended from existing protocols. However, since the existing schemes for an (m,k)-firm stream have been proposed under typical flat architecture, the scalability problem remains unsolved when the number of real-time flows increases in the networks. To solve this problem, in this paper, we propose a new clustering scheme for an (m,k)-firm stream. The two different clustering algorithms are performed according to either the (m,k)-firm requirement or the deadline. Simulation results are presented to demonstrate the suitability of the proposed scheme under hierarchical architecture by showing that its performance is acceptable irrespective of the increase in the number of flows.

• ETRI Journal
• /
• v.32 no.3
• /
• pp.422-429
• /
• 2010

We present guaranteed dynamic priority assignment schemes for multiple real-time tasks subject to (m, k)-firm deadlines. The proposed schemes have two scheduling objectives: providing a bounded probability of missing (m, k)-firm constraints and maximizing the probability of deadline satisfactions. The second scheduling objective is especially necessary in order to provide the best quality of service as well as to satisfy the minimum requirements expressed by (m, k)-firm deadlines. We analytically establish that the proposed schemes provide a guarantee on the bounded probability of missing (m, k)-firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed schemes with regard to their scheduling objectives.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1529-1532
• /
• 2010

본 논문은 동종의 멀티코어에서 (m,k)-firm Deadline 을 가지는 태스크를 위한 실시간 시스템의 스케줄링 기법을 제안한다. 본 논문에서 제안된 알고리즘의 목적은 (m, k)-firm Deadline 을 만족시키는 확률을 증가시켜 최대의 Quality of Service 를 제공하는 것이다. 본 논문에서는 제안된 알고리즘이 QoS 를 보장함을 분석적으로 보이고 실험을 통해 알고리즘의 효율성을 검증한다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.6
• /
• pp.237-244
• /
• 2013

We propose Energy-constrained Multiprocessor Real-Time Scheduling algorithms for (m,k)-firm deadline constrained tasks (EMRTS-MK). Rather than simply saving as much energy as possible, we consider energy as hard constraint under which the system remains functional and delivers an acceptable performance at least during the prescribed mission time. We evaluate EMRTS-MKs in several experiments, which quantitatively show that they achieve the scheduling objectives.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.775-779
• /
• 2011

As the technology of multimedia sensor networks is desired in large numbers of applications nowadays, real-time service becomes one of the most important research challenges. Even though lots of related works have been conducted to meet this requirement in several ways, the specific traffic model for real-time has not been taken yet. Thus, it causes lack of adaptability of those approaches in real deployment. To solve this problem, in this paper, we model the application via (m,k)-firm streams which have weakly hard real-time property. And then, a novel forwarding scheme based on modified DBP (Distance-Based Priority) is proposed by considering local-DBP and stream DBP together. Local-DBP can contribute to identify the detailed causes of unsatisfied quality, that is, network congestion or wireless link failure. Simulation results reveal that (m,k)-firm is a good traffic model for multimedia sensor networks and the proposed scheme can contribute to guarantee real-time requirement well.

• Journal of information and communication convergence engineering
• /
• v.10 no.2
• /
• pp.129-134
• /
• 2012

As application-specific requirements for wireless sensor networks emerge, both real-time and reliable communications become major research challenges in wireless sensor networks due to the many constraints on nodes and wireless links. To support these services, several protocols have been proposed. However, since most of them were designed as well as developed for general purpose applications, it is not recommended that they be directly adapted to applications with special requirements. In this paper, we propose a way to extend the current reliable transport protocol to cover a special real-time service, the (m,k)-firm deadline stream, in wireless sensor networks. While the proposed scheme is basically built on the PSFQ protocol for reliability, some features have been newly developed to support the (m,k)-firm stream efficiently. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic and with failed links.

• Journal of Korea Water Resources Association
• /
• v.39 no.5 s.166
• /
• pp.467-478
• /
• 2006

Water supply reliability for a dam is defined with a concept of probabilistic reliability. An evaluation procedure of the water supply reliability is shown with an analysis of long term firm yield reliability. The water supply reliabilities of Soyanggang Dam and Chungju Dam were evaluated. To evaluate the water supply reliability, forty one sets of monthly runoff series were generated by SAMS-2000. HEC-5 model was applied to the reservoir simulation to compute the firm yield from a monthly data of time series. The water supply reliability of the firm yield from the design runoff data of Soyanggang Dam is evaluated by 80.5 % for a planning period of 50 years. The water supply reliability of the firm yield from the historic runoff after the dam construction is evaluated by 53.7 %. The firm yield from the design runoff is 1.491 billion $m^3$/yr and the firm yield from the historic runoff is 1.585 billion $m^3$/yr. If the target draft Is 1.585 billion $m^3$/yr, additional water of 0.094 billion $m^3$ could be supplied every year with its risk. From the similar procedures, the firm yield from the design runoff of Chungju Dam is evaluated 3.377 billion $m^3$/yr and the firm yield from the historic runoff is 2.960 billion $m^3$/yr. If the target draft is 3.377 billion $m^3$/yr, water supply insufficiency occurs for all the sets of time series generated. It may result from overestimation of the spring runoff used for design. The procedure shown can be a more objective method to evaluate water supply reliability of a dam.

• Journal of Intelligence and Information Systems
• /
• v.22 no.4
• /
• pp.123-138
• /
• 2016

This study investigates intents of acquisitions in information technology industries. Mergers and acquisitions are a strategic decision at corporate-level and have been an important tool for a firm to grow. Plenty of firms in information technology industries have acquired startups to increase production efficiency, expand customer base, or improve quality over the last decades. For example, Google has made about 200 acquisitions since 2001, Cisco has acquired about 210 firms since 1993, Oracle has made about 125 acquisitions since 1994, and Microsoft has acquired about 200 firms since 1987. Although there have been many existing papers that theoretically study intents or motivations of acquisitions, there are limited papers that empirically investigate them mainly because it is challenging to measure and quantify intents of M&As. This study examines the intent of acquisitions by measuring specific intents for M&A transactions. Using our measures of acquisition intents, we compare the intents by four acquisition types: (1) the acquisition where a hardware firm acquires a hardware firm, (2) the acquisition where a hardware firm acquires a software/IT service firm, (3) the acquisition where a software/IT service firm acquires a hardware firm, and (4) the acquisition where a software /IT service firm acquires a software/IT service firm. We presume that there are difference in reasons why a hardware firm acquires another hardware firm, why a hardware firm acquires a software firm, why a software/IT service firm acquires a hardware firm, and why a software/IT service firm acquires another software/IT service firm. Using data of the M&As in US IT industries, we identified major intents of the M&As. The acquisition intents are identified based on the press release of M&A announcements and measured with four categories. First, an acquirer may have intents of cost saving in operations by sharing common resources between the acquirer and the target. The cost saving can accrue from economies of scope and scale. Second, an acquirer may have intents of product enhancement/development. Knowledge and skills transferred from the target may enable the acquirer to enhance the product quality or to expand product lines. Third, an acquirer may have intents of gain additional customer base to expand the market, to penetrate the market, or to enter a foreign market. Fourth, a firm may acquire a target with intents of expanding customer channels. By complementing existing channel to the customer, the firm can increase its revenue. Our results show that acquirers have had intents of cost saving more in acquisitions between hardware companies than in acquisitions between software companies. Hardware firms are more likely to acquire with intents of product enhancement or development than software firms. Overall, the intent of product enhancement/development is the most frequent intent in all of the four acquisition types, and the intent of customer base expansion is the second. We also analyze our data with the classification of production-side intents and customer-side intents, which is based on activities of the value chain of a firm. Intents of cost saving operations and those of product enhancement/development can be viewed as production-side intents and intents of customer base expansion and those of expanding customer channels can be viewed as customer-side intents. Our analysis shows that the ratio between the number of customer-side intents and that of production-side intents is higher in acquisitions where a software firm is an acquirer than in the acquisitions where a hardware firm is an acquirer. This study can contribute to IS literature. First, this study provides insights in understanding M&As in IT industries by answering for question of why an IT firm intends to another IT firm. Second, this study also provides distribution of acquisition intents for acquisition types.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.6
• /
• pp.1386-1390
• /
• 2011

The IEEE 802.11 MAC uses DCF for media access among the participating network nodes. But DCF alone is neither capable nor suitable for fulfilling the QoS requirements of realtime applications. There are many ways in which QoS is provided by modifying DCF based MAC. This paper proposes (m,k)-collision scheme which is based on IEEE 802.11 and (m,k)-firm scheme tries to improve DCF functionality. The proposed scheme uses different Contention Window according to the number of collision in the node. The simulation result shows that the proposed scheme helps improve the throughput of the DCF.

• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.231-236
• /
• 2012

For real-time wireless sensor network applications, it is essential to provide different levels of quality of service (QoS) such as reliability, low latency, and fault-tolerant traffic control. To meet these requirements, an (m,k)-firm based real-time routing protocol has been proposed in our prior work, including a novel local transmission status indicator called local DBP (L_DBP). In this paper, a fault recovery scheme for (m,k)-firm real-time streams is proposed to improve the performance of our prior work, by contributing a delay-aware forwarding candidates selection algorithm for providing restricted redundancy of packets on multipath with bounded delay in case of transmission failure. Each node can utilize the evaluated stream DBP (G_DBP) and L_DBP values as well as the deadline information of packets to dynamically define the forwarding candidate set. Simulation results show that for real-time service, it is possible to achieve both reliability and timeliness in the fault recovery process, which consequently avoids dynamic failure and guarantees meeting the end-to-end QoS requirement.