• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.86-89
• /
• 1998

Multiple types of information in a multimedia service are delivered though multiple virtual connections on ATM network, while each virtual connection may be controlled independently. A multimedia service requires an associative relationship among multiple information streams to provide required harmonization. There may be required additional traffic descriptors to guarantee the required harmonization among multiple information streams in a multimedia service. For buffering of large bandwidth information stream(e.g., video), extremely large buffer size is necessary, but this approach should not be efficient way to compensate a severely delayed cells/blocks experienced at network. The best way to solve this problem will be minimization of relative-delayed-transfer of cells/blocks to application processes through ATM network control. To minimize a delayed transfer the mapping between relative delay parameter(i.e., associative Group QoS parameters) and per-VC traffic descriptor will be necessary. This paper is present additional functions and parameters to interpret the mapping between relative delay parameters(i.e., associative Group QoS parameters) and per-VC traffic descriptors in ATM API for multimedia application services.

• Journal of the Optical Society of Korea
• /
• v.18 no.5
• /
• pp.466-471
• /
• 2014

An asynchronous optical packet-switching (AOPS) node with load-balancing capability can achieve better performance in reducing the high packet-loss ratio (PLR) and time delay caused by unbalanced traffic. This paper proposes a novel dynamic load-balancing algorithm for an AOPS node with limited buffer and without wavelength converters, and considering the data flow distribution and service levels. By calculating the occupancy state of the output ports, load state of the input ports, and priorities for data flow, the traffic is balanced accordingly. Simulations demonstrate that asynchronous variant data packets and output traffic can be automatically balanced according to service levels and the data flow distribution. A PLR of less than 0.01% can be achieved, as well as an average time delay of less than 0.46 ns.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.229-233
• /
• 2011

The existing approaches for analyzing the data service capacity of CDMA2000 1X EV-DO (Evolution-Data Only) systems have focused on deriving the maximum number of active customers assuming that the data rates provided to the customers can be determined beforehand. However, we have seen that through real experiment, the data rates actually provided to the customers adaptively change according to the number of active customers. In this paper, we propose new capacity analysis model considering the data rate adaptation. Numerical examples are also presented to obtain the maximum input traffic rates for various values of the length of data burst and the required mean delay bound.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.611-616
• /
• 2003

Recently, the HFC-CATV network stand in a substructure of superhighway information network. Because of sharing up to 500 of subscribes, the Collision Resolution Algorithm needs in the upstream channel of HFC-CATV network. In order to provide Quality of Service (QoS) to users with real-time data such as voice, video and interactive service, the research of Collision Resolution Algorithm must include an effective priority scheme. In IEEE 802.14, the Collision Resolution Algorithm has high request delay because of static PNA(Priority New Access) slots structure and different priority traffics with the same probability. In order to resolve this problem, this paper proposed dynamic priority collision resolution algorithm with ternary tree algorithm. It has low request delay according to an increase of traffic load because high priority traffic first resolve and new traffic content with different probability. In the result of the simulation, it demonstrated that the proposed algorithm needs lower request delay than that of ternary tree algorithm with static PNA slots structure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.632-650
• /
• 2013

The paper considers a spectrum sharing cognitive radio (CR) network coexisting with a primary network under the average interference power constraint. In particular, the secondary user (SU) is assumed to carry delay-sensitive services and thus shall satisfy a given delay quality-of-service (QoS) constraint. The secondary receiver is also assumed to be equipped with multiple antennas to perform maximal ratio combining (MRC) to enhance SU performance. We investigate the effective capacity of the SU with MRC diversity under aforementioned constraints in Nakagami fading environments. Particularly, we derive the optimal power allocation to achieve the maximum effective capacity of the SU, and further derive the effective capacity in closed-form. In addition, we further obtain the closed-form expressions for the effective capacities under three widely used power and rate adaptive transmission schemes, namely, optimal simultaneous power and rate adaptation (opra), truncated channel inversion with fixed rate (tifr) and channel inversion with fixed rate without truncation (cifr). Numerical results supported by simulations are presented to consolidate our studies. The impacts on the effective capacity of various system parameters such as the number of antennas, the average interference power constraint and the delay QoS constraint are investigated in detail. It is shown that MRC diversity can significantly improve the effective capacity of the SU especially for cifr transmission scheme.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1163-1174
• /
• 2001

