• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.221-230
• /
• 2015

Rateless codes have been shown to be able to provide greater flexibility and efficiency than fixed-rate codes for multicast applications. In the following, we optimize rateless codes for unequal error protection (UEP) for multimedia multicasting to a set of heterogeneous users. The proposed designs have the objectives of providing either guaranteed or best-effort quality of service (QoS). A randomly interleaved rateless encoder is proposed whereby users only need to decode symbols up to their own QoS level. The proposed coder is optimized based on measured transmission properties of standardized raptor codes over wireless channels. It is shown that a guaranteed QoS problem formulation can be transformed into a convex optimization problem, yielding a globally optimal solution. Numerical results demonstrate that the proposed optimized random interleaved UEP rateless coder's performance compares favorably with that of other recently proposed UEP rateless codes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1260-1281
• /
• 2015

As the number of services available on the Web increases, it is vital to be able to identify which services can be trusted. Since there can be an extremely large number of potential services that offer similar functionality, it is challenging to select the right ones. Service requestors have to decide which services closelysatisfy their needs, and theymust worry about the reliability of the service provider. Although an individual service can be trusted, a composed service is not guaranteed to be trustworthy. In this paper, we present a trust model that supports service discovery and composition based on trustworthiness. We define a method to evaluate trust in order to discover trustworthy services. We also provide a method to perform trust estimation for dynamic service composition, and we present results of two experiments. The proposed model allows for service requestors to obtain the most trustworthy services possible. Our mechanism uses direct and indirect user experience to discover the trustworthiness of the services and service providers. Moreover, composing services based on quantitative trust measurements will allow for consumers to acquire a highly reliable service that meet their quality and functional requirements.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.1-10
• /
• 2012

Mobility and quality of service (QoS) are becoming the more important issues in wireless communications. The traditional Internet service is expanding into new access media and applications. Since wireless communication services are accompanied by frequent handovers at remote sites, scalable and fast handover has become a prerequisite for ubiquitous communication. In this paper, the differentiated service (Diffserv) model is deployed in heterogeneous proxy mobile IPv6 (PMIPv6) networks to satisfy the QoS guaranteed service and fast handover requirements. The operational procedures for QoS guaranteed global roaming are presented. In addition, QoS management and handover cost evaluation schemes based on a mobile host's movement scope are proposed. This paper analyzes the reduction in handover delay in a network-based localized mobility management framework. We propose and analyze a PMIPv6 optimized with a global mobile access gateway (G-MAG), which is a network-based entity, to further improve the handover performance in terms of handover delay while maintaining minimal signaling overhead in the air interface among converged heterogeneous wireless networks. The handover signaling procedures with host-based MIPv6 are compared with network-based proxy MIPv6 (PMIPv6) and fast PMIPv6 assisted by G-MAG to show how much handover delay reduction can be achieved. Analytical results show that the handover delay is significantly reduced.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.889-896
• /
• 2006

ATM Forum has defined a guaranteed frame rate (GFR) service to serve Internet traffic efficiently. The GFR service provides virtual connections (VCs) for minimum cell rate (MCR) guarantees and allows them to fairly share the residual bandwidth. And ATM Forum has recommended a frame-based generic cell rate algorithm (F-GCRA) as a frame classifier, which determines whether an Am cell is eligible to use the guaranteed bandwidth in a frame level. An ATM switch accommodates cells in its buffer or drops them in a frame level according to current buffer occupancy. A FIFO shared buffer has so simple structure as to be feasibly implemented in switches, but has not been able to provide an MCR guarantee for each VC without buffer management based on per-VC accounting. In this paper, we enhance the F-GCRA frame classifier to guarantee an MCR of each VC without buffer management based on per-VC accounting. The enhanced frame classifier considers burstness of TCP traffic caused by congestion control algorithm so as to enable each VC to use its reserved bandwidth sufficiently. In addition, it is able to alleviate the unfairness problem in usage of the residual bandwidth. Simulation results show that the enhanced frame classifier satisfies quality of services (QoSs) of the GFR service for the TCP traffic.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.535-544
• /
• 2003

Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.

