• 제목/요약/키워드: network service pricing

검색결과 47건 처리시간 0.026초

Spectrum allocation strategy for heterogeneous wireless service based on bidding game

  • Cao, Jing;Wu, Junsheng;Yang, Wenchao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권3호
    • /
    • pp.1336-1356
    • /
    • 2017
  • The spectrum scarcity crisis has resulted in a shortage of resources for many emerging wireless services, and research on dynamic spectrum management has been used to solve this problem. Game theory can allocate resources to users in an economic way through market competition. In this paper, we propose a bidding game-based spectrum allocation mechanism in cognitive radio network. In our framework, primary networks provide heterogeneous wireless service and different numbers of channels, while secondary users have diverse bandwidth demands for transmission. Considering the features of traffic and QoS demands, we design a weighted interference graph-based grouping algorithm to divide users into several groups and construct the non-interference user-set in the first step. In the second step, we propose the dynamic bidding game-based spectrum allocation strategy; we analyze both buyer's and seller's revenue and determine the best allocation strategy. We also prove that our mechanism can achieve balanced pricing schema in competition. Theoretical and simulation results show that our strategy provides a feasible solution to improve spectrum utilization, can maximize overall utility and guarantee users' individual rationality.

네트워크 외부성을 고려한 마케팅 채널 경쟁 분석 (Analysis of Marketing Channel Competition under Network Externality)

  • 조형래;이민호;임상규
    • 산업경영시스템학회지
    • /
    • 제40권1호
    • /
    • pp.105-113
    • /
    • 2017
  • Network externality can be defined as the effect that one user of a good or service has on the value of that product to other people. When a network externality is present, the value of a product or service is dependent on the number of others using it. There exist asymmetries in network externalities between the online and traditional offline marketing channels. Technological capabilities such as interactivity and real-time communications enable the creation of virtual communities. These user communities generate significant direct as well as indirect network externalities by creating added value through user ratings, reviews and feedback, which contributes to eliminate consumers' concern for buying products without the experience of 'touch and feel'. The offline channel offers much less scope for such community building, and consequently, almost no possibility for the creation of network externality. In this study, we analyze the effect of network externality on the competition between online and conventional offline marketing channels using game theory. To do this, we first set up a two-period game model to represent the competition between online and offline marketing channels under network externalities. Numerical analysis of the Nash equilibrium solutions of the game showed that the pricing strategies of online and offline channels heavily depend not only on the strength of network externality but on the relative efficiency of online channel. When the relative efficiency of online channel is high, the online channel can greatly benefit by the network externality. On the other hand, if the relative efficiency of online channel is low, the online channel may not benefit at all by the network externality.

Analysis of Inter-Domain Collaborative Routing: Provider Competition for Clients

  • Nicholes, Martin O;Chuah, Chen-Nee;Wu, Shyhtsun Felix;Mukherjee, Biswanath
    • Journal of Communications and Networks
    • /
    • 제13권5호
    • /
    • pp.499-510
    • /
    • 2011
  • Any server offering a routing service in the Internet would naturally be in competition for clients, and clients may need to utilize service from a specific server in order to achieve a desired result. We study the various properties of this competition, such as the fraction of route requests handled by a routing service provider and the fraction of total revenue obtained. As the routing service providers (i.e., servers or routers in this context) compete, they may alter behavior in order to optimize one of the above properties. For example, a service provider may lower the price charged for its service, in order to increase the number of clients served. Our models are based on servers offering a routing service to clients within representative network topologies based on actual Internet sub-graphs. These models provide, a framework for evaluating competition in the Internet. We monitor key aspects of the service, as several variables are introduced into the models. The first variable is the fraction of client requests that will pay more for a better quality route. The remaining requests are normal client requests that are satisfied by the most economical route. The second variable is the fraction of servers who choose to lower service prices in order to maximize the number of client requests served. As this fraction increases, it is more likely that a server will lower the price. Finally, there are some resource constraints applied to the model, to increase the difficulty in providing a routing solution, i.e., to simulate a realistic scenario. We seek to understand the effect on the overall network, as service providers compete. In simple cases, we show that this competition could have a negative impact on the overall efficiency of a service. We show that the routing variety present in the larger models is unable to mask this tendency and the routing service performance is decreased due to competition.

