• Title/Summary/Keyword: Priority data

Search Result 1,788, Processing Time 0.033 seconds

Two Priority Class Polling Systems with Batch Poisson Arrivals

  • Ryu, Won;Kim, Dae-Ung;Lee, Bok-Lai;Park, Byeong-U;Chung, Jin-Wook
    • Communications for Statistical Applications and Methods
    • /
    • v.6 no.3
    • /
    • pp.881-892
    • /
    • 1999
  • In this paper we consider a polling system with two classes of stations; high priority and low priority. High priority stations are polled more frequently than low priority stations. We derive an exact and explicit formula for computing the mean waiting times for a message when the arrival processes are batch Poisson. In general the formula requires to solve two sets of simultaneous equations By specializing them to the case of two priority classes we greatly reduce the number equations and provide a simple formula for mean waiting times. We apply the results to a data communication processing system and show that the overall mean waiting time can be reduced by using priority polling.

  • PDF

Priority-based Overlay Multicast for Distributed Interactive Application (Distributed Interactive Application을 위한 우선 순위 기반 오버레이 멀티캐스트)

  • Lee, Hyung-Ok;Nam, Ji-Seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.1367-1369
    • /
    • 2013
  • Applying Application-Level Multicast technology (ALM) to Distributed Interactive Applications (DIAs) becomes more and more popular. Especially for DIAs embedded priority that the sender forwards data to receivers due to their respective priorities. The priority-based directed minimum spanning tree (PST) algorithm was designed for these DIAs. However, the PST has no efficient priority selection and filtering mechanism. The system will consume a tremendous amount of resource for reconstructing distribution tree and becomes unstable and unscalable. In this paper, First, We propose a novel priority-based application level multicast algorithm: Predict-and-Quantize for Priority with directed minimum Spanning Tree (PQPST), which can efficiently predict efficient priorities for the receivers and quantize the predicted priorities to build the multicast distribution tree. Second, we propose Priority Discrepancy Heuristic Mechanism (PDHM), which sets different thresholds of priority discrepancy within the priority discrepancy interval to control the distribution tree construction can efficiently decrease the repeated distribution tree construction, and we get the best heuristic priority discrepancy interval by PQPST. According to the simulation results, the PQPST and PDHM can efficiently improve the performance of the PST algorithm.

EEPB-MAC: Energy Efficient & Priority-Based MAC Protocol for Energy Harvesting Wireless Sensor Networks (에너지 수확 무선 센서 네트워크에서 에너지 효율 및 우선순위 기반의 MAC 프로토콜)

  • Kim, Seong-Cheol;Jeon, Jun-Heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.3
    • /
    • pp.755-761
    • /
    • 2013
  • Medium access control (MAC) protocols for wireless sensor networks make sensor nodes on state for energy-efficiency only when necessary. In this paper we present an energy efficient priority-based MAC protocol for energy-harvesting Wireless Sensor Networks (WSNs). For support priority-based packet transmission the proposed EEPB-MAC protocol uses the modified IEEE 802.15.4 beacon frames including priority bit, sender node address, and NAV value fields. A receiver node periodically wakes up, receives sender beacon frames, selects data sending sender, and broadcasts a beacon frame containing the selected sender's address. A receiver node selects sender node according to sender's data priority. A receiver nodes also adjust wake up period based on their energy states. Hence, the energy consumption of receiver node can be minimized. Through simulations and analytical analysis, we evaluate the performance of our proposed the EEPB-MAC protocol and compare it against the previous MACs. Results have shown that our protocol outperforms other MAC in terms of energy consumption, higher priority packet delivery delay.

Evaluation for Risk Priority Number of Railway Power System Facility using Fuzzy Theory (퍼지이론을 이용한 철도 전력 설비의 Risk Priority Number 산정)

  • Lee, Yun-Seong;Byeon, Yoong-Tae;Kim, Jin-O;Kim, Hyung-Chul;Lee, Jun-Kyung
    • Journal of the Korean Society for Railway
    • /
    • v.12 no.6
    • /
    • pp.921-926
    • /
    • 2009
  • The RPN provides information which includes the risk level and the priority order of maintenance tasks for components. However, if there is no sufficient historical failure data, the historical failure data from other sources can be applied to the target system. And if we use historical data from other sources without any process, there will be concomitant problems according to a discord of each system characteristic, a difference between the present and the date of failure data, etc. In this paper, a new methodology is proposed to model the failure rate as a fuzzy function to resolve these problems. Taking advantage of this result, the RPN can be calculated by using the fuzzy operation. The proposed method is applied to the substation system.

Energy Efficient and Multimedia Traffic Friendly MAC Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적이고 멀티미디어 트래픽에 적합한 MAC 프로토콜)

  • Kim, Seong Cheol;Kim, Hye Yun;Kim, Joong Jae
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.8
    • /
    • pp.1460-1465
    • /
    • 2016
  • In this paper, we propose an energy efficient and multimedia traffic friendly MAC protocol (EEMF-MAC) that controls sender's wakeup period based on the data packet's transmission urgency and the receiver's wakeup periods based on the received data packet traffic loads. The protocol is useful for applications such as object tracking, real time data gathering, in which priority-based packet transmission is required. The basic idea of EEMF-MAC is that it uses the priority concept with transmission urgency of sender's data packet to reduce the transmission delay of the urgent data and it also uses duty cycling technique in order to achieve energy efficiency. EEMF-MAC showed a better performance in energy efficiency and packet transmission delay compared to existing protocols, RI-MAC and EE-RI-MAC.

