• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.140-148
• /
• 2008

Using the self duality of an optimal normal basis(ONB) of type II, we present a bit parallel and bit serial systolic arrays over GF($2^m$) which has a low hardware complexity and a low latency. We show that our multiplier has a latency m+1 and the basic cell of our circuit design needs 5 latches(flip-flops). Comparing with other arrays of the same kinds, we find that our array has significantly reduced latency and hardware complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6B
• /
• pp.405-413
• /
• 2012

WFQ(Weighted Fair Queuing) is the most popular fair queuing algorithm to guarantee the Quality-of-Service(QoS), but it has the inherent drawback of a poor resource utilization, particularly under the low rate traffic requiring a tight delay bound. It was recently identified that the poor utilization is mainly due to non-optimized latency of a traffic flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced. The LOFQ algorithm, however, renews their optimal latencies for all flows whenever a new flow arrives, which results in the high implementation complexity of O($N^2$).This paper is to reduce thecomplexity to O(1). The proposed method is first to derive the optimal latency index function from the statistical QoS characteristics of the offered load, and then to simply calculate the optimal latency index of the arriving flow using the function.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.39-47
• /
• 2021

Lempel-Ziv coding is one of the most famous source coding schemes. The output of this source coding is usually a non-uniform code, which requires additional source coding, such as arithmetic coding, to reduce a redundancy. However, this additional source code increases complexity and decoding latency. Thus, this paper proposes the optimal maximum a-posteriori (MAP) receiver for non-uniform source non-orthogonal multiple access (NOMA) with symmetric superposition coding (SSC). First, we derive an analytical expression of the bit-error rate (BER) for non-uniform source NOMA with SSC. Then, Monte Carlo simulations demonstrate that the BER of the optimal MAP receiver for the non-uniform source improves slightly, compared to that of the conventional receiver for the uniform source. Moreover, we also show that the BER of an approximate analytical expression is in a good agreement with the BER of Monte Carlo simulation. As a result, the proposed optimal MAP receiver for non-uniform source could be a promising scheme for NOMA with SSC, to reduce complexity and decoding latency due to additional source coding.

• Journal of Korea Multimedia Society
• /
• v.10 no.1
• /
• pp.83-93
• /
• 2007

WFQ (Weighted Fair Queuing) is the most popular fair queuing algorithm, but it had the inherent drawback of a poet bandwidth utilization, particularly under the traffic requiring a low rate but tight delay bound such as internet phone. It was recently identified that the poor utilization is mainly due to the non-optimized latency of a flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced. In this paper, we improve the performance of LOFQ by introducing an occupied resource optimization function and reduce the implementation complexity of recursive resource transformation by revising the transformation scheme. We also prove the superiority of LOFQ over WFQ in terms of utilization. The simulation result shows that the improved LOFQ provides $20{\sim}30%$ higher utilization than that in the legacy LOFQ.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.155-162
• /
• 2007

WFQ (Weighted Fair Queuing) is the most popular fair queuing algorithm, but it had the inherent drawback of a poor bandwidth utilization, particularly under the traffic requiring a low rate but tight delay bound such as internet phone, It was recently identified that the poor utilization is mainly due to non optimized latency of a flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced, LOFQ was also improved through introducing an occupied resource optimization function and the implementation complexity of recursive resource transformation was reduced with revising the transformation scheme. However, the performance of LOFQ has been evaluated by means of simulation, so that there are some difficulties in evaluating the performance in the terms of the accuracy and evaluation time, In this paper, we develop how to analytically compute the bandwidth utilization in LOFQ.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.123-126
• /
• 1998

Generally, in a VOD(video on Demand) system, batching technique is oten used to improve throughput. Since subscribers to VOD servives tend to withdraw their requests as the latency becomes large, an optimal scheduling scheme should consider not only batching size but also withdrawal rae, service latency and fairness between different programs. In this paper, we propose a new scheduling scheme, which shows improvement in fairness and reduction in withdrawal rate and service latency compared with other well known schemes. When there are 2 or more streams are available in the VOD server, proposed scheme apply different program selection policies to each streams. Using this approach effectiveness of stream usage can be improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1032-1039
• /
• 2015

Service function chaining(SFC) defines the creation of network services that consist of an ordered set of service function. A multiple service function instances should be deployed across networks for scalable and fault-tolerant SFC services. Therefore, an incoming flows should be distributed to multiple service function instances appropriately. In this paper, we formulate the flow distribution problem in SFC aiming at minimizing the end-to-end flow latency under resource constraints. Then, we evaluate its optimal solution in a realistic network topology generated by the GT-ITM topology generator. Simulation results reveal that the optimal solution can reduce the total flow latency significantly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4889-4902
• /
• 2018

It is a challenging issue to improve the energy efficiency of neighbor discovery in WSNs. This paper proposes an optimal discovery model (ODM) for the first time. Based on the model, we investigate the influence of the relative size of two unequal active slots on the energy efficiency. ODM provides the energy optimal value of the length of the larger active slot at a given duty cycle. Other than existing methods, the worst-case latency bound of ODM is only one period. This is a subversive conclusion, because almost all other related methods are based on a wake-up schedule that contains several periods. We theoretically deduce that ODM can reduce worst-case discovery latency by 43.89% compared to Searchlight-Trim when their duty cycles are the same. The simulations verify the advantage of ODM.

• Maxillofacial Plastic and Reconstructive Surgery
• /
• v.23 no.4
• /
• pp.324-331
• /
• 2001

The present study was aimed to investigate the effects of latency period on alveolar ridge distraction using the intraoral distraction device. Nine adult mongrel dogs of either sex, weighing about 15kg, were used. They were divided into 3-day, 5-day, and 7-day groups according to the latency period. The left upper and lower premolars and first molars were extracted. Twelve weeks after the extraction, an osteotomy was performed and the distraction device was applied. After the latency period, the distraction was applied at a rate of 1.2mm for 8 days. The distraction device was left in place for 2 weeks to allow consolidation and was then removed. The animals were sacrified at 8 weeks after completion of distraction and were examined macroscopically, radiographically, and histologically. After completion of the distraction, the alveolar crest protruded prominently, showing the vertical augmentation of the alveolar bone. Soft tissues were broken down after the 6th day of distraction in 3-day latency group, and premature union occurred on the 7th day of distraction in the 7-day latency group. The average distance was $9.40{\pm}0.3mm$ in 3-day latency group, $9.35{\pm}0.1mm$ in 5-day latency group, and $8.85{\pm}0.1mm$ in 7-day latency group. In the radiograph taken at 8 weeks after distraction, there was slight bone resorption around the medial and distal edges of the alveolar bone segment, and a new bone deposition was observed in the neighboring alveolar crest area in all groups. Fibrous tissues were present in a part of the buccal cortical bone area of the distraction gap, and the woven and lamellar bones were observed in the distracted gap. There were bony bridges in the distraction gap in all animals examined. These results suggest that optimal time of latency period on alveolar ridge distraction using the intraoral distraction device is about 5 days in dogs, and about 7days in human beings.