• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.1
• /
• pp.85-95
• /
• 2015

Network-on-chip (NoC) has evolved to overcome the issues of traditional bus-based on-chip interconnect. In NoC-reuse as TAM, the test schedulers are constrained with the topological position of cores and test access points, which may negatively affect the test time. This paper presents a scalable hybrid test data transportation scheme that allows to simultaneously test multiple heterogeneous cores of NoC-based SoCs, while reusing NoC as TAM. In the proposed test scheme, single test stimuli set of multiple CUTs is embedded into each flit of the test stimuli packets and those packets are multicast to the targeted CUTs. However, the test response packets of each CUT are unicast towards the tester. To reduce network load, a flit is filled with maximum possible test response sets before unicasting towards the tester. With the aid of Verilog and analytical simulations, the proposed scheme is proved effective and the results are compared with some recent techniques.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.19-23
• /
• 2008

The AQM (Active Queue Management) starts dropping packets earlier to notify traffic sources about the incipient stage of congestion. The AQM improves fairness between response flow (like TCP) and non-response flow (like UDP), and it can provide high throughput and link efficiency. In this paper, we suggest the QVARED (Queue Variation Adaptive RED) algorithm to respond to bursty traffic more actively. It is possible to provide more smoothness of average queue length and the maximum packet drop probability compared to RED and ARED (Adaptive RED). Therefore, it is highly adaptable to new congestion condition. Our simulation results show that the drop rate of QVARED is decreased by 80% and 40% compare to those of RED and ARED, respectively. This results in shorter end-to-end delay by decreasing the number of retransmitted packets. Also, the QVARED reduces a bias effect over 18% than that of drop-tail method; therefore packets are transmitted stably in the bursty traffic condition.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.729-738
• /
• 1995

We consider a priority-based packet-switching system with three phases of the packet transmission time. Each packet belongs to one of several priority classes, and the packets of each class arrive at a switch in a Poison process. The switch transmits queued packets on a priority basis with three phases of preemption mechanism. Namely, the transmission time of each packet consists of a preemptive-repeat part for the header, a preemptive-resume part for the information field, and a nonpreemptive part for the trailer. By an exact analysis of the associated queueing model, we obtain the Laplace-Stieltjes transform of the distribution function for the delay, i.e., the time from arrival to transmission completion, of a packet for each class. We derive a set of equations that calculates the mean response time for each class recursively. Based on this result, we plot the numerical values of the mean response times for several parameter settings. The probability generating function and the mean for the number of packets of each class present in the system at an arbitrary time are also given.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.3
• /
• pp.437-444
• /
• 2013

The object of study is to verify the distributions of response packets of 3 portal sites such as Naver, Daum, Nate. The period of experiments is from May 19th 2010 to November 7th 2012 and the number of experiments is 4,642. The distributions of Naver, Nate are biomodals. The distribution of Daum has long right tails. 3 distributions are different under 1% significance level using chi-square test and two sample Kolmogorov-Smirnov test. From proportions and percentiles, Naver has a distribution with the largest values. Nate is the second place, and Daum has a distribution with the smallest values. We must make portal pages light to increase response speed including other technologies. We expect our results to activate competition among portal sites.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.27-40
• /
• 2015

Inferring firewall policy is to discover firewall policy by analyzing response packets as results of active probing without any prior information. However, a brute-force approach for generating probing packets is unavailable because the probing packets may be regarded as attack traffic and blocked by attack detection threshold of a firewall. In this paper, we propose a firewall policy inference method using an efficient probing algorithm which considers the number of source IP addresses, maximum probing packets per second and interval size of adjacent sweep lines as inference parameters to avoid detection. We then verify whether the generated probing packets are classified as network attack patterns by a firewall, and present the result of evaluation of the correctness by comparing original firewall policy with inferred firewall policy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.758-766
• /
• 1992

