• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.136-147
• /
• 2002

In this paper, the maximal capacity of the data network link has attempted to be exploited by using the dynamic allocation strategy. We propose a new methodology based on the economic models for competing traffic classes (classes of sessions) in packet networks. As the demand for network services accelerates, users' satisfaction to the service level might decrease due to the congestion at the network nodes. To prevent this, efficient allocation of a networks resources, such as available bandwidth and switch capacity, is needed. By using the so-called user profile as well as the utility (e.g., data rate) functions, it is possible to allocate data rates and other utilities using the arbitrary number of QoS classes, say $0.01,...,$10.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.11a
• /
• pp.13-18
• /
• 2005

Routers determine routing path considering network topology and link state information for providing QoS (quality of service) guarantee. Therefore, it is important that routers know link state information to calculate routing path. However, if routers generate link state update messages inordinately, their router performance are reduced due to the process of link state update messages. On the other side, in case that link state information is not updated appropriately, route setup requests can be rejected even though there exist routes. In this paper, we propose an algorithm to improve router performance and evaluate the proposed algorithm performance compare with conventional algorithm by simulations.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.2
• /
• pp.645-655
• /
• 2008

As wireless connectivity is integrated into many handheld devices, streaming multimedia content among mobile ad-hoc peers is becoming a popular application. In this paper, we propose a dynamic service replication algorithm for providing guaranteed continuous streaming services to all nodes in mobile ad-hoc networks (MANETs). First, a MANET is comprised of logical grid hierarchy, and a streaming service is replicated to a lower server region of the logical grid hierarchy by considering the link availability between a mobile node and the streaming server within a server region or the popularity of the streaming service. We evaluate analytically the performance of the proposed algorithm, and compared with that of existing Qin's algorithm. Evaluation results show that our algorithm can achieve better streaming performance than Qin's algorithm. Therefore, the proposed algorithm not only improves the sharing availability of replicated streaming services but also controls efficiently the number of streaming service replications.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.6
• /
• pp.1515-1523
• /
• 2015

It has been prevalent to be serviced through WLAN(Wireless Local Area Network) as a variety of mobile devices have been introduced. If the number of mobile devices increases rapidly for the network access in a limited range of ESS(Extended Service Set), a lengthy connection delays are induced due to the initial link setup process of the IEEE 802.11i which is WLAN security standard. In this paper, we propose a new initial link setup protocol which can be executed in the ESS area of WLAN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.7 no.4
• /
• pp.173-176
• /
• 1982

Point-to-point congestion, a criterion by which service quality in a communication network is estimated, Can be obtained by single moment method of analysis, point-to-point congestion can be computed by link blocking probability in turn is calculated by link offered traffic. Consequently, exact calculation of link offered traffic is vital to analysis of communication network. In this paper a fomula which facilitaties the calculation of link offered traffic in the limited available state of links, is derived.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.720-740
• /
• 2011

Wi-Fi-enabled portable devices have recently been introduced into the consumer electronics market. These devices download or upload content, from or to a host machine, such as a personal computer, a laptop, a home gateway, or a media server. This paper investigates the fairness among multiple Wi-Fi-enabled portable devices in a home network when they are simultaneously communicated with the host machine. First, we present that, a simple IEEE 802.11-based home network suffers from unfairness, and the fairness is exaggerated by the wireless link errors. This unfairness is due to the asymmetric response of the TCP to data-packet loss and to acknowledgment-packet loss, and the wireless link errors that occur in the proximity of any node; the errors affect other wireless devices through the interaction at the interface queue of the home gateway. We propose a QoS-provisioning framework in order to achieve per-device fairness and service differentiation. For this purpose, we introduce the medium access price, which denotes an aggregate value of network-wide traffic load, per-device link usage, and per-device link error rate. We implemented the proposed framework in the ns-2 simulator, and carried out a simulation study to evaluate its performance with respect to fairness, service differentiation, loss and delay. The simulation results indicate that the proposed method enforces the per-device fairness, regardless of the number of devices present and regardless of the level of wireless link errors; furthermore it achieves high link utilization with only a small amount of frame losses.

• Journal of information and communication convergence engineering
• /
• v.16 no.1
• /
• pp.31-37
• /
• 2018

In this work, we propose an analytic framework for evaluating the quality of service and dimensioning the link capacity in the gateway router of a smart farm with a greenhouse eco-management system. Specifically, we focus on the gateway router of an IoT network that provides an access service for smart farms. We design the link capacity of a gateway router that is used for the remote management of the greenhouse eco-management system to accommodate both time-critical and delay-tolerant traffic in a greenhouse LAN. For this purpose, we first investigate the ecosystem for smart farm, and we define the specification and requirements of the greenhouse eco-management system. Second, we propose a system model for the link capacity of a gateway that is required to guarantee the delay performance of time-critical applications in the greenhouse LAN. Finally, the validity of the proposed system is demonstrated through a series of numerical experiments.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.117-120
• /
• 2000

This paper discusses solutions for forward link power allocation based on 3GPP(FDD) standardization reports and which meet the required Eb/No of forward link channels. In addition, the forward link user capacity in a mixed service environment. Cell coverage is induced from the user capacity solutions using the urban propagation model. In an urban macrocell environment, the forward link user capacity turns out to be roughly 29 and 3, respectively, for voice and data service (144 kbps) at a distance of 1 km, and in an urban microcell environment, the user capacity turns out to be Toughly 14, 4, and 2, respectively, for voice and two data services (144 kbps, 384 kbps) when the cell radius is 0.2 km.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.892-900
• /
• 1994

Recently, ITU-TSS recommends a service specific connection oriented protocol (SSCOP) which assures the successful transmission of signalling information for B-ISDN. In the SSCOP, there is a mechanism to exchange periodically status informations for both error and flow controls. In this paper, we analyze the SSCOP with a discrete-time queueing model. We consider two cases for link-by-link and end-to-end controls. As the performance measures, we investigate delay, throughput, and buffer size of the receiver. The average values of these measures are analyzed with respect to the loss probability of messages, the traffic load, and the exchange period of status information. We also verify the accuracy of this model with simulations.

• The KIPS Transactions:PartB
• /
• v.11B no.5
• /
• pp.537-544
• /
• 2004

The Web is rich with various sources of information. Due to the massive and heterogeneous web document collections, users want to find various types of target pages. Each type of information for Web search has designated queries. If a user query is not a designated query, then we cannot have good result documents. Different strategies are needed to utilize the goodness of each type of information for a search engine. If we know the property of information, then we can refine candidate pages and rank them delicately. Various experiments are conducted to show the properties of each type of information. Therefore, we show an appropriate combining formula to utilize the properties of each type of information. In addition, for a service finding task, we propose Service Link Information that utilizes the existence of mechanisms for a user interaction.