• Title/Summary/Keyword: Call Flow

Search Result 112, Processing Time 0.026 seconds

A buffer readout scheduling for ABR traffic control (ABR 트랙픽 제어를 위한 버퍼 readout 스케쥴링)

  • 구창회;이재호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.11
    • /
    • pp.25-33
    • /
    • 1997
  • The end-to-end rate-based control mechanism is used for the flow control of the ABR service to allow much more flexibility in ATM switching system. To accommodate the ABR service effciently many algorithms such as EFCI, EPRCA, ERICA, and CAPC2 have been proposed for the switch algorithm. ABR cells and related RM cells are received at the ATM switch fabric transparently without any processing. And then cells received from the traffic source are queued in the ABR buffer of switching system. The ABR buffer usually has some thresholds for easy congestion control signal transmission. Whatever we use, therefore, these can be many ABR traffic control algorithms to implement the ABR transfer capability. The genertion of congestion indicate signal for ABR control algorithms is determined by ABR buffer satus. And ABR buffer status is determined by ABR cells transfer ratio in ATM switch fabrics. In this paper, we presented the functional structures for control of the ABR traffic capability, proposed the readout scheduling, cell slot allocation of output link and the buffer allocation model for effective ABR traffic guranteeing with considering CBR/VBR traffics in ATM switch. Since the proposed readout scheduling scheme can provide more avaliable space to ABR buffer than existing readout scheduling scheme, generation rate of a SEND signal, that is, BCN signal in destination node can be increased for ABR call connection. Therefore, the proposed scheme, in this paper, can be appropriate as algorithm for effective ABR traffic service on output link of ATM switching node.

  • PDF

The design and implementation of security kernel assured trusted path (신뢰경로가 보장되는 보안커널 설계 및 구현)

  • 이해균;김재명;조인준
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2001.11a
    • /
    • pp.340-347
    • /
    • 2001
  • Security operating system applied to MAC(Mandatory Access Control) or to MLS(Multi Level Security) gives both subject and object both Security Level and value of Category, and it restrict access to object from subject. But it violates Security policy of system and could be a circulated course of illegal information. This is correctly IPC(Interprocess Communication)mechanism and Covert Channel. In this thesis, I tried to design and implementation as OS kernel in order not only to give confidence of information circulation in the Security system, but also to defend from Covert Channel by Storage and IPC mechanism used as a circulated course of illegal information. For removing a illegal information flow by IPC mechanism. I applied IPC mechanism to MLS Security policy, and I made Storage Covert Channel analyze system call Spec. and than distinguish Storage Covert Channel. By appling auditing and delaying, I dealt with making low bandwidth.

  • PDF

Analysis on the Information Flows and Representations of User-OPACs Interfaces. (이용자-OPACs접속의 정보 흐름과 표현의 분석)

  • Kim Sun-Ho
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.29
    • /
    • pp.141-172
    • /
    • 1995
  • The main objective of this study is to analyse the information flows and representations which is shown at the displays of the user-OPACs interfaces in the 5 academic library automation systems. The findings made in the study are summarized as follows: 1) The interactive styles of that displays are based on the menu selection style. 2) The structures of information flow on that displays are the compound structure which is basically made of the network, the binary, and the pop-up structures. 3) The elements of the displays are consisted with the fields concerning the database name, the current working area, the indicator, the menu, the exit, the prompt and the system message. 4) The essential entries of the main menus are Book, Periodical. and Thesis. 5) The important languages of the command language styles are Search, Display, Print, Help, and End. 6) The elements of the display structures for the retrieval are the retrieving key, the Boolean operators, and the exit. 7) The major retrieving keys are Title, Author, Subject name, Call Number, and Publisher. 8) The marks of Boolean operators on the retrieval displays is different among the systems each other.

  • PDF

Efficient Robot Cleaning Algorithm based on Set Cover Algorithm (셋 커버 알고리즘을 이용한 효율적인 로봇 청소 알고리즘)

  • Jeon, Heung-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.3
    • /
    • pp.85-90
    • /
    • 2008
  • In this paper, we propose a new robot cleaning algorithm, which we call SetClean. The new algorithm cleans from the most less complex area. Sometimes, when the cleaning completion time can be longer or can not be estimated, cleaning larger area first is better than optimizing the whole time for cleaning. To do this, SetClean algorithm divides the whole area into cleanable sub-areas using Set Cover algorithm and cleans the area in the order of high efficiency that maximize the cleanable area per unit time. SetClean algorithm decides the navigation flow by considering not only the size of the area but also the distance from the current robot location to the area to be cleaned and the delay time caused by the number of turns within the area. The experimental results show the mechanism and performance of the SetClean algorithm.

  • PDF

