• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.12
• /
• pp.520-528
• /
• 2002

The ATM Forum recently introduced the Guaranteed Frame Rate(GFR) service category GFR service has been designed to support classical best effort traffic such as TCP/IP based traffic. The GFR service not only guarantees a minimum throughput, but also supports fair distribution of available bandwidth to completing VCs. In this paper, we proposed a new buffer management algorithm based on leaky bucket to provide minimum cell rate guarantee and improve fairness. The proposed algorithm reduces complexity and processing overhead of leaky-bucket algorithm to implement easily.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.476-476
• /
• 2021

도시화로 인한 불투수율 증가는 자연 물순환을 왜곡시켜 표면 유출량 증가, 침투량 감소, 증발량 감소 등을 야기한다. 뿐만 아니라 도시화로 인한 인구밀도 집중은 배출오염물질의 평균 농도와 물 사용량을 증가시켜 인공 물순환의 왜곡을 초래한다. 왜곡된 물순환의 회복을 위해 건전한 도시 물순환의 정의를 정립하는 것은 필수적이다. 본 연구는 물순환과 관련된 문헌조사와 평가 분석 방법을 검토하여, 건전한 도시 물순환을 지속가능성, 공평성, 안전성, 효율성 측면에서 시간, 공간, 이해관계자들이 균형을 이루는 것에 초점을 맞추고자 한다. 과거와 현재 상태, 그리고 미래 기후변화시나리오 적용 시 어떤 변화가 있으며, 이에 따른 물순환 관리체계가 확보될 수 있는 모습, 공간적 측면에서 물의 수평적·수직적 이동이 치우침이 없는 모습, 수요자 입장에서 가뭄이나 홍수로 인한 재산·인명 피해가 최소화된 모습, 공급자 입장에서 수량·수질 관리체계가 확보된 모습을 각각 지속가능성, 공평성, 안전성, 효율성으로 정의 내렸다. 도시 물순환의 적절한 상태를 제안하기 위해서 도시 물순환의 지표로 증발산율, 지표수유출률, 지하수유출률, 침투율로 선정하였다. 앞서 언급한 네 가지 측면(지속가능성, 안전성, 공평성, 효율성)에서의 모습과 네 개의 지표 상태를 비교하여 균형 잡힌 도시 물순환의 상태를 제안하고자 한다. 정의에 제시된 네 가지 측면에 대한 하위 항목은 WAMIS, KOSTAT 등을 통해 조사하고 국내 주요 도시와 서울대학교 관악캠퍼스 내에서 분석하고자 한다. 본 연구를 통해 도시 정책 설립 및 이해관계자들에게 수문학적 관점에서 건전한 도시화의 방향을 줄 수 있을 것이다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.5 s.347
• /
• pp.84-93
• /
• 2006

Ethernet-PON is an emerging access network technology that provides a low-cost method of deploying optical access lines between OLT and ONUs. It has a point-to-multipoint and multipoint-to-point architecture in downstream and upstream direction, respectively. Therefore, downstream packets are broadcast from an OLT toward all ONUs sithout collision. On the other hand, since alt ONUs share a common channel, the collision may be occurred for the upstream transmission. Therefore, earlier efforts on Ethernet-PON have been concentrated on an upstream MAC protocol to avoid collision. But it is needed to control downstream traffic in practical access network, where the network provider limits available bandwidth according to the number of users. In this paper, we propose a traffic control scheme for supporting the fairness of the downstream bandwidth. The objective of this algorithm is to guarantee the fairness of ONUs while maintaining good performance. In order to do this, we define the service probability that considers the past traffic information for downstream, the number of tokens and the relative size of negotiated bandwidth. We develop the simulation model for Ethernet-PON to evaluate the rate-limiting algorithm by using AWESIM. Some results are evaluated and analyzed in terms of defined fairness factor, delay and dropping rate under various scenario.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.191-197
• /
• 2012

In this paper we propose the FQSM(Fairness and QoS Supporting MAC) protocol that supports fairness and Quality of Service(QoS). The received or measured data traffics will be assigned a priority level according to its transmission urgency in the FQSM. And the load prediction algorithm is used to support the fairness between different priority traffics. For this, the buffer length values of the nodes are continuously monitored for a some period. Based on the buffer length variations for this period, the order of transmission is determined. FQSM also adapts cross-layer concept to rearrange the data transmission order in each sensor node's buffer, saves energy consumption by allowing few nodes in data transmission, and prolongs the network lifetime.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.348-353
• /
• 2010

