• Title/Summary/Keyword: CLP

Search Result 184, Processing Time 0.033 seconds

A Group Handover Algorithm Consider ins QoS in Frame Relay Networks (프레임 릴레이 망에서 QoS를 고려한 그룹 핸드오버 알고리즘)

  • 손정호;박상욱;서주환;한기준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10c
    • /
    • pp.442-444
    • /
    • 2001
  • 최근 통신환경의 급속한 발전과 함께 점점 복잡 다양해지는 사회적 요구에 의해 유선망을 무선환경으로 옮겨 가기 위한 많은 연구들이 진행되고 있다. 본 논문에서는 Frame Relay 망과 WATM 백본 망라의 연동 환경을 제안하였고, 이 망에서 Frame Relay 망의 이동으로 인하여 발생하는 망의 이동성 지원 방안과 QoS를 보장하는 단말들의 멀티 핸드오버를 효율적으로 지원하기 위한 G-CAC알고리즘을 제안한다. 본 논문에서 제안한 G-CAC알고리즘은 망 단위의 이동환경에서 Frame Relay의 트래픽 특성, DE/CLP 맵핑 , 트래픽 파라미터 변환 방식을 이용하여 핸드오버 블락킹 율과 손실 율을 감소시킨다. 또한 여러 Frame Relay 망과 통신하고 있는 백본의 WATM에서는 다른 Frame Relay망들의 할당된 자원 중에 CLP비트가 세트된 셀들을 드롭하여 그 자원을 새로운 핸드오버를 요청하는 Frame Relay망에 접합된 WATM에 제공하는 QoS를 고려한 핸드오버 CAC(connection admission control)알고리즘을 제안한다.

  • PDF

VLSI implementation of Usage Parameter Control Based on Cell Loss Priority (셀손실 우선순위 기반의 사용 변수제어의 VLSI 구현)

  • 권재우;조태경;최명렬
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.196-199
    • /
    • 2000
  • In this paper has studied an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks. The proposed algorithm is based on the CLP(Cell Loss Priority) bit in the ATM cell header. This algorithm can eliminate the measurement phasing problem in cell conformance testing in ATM networks. The proposed algorithm can minimize the cell loss ratio of high priority cell(CLP = 0) and resolve the burstiness of eel]s which may be generated in the multiplexing and demultiplexing procedure. For the performance evaluation, we have simulated the proposed algorithm with discrete time input traffic model and the results show that the performance of the proposed algorithm is better than that of ITU-T usage parameter control algorithm.

  • PDF

Effects of Joining Coalition Loyalty Program : How the Brand affects Brand Loyalty Based on Brand Preference (브랜드 선호에 따라 제휴 로열티 프로그램 가입이 가맹점 브랜드 충성도에 미치는 영향)

  • Rhee, Jin-Hwa
    • Journal of Distribution Research
    • /
    • v.17 no.1
    • /
    • pp.87-115
    • /
    • 2012
  • Introduction: In these days, a loyalty program is one of the most common marketing mechanisms (Lacey & Sneath, 2006; Nues & Dreze, 2006; Uncles et al., 20003). In recent years, Coalition Loyalty Program is more noticeable as one of progressed forms. In the past, loyalty program was operating independently by single product brand or single retail channel brand. Now, companies using Coalition Loyalty Program share their programs as one single service and companies to participate to this program continue to have benefits from their existing program as well as positive spillover effect from the other participating network companies. Instead of consumers to earn or spend points from single retail channel or brand, consumers will have more opportunities to utilize their points and be able to purchase other participating companies products. Issues that are related to form of loyalty programs are essentially connected with consumers' perceived view on convenience of using its program. This can be a problem for distribution companies' strategic marketing plan. Although Coalition Loyalty Program is popular corporate marketing strategy to most companies, only few researches have been published. However, compared to independent loyalty program, coalition loyalty program operated by third parties of partnership has following conditions: Companies cannot autonomously modify structures of program for individual companies' benefits, and there is no guarantee to operate and to participate its program continuously by signing a contract. Thus, it is important to conduct the study on how coalition loyalty program affects companies' success and its process as much as conducting the study on effects of independent program. This study will complement the lack of coalition loyalty program study. The purpose of this study is to find out how consumer loyalty affects affiliated brands, its cause and mechanism. The past study about loyalty program only provided the variation of performance analysis, but this study will specifically focus on causes of results. In order to do these, this study is designed and to verify three primary objects as following; First, based on opinions of Switching Barriers (Fornell, 1992; Ping, 1993; Jones, et at., 2000) about causes of loyalty of coalition brand, 'brand attractiveness' and 'brand switching cost' are antecedents and causes of change in 'brand loyalty' will be investigated. Second, influence of consumers' perception and attitude prior to joining coalition loyalty program, influence of program in retail brands, brand attractiveness and spillover effect of switching cost after joining coalition program will be verified. Finally, the study will apply 'prior brand preference' as a variable and will provide a relationship between effects of coalition loyalty program and prior preference level. Hypothesis Hypothesis 1. After joining coalition loyalty program, more preferred brand (compared to less preferred brand) will increase influence on brand attractiveness to brand loyalty. Hypothesis 2. After joining coalition loyalty program, less preferred brand (compared to more preferred brand) will increase influence on brand switching cost to brand loyalty. Hypothesis 3. (1)Brand attractiveness and (2)brand switching cost of more preferred brand (before joining the coalition loyalty program) will influence more positive effects from (1)program attractiveness and (2)program switching cost of coalition loyalty program (after joining) than less preferred brand. Hypothesis 4. After joining coalition loyalty program, (1)brand attractiveness and (2)brand switching cost of more preferred brand will receive more positive impacts from (1)program attractiveness and (2)program switching cost of coalition loyalty program than less preferred brand. Hypothesis 5. After joining coalition loyalty program, (1)brand attractiveness and (2)brand switching cost of more preferred brand will receive less impacts from (1)brand attractiveness and (2)brand switching cost of different brands (having different preference level), which joined simultaneously, than less preferred brand. Method : In order to validate hypotheses, this study will apply experimental method throughout virtual scenario of coalition loyalty program if consumers have used or available for the actual brands. The experiment is conducted twice to participants. In a first experiment, the study will provide six coalition brands which are already selected based on prior research. The survey asked each brand attractiveness, switching cost, and loyalty after they choose high preference brand and low preference brand. One hour break was provided prior to the second experiment. In a second experiment, virtual coalition loyalty program "SaveBag" was introduced to participants. Participants were informed that "SaveBag" will be new alliance with six coalition brands from the first experiment. Brand attractiveness and switching cost about coalition program were measured and brand attractiveness and switching cost of high preference brand and low preference brand were measured as same method of first experiment. Limitation and future research This study shows limitations of effects of coalition loyalty program by using virtual scenario instead of actual research. Thus, future study should compare and analyze CLP panel data to provide more in-depth information. In addition, this study only proved the effectiveness of coalition loyalty program. However, there are two types of loyalty program, which are Single and Coalition, and success of coalition loyalty program will be dependent on market brand power and prior customer attitude. Therefore, it will be interesting to compare effects of two programs in the future.

  • PDF

