• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.305-310
• /
• 2003

The performance of various GFR implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. An efficient buffer management algorithm is necessary to guarantee MCR for untagged cell in ATM switch. In this paper, we propose and evaluate a buffer management scheme to provide the GFR service guarantees. The proposed scheme can control the cell discarding for fairness in each VC, and compared with Double-EPD and DFBA. Our results show that the proposed buffer management with per-VC queuing achieves significant enhancement on goodputs and fairness index than those of existing methods.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.321-333
• /
• 2005

With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. As demand for services has expanded in the cellular segment, sever innovations have been made in order to increase the utilization of bandwidth. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. Hierarchical network design holds the public eye because of increasing demand and quality of service to mobile users. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. In addition, we know the avenue and demand as an assumption. We propose the network about the profit maximization. This study can apply to GSM(Global System for Mobile Communication) which has 70% portion in the world. Hierarchical network design using GA(Genetic Algorithm) is the first three-tier (Macro, Micro, Pico) model, We increase the reality through applying to EMC (Electromagnetic Compatibility Constraints). Computational experiments on 72 problem instances which have 15${\sim}$40 candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers more than 90% of the demand.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1216-1226
• /
• 2005

In this paper, a preventive transmission rate decision algorithm, called PTRD, is proposed for the transmission of live video over networks with dynamic bandwidth allocation capability. Frame analyzer predicts the bit-rates of future frames before encoding by analyzing the source information such as spatial variances and the degree of scene changes. By using the predicted bit-rates, transmission rate bounds are derived from the constraints of encoder and decoder buffers. To resolve the problem of renegotiation cost increment due to frequent renegotiations, the PTRD algorithm is presented to decide transmission rates considering the elapsed time after the recent renegotiation and the perceived video quality. From the simulation results, compared to the normalized LMS based method, PTRD is shown to achieve high channel utilization with low renegotiation cost and no delay violation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1138-1147
• /
• 2012

In this paper, an efficient power control based MF-TDMA resource allocation scheme is proposed for next generation military satellite communication systems. The proposed scheme has the flexibility is used to support heterogeneous terminals with differ in transmission capabilities. The method can be divided into two parts : burst size calculation and burst structure determination. At first, we estimate the link budget taken into account a dynamic satellite link state variation. Then, applicable ACM level and burst size is chosen. In burst structure determination phase, we reorganize the burst structure in time-frequency domain by controlling limited power, bandwidth, time resources. In particular, we compensate the power spectral density among different terminals to integrate them in same transponder, Furthermore, we increase the packing efficiency by controlling the ACM level of the burst in applicable power spectral density range. Simulation results show that the method increase the spectral efficiency and burst packing efficiency. In addition, slot allocation rejection ratio is successfully reduced.

• Journal of Advanced Navigation Technology
• /
• v.20 no.3
• /
• pp.238-245
• /
• 2016

There are technological, operational and environmental constraints at tactical edge, which are disconnected operation, intermittent connectivity, and limited bandwidth (DIL), size, weight and power (SWaP) limitations, ad-hoc and mobile network, and so on. To overcome these limitations and constraints, we use service-oriented architecture (SOA) based technologies. Moreover, the operation environment is highly dynamic: requirements change in response to the emerging situation, and the availability of resources needs to be updated constantly due to the factors such as technical failures. In order to use appropriate resources at the right time according to the mission, it needs to find the best resources. In this context, we identify ontology-based mission service model including mission, task, service, and resource, and develop capability-based matching in tactical edge environment. The goal of this paper is to propose a capability-based semantic matching for dynamic resource allocation. The contributions of this paper are i) military domain ontologies ii) semantic matching using ontology relationship; and (iii) the capability-based matching for the mission service model.

• Journal of Advanced Navigation Technology
• /
• v.14 no.4
• /
• pp.495-503
• /
• 2010

The clustering is an important mechanism thai provides information for mobile nodes efficiently and improves the processing capacity for routing and the allocation of bandwidth. This paper proposes a clustering scheme based on the fuzzy relevance degree to solve problems such as node distribution found in the dynamic property due to mobility and flat structure and to enhance the routing performance. The proposed scheme uses the fuzzy relevance degree, ${\alpha}$, to select the cluster head for clustering in FSV (Fuzzy State Viewing) structure. The fuzzy relevance ${\alpha}$ plays the role in CH selection that processes the clustering in FSV. The proposed clustering scheme is used to solve problems found in existing 1-hop and 2-hop clustering schemes. NS-2 simulator is used to verify the performance of the proposed scheme by simulation. In the simulation the proposed scheme is compared with schemes such as Lowest-ID, MOBIC, and SCA. The simulation result showed that the proposed scheme has better performance than the other existing compared schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.325-338
• /
• 2004

As the recent rapid development of internet technology and the wide spread of multimedia communication, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service. To resolve these problems, this paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network. Particularly for the efficient processing of Assured Forwarding(AF) Per Hop Behavior(PHB), this paper proposes an ACWF$^2$Q$^{+}$ packet scheduler on a DiffServ router to enhance the throughput of packet transmission and the fairness of traffic services.s.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.344-347
• /
• 2011

Unlike a terrestrial wireless sensor network which uses radio waves, UWASN(Underwater Acoustic Sensor Network) relies on acoustic waves. There are lots of ongoing researches for long latency and limited bandwidth of underwater sensor network by using acoustic wave. Packets transferred by node often colide in underwater sensor network due to long latency. To solve this kind of problem, in general, Back-off scheme which is used in wireless network is used. However, fixed Slot-time according to node allocation generates useless time delay, and this lowers network performance. In this thesis, active setting technique of Slot-time is proposed, and applied for already studied MAC protocol. At the conclusion, it was proved that the MAC protocol using the proposed scheme has better performance than existing MAC protocol as a result comparison.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8C
• /
• pp.803-811
• /
• 2002

Asynchronous Transfer Mode-Passive Optical Network(ATM-PON) Technology is one of the best solutions for implementation of broadband access network. In this paper, we propose a new Dynamic Bandwidth Allocation (DBA) algorithm for ATM-PON systems. The DBA is a key technique for data traffic management. DBA has been studied widely to allow ATM-PON to transport data traffic cost-effectively and efficiently, and currently a hot standardization issue in Full Service Access Network(FSAN) and ITU-T. The proposed DBA algorithm efficiently manages the user traffics according to their service categories. Performance of the proposed algorithm, in aspect of Cell Transfer Delay(CTD) and Cell Delay Variation(CDV), is evaluated using computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.48-58
• /
• 2002

As internet traffic increases, the problem that it should be efficiently accepted in to the existing voice network in the pending problem importantly to the existing communication corporations. The feature of next generation exchange network is made up of the form of integration network that connect data traffic(internet service. Etc) with the existing voice network and it can be showed with very diverse aspects according to the constitution time of network or the characteristics of business. The progress strategy that develop the existing circuit based communication network into packet-based communication network can be divided into two in a large scale according to the application position These are VoDSL application method(Technology that packetize access network) and softswitch technology application method(after packetizing relay network, packetizing that into the access network). In this paper, we will deduce the desirable technology that can construct packet-based next generation exchange networks in the structure of the existing communication network environment. We will perform the research on a device to offer the necessary core technique VoSDL service with realistic resolutions primarily.