A threshold decryption scheme is a multi-party public key cryptosystem that allows any sufficiently large subset of participants to decrypt a ciphertext, but disallows the decryption otherwise. When performing a threshold decryption, a third party is often involved to guarantee fairness among the participants. To maintain the security of the protocol as high as possible, it is desirable to lower the level of trust and the amount of information given to the third party. In this paper, we present a threshold decryption scheme which allows the anonymity of the participants as well as the fairness by employing a semi-trusted third party (STTP) which follows the protocol properly with the exception that it keeps a record of all its intermediate computations. Our solution preserves the security and fairness of the previous scheme and reveals no information about the identities of the participants and the plaintext even though an attacker is allowed to access the storage of the STTP.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.291-303
• /
• 2009

Round robin based proportional share scheduling(RRPS) defines weight which determines share for each task and allocates CPU resource to each task in proportional to its respective weight. RRPS uses fairness as the measure of performance and aims at high fairness of scheduling. However, researches for scheduling fairness problem due to synchronization among tasks have been rarely investigated. In this paper, we discuss that scheduling delay due to synchronization may result high unfairness in RRPS. We explain such a situation as weight inversion. We then propose weight inheritance protocol(WIP), a synchronization mechanism, that prevents weight inversion. We also show that WIP can reduce unfairness using fairness analysis and simulation.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.10a
• /
• pp.316-319
• /
• 1996

• The Journal of the Korea Contents Association
• /
• v.7 no.12
• /
• pp.238-244
• /
• 2007

Guaranteed Frame Rate(GFR), recently approved by the ATM Forum, expects to become an important service category to efficiently support TCP/IP traffic in ATM networks. The GFR service not only guarantees a minimum service rate at the frame level, but also supports a fair share of available bandwidth. We proposed new scheduling scheme for the GFR service. Proposed scheme provides priority to VCs and high priority to a VC which have more untagged cells in buffer. High priority VCs have much more serviced than low priority. Proposed scheme can provide MCR(minimum cell rate) guarantee and fair sharing to GFR VCs. Computer simulation results show that proposed scheduling scheme provide a much better performance in TCP goodput and fairness than previous scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.9C
• /
• pp.853-860
• /
• 2002

In this paper, we proposed a new buffer management and cell scheduling scheme for GFR service in ATM networks. The proposed scheme is able to satisfy fairness criteria and efficient cell service in GFR. Performance analysis through the simulation presents that the proposed scheme can meet fairness 2(MCR plus equal share), which are not met by conventional scheduling mechanisms such as WRR. Also, the proposed scheme is superior to WRR about 29% in throughput and more efficency in fairness criteria.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.491-494
• /
• 2001

IP 망에서 Qos(Quality of Service)를 보장하기 위하여 요구되는 것이 수락 제어이다. 기존의 수락 제어 메커니즘은 크게 RSVP(Resource Reservation Protocol) 시그널링 방법과 MBAC(Measurement Based Admission Control)로 분류된다. 첫번째 방법의 경우 코어 망에서 각 플로우마다 상태를 유지해야 하는 확장성 문제때문에 적용이 쉽지 않고, 두 번째 방법의 경우 긴 경로를 가진 플로우의 경우 짧은 경로를 가진 플로우에 비해 블록킹 확률이 높아지는 문제점이 있다. 본 논문에서는 IP 코어 망에서 사용자의 QoS 요구사항과 서로 다른 경로상의 플로우간 블록킹 확률의 공평성을 위한 TPED MBAC(Two-Phase Edge-to-Edge Distributed Measurement Based Admission Control) 메커니즘을 제안한다. 이 MBAC 메커니즘은 수락 제어를 Quantitative Provisioning 단계와 Qualitative Provisioning 단계로 나누어 수행하며 프로빙 패킷 전송을 위해 홉 카운터에 기반 한 WRR(Weighted Round-Robin) 스케쥴링을 적용함으로써 각 플로우간의 블록킹 확률의 공평성을 제어할 수 있는 메커니즘이다.