• Title/Summary/Keyword: Priority Queuing

Search Result 41, Processing Time 0.019 seconds

Analysis and Reduction of Transient Time Periods for Smooth Handoff Packets in Mobile IPv6 Networks (Mobile IPv6망에서 Smooth 핸드오프 패킷의 과도기간 분석 및 단축)

  • Lee, Dong-Wook;Kim, Jong-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11B
    • /
    • pp.999-1006
    • /
    • 2003
  • In the paper, we investigate the impact of handoff on the packet delivery in the Mobile IPv6 networks, where the smooth handoff is adopted. That is measured by an 'unstable time period (UTP)', a 'silence time period(STP)', and a 'handoff time period (HTP)' in the mobile node's perspective. Then, we propose a queuing model to get the exact value of the handoff transient time. The numerical results show that the queuing delay for the handoff packets and the involved link (or route) capacities affect the estimated UTP, STP, and HTP. On the other hand, the damage of application caused by handoff will increases when the handoff transient time becomes longer. We show that the priority scheduling method can achieve shorter STP and UP than the FIFO scheduling method that is generally used in best-effort IP network.

Effective Priority Control Scheme according to Cell Loss Probability in ATM (ATM에서의 셀 손실율에 따른 효율적인 우선순위 제어)

  • 이상태;김남희전병실
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.70-73
    • /
    • 1998
  • This paper present a new priority control mechanism which is to balance the cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements. And, to reduce the delay rates we modified existing cell scheduling scheme. Throughout the computer simulation, the existing methods and proposed scheme is compared with respect to cell loss rate and average delay time. In the result of simulation, the proposed scheme have more improved performance than the other schemes with respect to cell loss rate and average delay time.

  • PDF

Incentive-Compatible Priority Pricing and Transfer Analysis in Database Services

  • Kim, Yong J.
    • The Journal of Information Technology and Database
    • /
    • v.4 no.2
    • /
    • pp.21-32
    • /
    • 1998
  • A primary concern of physical database design has been efficient retrieval and update of a record because predictable performance of a DBMS is indispensable to time-critical missions. To maintain such phenomenal performance, database manages often spends more than or as much as the goal of an organization can warrant. The motivation of this research stems from the fact that even predictable performance of a physical database can be hampered by stochastic query processing time, physical configurations of a database, and random arrival processes of queries. They all together affect the overall performance of a DBMS. In particular, if there are queuing delays due to limited capacity or during on-peak congestion, this paper suggest to prioritize database services. A surprising finding of this paper is that such a transition from a non-priority system to a corresponding priority-based system can be Pareto-improving in the sense that no users in the system will be worse off after the transition. Thus prioritizing database services can be a viable option for efficient database management.

  • PDF

Design and Implementation of HomePNA 2.0 MAC Controller Circuit (HomePNA 2.0 MAC Controller 회로의 설계 및 구현)

  • Kim, Jong-Won;Kim, Dae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1A
    • /
    • pp.1-10
    • /
    • 2006
  • The Home Phoneline Networking Alliance(HomePNA) 2.0 technology can establish a home network using existing in-home phone lines, which provides a channel rate of 4-32 Mbps. HomePNA 2.0 Medium Access Control(MAC) protocol adopts an IEEE 802.3 Carrier Sense Multiple Access with Collision Detection(CSMA/CD) access method, Quality of Service(QoS) algorithm, and Distributed Fair Priority Queuing(DFPQ) collision resolution algorithm. In this paper, we describe some performance analysis results of HomePNA 2.0 MAC protocol and the requirements of HomePNA 2.0 MAC controller. Then, we propose the architecture of HomePNA 2.0 MAC controller circuit, show the simulation result of each block included in HomePNA 2.0 MAC controller, and present the HomePNA 2.0 transceiver chip that we have implemented.