An Efficient Coverage Algorithm for Intelligent Robots with Deadline (데드라인을 고려하는 효율적인 지능형 로봇 커버리지 알고리즘)

  • Jeon, Heung-Seok;Jung, Eun-Jin;Kang, Hyun-Kyu;Noh, Sam-H.
    • The KIPS Transactions:PartA
    • /
    • v.16A no.1
    • /
    • pp.35-42
    • /
    • 2009
  • This paper proposes a new coverage algorithm for intelligent robot. Many algorithms for improving the performance of coverage have been focused on minimizing the total coverage completion time. However, if one does not have enough time to finish the whole coverage, the optimal path could be different. To tackle this problem, we propose a new coverage algorithm, which we call MaxCoverage algorithm, for covering maximal area within the deadline. The MaxCoverage algorithm decides the navigation flow by greedy algorithm for Set Covering Problem. The experimental results show that the MaxCoverage algorithm performs better than other algorithms for random deadlines.

Development of an AGV Controller in Semiconductor and LCD Production Systems (반도체 및 LCD 제조 공정의 AGV Controller 개발)

  • Suh, Jungdae;Jang, Jaejin;Koo, Pyung-Hoi
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.29 no.1
    • /
    • pp.1-13
    • /
    • 2003
  • In this paper, LAC(Look-ahead AGV Controller) has been developed for efficient routing of parts in semiconductor and LCD production systems. Several procedures have been developed as sub-modules. LACP(Look-ahead AGV Control Procedure) which controls AGVs using the information on the current and future status of the systems is the main element of the LAC. To support LACP, DSP(Destination Selection Procedure) which determines a destination of a part and AGV call time, SSP(Source Selection Procedure)which selects a part coming next to a buffer when the buffer becomes available. and RTM(Response Time Model) which estimates empty travel time of AGVs and waiting time for an available AGV have been developed. A simulation experiment shows that LAC reduces part's flow time, AGV utilization, average and maximum inventory level of a central buffer, empty travel time of an AGV, and waiting time for an available AGV.

A Study on the Various Attributes of E-Sport Influencing Flow and Identification (e-스포츠의 다양한 속성이 유동(flow)과 동일시에 미치는 영향에 관한 연구)

  • Suh, Mun-Shik;Ahn, Jin-Woo;Kim, Eun-Young;Um, Seong-Won
    • Journal of Global Scholars of Marketing Science
    • /
    • v.18 no.1
    • /
    • pp.59-80
    • /
    • 2008
  • Recently, e-sports are growing with potentiality as a new industry with conspicuous profit model. But studies that dealing with e-sports are not enough. Hence, proposes of this paper are both to establish basic model that is for the design of e-sport marketing strategy and to contribute toward future studies which are related to e-sports. Recently, the researches to explain sports-sponsorship through the identification theory have been discovered. Many researches say that somewhat proper identification is a requirement for most sponsors to improve the their images which is essential to sponsorship activity. Consequently, the research for sponsorship associated with identification in the e-sports, not in the physical sports is the core sector of this study. We extracted the variables from online's major characteristics and existing sport sponsorship researches. First, because e-sports mean the tournaments or leagues in the use of online game, the main event of the game is likely to call it online game. Online media's attributes are distinguished from those of offline. Especially, interactivity, anonymity, and expandibility as a e-sport game attributes are able to be mentioned. So, these inherent online attributes are examined on the relationship with flow. Second, in physical sports games, Fisher(1998) revealed that team similarity and team attractivity were positively related to team identification. Wann(1996) said that the result of former game influenced the evaluation of the next game, then in turn has an effect on the identification of team supporters. Considering these results in the e-sports side, e-sports gamer' attractivity, similarity, and match result seem to be important precedent variables of the identification with a gamer. So, these e-sport gamer attributes are examined on the relationship with both flow and identification with a gamer. Csikszentmihalyi(1988) defined the term flow as feeling status for him to be making current positive experience optimally. Hoffman and Novak(1996) also said that if a user experienced the flow he would visit a website without any reward. Therefore flow might be positively associated with user's identification with a gamer. And, Swanson(2003) disclosed that team identification influenced the positive results of sponsorship, which included attitude toward sponsors, sponsor patronage, and satisfaction with sponsors. That is, identification with a gamer expect to be connected with corporation identification significantly. According to the above, we can design the following research model. All variables used in this study(interactivity, anonymity, expandibility, attractivity, similarity, match result, flow, identification with a gamer, and identification with a sponsor) definitely were defined operationally underlying precedent researches. Sample collection was carried out to the person who has an experience to have enjoyed e-sports during June 2006. Much portion of samples is men because much more men than women enjoy e-sports in general. Two-step approach was used to test the hypotheses. First, confirmatory factor analysis was committed to guarantee the validity and reliability of variables. The results showed that all variables had not only intensive and discriminant validity, but also reliability. Then, research model was examined with fully structural equation using LISREL 8.3 version. The fitness of the suggested model mostly was at the acceptable level. Shortly speaking about the results, first of all, in e-sports game attributes, only interactivity which is called a basic feature in online situation affected flow positively. Secondly, in e-sports gamer's attributes, similarity with a gamer and match result influenced flow positively, but there was no significant effect in the relationship between the attractivity of a gamer and flow. And as expected, similarity had an effect on identification with a gamer significantly. But unexpectedly attractivity and match result did not influence identification with a gamer significantly. Just the same as the fact verified in the many precedent researches, flow greatly influenced identification with a gamer, and identification with a gamer continually had an influence on the identification with a sponsor significantly. There are some implications in these results. If the sponsor of e-sports supports the pro-game player who absolutely should have the superior ability to others and is similar to the user enjoying e-sports, many amateur gamers will feel much of the flow and identification with a pro-gamer, and then after all, feel the identification with a sponsor. Such identification with a sponsor leads people enjoying e-sports to have purchasing intention for products produced by the sponsor and to make a positive word-of-mouth for those products or the sponsor. For the future studies, we recommend a few ideas. Based on the results of this study, it is necessary to find new variables relating to the e-sports, which is not mentioned in this study. For this work to be possible, qualitative research seems to be needed to consider the inherent e-sport attributes. Finally, to generalize the results related to e-sports, a wide range of generations not a specific generation should be researched.

  • PDF

