• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.1
• /
• pp.50-64
• /
• 2012

Quality of Service (QoS) and fairness considerations are undoubtedly essential parameters that need to be considered in the design of next generation scheduling algorithms. This work presents a novel game theoretic cross-layer design that offers optimal allocation of wireless resources to heterogeneous services in Orthogonal Frequency Division Multiple Access (OFDMA) networks. The method is based on the Axioms of the Symmetric Nash Bargaining Solution (S-NBS) concept used in cooperative game theory that provides Pareto optimality and symmetrically fair resource distribution. The proposed strategies are determined via convex optimization based on a new solution methodology and by the transformation of the subcarrier indexes by means of time-sharing. Simulation comparisons to relevant schemes in the literature show that the proposed design can be successfully employed to typify ideal resource allocation for next-generation broadband wireless systems by providing enhanced performance in terms of queuing delay, fairness provisions, QoS support, and power consumption, as well as a comparable total throughput.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.841-850
• /
• 2004

In this paper under the distributed system for efficient distribution resource to system's each node must be designed to get right decision making. Thus we considered computing time to estimate fault such as delay on communication network, communication period and other decision making. Aiso, using direct communitation mode improve the availity of total system.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.45-48
• /
• 2003

We can easily buy network system for high performance micro-processor, progress computer architecture is caused of high bandwidth and low delay time. Coupling PC-based commodity technology with distributed computing methodologies provides an important advance in the development of single-user dedicated systems. Lately Network is joined PC or workstation by computers of high performance and low cost. Than it make intensive that Cluster system is resembled supercomputer. Unix, Linux, BSD, NT(Windows series) can use Cluster system OS(operating system). I'm chosen linux gain low cost, high performance and open technical documentation. This paper is benchmark performance of Beowulf clustering by UltraSPARC-1K(64bit-RISC processor). Benchmark tools use MPI(Message Passing Interface) and NetPIPE. Beowulf is a class of experimental parallel workstations developed to evaluate and characterize the design space of this new operating point in price-performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.1024-1034
• /
• 1998

Most public cryptosystem widely used in communication network are based on the exponentiation-arithmetic. But, cryptosystem has to use bigger and bigger key parameter to attain an adequate level of security. This situation increases both computation and time delay. Montgomery, yang and Kawamura presented a method by using the pre-computation, intermediately computing and table look-up on modular reduction. Coster, Brickel and Lee persented also a method by using the pre-computation on exponentiation. This paper propose to reduce computation of exponentiation with spare prime. This method is to enhance computation efficiency in cryptosystem used discrete logarithms.

• Korean Journal of Remote Sensing
• /
• v.33 no.4
• /
• pp.391-400
• /
• 2017

Geo-based application services linked with the Open Geospatial Consortium (OGC) Web Processing Service (WPS) protocol have been regarded as an important standardized framework for of digital earth building in the web environments. The WPS protocol provides interface standards for analysis functionalities within geo-spatial processing in web-based service systems. Despite its significance, there is few performance tests of WPS applications. The main motivation in this study is to perform the comparative performance test on WPS standards. Test system, which was composed of WPS servers, WPS framework, data management module, geo-based data processing module and client-sided system, was implemented by fully open source stack. In this system, two kinds of geo-based image processing functions such as cloud detection and gradient magnitude computation were applied. The performance test of different server environments of non-WPS, synchronous WPS 1.0 and asynchronous WPS 2.0 was carried out using 100 threads and 400 threads corresponds client users on a web-based application service. As the result, at 100 threads, performance of three environments was within an adjacent range in the average response time to complete the processing of each thread. At 400 threads, the application case of WPS 2.0 showed the distinguished characteristics for higher performance in the response time than the small threads cases. It is thought that WPS 2.0 contributes to settlement of without performance problems such as time delay or thread accumulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.1978-1982
• /
• 2001

In a Multi-carrier modulation system, CP (Cyclic prefix) is inserted in the transmit tame in order to eliminate the ISI (Intersymbol Interference) and ICI (Interchannel Interference) caused by delay spread of a received signal, which in rum degrades the throughput of the system. TEQ (Time-domain equalizer) improves the system throughput by shortening the CIR (Channel Impulse Response) time and maintaining the CP length to the minimum regardless of the channel condition. In this paper, a new MMSE (Minimum Mean Square Error) TEQ algorithm is proposed and its performance is analyzed in order to speed up computing the optimum tap coefficients of the equalizer by employing Newton method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.857-860
• /
• 2013

Companies that have high need of some computational resources for an specific space of time, nowadays, the pay as they use manner for resources required, that, is a good solution provided these days by some Cloud computing providers. Also solutions that represent a distributed computation for processes with high demand of calculation have appeared lately, the only problem is that when they are created, they need also be configured to share the same working space, this is the scope that comprehends this work, where the aim is to propose a framework that can be used as a solution of automation of the configurations that sometimes can take undetermined time and sometimes the user that configures it has to have a lot of knowledge and also configurations can turn in tricky ones generating a delay in the time where real productivity should be exploited.

• Journal of the Korea Convergence Society
• /
• v.8 no.11
• /
• pp.7-13
• /
• 2017

In recent years, cloud computing technology has been socially emerged that provides services remotely as various devices are used. However, there are increasing attempts by some users to provide cloud computing services with malicious intent. In this paper, we propose a property - based multi - level hierarchical approach to facilitate authentication access for users accessing servers in cloud environment. The proposed method improves the security efficiency as well as the server efficiency by hierarchically distributing a set of attribute values by replacing the order of the user 's attribute values in the form of bits according to a certain rule. In the performance evaluation, the proposed method shows that the accuracy of authentication according to the number of attributes is higher than that of the existing method by an average of 15.8% or more, and the authentication delay time of the server is decreased by 10.7% on average. As the number of attributes increases, the average overhead change is 8.5% lower than that of the conventional method.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.21-30
• /
• 2005

In mobile computing environments, a mobile host caches the data to use the narrow bandwidth efficiently and improve the response time. A server periodically broadcasts the update data for maintaining the cache consistency of a mobile host. However, a method for maintaining cache consistency using periodic invalidation report has a problem that defers the commit decision of a mobile transaction to guarantee its serializable execution. In this paper, we propose CCM-AD method that guarantees the serializable execution of a mobile transaction even in the case that it is executed using cached data. As CCM-AD method guarantees the serializable execution of mobile transactions by using the intersection between the data broadcast to mobile host and the data updated at server. Then the CCM-AD method can reduce the delay of commitment decision of a mobile transaction. Also our method can reduce the size of invalidation report.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.5
• /
• pp.772-778
• /
• 2018

Due to the recent advances in computing, communication and micro-electromechanical technology, Wireless Sensor Networks (WSNs) applications have been extended from military to many commercial areas such as object tracking, wire detection, and vehicular sensor networks. In some applications bursty data from many sensor nodes may be generated and the generated data from the monitoring area may be sent in a limited time to the final destination, sink node. In this paper, we present a BTF-MAC protocol adequate for WSNs applications in which bursty data packets are required to be transmitted in a limited time. The BTF-MAC is a synchronous duty-cycle MAC protocol and uses a slot-reserved and operational period extension mechanism adapted to the traffics. Our numerical analysis and simulation results show that BTF-MAC outperforms other related protocols such as DW-MAC and SR-MAC in terms of energy consumption and transmission delay.