• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.6
• /
• pp.779-792
• /
• 1997

Flow characteristics are numerically investigated when a packet of waves consisting of a Tollmien-Schlichting wave and a pair of Squire waves evolves in a flat-plate laminar boundary layer using a large eddy simulation with a dynamic subgrid-scale model. Characteristics of early stage transitional boundary layer flow such as the .LAMBDA. vortex, variation of the skin friction and backscatter are predicted. Smagorinsky constants and the eddy viscosity obtained from the dynamic subgrid-scale model significantly change as the flow evolves. Far Field noise radiated from the transitional boundary layer shows the dipole and quadrupole characteristics owing to the wall shear stress and the Reynolds stresses, respectively.

• Journal of Navigation and Port Research
• /
• v.28 no.4
• /
• pp.299-303
• /
• 2004

In the Internet, to guarantee transmission rate and delay and to achieve fair bandwidth allocation, many per-flow scheduling algorithms, such as fair queueing, which have many desirable properties for congestion control, have been proposed and designed. However, algorithms based on per-flow need maintain rate state, buffer management and packet scheduling, so that it cost great deal ： implement. Therefore, in this paper, to implement routers cost-effectively, we propose CS-FNE algorithm based on FNE in Core-Stateless network We evaluate CS-FNE comparing with four additional algorithms i.e., CSFQ, FRED, RED and DRR, in several different, configurations and traffic sources. Through simulation results, we show that CS-FNE algorithm can allocate fair bandwidth approximately and is simpler and easier to implement than other per-flow basis queueing mechanisms.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.42-46
• /
• 2006

As the next generation internet (NGI) is supporting High-speed in Gbps rate with the appearance of advanced network technologies, various applications that require high data rates. have been experimented and operated. By using high speed application services, many kinds of problems can be generated but we cannot easily grasp their reasons. However, if the user monitors the end-to-end one's flow data information (path and data rate in each router, state of each router) he can find them more accurately Until now, we have found out the fact that systems which can network-widely monitor end-to-end flow have not be developed yet, only simple systems which can monitor user's individual flow data at just one node are developed In this study, we suggest and materialize a system which can analyze bandwidth in real time by searching routing paths and measuring packet transfer rate between end-to-end flow data and supported flow traffic of using IPv6.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.793-805
• /
• 2001

