• Journal of KIISE:Information Networking
• /
• v.33 no.3
• /
• pp.277-287
• /
• 2006

Most of the existing broadband access networks based on DSL, cable modem, and Ethernet support the best-effort internet access service, and adopt the flat rate pricing mechanism. It is almost impossible to provide the differentiated communication services, in current broadband access networks, for the different users and/or the different application services. Currently, however, the advances in multimedia, communication, and security technologies push the interactive and/or streaming multimedia services and VPN services to be widely deployed over Internet, and they require more QoS-sensitive services than the best-effort service. Though various QoS technologies such as RSVP-based IntServ and DiffSern were already developed and under standardization in Internet world, it is impractical to replace the existing QoS-unaware access networks with the QoS-enabled ones at a time to deploy QoS-sensitive services. In this paper, after analyzing current broadband access network architectures and the status of QoS support, we propose a practical approach to support multimedia QoS in the broadband access networks. The approach will be based on the integration of the differentiated pricing and the DiffServ technology. And it will be a step-wise approach to support backward compatibility with the legacy broadband access networks as much as possible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.461-471
• /
• 2004

Recently, subscribers have strong desire to get QoS based personalized services in high-speed Internet access. Service providers have been rapidly replacing ADSL, cable broadband access networks with Metro-Ethernet based VDSL. But, it is difficult for Motto-Ethernet based broadband access networks to provide QoS based personalized services, because already deployed network elements cannot distinguish subscribers by specific traffic characteristics. In this paper, when the access network has tree topology, we show that it is possible to provide QoS for each downstream flow with only per flow traffic shaping at the edge node without QoS functions in access networks. In order to show that our suggested scheduling algorithm at the edge node can support the assured service in tree topology access networks, we evaluated its performance by simulation. The suggested scheduling algorithm can shape per-flow traffic based on the maximum bandwidth, and guarantees minimum bandwidth per flow by modifying the DRR scheduler. Simulation results show that congestion and loss in the access network elements are greatly reduced, TCP performance is highly enhanced and loss for assured CBR service flows is reduced by only shaping per-flow traffic at the edge node using our proposed scheduling algorithm.

• Proceedings of the ESK Conference
• /
• 1995.10a
• /
• pp.185-191
• /
• 1995

This paper reviews how to access the ergonomic information through internet-the world-wide computer networks. Recently, with the growth of hypertext type Internet-the WWW (World-Wide Web), it becomes much easier to access to the Internet and we can retrieve information very effeciently. In order to search the ergonomic information, this paper also reviews the famous Web search engines like Lycos, Web Crawler, and meta-indices like YAHOO. Also, useful Web-sites of ergonomics/human factors such as ErgoWeb are summarised.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4331-4346
• /
• 2015

The femtocell network, which is designed for low power transmission and consists of consumer installed small base stations, coexists with macrocells to exploit spatial reuse gain. For its realization, cross-tier interference mitigation is an important issue. To solve this problem, we propose a joint access and power control scheme that requires limited information exchange between the femto and macro networks. Our objective is to maximize the network throughput while satisfying each user's quality of service (QoS) requirement. To accomplish this, we first introduce two distributed interference detection schemes, i.e., the femto base station and macro user equipment based schemes. Then, the proposed scheme dynamically adjusts the transmission power and makes a decision on the access mode of each femto base station. Through extensive simulations, we show that the proposed scheme outperforms earlier works in terms of the throughput and outage probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4293-4304
• /
• 2014

In order to ensure the wireless connectivity and seamless service to mobile users, the next generation network system will be an integration of multiple wireless access networks. In a heterogeneous wireless access system, bandwidth allocation becomes crucial for load balancing to avoid network congestion and improve system utilization efficiency. In this article, we propose a new dynamic bandwidth allocation scheme for hierarchical wireless network systems. First, we derive a multi-objective decision criterion for each access point. Second, a bargaining strategy selection algorithm is developed for the dynamic bandwidth re-allocation. Based on the intervenient Stackelberg game model, the proposed scheme effectively formulates the competitive interaction situation between several access points. The system performance of proposed scheme is evaluated by using extensive simulations. With a simulation study, it is confirmed that the proposed scheme can achieve better performance than other existing schemes under widely diverse network environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4269-4292
• /
• 2014

