• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1346-1367
• /
• 2011

As the size of camera modules is decreasing and as the computing performance of portable devices is improving, taking photos has become a part of daily life. However, existing photo management programs and products that manage such photos still require extensive user effort to facilitate the sharing and browsing of images. It is especially difficult for novice users to manage and share photos. In this paper, we develop a round-robin concept-driven user preference feedback mechanism for achieving direct photo sharing, instant display, and easy management using optimized user controls and user preference-driven classification. Compared with commercial photo management systems, our proposed solution provides new features: optimized user controls, direct sharing and instant display, and user preference feedback driven classification. These new features boost the round-robin concept-driven user preference feedback. This paper proposes a photo finder that automatically searches for photos in storage spaces or cameras. The proposed photo finder relies on user preference feedback to share photos by leveraging user preferences, and the round-robin connection transmits photos to the family's digital photo frame or web album by arbiter. The proposed method saves time and spares users the effort required for photo management. Moreover, this method does not merely direct photo sharing and simple photo management, but it also increases the satisfaction level of users viewing the photos.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.04a
• /
• pp.43-48
• /
• 2004

RTP that is proposed supplement of real-time services on internet environment, as Real-time Transport Protocol, is the protocol that for the purpose of sending data of stream type. RTP and RTCP(Real-time Transport Control Protocol) basically work at the same time, RTCP serves with state information of network at present. RTP has important properties of a transport protocol that runs on end-to-end systems and provides demultiplexing. It also offer reliability and protocol-defined flow／congestion control that transport protocol like TCP can not provides. In this paper, we look around concept and construction of Differentiated sen1ice tint run on RTP and by setting parameters of packet transfer method be used CBQ(Class-Based Queuing) for packet transfer on Differentiated service, each service queue controls properly through packet scheduling method, such as WRR(Weighted Round Robin) and PRR(Packet-by-packet Round Robin) all service classes do not experience the starvation and confirm the performance through computer simulation to achieve fairly scheduling.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.486-495
• /
• 2002

In this paper, we propose a delay reduction method for frame-based packet transmit scheduling algorithm. A high-speed network such as ATM network has to provide some performance guarantees such as bandwidth and delay bound. Framing strategy naturally guarantees bandwidth and enables simple rate-control while having the inherently bad delay characteristics. The proposed delay reduction method uses the same hierarchical frame structure as HRR (Hierarchical Round-Robin) but does not use the static priority scheme such as round-robin. Instead, we use a dynamic priority change scheme so that the delay unfairness between wide bandwidth connection and narrow bandwidth connection can be eliminated. That is, we use FIFO (First-In First-Out) concept to effectively reduce the occurrence of worst-case delay and to enhance delay distribution. We compare the performance for the proposed algorithm with that of HRR. The analytic and simulation results show that HFIFO inherits almost all merits of HRR with fairly better delay characteristics.

• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.827-834
• /
• 2006

In distributed virtual environment, system response time to users' interactions is an importance factor to determine the degree of contentment with the system. Generally, response time is affected by the efficiency of event message processing algorithm, and most of previous systems use FCFS algorithm, which processes message traffic sequentially based only on the event occurrence time. Since this method totally depends on the order of occurrence without considering the priorities of events, it has a problem that might drop the degree of system response time by causing to delay processing message traffic when a bottleneck phenomenon happens in the server side. To overcome this limitation of FCFS algorithm, this paper proposes a concurrent event scheduling algorithm, which is able to process event messages concurrently by assigning the priorities to the events. It is also able to satisfy the two goals of system together, consistency and responsiveness through the combination of occurrence time with priority concept of events.