BIM-based Design Verification Performance Analysis with Priority Rules Applied (우선순위 규칙을 적용한 BIM 기반 설계검증 성과 분석)

  • Huh, Seung-Ha;Shim, Jae-Hyeong;Ham, Nam-Hyuk;Kim, Jae-Jun
    • Journal of KIBIM
    • /
    • v.11 no.3
    • /
    • pp.1-11
    • /
    • 2021
  • BIM is one of the means of reducing the economic loss caused by design errors. These features of BIM have led to increased use of BIM. With the increasing use of BIM, several studies have been conducted to analyze the performance of BIM. As the importance of BIM staff is emphasized in the performance analysis of BIM, the human resource allocation of BIM staff can become an important research issue. However, there are few studies to measure the workforce effectiveness of BIM staff. Ham et al (2020) measured BIM workforce efficiency using FCFS queue model rules. Since design errors can have different effects on the project depending on the type, there are design errors that must be dealt with first. Therefore, in this study, a priority queue was used to solve design errors with high priority first. The performance of BIM-based design verification was analyzed by quantitatively analyzing the performance of BIM staff when the priority rule was applied to the design error processing sequence.

A Study on Efficient Scheduling Scheme for QoS in ATM Switch (ATM 스위치에서의 QOS 을 위한 효율적인 스케쥴링 기법에 관한 연구)

  • 이상태;김남희
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.75-78
    • /
    • 1998
  • In this paper, we propose a new cell discarding and scheduling scheme which reduce cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements and reduce average delay rate for the traffic that is sensitive in cell delay in output buffer of the ATM switch. Throughout the computer simulation, the existing scheduling scheme and proposed scheme are compared with respect to cell loss rate and average delay time.

  • PDF

A traffic control agent to manage flow usage in Differentiated Service Network (차별화서비스 네트워크에서 흐름 관리를 위한 트래픽 제어 에이전트)

  • 이명섭;박창현
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.69-72
    • /
    • 2003
  • This paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network.

  • PDF

A Priority Time Scheduling Method for Avoiding Gateway Bottleneck in Wireless Mesh Networks (무선 메쉬 네트워크에서 게이트웨이 병목 회피를 위한 우선순위 타임 스케줄링 기법)

  • Ryu, Min Woo;Kim, Dae Young;Cha, Si Ho;Cho, Kuk Hyun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.2
    • /
    • pp.101-107
    • /
    • 2009
  • In existing wireless ad-hoc networks, how to distribute network resources fairly between many users to optimize data transmission is an important research subject. However, in wireless mesh networks (WMNs), it is one of the research areas to avoid gateway bottleneck more than the fair network resource sharing. It is because WMN traffic are concentrated on the gateway connected to backhaul. To solve this problem, the paper proposes Weighted Fairness Time-sharing Access (WFTA). The proposed WFTA is a priority time scheduling scheme based on Weighted Fair Queuing (WFQ).

Design and Simulation of HomePNA 2.0 MAC Controller Circuit

  • Kim, Jong-Won;Kim, Dae-Young
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.179-182
    • /
    • 2005
  • The Home Phoneline Networking Alliance (HomePNA) 2.0 technology can establish a home network using existing in-home phone lines, which provides a channel rate of 4 - 32 Mbps. HomePNA 2.0 Medium Access Control (MAC) protocol adopts an IEEE 802.3 Carrier Sense Multiple Access with Collision Detection (CSMA/CD) access method, a Quality of Service (QoS) algorithm, and a Distributed Fair Priority Queuing (DFPQ) collision resolution algorithm. In this paper, we analyze the HomePNA 2.0 MAC protocol and propose the architecture of HomePNA 2.0 MAC controller circuit. Then, we present the simulation result of each block included in the HomePNA 2.0 MAC controller.

  • PDF

Lyapunov-based Fuzzy Queue Scheduling for Internet Routers

  • Cho, Hyun-Cheol;Fadali, M. Sami;Lee, Jin-Woo;Lee, Young-Jin;Lee, Kwon-Soon
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.3
    • /
    • pp.317-323
    • /
    • 2007
  • Quality of Service (QoS) in the Internet depends on queuing and sophisticated scheduling in routers. In this paper, we address the issue of managing traffic flows with different priorities. In our reference model, incoming packets are first classified based on their priority, placed into different queues with different capacities, and then multiplexed onto one router link. The fuzzy nature of the information on Internet traffic makes this problem particularly suited to fuzzy methodologies. We propose a new solution that employs a fuzzy inference system to dynamically and efficiently schedule these priority queues. The fuzzy rules are derived to minimize the selected Lyapunov function. Simulation experiments show that the proposed fuzzy scheduling algorithm outperforms the popular Weighted Round Robin (WRR) queue scheduling mechanism.