Currently, increasing numbers of access points (AP) are being deployed in enterprise offices, campuses and municipal downtowns for flexible Internet connectivity, but most of these access points are idle or redundant most of the time, which causes significant energy waste. Therefore, with respect to power conservation, applying energy efficient strategies in WIFI networks is strongly advocated. One feasible method is dynamically managing network resources, particularly APs, by powering devices on or off. However, when an AP is powered on, the device is initialized through a long boot time, during which period clients cannot be associated with it; therefore, the network performance would be greatly impacted. In this paper, based on a global view of an entire WLAN, we propose an AP selection technology, known as Temporary Access Selection (TAS). The criterion of TAS is a fusion metric consisting of two evaluation indexes which are based on throughput and battery life, respectively. TAS is both service and clients' preference specific through balancing the data rate, battery life and packet size. TAS also works well independently in traditional WLANs in which no energy efficient strategy is deployed. Moreover, this paper demonstrates the feasibility and performance of TAS through experiments and simulations with Network Simulator version 3 (NS3).

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.13-16
• /
• 2000

Recently, with the advent of satellite communication technologies, the network access service through satellites has emerged as an alternative to existing ones. Of satellite access services including multimedia services, the high speed internet access service will be one of the important services. Particularly, the efficient transportation of real time internet traffic seems very essential. The aim of this research is to examine the applicability of the IETF RTP protocol in the satellite access network. The RTP has been developed for the QoS-met transportation protocol of real time traffic over the existing best-effort internet. This paper summarizes the RTP protocol, and describes the architecture of the implementation of the RTP. And also, the compressed RTP header protocol is discussed for the applicability to the satellite link.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4242-4263
• /
• 2017

Multi-User Multiple-Input Multiple-Output (MU-MIMO) technology has recently attracted significant attention from academia and industry because of it is increasingly important role in improving networks' capacity and data rate. Moreover, MU-MIMO systems for the Fifth Generation (5G) have already been researched. High Quality of Service (QoS) and efficient operations at the Medium Access Control (MAC) layer have become key requirements. In this paper, we propose a downlink MU-MIMO MAC protocol based on adaptive Channel State Information (CSI) feedback (called MMM-A) for Wireless Local Area Networks (WLANs). A modified CSMA/CA mechanism using new frame formats is adopted in the proposed protocol. Specifically, the CSI is exchanged between stations (STAs) in an adaptive way, and a packet selection strategy which can guarantee a fairer QoS for scenarios with differentiated traffic is also included in the MMM-A protocol. We then derive the expressions of the throughput and access delay, and analyze the performance of the protocol. It is easy to find that the MMM-A protocol outperforms the commonly used protocols in terms of the saturated throughput and access delay through simulation and analysis results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3945-3964
• /
• 2015

Since the decentralized structure and the blindness of a large-scale wireless network make it difficult to collect the real-time channel state or other information from random distributed relays, a fundamental question is whether it is feasible to perform the relay selection without this knowledge. In this paper, a Slotted ALOHA based Greedy Relay Selection (SAGRS) scheme is presented. The proposed scheme allows the relays satisfying the user's minimum transmission request to compete for selection by randomly accessing the channel through the slotted ALOHA protocol without the need for the information collection procedure. Moreover, a greedy selection mechanism is introduced with which a user can wait for an even better relay when a suitable one is successfully stored. The optimal access probability of a relay is determined through the utilization of the available relay region, a geographical region consisting of all the relays that satisfy the minimum transmission demand of the user. The average number of the selection slots and the failure probability of the scheme are analyzed in this paper. By simulations, the validation and the effectiveness of the SAGRS scheme are confirmed. With a balance between the selection slots and the instantaneous rate of the selected relay, the proposed scheme outperforms other random access selection schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.1973-1991
• /
• 2018

Multimedia applications over wireless networks have been evolving to augmented reality or virtual reality services. However, a rich data size compared to conventional multimedia services causes bandwidth bottlenecks over wireless networks, which is one of the main reasons why those applications are not used widely. To overcome this limitation, bandwidth aggregation techniques, which exploit a multi-path transmission, have been considered to maximize link utilization. Currently, most of the conventional researches have been focusing on the user end problems to improve the quality of service (QoS) through optimal load distribution. In this paper, we address the joint pricing and load distribution problem for multi-homing in heterogeneous wireless access networks (ANs), considering the interests of both the users and the service providers. Specifically, we consider profit from resource allocation and cost of power consumption expenditure for operation as an utility of each service provider. Here, users decide how much to request the resource and how to split the resource over heterogeneous wireless ANs to minimize their cost while supporting the required QoS. Then, service providers compete with each other by setting the price to maximize their utilities over user reactions. We study the behaviors of users and service providers by analyzing their hierarchical decision-making process as a multileader-, multifollower Stackelberg game. We show that both the user and service provider strategies are closed form solutions. Finally, we discuss how the proposed scheme is well converged to equilibrium points.