ANS Repositioning for Correction of Asymmetric Nose in Unilateral Cleft Lip and Palate (편측 구순구개열 환자에서 ANS 골절단술을 이용한 코 비대칭의 교정)

  • Jung, Young-Soo;Kim, Ki-Ho;Lee, Sang-Hwy;Yi, Choong-Kook
    • Korean Journal of Cleft Lip And Palate
    • /
    • v.8 no.2
    • /
    • pp.87-94
    • /
    • 2005
  • Patients with unilateral cleft lip and palate (UCLP) generally demonstrate the asymmetries in the lip, nose and the naso-maxillary complex. And their skeletal asymmetries are known to be derived from the displacement of nasal septum, anterior nasal spine (ANS) and the pre-maxilla toward the non-affected side during the developmental and growth period. Due to the interruption of the important facial muscles, which are critical for the symmetric growth of premaxilla, functional matrix system fails to develop and results in the displacement of the ANS toward the non-affected side and nasal asymmetry. Therefore the rhinoplasty for CLP patients is required to have inter-skeletal and muscular rearrangement in the naso-maxillary complex in order to let them recover from esthetic and physiologic imbalances. And functional cheilorhinoplasty (FCR) has been a representative treatment of choice for this concept of treatment modality. The outcome and prognosis of primary or repair FCR have been known to be definitely affected by timing of the operation as well as adequate reconstruction of naso-labial muscles. However, sometimes FCR has an ineffective treatment results for patients after the facial growth period, and the limited rhinoplasty around the nose often fails to bring satisfying results. In order to circumvent this limitation, we performed ANS osteotomy for patients with unilateral CLP showing asymmetric nose, as an alternative way for corrective rhinoplasty. We could observe that the nose was rearranged along the facial mid-line by this osteotomy design and asymmetries were evidently improved postoperatively. Here we present this osteotomy method in CLP patients.

  • PDF

Robust GPU-based intersection algorithm for a large triangle set (GPU를 이용한 대량 삼각형 교차 알고리즘)

  • Kyung, Min-Ho;Kwak, Jong-Geun;Choi, Jung-Ju
    • Journal of the Korea Computer Graphics Society
    • /
    • v.17 no.3
    • /
    • pp.9-19
    • /
    • 2011
  • Computing triangle-triangle intersections has been a fundamental task required for many 3D geometric problems. We propose a novel robust GPU algorithm to efficiently compute intersections in a large triangle set. The algorithm has three stages:k-d tree construction, triangle pair generation, and exact intersection computation. All three stages are executed on GPU except, for unsafe triangle pairs. Unsafe triangle pairs are robustly handled by CLP(controlled linear perturbation) on a CPU thread. They are identified by floating-point filtering while exact intersection is computed on GPU. Many triangles crossing a split plane are duplicated in k-d tree construction, which form a lot of redundant triangle pairs later. To eliminate them efficiently, we use a split index which can determine redundancy of a pair by a simple bitwise operation. We applied the proposed algorithm to computing 3D Minkowski sum boundaries to verify its efficiency and robustness.