In the recent priority system, high-priority packet will be served first and low-priority packet will be served when there isn\`t any high-priority packet in the system. By the way, even high-priority packet can be blocked by HOL (Head of Line) contention in the input queueing System. Therefore, the whole switching performance can be improved by serving low-priority packet even though high-priority packet is blocked. In this paper, we study the performance of preemptive priority in an input queueing switch for high speed switch system. The analysis of this switching system is taken into account of the influence of priority scheduling and the window scheme for head-of-line contention. We derive queue length distribution, delay and maximum throughput for the switching system based on these control schemes. Because of the service dependencies between inputs, an exact analysis of this switching system is intractable. Consequently, we provide an approximate analysis based on some independence assumption and the flow conservation rule. We use an equivalent queueing system to estimate the service capability seen by each input. In case of the preemptive priority policy without considering a window scheme, we extend the approximation technique used by Chen and Guerin [1] to obtain more accurate results. Moreover, we also propose newly a window scheme that is appropriate for the preemptive priority switching system in view of implementation and operation. It can improve the total system throughput and delay performance of low priority packets. We also analyze this window scheme using an equivalent queueing system and compare the performance results with that without the window scheme. Numerical results are compared with simulations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.531-534
• /
• 2014

DLNA is an established industry standard which supports contents sharing among smart devices in home wired- and wireless-network environment and is well known in Korea as Allshare or Smartshare. The DLNA standard is implemented as built-in services in most of Android smart phones and tablets. In addition to the handheld devices, DLNA service can also be employed in speakers, printers, and so on. However, users have reported many interoperability issues between DLNA devices. Developers typically identify causes by analyzing the packet exchange information between devices. However, this approach costs them to put additional effort to filter relevant packets, to reconstruct packet exchange history and the protocol flow. Consequently, it ends up with increased development time. In this paper, we demonstrate a technique to automatically analyze and visualize the packet exchange history. We modified a router firmware to capture and store packets exchanged between DLNA devices, and then analyze and visualize the stored packet exchange history for developers. We believe that visualized packet exchange history can help developers to test the interoperability between DLNA devices with less effort, and ultimately to improve the productivity of developers.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.1
• /
• pp.74-81
• /
• 2001

In this paper. the architecture of a high-speed ATM router using ATM switch is studied and the performance of the high-speed ATM router is analyzed through simulation. The high-speed ATM router using ATM switch is able to reduce the load of router and the processing time of a packet in the router. The size of router buffers has been studied through simulation processes for the analysis of performance capacity in due course of making changes in routing time(RT), which is the performance capacity parameters of high-speed ATM routers, flow table size(FS), flow live time(FT) and input circuit efficiencies. The result of this study can be used as the source material for analyzing the suitability of equipment in upgrading networks and applying high-speed ATM routers by using ATM switches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.68-82
• /
• 2011

Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.

• Journal of KIISE:Information Networking
• /
• v.35 no.2
• /
• pp.99-111
• /
• 2008

In recent years, the needs for WLANs(Wireless Local Area Networks) technology which can access to Internet anywhere have been dramatically increased particularly in SOHO(Small Office Home Office) and Hot Spot. However, unlike wired networks, there are some unique characteristics of wireless networks. These characteristics include the burst packet losses due to unreliable wireless channel. Note that burst packet losses, which occur when the distance between the wireless station and the AP(Access Point) increase or when obstacles move temporarily between the station and AP, are very frequent in 802.11 networks. Conversely, due to burst packet losses, the performance of 802.11 networks are not always as sufficient as the current application require, particularly when they use TCP at the transport layer. The high packet loss rate over wireless links can trigger unnecessary execution of TCP congestion control algorithm, resulting in performance degradation. In order to overcome the limitations of WLANs environment, MAC-layer LDA(Loss Differentiation Algorithm)has been proposed. MAC-layer LDA prevents TCP's timeout by increasing CRD(Consecutive Retry Duration) higher than burst packet loss duration. However, in the wireless channel with high packet loss rate, MAC-layer LDA does not work well because of two reason: (a) If the CRD is lower than burst packet loss duration due to the limited increase of retry limit, end-to-end performance is degraded. (b) energy of mobile device and bandwidth utilization in the wireless link are wasted unnecessarily by Reducing the drainage speed of the network buffer due to the increase of CRD. In this paper, we propose a new retransmission module based on Cross-layer approach, called BLD(Burst Loss Detection) module, to solve the limitation of previous link layer retransmission schemes. BLD module's algorithm is retransmission mechanism at IEEE 802.11 networks and performs retransmission based on the interaction between retransmission mechanisms of the MAC layer and TCP. From the simulation by using ns-2(Network Simulator), we could see more improved TCP throughput and energy efficiency with the proposed scheme than previous mechanisms.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.962-964
• /
• 1987

In this paper a virtual route pacing control mechanism is introduced to the flow control of M-hop virtual route in the packet data network. The results described in this paper show us a comparison of the relationship between the throughput and the time-delay with the variation of the parameter, the normalized applied load. for the fixed window size.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.347-350
• /
• 2002

In the input buffer switch system, VOQ(Virtual Output Queue) archives 100% throughput. The VOQ with the systolic architecture maintains an uniform performance regardless of a number of Packet class and output port, so that it doesn't have a limitation of scalability. In spite of these advantages, the systolic architecture VOQ is difficult to change sorting order In this paper, we Proposed a systolic architecture VOQ which support weighted round robin(WRR) algorithm to provide with flow control service.