7 research outputs found
Resource Allocation Algorithm for Differentiated Multimedia Services Using Game Theory
λ³Έ λ
Όλ¬Έμ 2008λ
λ νκ΅κ²½μκ³Όνν μΆκ³νμ λν κ²½μλΆλ¬Έ(μ΄λ‘ ) μμλ
Όλ¬ΈμΌλ‘ μμ μ μ¬μ¬κ³Όμ μ κ±°μ³ κ²μ¬
μΆμ²λμμ.Game theory is adapted to a variety of domains such as economics, biology, engineering, political science, computer
science, and philosophy in order to analyze economic behaviors. This research is an application of game theory to
wireless communication. In particular, in terms of bargaining game we dealt with a multimedia resource allocation
problem in wireless communication, which is rapidly spreading such as Wibro, WCDML, IPTV, etc. The algorithm is
assumed to allocate multimedia resources to users who can choose and access differentiated media services. For
this purpose, a utility function of users is devised to reflect quality of service (QoS) and price. We illustrated experimental
results with synthesis data which were made to mimic real multimedia data, and analyzed differentiated
service providing and the effect of the utility function.λ³Έ μ°κ΅¬λ μ§μκ²½μ λΆ λ° μ 보ν΅μ μ°κ΅¬μ§ν₯μμ ITμμ²κΈ°μ κ°λ°μ¬μ
(IITA-2008-F-005-01)μ μ§μμΌλ‘ μνλμμ
ν΄λΌμ°λ μ»΄ν¨ν νκ²½μμμ κ²μμ΄λ‘ μ μ΄μ©ν μμ κ΄λ¦¬μ μλΉμ€ μ°¨λ³ν
Glocalization and hyper-connection are the most noteworth business trends. In order to proactively utilize the hyper-connection technologies for the business, and secure the competitive advantages based on the glocalization strategies, it is necessary to utilize the cloud computing technologies which are the most popular and known to be well-suited for the distributed computing and web-based service delivery. Cloud computing provides infrastructure, platform, and software as services to customers. For reliable and truthful service providing, a fair and elastic resource allocation strategy is essential from viewpoint of service users.
In this paper, the framework for adaptive process design has been developed in order to effectively support glocalization strategy in the cloud computing system at first. Users request cloud tasks according to the predefined processes. Then, a game-theoretic mechanism for dynamic cloud resource management for the requested tasks including task assignment and resource allocation has been presented to provide reliable and truthful services. A utility function for each cloud task is devised to evaluate the quality of cloud service by considering dynamic characteristics of cloud computing. The elementary stepwise system is then applied to efficiently assign tasks to cloud servers. The resource allocation mechanism based on bargaining solutions is finally adopted for the fair resource allocation in terms of quality of service.
In addition, a resource allocation problem for service discrimination has been presented. It has been assumed that the service administrator allocates resources to users who select and access one of the discriminated services. To express rational service selection of users, a utility function of users is devised to reflect both service quality and cost. For the utility function of service provider, total profit and efficiency of resource usage have been considered. The proposed service discrimination framework is composed of two game models. An outer model is a repeated Stackelberg game between the service administrator and a user group, while an inner model is a service selection game among users which is solved by adopting the Kalai-Smorodinsky bargaining solution.
The numerical experiments, it has been shown that the proposed mechanism guarantees better system performance than existing methods. The proposed mechanism completes the requested tasks earlier and provides relatively higher level of fairness of utility-cost ratio. Also, for the service discrimination, the performance has been compared with existing resource allocation methods according to user cost sensitivity. From the comparison results, it is shown that the proposed framework obtains better performance in terms of the total profit of the service administrator and the fairness for users utilities.
By applying the proposed mechanism, it seems possible to support cloud service administrator to elastically manage the limited resources in cloud computing environment in terms of quality of service.μ§μμ μΈκ³νμ μ΄μ°κ³νμμ μ΅κ·Ό λΉμ¦λμ€ κ²½ν₯ μ€ κ°μ₯ μ£Όλͺ©ν λ§ν νμμ΄λ€. μ΄λ¬ν μ΄μ°κ³νμμ κ°λ₯μΌνλ κΈ°μ μ λΉμ¦λμ€μ μ κ·Ήμ μΌλ‘ νμ©νκ³ , μ§μμ μΈκ³ν μ λ΅μ κΈ°λ°ν κ²½μ μ°μλ₯Ό ν보νκ³ μ μ§μν€κΈ° μν΄μλ μΉ κΈ°λ° μλΉμ€ μ 곡방μκ³Ό λΆμ° μ»΄ν¨ν
νκ²½μ μ ν©ν κ²μΌλ‘ μ μλ €μ§ ν΄λΌμ°λ μ»΄ν¨ν
κΈ°μ μ νμ©νλ κ²μ΄ νμνλ€. ν΄λΌμ°λ μ»΄ν¨ν
μ μΈνλΌμ€νΈλμ², νλ«νΌ κ·Έλ¦¬κ³ μννΈμ¨μ΄ λ±κ³Ό κ°μ μμμ μ¬μ©μλ€μκ² μλΉμ€μ ννλ‘ μ 곡νλ€. μ λ’°μ± λμ μλΉμ€ μ 곡μ μν΄μλ μλΉμ€ μ΄μ©μ κ΄μ μμ 곡μ ν λΏλ§ μλλΌ, μ¬μ©μ μꡬ λ³νμ νλ ₯μ μΌλ‘ λμν μ μλ μμ ν λΉ μ λ΅μ΄ νμμ μ΄λ€.
λ³Έ λ
Όλ¬Έμμλ μ°μ ν΄λΌμ°λ μ»΄ν¨ν
μμ€ν
μμμ μ§μμ μΈκ³ν μ λ΅μ ν¨κ³Όμ μΈ μνμ μ§μνκΈ° μν μ‘°μ κ°λ₯ν νλ‘μΈμ€ μ€κ³ νλ μμν¬λΆν° κ°λ°νμλ€. μ¬μ©μλ€μ μ μλ νλ μμν¬μ λ°λΌ μ¬μ μ μ μλ νλ‘μΈμ€λ₯Ό κΈ°λ°μΌλ‘ ν΄λΌμ°λ μ
무λ₯Ό μλ²μ μμ²νκ² λλ€. λν, μ¬μ©μλ‘λΆν° μμ²λ μ
무λ₯Ό ν¨κ³Όμ μΌλ‘ μ²λ¦¬νκΈ° μν΄ μ
무μ μλ² λ°°μ κ³Ό μμ ν λΉμ ν¬ν¨νλ κ²μ μ΄λ‘ κΈ°λ°μ λμ μμ κ΄λ¦¬ κΈ°λ²μ μ μνμλ€. ν΄λΌμ°λ μ
무 μν κ²°κ³Όμ νμ§ μμ€μ νκ° νκΈ° μν ν¨μ©ν¨μλ₯Ό ν΄λΌμ°λ μ»΄ν¨ν
νκ²½μ λμ μΈ νΉμ±μ κ³ λ €νμ¬ μ€κ³νμκ³ , κ° μ
무λ₯Ό μλ²μ ν¨κ³Όμ μΌλ‘ λ°°μ νκΈ° μν΄ ESS κΈ°λ²μ νμ©νμλ€. μλΉμ€ νμ§ μμ€ κ΄μ μμ 곡μ νκ² μμμ ν λΉνκΈ° μν΄μ ꡬ맀 κ²μμ ν΄λ₯Ό νμ©νκΈ° μν λ°©μμ μ μνμλ€.
λν, μλΉμ€ μ°¨λ³νλ₯Ό μν μμ ν λΉμ κ΄ν λ¬Έμ λ μ μνμλ€. μ°μ μλΉμ€ κ΄λ¦¬μλ μ°¨λ³νλ μλΉμ€λ€ μ€ νλλ₯Ό μ ννκ³ μ΄λ₯Ό νμ©νλ μ¬μ©μμκ² μΌμ μμ€μ μμμ ν λΉνλ κ²μ κ°μ νλ€. μ΄ λ, μ¬μ©μμ μλΉμ€ μ νμ΄ μ΄μ±μ μμ νννκΈ° μν΄, μ¬μ©μμ ν¨μ©ν¨μλ₯Ό μλΉμ€ νμ§ μμ€κ³Ό ν¨κ» μλΉμ€ μ΄μ©μ μν λΉμ©μ κ³ λ €νμ¬ μ€κ³νμλ€. μλΉμ€ κ΄λ¦¬μμ ν¨μ©ν¨μλ μμ ν λΉμ ν΅ν΄ μ»μ μ μλ μμ΅κ³Ό μμ ν λΉμ ν¨μ¨μ±μ κΈ°λ°μΌλ‘ μ€κ³νμλ€. λ³Έ μ°κ΅¬μμ μ μν μλΉμ€ μ°¨λ³ν λ° μμ ν λΉμ κ΄ν λ¬Έμ λ μλΉμ€ κ΄λ¦¬μμ μ¬μ©μ μ§λ¨ κ°μ κ²μμΌλ‘ λͺ¨λΈλ§ν μ μμΌλ©°, μ΄λ ν¬κ² λκ°μ§ ννμ κ²μμΌλ‘ ꡬλΆλλ€. μΈνμ μΌλ‘λ μλΉμ€ κ΄λ¦¬μμ μ¬μ©μ κ·Έλ£Ή κ° λ°λ³΅λ Stackelberg κ²μμ ννλ₯Ό λνλκ²λκ³ , λ΄λΆμ μΌλ‘λ μ νλ μμμ λν μ¬μ©μ κ·Έλ£Ή λ΄ μλΉμ€ μ νμ μν κ²μμ ννλ‘ ννλλ€. μ¬μ©μ κ·Έλ£Ή λ΄ κ²μμ μ΅μ ν΄λ₯Ό ꡬνκΈ° μν΄μλ Kali-Smorodinsky Bargaining Solution (KSBS)μ νμ©νμλ€.
μμΉν΄μμ μ€νμ ν΅ν΄μ λ³Έ μ°κ΅¬μμ μ μνλ κΈ°λ²μ΄ κΈ°μ‘΄μ λ€λ₯Έ λ°©λ²μ λΉν΄ λ μ’μ μμ€ν
μ±λ₯μ 보μ₯ν μ μμμ 보μλ€. νΉν, μ¬μ©μλ‘λΆν° λμ μΌλ‘ μμ²λλ ν΄λΌμ°λ μ
무λ λ λΉ λ₯Έ μκ° λ΄μ μλ£λ μ μμΌλ©°, ν¨μ©-λΉμ© λΉμ¨ κ΄μ μμλ λ λμ μμ€μ 곡μ μ±μ 보μ₯ν μ μκ² λλ€. λν μλΉμ€ μ°¨λ³ν λ¬Έμ μμλ μ¬μ©μμ λΉμ© λ―Όκ°λλ₯Ό κΈ°μ€μΌλ‘ κΈ°μ‘΄ μ°κ΅¬μμ μ±λ₯μ λΉκ΅ λΆμνμλ€. λΉκ΅ κ²°κ³Ό μλΉμ€ κ΄λ¦¬μμκ² λ ν° μμ΅μ, κ·Έλ¦¬κ³ μ¬μ©μ ν¨μ© κ΄μ μμλ λ λμ μμ€μ 곡μ μ±μ 보μ₯ν μ μλ€κ³ λ§ν μ μλ€.
λ°λΌμ, λ³Έ μ°κ΅¬μμ μ μνλ κΈ°λ²μ νμ©ν κ²½μ°, ν΄λΌμ°λ μ»΄ν¨ν
νκ²½μμ μλΉμ€ κ΄λ¦¬μλ μ νλ μμμ νλ ₯μ μΌλ‘ κ·Έλ¦¬κ³ ν¨κ³Όμ μΌλ‘ νμ©νμ¬, λμ μμ΅μ κΈ°λν¨κ³Ό λμμ λ λμ νμ§ μμ€μ μλΉμ€λ₯Ό μ¬μ©μμκ² μ 곡ν μ μμ κ²μΌλ‘ μμλλ€.Docto
(A)Study on the short channel effect of threshold voltage degradation in hydrogenated amorphous silicon thin-film transistor for AMOLED
νμλ
Όλ¬Έ(μμ¬) --μμΈλνκ΅ λνμ :μ κΈ°. μ»΄ν¨ν°κ³΅νλΆ,2006.Maste
Negotiation model and acceptance sampling plan for the complex supply chain network
Thesis(master`s)--μμΈλνκ΅ λνμ :μ°μ
곡νκ³Ό,2006.Maste
PageRank Algorithm Using Link Context
μΉμ μ 보μ μ μ₯ λ° κ²μμ μμ΄μ 보νΈμ μΈ λ§€μ²΄κ° λκ³ μλ€. μΉμμ μ 보 κ²μμ κ²μμμ§
μ μΆλ°μ μΌλ‘ μ΄μ©νλ κ²μ΄ λλΆλΆμ΄μ§λ§, κ·Έ κ²°κ³Όλ μ¬μ©μμ μꡬμ λ μΌμΉνλ κ²μ μλλ©° λλ‘λ
μλμ μΌλ‘ μ‘°μλ κ²μ κ²°κ³Όκ° μ μλκΈ°λ νλ€. κ²μμμ§μ λ°μ΄νλ₯Ό μλμ μΌλ‘ μ‘°μνλ κ²μ μ€ν¨λ°
(spamming)μ΄λΌκ³ λΆλ₯΄λ©°, λ€μν μ€ν¨λ°κ³Ό λ°©μ§κΈ°μ μ΄ μμ§λ§, μ΅κ·Όμ κ°κ΄μ λ°κ³ μλ λ§ν¬κΈ°λ° κ²μ
λ°©μμλ μ€ν¨λ°μ΄ μ½μ§ μμ κ²μΌλ‘ μλ €μ Έ μλ€. κ·Έλ¬λ μ΄λ¬ν λ°©μμμλ ꡬκΈνν(Google Bombing)
κ³Ό κ°μ΄ νμ΄μ§μ μλ²(PageRank)μ μ‘°μν μ μλ μ½μ μ΄ μλ€. λ³Έ λ
Όλ¬Έμμλ μ΄λ¬ν μ½μ μ λ°©μ§ν
μ μλ μκ³ λ¦¬μ¦μ μ μνλ€. κΈ°λ³Έμ μΌλ‘ λ§ν¬ κΈ°λ° κ²μ λ°©μμ κΈ°μ΄λ‘ νμ¬ μΉμ νλμ μ ν₯ λ μ΄λΈ
κ·Έλνλ‘ μΈμνμ¬ κ° μΉ νμ΄μ§λ€μ νλμ λ
Έλλ‘, νμ΄νΌλ§ν¬λ μμ§λ‘ ννν¨μ μμ΄μ λ³Έ μ°κ΅¬μμλ
λ§ν¬κ΅¬μ‘°λ₯Ό κΈ°λ°μΌλ‘ λ§ν¬λ΄μ(link context)μ λΆμ¬νκ³ μ΄λ₯Ό μμ§μ λ μ΄λΈλ‘ μ¬μ©νλ€. λ§ν¬λ΄μκ³Ό λμ
νμ΄μ§ μ¬μ΄μ μ μ¬λλ₯Ό ꡬνκ³ , μ΄κ²μ μ΄μ©νμ¬ νμ΄μ§μ μλ²μ μΈμ νλ ¬μ μ¬κ΅¬μ±νλ λ°©λ²μ μ·¨νλ€.
κ²°κ³Όλ‘μ¨ κΈ°μ‘΄μ λ°©λ² λ° νΉμ΄κ° μΆμΆκΈ°λ²(SVD)μ κΈ°λ°ν μλ‘μ΄ κΈ°μ€μ λμ
ν΄ κ·Έ ν¨κ³Όλ₯Ό μ
μ¦νλ€. ; The World Wide Web has become an entrenched global medium for storing and searching information. Most people begin at a Web search engine to find information, but the users pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is Web spamming as Google bombing that is based on the PageRank algorithm, one of the most famous Web structuring techniques. In this paper, we regard the Web as a directed labeled graph that Web pages represent nodes and the corresponding hyperlinks edges. In the present work, we define the label of an edge as having a link context and a similarity measure between link context and the target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. A motivating example is investigated in terms of the Singular Value Decomposition with which our algorithm can outperform to filter the Web spamming pages effectively.This work was supported by the Korea Science and Engineering Foundatino (KOSEF) through the Advanced Information Technology Research Center (AITrc)