• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.466-474
• /
• 2003

In this paper, we develope the simulation model for Ethernet passive optical networks (Ethernet-PON) by using OPNET. Ethernet-PON is an emerging access network technology that provides a low-cost method of deploying optical access lines. The simulator uses a Request/Grant TDMA MAC protocol based on IEEE 802.3ah EFM. It also executes registration, ranging and dynamic bandwidth allocation algorithm by exchanging control packets between OLT and ONUs. We have evaluated for success ratio of initial registration process and delay of late registration process. We also have simulated for dynamic TDMA protocol and static TDMA protocol in terms of channel utilization and queueing delay. We expect that this simulator can help to determine various parameters which are considered for designing Ethernet-PON system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.42-52
• /
• 2017

DASH (Dynamic Adaptive Streaming over HTTP) is an adaptive streaming technique that enables transmission of multimedia content when clients request the multimedia contents to server. In this system, to ensure the best quality of the content to satisfy users, it is necessary to precisely measure the residual bandwidth. However, the measured residual bandwidth by the DASH, which is not considering the transmission features of TCP, varies by the size of previous media segment, which makes it hard to ensure QoE to users. In this paper, we excluded the TCP Slow start range from measurement of residual bandwidth and suggested the new DASH bandwidth measuring method to decrease the error. Then, we realized the method in DASH system based on open source, and compared the existing measuring method. The new method showed that the accuracy of result has increased by 20%. Also, it could improve the QoE of users in terms of service quality and number of changes of segment quality.

• ETRI Journal
• /
• v.39 no.3
• /
• pp.428-436
• /
• 2017

State-of-the-art processors require increasingly complicated memory services for high performance and low power consumption. In particular, they request transfers within a burst in a wrap-around order to minimize the miss penalty of a cache. However, synchronous dynamic random access memories (SDRAMs) do not always generate transfers in the wrap-round order required by the processors. Thus, a memory subsystem rearranges the SDRAM transfers in the wrap-around order, but the rearrangement process may increase memory latency and waste the bandwidth of on-chip interconnects. In this paper, we present a memory subsystem that is effective for the wrapping bursts of a cache. The proposed memory subsystem makes SDRAMs generate transfers in an intermediate order, where the transfers are rearranged in the wrap-around order with minimal penalties. Then, the transfers are delivered with priority, depending on the program locality in space. Experimental results showed that the proposed memory subsystem minimizes the memory performance loss resulting from wrapping bursts and, thus, improves program execution time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.103-110
• /
• 2009

We are witnessing rapid increase of the number of wireless devices available today such as cell phones, PDAs, Wibro enabled devices. Because of the inherent limitation of the bandwidth available for wireless channels, broadcast systems have attracted the attention of the research community. The main problem in this area is to develop an efficient broadcast program. In this paper, we propose a dynamic broadcast method that overcomes the limitations of static broadcast programs. It optimizes the scheduling based on the probabilistic model of user requests. We show that dynamic broadcast system can indeed improve the quality of service using user requests. This paper extends our previous work in [1] to include more thorough explanation of the proposed methodology and diverse performance evaluation models.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.266-274
• /
• 2003

One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.529-546
• /
• 2002

A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1238-1244
• /
• 2001

Earlier efforts on optical access concentrated on the design of PONs for the collection and distribution portion of the access network. In these networks the optical hardware in the RN is very simple, but a multiple access protocol is needed for upstream traffic control. On the other hand, the role of communications is already well established in the office environment. With the advent of cheap, affordable broadband communications and the increasing complexity of consumer electronics, it seems natural to extend the network into the home. As the application of Home Area Network is ever increasing, we therefore consider connectivity between access network and home network which generates various traffic to design MAC protocol over residential network. Global-FIFO is quite simple and allows dynamic upstream bandwidth assignment on the basis of a request-and-permit mechanism. It has good bandwidth efficiency and being cell-based, it does not consider the various traffic from home network. In this paper, we design and analyze the new MAC resource assignment algorithm called MQ-FIFO (Multiple Queue-FIFO) that provides good performance under the environment of ATM-PON and Home Network.

• Journal of Korea Multimedia Society
• /
• v.8 no.10
• /
• pp.1383-1390
• /
• 2005

Mobile Multimedia Storage Server should provide to store and transfer a data that the number of concurrent datum by Personal Digital Assistant(PDA) requests in real time. simultaneously. But, While the large number of a PDA request connect to MTS (Mobile Translation Storage) server with BottleNeck problem in mobile internet environment by many constraints such as limited bandwidth can be introduced. This paper introduces an optimal method of new DVDS (Dynamic Variable Disk Scheduling) for MTS server which is based on the Weight Value to solve the BottleNeck problems that occur when transfer and store capture images through mounted digital camera on the PDA in real time simultaneously. The comparison with previous research shows that the proposed scheme provides better.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.