• Journal of Computing Science and Engineering
• /
• v.6 no.2
• /
• pp.89-104
• /
• 2012

In dynamic Web service environments, the performance of the Internet is unpredictable; the reliability and effectiveness of remote Web services are also unclear. Therefore, it can hardly be guaranteed that the quality of Web service (QoWS) attributes of Web services do not fluctuate with the dynamic Web service environments. When a composite service is planned in the context of dynamic service environments, there is another aspect which has not been taken into account by existing works, namely, concurrency - the fact that multiple requests to a composite service may arrive at the same time. Considering the dynamics of Web service environments and concurrency of requests, we propose in this paper a service selection scheme which adopts top-k dominating queries to generate a composition solution rather than only select the best composition solution for a given request. The experimental results have investigated the efficiency and effectiveness of our approach and shown that it outperforms baseline and traditional methods for service selection.

• Journal of The Korean Digital Architecture Interior Association
• /
• v.13 no.1
• /
• pp.43-53
• /
• 2013

The purpose of this study is to propose the reasonable method for effective public building construction process. Public building service administration is necessary to make efficient public building supply and demand program. As a result, current public building precess need four steps(organize public assets, various process, establish public building service administration, design criteria). 1. Planning phase : Participation of Private Experts is guaranteed to enhance public building's function such as welfare, entertainment. 2. Design Phase : Detailed design review makes efficient and user oriented public building. 3. Construction Phase : Public Architect solve various problems among the participator especially in case of government local building construction. In conclusion, well formulated design criteria and Public building service administration make public building efficient in various field.

• Journal of Information Technology Services
• /
• v.11 no.2
• /
• pp.1-17
• /
• 2012

This study based on DeLone and McLean's IS success model aims to identify mobile office service factors affecting user satisfaction. The result of analysis showed that user satisfaction was positively related to job performance, and mobility and information quality affects user satisfaction. In addition to that, we carried out separated hypotheses test to investigate mobile office service factors depending on usage(frequently used functions) and job characteristics classified generally as either primary or support activities. As a result of this research, somewhat different results were derived. The main results of this study are that mobility is the most important factor affecting user satisfaction, and mobile office services should be more strictly guaranteed in quality especially if it supports primary activities of customer companies such as sales.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.321-322
• /
• 2010

Mobile IPTV lets mobile users transmit and receive multimedia traffic, such as TV signals, audio, text and graphics, through IP-based networks with the support of quality of service(QoS) and quality of experience(QoE), mobility and interactivity [1]. To provide service feasibility, QoS and seamless mobility to mobile users, we consider mobility prediction, link stability, service requirements to develop resource reservation scheme in mobile IPTV environments. Thus, we study for mobility prediction and QoS-guaranteed mobile IPTV service prior to develop the resource reservation scheme.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.695-698
• /
• 2000

The services such as real-time audio and video applications have become increasingly popular, especially over the Internet. Furthermore, as being commercialized those contents on the Internet require quality of service (QoS) support to ensure their performance. PPP is the best solution to of for those kinds of services. The reason why we want to employ PPP is this satisfies most of the requirements associated with remote connectivity to an NSP, such as IP address assignment, security, and AAA (authentication, authorization and accounting). In addition, since ISPs and corporations are familiar with PPP based connectivity, easy migration from existing ISP infrastructure is expected, if QoS is guaranteed. But so for PPP has had no field to ensure the quality of service. This article presents the solution by using some tunneling protocols and the draft [1] that proposed additional LCP option fields to negotiate QoS. To communicate each other, after negotiating those option fields, over various protocols such as ATM, Ethernet, and etc. tunneling protocol is used. Following sections will mention those briefly. And the service provision to offer the end-to-end communication with negotiated QoS will also be proposed.