A general goal of the ATM(Asynchronous Transfer Mode) network is to support connections across various networks. ABR service using EPRCA(Enhanced Proportional Rate Control Algorithm) switch controls traffics in ATM network. EPRCA switch, traffic control method uses variation of the ACR(Allowed Cell Rate) to enhance the utilization of the link bandwidth. However, in ABR(Available Bit Rate) service, different treatments are offered according to different RTTs(Round Trip Times) of connections. To improve the above unfairness, this paper presents ABR DELAY mechanism, in which three reference parameters for cell delay are defined, and reflect on the messages of RM(Resource Management) cells. To evaluate our mechanism, we compare the fairness among TCP connections between ABR DELAY mechanism and ABR RRM mechanism. And also we execute simulations on a simple ATM network model where six TCP connections and a background traffic with different RTTs share the bandwidth of a bottleneck link. The simulation results, based on TCP goodput and efficiency, clearly show that ABR DELAY mechanism improves the fairness among TCP connections.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.414-418
• /
• 2003

VoIP is a core technology used to transmit both voice and data in an integrated packet' form. Within this technology, SIP is the signaling protocol used for 'real time' call services; particularly those where H323 is used. Yet, when considering the needs of mobile users, it is essential we integrate VoIp within the mobile technology so the mobile host is able to receive the 'packet' transported and by, and connected to, any available internet-address. For all this to occur, we need to improve Network Delay by reducing transmission problems associated with mobile services. If we are to obtain an optimal service then we must reduce any network delays which may arise from joining Mobile IP and VoIp services. This paper, therefore, considers how, unlike previous research, these delays may be improved through the use of the signaling technology\ulcorner SIP. It also considers how this research may be introduced into current wired and wireless integrated services enabling them to use the IP 'packet'.

• KIISE Transactions on Computing Practices
• /
• v.23 no.5
• /
• pp.310-315
• /
• 2017

In a centralized control structure, the software defined network controller manages all openflow enabled switched in a data plane and controls the telecommunication between all hosts. In addition, the network manager can easily deploy the network function to the application layer with a software defined network controller. For this reason, many methods for network management using a software defined network concept have been proposed. The main policies for network management are related to traffic Quality of Service and resource management. In order to provide Quality of Service and load distribution for network users, we propose an efficient routing method using a naive bayesian algorithm and transmission delay estimation module. In this method, the forwarding path is decided by flow class and estimated transmission delay result in the software defined network controller. With this method, the load on the network node can be distributed to improve overall network performance. The network user also gets better dynamic Quality of Service.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.217-226
• /
• 2001

In this paper, for continuous media access operations performed by Clustered Continuous Media Storage Server (CCMSS) system, we present the analytical model based on the open queueing network, which considers simultaneously two critical delay factors, the disk I/O and the internal network, in the CCMSS system. And we derive by using the analytical model the stochastic model for the total service delay time in the system. Next, we propose the integrated stochastic admission control model for the CCMSS system, which estimate the maximum number of admittable service requests at the allowable service failure rate by using the derived stochastic model and apply the derived number of requests in the admission control operation. For the performance evaluation of the proposed model, we evaluated the deadline miss rates by means of the previous stochastic model considering only the disk I/O and the propose stochastic model considering the disk I/O and the internal network, and compared the values with the results obtained from the simulation under the real cluster-based distributed media server environment. The evaluation showed that the proposed admission control policy reflects more precisely the delay factors in the CCMSS system.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2456-2467
• /
• 2018

Wireless multimedia sensor networks (WMSNs) require real-time quality-of-service (QoS) guarantees to be provided by the network. The end-to-end delay is very critical metric for QoS guarantees in WMSNs. In WMSNs, due to the transmission errors incurred over wireless channels, it is difficult to obtain reliable delivery of data in conjunction with low end-to-end delay. In order to improve the end-to-end delay performance, the system has to drop few packets during network congestion. In this article, our proposal is based on optimization of end-to end delay for WMSNs. We optimize end-to-end delay constraint by assuming that each packet is allowed fixed number of retransmissions. To optimize the end-to-end delay, first, we compute the performance measures of the system, such as end-to-end delay and reliability for different network topologies (e.g., linear topology, tree topology) and against different choices of system parameters (e.g., data rate, number of nodes, number of retransmissions). Second, we study the impact of the end-to-end delay and packet delivery ratio on indoor and outdoor environments in WMSNs. All scenarios are simulated with multiple run-times by using network simulator-2 (NS-2) and results are evaluated and discussed.