• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.43-51
• /
• 2002

In this paper, we study the new packet dropping scheme using an active queue management algorithm. Active queue management mechanisms differ from the traditional drop tail mechanism in that in a drop tail queue packets are dropped when the buffer overflows, while in active queue management mechanisms, packets may be dropped early before congestion occurs, However, it still incurs high packet loss ratio when the buffer size is not large enough, By detecting congestion and notifying only a randomly selected fraction of connection, RED causes to the global synchronization and fairness problem. And also, it is the biggest problem that the network traffic characteristics need to be known in order to find the optimum average queue length, We propose a new efficient packet dropping method based on the active queue management for congestion control. The proposed scheme uses the per-flow rate and fair share rate estimates. To this end, we present the estimation algorithm to compute the flow arrival rate and the link fair rate, We shows the proposed method improves the network performance because the traffic generated can not cause rapid fluctuations in queue lengths which result in packet loss

• Journal of KIISE:Information Networking
• /
• v.37 no.3
• /
• pp.204-216
• /
• 2010

Since Sensor nodes around a fixed sink have huge concentrated network traffic, the battery consumption of them is increased extremely. Therefore the lifetime of sensor networks is limited because of huge battery consumption. To address this problem, a mobile sink has been studied for load distribution among sensor nodes. Since a mobile sink changes its location in sensor networks continuously, the mobile sink has time limits to communicate with each sensor node and unstable signal strength from each sensor node. Therefore, a fair and stable data collection method between a mobile sink and sensor nodes is necessary in this environment. When some sensor nodes are not able to send data to the mobile sink, a real-time application in sensor networks cannot be provided. In this paper, the new scheduling method, FQMS (Fair Queuing for Mobile Sink), is proposed for fair and stable data collection for mobile sinks in sensor networks. The FQMS guarantees balanced data collecting between sensor nodes for a mobile sink. In out experiments, the FQMS receives more packets from sensor nodes than legacy scheduling methods and provides fair data collection, because moving speed of a mobile sink, distance between a mobile sink and sensor nodes and the number of sensor nodes are considered.

• Korean Journal of Animal Reproduction
• /
• v.11 no.2
• /
• pp.122-126
• /
• 1987

This study was carried out to investigate the effects of the glycerol equilibration methods and embryo grades before freezing on the survival rate after thawing in mouse embryos. The results obtained from this study were as follows: 1. The number of embryos of grade I(Excellent), II(Good) and III(Fair) before freezing in this study was 97(27.4%), 160(45.2%) and 97(27.4%), respectively. 2. The average survival rate of frozen-thawed embryos in 3 and 5 steps glycerol equilibration was 66.7% and 64.1%, and the rate of transfererable embryos after culture was 68.9% and 69.0%, respectively. 3. Out of embryo grade I and II before freezing, the transferable rate after thawing was 75.2% and 48.1%, respectively, and grade I embryos before freezing was higher transferable rate than that of grade II.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.6 no.3
• /
• pp.71-86
• /
• 1996

In this paper we propose an explicit rate allocation algorithm for ATM(Asynchronous Transfer Mode) Networks using the available bit rate(ABR) class of service and study the performance of this algorithm. We examine the behavior of ABR traffic with the suggested algorithm, and demonstrate that the algorithm is fair and maintains network efficiency with low cell loss rate. The simulation results show substantial improvements in fairness and efficiency over the existing algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.249-256
• /
• 2007

GPS(generalized processor sharing) is a fair scheduling scheme that guarantees fair distribution of resources in an instantaneous manner, while virtual clock pursues fairness in the sense of long-term. In this paper, we notice that the degree of memorylessness is the key difference of the two schemes, and propose a unified scheduling model that covers the whole spectrum of history-sensitiveness. In this model, each application's resource right is represented in a value called deposit, which is accumulated at a predefined rate and is consumed for services. The unused deposit, representing non-usage history, gives the application more opportunity to be scheduled, hence relatively enhancing its response time. Decay of the deposit means partial erase of the history and, by adjusting the decaying rate, the degree of history-sensitiveness is controlled. In the spectrum, the memoryless end corresponds GPS and the other end with full history corresponds virtual clock. And there exists a tradeoff between average delay and long-term fairness. We examine the properties of the model by analysis and simulation.

• The Journal of Fisheries Business Administration
• /
• v.44 no.2
• /
• pp.1-17
• /
• 2013