A Comparative Study of Geological Characteristics between Traditional Spa and Newly-established Spa (전통온천과 신설온천의 지질학적 특성 비교)

  • Lee, Young-Hee
    • Journal of the Korean Geographical Society
    • /
    • v.42 no.6
    • /
    • pp.851-862
    • /
    • 2007
  • The main reason of environmental pollution and destruction due to an indiscreet development of spa is the law of spa in use. According to the law of spa, the water of spa is ordained not mineral component and its efficacy but water temperature of over $25^{\circ}C$. Therefore this research was to analyze the differences between traditional spa and newly-established spa based on heat flow, geological rock, and fault relating to spa in order to call attention to a revision of the law of spa. According to the results, the location of the traditional spas was in accord with places which are Pohang, Bugok, Dongrae and Haeundae-gu of Busan, Uljin, Chungju, Usung-gu of Daejeon, Yesan, Asan, and Ichon. The heat flow of these places is over 67mW/m2 that is an average of South Korea. Relating to a fault, 92.3% of the traditional spas concurs with a fault and 33.5% of newly-established spa is in accord with a fault. 58.2% of the traditional spas and 42.7% of the newly-established spa are consistent with the granite.

A Study on the Safety Improvement of Vessel Traffic in the Busan New Port Entrance (부산신항 진출입 항로 내 선박 통항 안전성 향상에 관한 연구)

  • Choi, Bong-kwon;Park, Young-soo;Kim, Nieun;Kim, Sora;Park, Hyungoo;Shin, Dongsu
    • Journal of Navigation and Port Research
    • /
    • v.46 no.4
    • /
    • pp.321-330
    • /
    • 2022
  • Busan New Port manages the largest volume of traffic among Korean ports, and accounts for 68.5% of the total volume of the Busan port. Due to this increase in volume, ultra large container ships call at Busan New Port. When the additional south container terminal as well as ongoing construction project of the west container terminal are completed, various encounters may occur at the Busan New Port entrance, which may cause collision risk.s Thus, the purpose of this study was to provide a plan to improve the safety of vessel traffic, in the in/out bound fairway of Busan New Port. For this purpose, the status of arrivals and departures of vessels in Busan New Port, was examined through maritime traffic flow analysis. Additionally, risk factors and safety measures were identified, by AHP analysis with ship operators of the study area. Also, based on the derived safety measures, scenarios were set using the Environmental Stress model (ES model), and the traffic risk level of each safety measure was identified through simulation. As a result, it is expected that setting the no entry area for one-way traffic would have a significant effect on mitigating risks at the Busan New Port entrance. This study can serve as a basis for preparing safety measures, to improve the navigation of vessels using Busan New Port. If safety measures are prepared in the future, it is necessary to verify the safety by using the traffic volume and flow changes according to the newly-opened berths.

Guaranteeing delay bounds based on the Bandwidth Allocation Scheme (패킷 지연 한계 보장을 위한 공평 큐잉 기반 대역할당 알고리즘)

  • 정대인
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8A
    • /
    • pp.1134-1143
    • /
    • 2000
  • We propose a scheduling algorithm, Bandwidth Allocation Scheme (BAS), that guarantees bounded delay in a switching node. It is based on the notion of the GPS (Generalized Processor Sharing) mechanism, which has clarified the concept of fair queueing with a fluid-flow hypothesis of traffic modeling. The main objective of this paper is to determine the session-level weights that define the GPS sewer. The way of introducing and derivation of the so-called system equation' implies the approach we take. With multiple classes of traffic, we define a set of service curves:one for each class. Constrained to the required profiles of individual service curves for delay satisfaction, the sets of weights are determined as a function of both the delay requirements and the traffic parameters. The schedulability test conditions, which are necessary to implement the call admission control, are also derived to ensure the proposed bandwidth allocation scheme' be able to support delay guarantees for all accepted classes of traffic. It is noticeable that the values of weights are tunable rather than fixed in accordance with the varying system status. This feature of adaptability is beneficial towards the enhanced efficiency of bandwidth sharing.

  • PDF