VoLTE 활성화에 따른 요금 인하 여력 분석 (Analysis of VoLTE Charge Reduction under VoLTE Growth)

  • 이상우;정선화
    • 한국통신학회논문지
    • /
    • 제41권1호
    • /
    • pp.92-100
    • /
    • 2016
  • VoLTE는 음성과 문자까지 IP 기반으로 서비스가 제공됨에 따라 기존 서킷방식의 2G/3G망 기반 음성서비스에 비해 기술 및 원가효율성이 높아 규모의 경제 효과가 클 뿐만 아니라, 음성과 데이터가 하나의 망으로 제공되기 때문에 범위의 경제 효과 또한 큰 것으로 알려져 있다. 이러한 기술적 효율성을 기초로 VoLTE 서비스가 기존 서킷방식의 음성서비스에 비해 원가적 측면에서 비용효율성이 얼마나 큰지 혹은 상대적으로 높은 원가효율성을 지니고 있는 VoLTE 서비스가 활성화될 경우 이에 따라 사업자들에게는 얼마만큼의 요금인하 여력을 제공할 수 있는지에 대한 연구는 전무한 상황이다. 본 논문에서는 기존 서킷방식의 음성서비스 대비 VoLTE 서비스의 상대적 원가효율성 규모를 분석하고, 이를 기초로 VoLTE 서비스 활성화 정도에 따른 음성서비스 요금 인하 여력이 얼마만큼 될 것인지를 계량적으로 분석하였다. 분석결과 첫째 음성통화량이 고정되어 있다는 가정하에 단기적으로는 VoLTE 서비스 제공을 위해 LTE망 구축 투자비 발생으로 인해 평균비용이 상승하나, VoLTE의 상대적 우수한 원가효율성에 따라 VoLTE 전환율이 높아질수록 음성서비스의 요금인하 여력이 발생되는 것으로 분석되었다. 둘째, 모든 음성통화량이 VoLTE로 전이될 경우 음성서비스 요금은 현재 요금 수준의 약 60%까지 인하될 여력이 존재하며, 이에 따라 데이터서비스 중심으로 과금하는 요금안의 정당성을 일부 확보할 수 있음을 증명하였다. 본 연구 결과를 통해 통신사업자에게는 요금전략 수립시 기초자료로 활용될 수 있으며, 정책적으로는 요금인하를 유도할 수 있는 정책자료로 활용될 수 있을 것으로 기대된다.

Machine Learning based Prediction of The Value of Buildings

  • Lee, Woosik;Kim, Namgi;Choi, Yoon-Ho;Kim, Yong Soo;Lee, Byoung-Dai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권8호
    • /
    • pp.3966-3991
    • /
    • 2018
  • Due to the lack of visualization services and organic combinations between public and private buildings data, the usability of the basic map has remained low. To address this issue, this paper reports on a solution that organically combines public and private data while providing visualization services to general users. For this purpose, factors that can affect building prices first were examined in order to define the related data attributes. To extract the relevant data attributes, this paper presents a method of acquiring public information data and real estate-related information, as provided by private real estate portal sites. The paper also proposes a pretreatment process required for intelligent machine learning. This report goes on to suggest an intelligent machine learning algorithm that predicts buildings' value pricing and future value by using big data regarding buildings' spatial information, as acquired from a database containing building value attributes. The algorithm's availability was tested by establishing a prototype targeting pilot areas, including Suwon, Anyang, and Gunpo in South Korea. Finally, a prototype visualization solution was developed in order to allow general users to effectively use buildings' value ranking and value pricing, as predicted by intelligent machine learning.

Handover Management Based on Loca-tion Based Services in F-HMIPv6 Net-works

  • Nashaat, Heba;Rizk, Rawya
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권12호
    • /
    • pp.5028-5057
    • /
    • 2015
  • In this paper, a new mathematical scheme of Macro Handover Management (MHM) in F-HMIPv6 networks based on Location Based Services (LBS) is proposed. Previous schemes based on F-HMIPv6 protocol usually suffer from three major drawbacks: First, They don't exploit the information about the user mobility behavior in order to reduce handover effects. Second, they only focus on the micro mobility level. Third, they don't consider the quality of service (QoS) of the traffic. The proposed MHM scheme avoids these drawbacks using the available information about Mobile Node (MN) such as user mobility patterns and MN's velocity to predict handover and improve network's QoS. It also takes the traffic type in consideration since it presents a major factor in locating QoS for the user. MHM is analyzed and compared with the F-HMIPv6. The results show that MHM improves the performance in terms of packet delivery cost, location update cost, and handover latency. The design of MHM comprises software package in the MN in addition to a hardware part in the network side. It has implications for communication, design, and pricing of mobile services.