Global Patterns of Pigment Concentration, Cloud Cover, and Sun Glint: Application to the OSMI Data Collection Planning

  • Kim, Yong-Seung;Kang, Chi-Ho;Lim, Hyo-Suk
    • Proceedings of the KSRS Conference
    • /
    • 1998.09a
    • /
    • pp.387-392
    • /
    • 1998
  • To establish a monthly data collection planning for the Ocean Scanning Multispectral Imager (OSMI), we have examined the global patterns of three impacting factors: pigment concentration, cloud cover, and sun glint. Other than satellite mission constraints (e.g., duty cycle), these three factors are considered critical for the OSMI data collection. The Nimbus-7 Coastal Zone Color Scanner (CZCS) monthly mean products and the International Satellite Cloud Climatology Project (ISCCP) monthly mean products (C2) were used for the analysis of pigment concentration and cloud cover distributions, respectively. And the monthly simulated patterns of sun glint were produced by performing the OSMI orbit prediction and the calculation of sun glint radiances at the top-of-atmosphere (TOA). Using monthly statistics (mean and/or standard deviation) of each factor in the above for a given 10$^{\circ}$ latitude by 10$^{\circ}$ longitude grid, we generated the priority map for each month. The priority maps of three factors for each month were subsequently superimposed to visualize the impact of three factors in all. The initial results illustrated that a large part of oceans in the summer hemisphere was classified into the low priority regions because of seasonal changes of clouds and sun illumination. Sensitivity tests were performed to see how cloud cover and sun glint affect the priority determined by pigment concentration distributions, and consequently to minimize their seasonal effects upon the data collection planning.

  • PDF

Where and Why? A Novel Approach for Prioritizing Implementation Points of Public CCTVs using Urban Big Data

  • Ji Hye Park;Daehwan Kim;Keon Chul Park
    • Journal of Internet Computing and Services
    • /
    • v.24 no.5
    • /
    • pp.97-106
    • /
    • 2023
  • Citizens' demand for public CCTVs continues to rise, along with an increase in variouscrimes and social problems in cities. In line with the needs of citizens, the Seoul Metropolitan Government began installing CCTV cameras in 2010, and the number of new installations has increased by over 10% each year. As the large surveillance system represents a substantial budget item for the city, decision-making on location selection should be guided by reasonable standards. The purpose of this study is to improve the existing related models(such as public CCTV priority location analysis manuals) to establish the methodology foranalyzing priority regions ofSeoul-type public CCTVs and propose new mid- to long-term installation goals. Additionally, using the improved methodology, we determine the CCTV priority status of 25 autonomous districts across Seoul and calculate the goals. Through its results, this study suggests improvements to existing models by addressing their limitations, such as the sustainability of input data, the conversion of existing general-purpose models to urban models, and the expansion of basic local government-level models to metropolitan government levels. The results can also be applied to other metropolitan areas and are used by the Seoul Metropolitan Government in its CCTV operation policy

A priority scheme for IEEE 802.11 with guaranteeing QoS

  • Kim, Yong-Joong;Park, Hyo-Dal
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1594-1597
    • /
    • 2002
  • In this paper, we proposed the IEEE 802.11 CSMA/CA protocol with the priority scheme. The IEEE 802.11 CSMA/CA protocol is the standard in wireless LAN We applied the proposed method to the aeronautical mobile telecommunication environment. The CSMA/CA protocol has two frames : one is PCF frame for real time service like voice and image and the other DCF frame for contention services like data transmission. Now we proposed the priority scheme that has the different CW region according to the transmitted data. The simmulation results shows the proposed method's performance is improved, Because the collision probability is reduced by allowing the different CW between stations. And the time dalay results show the priority scheme is very appropriated.

  • PDF

A scheduling algorithm for conditonal resources sharing consideration (조건부 자원 공유를 고려한 스케쥴링 알고리즘)

  • 인지호;정정화
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.2
    • /
    • pp.196-204
    • /
    • 1996
  • This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

  • PDF

A Cultural Property Priority Assessment Using Information Measure Technique (정보계측기법을 이용한 문화재 중요도 평가방안)

  • Jung, Nam-Su;Lee, Jeong-Jae
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.48 no.1
    • /
    • pp.41-48
    • /
    • 2006
  • In the evaluation of rural amenities, its properties are related with social, cultural, and environmental elements. In this study, Information Measure Model (IMM) and Cultural Property Priority Assessment Model (CPPAM) were developed adapting information measure model with text based surveying data. To apply developed model not only general properties but also specific surveyed data, Specific Information Gathering and Utilizing System (SIGUS) was constructed using the data in Dusan World encyclopedia. IMM shows priorities of cultural property by information in national-designated cultural properties. And CPPAM applied in surveying data in 2004 by Rural Resources Development Institute.