We investigate the appropriateness of the fixed 12% discount rate to be used in estimating the amount of compensation for revoking a license for fishery business by the Enforcement Decree of Fisheries Act in Korea. We also suggest the appropriate discount rate fully reflecting the change of market interest rate in the Korean financial market. The capital asset pricing model, or, CAPM is the best known model of risk and return, and is widely used to estimate the expected rate of return for the risky projects. Even though the CAPM implies that the discount rate or the expected rate of return should change as the related market factors do, the discount rate used to estimate compensation for revoking a license for fishery business remains to be the same 12% rate for the last 15 years by law. During this period, however, the yield to maturity for the 5-year government bonds in Korea has dramatically changed from about 12% to less than 3%. In order to provide the fair compensation for the damages against the coastal fisheries and evaluate the intrinsic value of fishery resources in the coastal areas, we suggest that the appropriate discount rate should be determined by the yield to maturity of the government bonds with 5-year maturity, instead of the current fixed 12% interest rate.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.17-20
• /
• 2000

TCP is ill-suited to real-time multimedia applications. Its bursty transmission, and abrupt and frequent wide rate fluctuations cause high delay jitters and sudden quality degradation of multimedia applications. Deploying non congestion controlled traffic results in extreme unfairness towards competing TCP traffic. Therefore, they need to be enhanced with congestion control schemes that not only am at reducing loss ratios and improve bandwidth utilization but also are fair towards competing TCP connections. This paper proposes a differentiated rate adaptation algorithm based on loss and round trip time. Rate in a sender quickly responds to loss ratio and holds steady state. Additionally, this algorithm reduces loss ratio by loss prediction in a receiver.

• Journal of Distribution Science
• /
• v.3 no.1
• /
• pp.23-42
• /
• 2005

The service offer expectation and the desire of customers to a large-sized rate influence store also increase as a result of such environmental change. the counter where research of a book was upgraded from differentiation pursuit by competition between business condition in business condition in the case of the domestic rate influence store which has put the focus on service strengthening The work shrine which cannot reach here the competition predominance in the domestic market it will be hard coming to secure, when environmental change of inside large-sized rate influence store industry is taken into consideration The research which tried to receive customer service failure recovery carried out actual proof analysis in the influence to which fair nature lateness of a customer attains to the re-purchase intention to this store of customer satisfaction and future by service recovery process for an object in the customer who held service failure recovery experience in the domestic large-sized rate influence store.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.255-258
• /
• 2003

TCP is taking over 95％ among the Internet traffics. Recently the demands of multimedia services in the Internet has been increasing. These multimedia services mostly need real-time deliverly, and then RTP has been a de facto to transmission protocol for these real-time multimedia services. RTP uses UDP as its underlying transport protocol, and thus it does not support any rate and congestion control. Thus, for fair use of the Internet bandwidth with TCP traffics. RTP also needs a rate control. One constraint of RTP is that the feedback information(delivered by, RTP's twin protocol, RTCP) is recommended to be sent no less than 5 seconds. In this paper, we propose a TCP-friendly RTP rate control which use only RTCP feedback information at every 5 seconds. The experiment results show that our proposed algorithm works. But, it is found that we need more time to test the effects of parameters and policies of the algorithms, which will be reported later.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.132-138
• /
• 2012

VANET(Vehicular Ad-hoc Network), standardization of IEEE 802.11p specification is in process. 802.11 MAC protocol grants all nodes equal opportunity to acquire channel without regard to their bit-rates, making it possible for lower bit-rate nodes to occupy communication channel for a fair amount of time thus keeping the higher bit-rate nodes from acquiring connection channel which downward-equalize the overall network performance. Also with the 802.11p MAC protocol, the probability of collision occurring increases as the number of nodes grow. The proposed algorithm is a new MAC protocol that guarantees nodes with acquired channel a firm priority over other nodes for a fixed amount of time with TXOP concept added to 'packet burst' according to the current transmitting speed. This newly designed algorithm allows the construction of wireless network with enhanced network throughput, decreased probability of collisions as well as providing the means to grant each node a fair chance of acquiring connection according to their channel conditions. The algorithm sets the CW's (Contention Window) width wider than the standard's and modulates the continuous transmitting threshold value depending on channel acquired time, thus improving the overall performance of the network.