QoS- and Revenue Aware Adaptive Scheduling Algorithm

  • Joutsensalo, Jyrki;Hamalainen, Timo;Sayenko, Alexander;Paakkonen, Mikko
    • Journal of Communications and Networks
    • /
    • 제6권1호
    • /
    • pp.68-77
    • /
    • 2004
  • In the near future packet networks should support applications which can not predict their traffic requirements in advance, but still have tight quality of service requirements, e.g., guaranteed bandwidth, jitter, and packet loss. These dynamic characteristics mean that the sources can be made to modify their data transfer rates according to network conditions. Depending on the customer&; needs, network operator can differentiate incoming connections and handle those in the buffers and the interfaces in different ways. In this paper, dynamic QoS-aware scheduling algorithm is presented and investigated in the single node case. The purpose of the algorithm is in addition to fair resource sharing to different types of traffic classes with different priorities ?to maximize revenue of the service provider. It is derived from the linear type of revenue target function, and closed form globally optimal formula is presented. The method is computationally inexpensive, while still producing maximal revenue. Due to the simplicity of the algorithm, it can operate in the highly nonstationary environments. In addition, it is nonparametric and deterministic in the sense that it uses only the information about the number of users and their traffic classes, not about call density functions or duration distributions. Also, Call Admission Control (CAC) mechanism is used by hypothesis testing.

조직 생태학 관점에서 본 플랫폼 이해관계자들간의 상호 작용 및 전략 (Platform Interaction and Strategy from the Perspective of Organizational Ecology)

  • 이성호;배성주
    • 기술혁신학회지
    • /
    • 제22권2호
    • /
    • pp.220-241
    • /
    • 2019
  • 본 연구는 플랫폼 생태계 이해관계자간의 공생, 경쟁 관계를 분석하는 이론적 프레임을 구축하고, 플랫폼 제공자와 서비스 제공자간 상호 작용 및 전략을 연구했다. 플랫폼 제공자는 서비스 제공자에 사용자 기반을 제공하며, 서비스 제공자는 플랫폼 제공자에 서비스를 제공하며 공생 관계를 맺는다. 더불어 플랫폼 제공자, 서비스 제공자는 다른 플랫폼 제공자, 서비스 제공자와 경쟁 관계를 형성하며 다양한 상호작용을 만든다. 기존 연구들은 플랫폼 제공자 관점에서 네트워크 효과를 높이는 전략에 집중하고 있다. 본 연구는 조직 생태학의 커뮤니티 이론을 통해 플랫폼 개방, 가격전략에서 플랫폼 제공자와 서비스 제공자간 상호 작용 및 상호 전략을 살펴보았다. 플랫폼 개방, 고가 가격 전락은 서비스 제공자를 늘리고, 이익을 늘리나, 서비스 제공자간 경쟁을 높이고, 서비스 제공자의 이익을 감소시켜 경쟁플랫폼으로의 이동을 촉진해 플랫폼 경쟁력을 약화시킨다. 이에 플랫폼 제공자는 서비스 제공자에 차별적인 플랫폼 자원 제공, 가격 정책을 펼치며 서비스 제공자는 싱글호밍을 통해 공생을 강화하거나, 멀티호밍으로 사용자 기반을 확대하며 플랫폼 생태계에 다양한 상호작용을 만든다.

광대역 ISDN 서비스의 과금체계 및 과금요소 연구 (A remark on the tariff system and the billing parameters of B-ISDN services)

  • 강국창;이영용;오형식;이덕주;노장래
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
    • /
    • pp.328-332
    • /
    • 1996
  • B-ISDN is expected to be a main vehicle of future telecommunications. There has been a series fo studies on the demand and the market prospect of B-ISDN services. It is true, however, that they lacked some economic reality since the price of services has been overlooked which is a critical economic factor. In this study, we analyze some aspects of the tariff system of B-ISDN services. First, we explore and summarize the billing parameters of B-ISDN services from diverse characteristics of services and ATM network. These parameters are essential if the services are to be charged based on usage. Secondly, we discuss what factors be considered in the design fo B-ISDN services tariff systems from various points of view shch as traffic charactristics, information types and connection types, etc. The results of this study will offer fundamental insights in the design of B-ISDN service pricing scheme and provide reference for efficient services providing.

  • PDF

Value of Number Portability on Internet Phones

  • Ku, Jung-Eun;Lee, Sang-Woo;Hyun, Tchang-Hee
    • ETRI Journal
    • /
    • 제32권1호
    • /
    • pp.169-171
    • /
    • 2010
  • Even though Internet phone service (IPS) continues to evolve in terms of quality and competitive pricing compared with the public switched telephone network (PSTN), the number of Internet phone subscribers is still low in South Korea. The Korean government decided to apply number portability to the IPS market in 2008. This study expresses its value in monetary terms with a contingent valuation approach. With this methodology, this study investigates the willingness of 316 current PSTN subscribers to pay for IPS, using a specific survey method called double-bounded dichotomous choices, to obtain more accurate data. The results show that the calculated value of Internet phone number portability positively impacts consumer welfare.