In this paper, the traffic control scheme used by M-cancel-Get services In CMIS /CMIP, OSI network management protocol, is presented and the performance is analyzed. M -Get service which allows a multiple response functional unit is a service that searches an attribute of the managed sys-tem and the service requires a large quantity of response as its typical characteristics. At the time, management response is transmitted Irrelevant to the network condition In the managed as well as In the management system. The management system requests M Canrel-Get service which informs the canrelation of M -Get service (or Information retrieval. In case of using M-Cancel-Get service for traffic control, the point of time for traffic control is propose by the result of simulation on management response time as the number of multiple response packets is Increased. The result is analyzed by processing ratio of the network workload and the average delay time of packets. As a result, the traffic control parameters proposed in the study show superiority in its processing ratio and the average packet delay time. Especially, its performance improves as the size of background traffic density Increase.

• Journal of Korean Society for Quality Management
• /
• v.42 no.1
• /
• pp.33-41
• /
• 2014

Purpose: The purpose of this paper is estimate response quality of three major portal in Korea based on the response time. In addition to response time, the response time by 1Kbyte will be analysed. Methods: Data was collected from July 2010 to November 2013 using Firebug. For comparing averages, ANOVA will be used. For comparing distributions, Chisquare test and Kolmogov-Smirnov test will be used for parametric and non parametric test respectively. Results: For response quality based on response time, Daum gets the first place, Naver the second place, and Nate the third place. But the order of the response time per 1Kbyte is different. The order is Naver, Daum and Nate. Conclusion: The response quality may be estimated using various factors. Response time is the most important factor. Daum provides the shortest response time. We could say Daum provides the best response quality. But Naver provides the shortest response time per 1Kbyte. From these results, we know reducing packets is very important thing in response time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.859-867
• /
• 2004

To provide high-quality media streaming service over the best-effort Internet, a streaming methodology is required to response to the dynamic fluctuation of underlying networks. In this paper, we implement the MPEG-4 streaming system with adaptive transport based on priorities of media packets. The implemented system is composed of the common MPEG-4 streaming components such as elementary stream provider, sync and DMIF layer, and adaptive transport module including data prioritization and FEC control. More specifically, the prioritized sync layer packets (based on object level) are delivered to the transport module and then are encoded by an adaptive FEC encoder to help reliable transport. The FEC combination is dynamically adjusted by the feedback information from the receiver. In addition, low priority packets are selectively dropped to meet the limitation of available bandwidth. The experimental results over the emulation-based testbed show that the Proposed system can mitigate the impact of network fluctuation and thus improve the quality of streaming.

• The Journal of the Acoustical Society of Korea
• /
• v.34 no.4
• /
• pp.295-302
• /
• 2015

Acoustic channels are characterized by long multipath spreads that cause inter-symbol interference. The way in which this fact influences the design of the receiver structure is considered. To satisfy performance and throughput, we presented consecutive iterative BCJR (Bahl, Cocke, Jelinek, Raviv) equalization to improve the performance and throughput. To achieve low error performance, we resort to powerful BCJR equalization algorithms that iteratively update probabilistic information between inner decoder and outer decoder. Also, to achieve high throughput, we divide long packet into consecutive small packets, and the estimate channel information of previous packets are compensated to next packets. Based on experimental channel response, we confirmed that the performance is improved for long length packet size.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.6 no.4
• /
• pp.216-223
• /
• 2013

As the fast growth of using Internet, the requests of clients having different types and pressing loads on the server have been increased in World Wide Web. Thus the interesting issue is how to measure the real capacity of a Web Server. There have been much recent studies about measuring the capacity of web server. But the cause of Server response time delay is not just server itself but also network packet loss. To measure the practical capacity of web server, we generate scalable clients using Posix Thread, transport packets which were generated by scalable clients to the server using UDP and receive the packets which were the remain packet from network packet loss using TCP. In this paper, we propose a method to measure the practical capacity of a web server using the Scalable Clients based on Posix Thread and the transport on Application level.