KR20200027457A - Method for managing service entry - Google Patents

Abstract

Disclosed is a service entry management method according to an embodiment of the present disclosure. The operation stored in the computer program for the processing of the method may include an operation of processing an entry attempt for the service when the number of accesses of the service is less than the number of access control operation setting accesses for an attempt to enter the service; When the number of accesses of the service is greater than or equal to the number of access control operation settings and less than the maximum number of accesses for the access attempt, the access attempt is processed or the wait for access is processed according to the access probability determined based on the number of accesses of the service. A process of processing the entry attempt to the service based on probability; And when the number of accesses of the service is greater than or equal to the maximum number of accesses for the entry attempt, processing the standby attempt to enter the service for the entry attempt for the service.

Description

Service entry management method {METHOD FOR MANAGING SERVICE ENTRY}

The present invention relates to a service entry management method using a computing device, and more particularly, to a solution for managing entry of users accessing a game.

As the online game market becomes active, the number of users accessing the game has rapidly increased. While there are limits on the servers that operate online games, the number of users who want to use online games may be more than the limits that the server can accommodate.

In the online game, when a user accesses within a limit that the server can accept, users are allowed to enter, and when the server reaches an unacceptable limit, the entire server is paralyzed. Therefore, research is being conducted on how service servers including online games can manage users' entry within limits that the server can accommodate.

Republic of Korea Patent Publication No. 10-2017-0022057 discloses a method for managing a server.

The present disclosure has been devised in response to the background art described above, and has an object to provide a service entry management method.

Disclosed is a computer program stored in a computer-readable storage medium in accordance with one embodiment of the present disclosure for realizing the above-described problems. The computer program, when executed on one or more processors of the computing device, performs the following operations for service entry management, and the operations are: when the number of accesses of the service is less than the number of access control operation set accesses for an attempt to enter the service, An operation of processing an entry attempt for the service; When the number of accesses of the service is greater than or equal to the number of access control operation settings and less than the maximum number of accesses for the access attempt, the access attempt is processed or the wait for access is processed according to the access probability determined based on the number of accesses of the service. A process of processing the entry attempt to the service based on probability; And when the number of accesses of the service is greater than or equal to the maximum number of accesses for the access attempt, may include an operation of waiting for the access to enter the service.

In an alternative embodiment of computer program operations to perform the following operations for service entry management, for the user terminal processed to wait for service entry based on the probability-based access control process, the service of the service at the time of the entry attempt The method may further include determining a waiting time for entry processing based on the number of users.

In an alternative embodiment of computer program operations to perform the following operations for service entry management, when an entry processing attempt is received for an entry attempt processed for waiting for service entry, the entry processing attempt starts from the service entry waiting processing. The method may further include an operation of determining waiting for service entry or processing for service entry based on the time interval until.

In an alternative embodiment of computer program operations to perform the following operations for service entry management, when a waiting time for service entry processing elapses from the service entry waiting process for the user terminal processed to wait for service entry, The method may further include transmitting a service entry notification to the user terminal processed to wait for service entry.

In an alternative embodiment of computer program operations to perform the following operations for service entry management, the method may further include transmitting an alternative service list to the user terminal that has been queued for service entry.

In an alternative embodiment of computer program operations to perform the following operations for service entry management, receiving that the user terminal is accessing the alternative service server from at least one alternative service server included in the alternative service list In this case, an operation of determining that the waiting time for the service entry processing of the user terminal is reduced may be further included.

In an alternative embodiment of computer program operations to perform the following operations for service entry management, when the alternative service selection input for at least one included in the alternative service list is received from the user terminal, the alternative service If it is executable in the user terminal, transmitting a control signal to the user terminal so that the replacement service is executed; And when the replacement service is in a non-executable state in the user terminal, transmitting the control signal to the user terminal so that the user terminal can execute the replacement service.

In an alternative embodiment of computer program operations to perform the following operations for service entry management, the alternative service list is output by calculating an alternative service judgment model including the user's game data including one or more network functions. It may include at least one of a replacement service, a replacement service selected based on the genre of the service, a replacement service selected based on a service execution history of the user terminal, and a promotion replacement service.

In an alternative embodiment of computer program operations to perform the following operations for service entry management, the alternative service determination model analyzes game data of the user to determine an alternative service to be provided to the user terminal A decision policy submodel may be included, and the replacement service decision policy may be updated based on the usage record of the user terminal for the replacement service.

In an alternative embodiment of computer program operations to perform the following operations for service entry management, the probability-based access control process is performed in response to the entry attempt as the number of accesses of the service approaches the number of access control operation set accesses. The probability of the entry processing increases, and as the number of accesses of the service approaches the maximum number of accesses, the probability of processing to wait for the entry may increase.

In an alternative embodiment of computer program operations to perform the following operations for service entry management, the probability-based access control processing includes game data of a user identified based on an attempt to enter the service and the number of users of the service The entry processing probability may be increased based on at least one of the above.

Disclosed is a service entry management method according to another embodiment of the present disclosure. The method includes: when the number of accesses of the service is less than the number of access control operation setting accesses for an attempt to enter the service, processing the attempt to enter the service by entering the service; When the number of accesses of the service is greater than or equal to the number of access control operation settings and less than the maximum number of accesses for the access attempt, the access attempt is processed or the wait for access is processed according to the access probability determined based on the number of accesses of the service. A process of processing the entry attempt for the service based on probability based on probability; And when the number of accesses of the service is greater than or equal to the maximum number of accesses for the access attempt, may include waiting for the access to enter the service.

A computing device is disclosed in accordance with another embodiment of the present disclosure. The computing device includes a processor including one or more cores; And memory; Including, when the number of users of the service for the attempt to enter the service is less than the number of access control operation setting users, the processor processes the attempt to enter the service, and the number of users of the service for the attempt to enter the service. If the number of access control operation setting access numbers is greater than or less than the maximum number of access settings, the access attempt for the service is processed by the service access processing or waiting to enter, according to the access probability determined based on the access number of the service. When the access control processing is based on probability, and the number of accesses of the service is greater than or equal to the maximum number of accesses for the access attempt, the access attempt for the service may be processed to wait for access to the service.

The present disclosure can provide a service entry management method.

1 is a block diagram of a computing device performing an operation for managing service entry according to an embodiment of the present disclosure.
2 is a diagram illustrating service entry management according to an embodiment of the present disclosure.
3 is a diagram illustrating service entry management according to an embodiment of the present disclosure.
4 is a diagram illustrating service entry management according to an embodiment of the present disclosure.
5 is a diagram illustrating an alternative service provision notification according to an embodiment of the present disclosure.
6 is a flowchart of a service entry management method according to an embodiment of the present disclosure.
7 is a timing diagram of a service entry management method according to an embodiment of the present disclosure.
8 is a block diagram illustrating logic for implementing a service entry management method according to an embodiment of the present disclosure.
9 is a block diagram illustrating a module for implementing a service entry management method according to an embodiment of the present disclosure.
10 is a block diagram illustrating a circuit for implementing a service entry management method according to an embodiment of the present disclosure.
11 is a block diagram illustrating a means for implementing a service entry management method according to an embodiment of the present disclosure.
12 is a block diagram of a computing device according to an embodiment of the present disclosure.

Various embodiments are now described with reference to the drawings. In this specification, various descriptions are presented to provide an understanding of the present disclosure. However, it is apparent that these embodiments can be practiced without these specific details.

As used herein, the terms “component”, “module”, “system” and the like refer to computer-related entities, hardware, firmware, software, combinations of software and hardware, or execution of software. For example, a component can be, but is not limited to, a process executed on a processor, a processor, an object, a thread of execution, a program, and / or a computer. For example, both the application and the computing device running on the computing device can be components. One or more components can reside within a processor and / or thread of execution. One component can be localized in one computer. One component can be distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored therein. Components are, for example, signals having one or more data packets (e.g., data and / or signals from one component interacting with other components in a local system, distributed system, etc.) through other systems and networks such as the Internet. (Transmitted data) may be communicated through local and / or remote processes.

In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or”. That is, unless specified otherwise or unclear in context, "X uses A or B" is intended to mean one of the natural inclusive substitutions. That is, X uses A; X uses B; Or, if X uses both A and B, "X uses A or B" can be applied in either of these cases. Also, it is to be understood that the term "and / or" as used herein refers to and includes all possible combinations of one or more of the listed related items.

In addition, the terms "comprises" and / or "comprising" should be understood to mean that the corresponding features and / or components are present. It should be understood, however, that the terms “comprises” and / or “comprising” do not exclude the presence or addition of one or more other features, elements, and / or groups thereof. In addition, unless otherwise specified or contextually unclear as indicating a singular form, the singular in the specification and claims should generally be construed to mean "one or more."

Those skilled in the art will further appreciate that the various illustrative logical blocks, configurations, modules, circuits, means, logics, and algorithm steps described in connection with the embodiments disclosed herein may be electronic hardware, computer software, or a combination of both. It should be appreciated that it can be implemented with To clearly illustrate the interchangeability of hardware and software, various illustrative components, blocks, configurations, means, logics, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented in hardware or as software depends on the specific application and design limitations imposed on the overall system. Skilled technicians can implement the functionality described in various ways for each particular application. However, such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

Descriptions of the presented embodiments are provided so that those skilled in the art of the present disclosure may use or practice the present invention. Various modifications to these embodiments will be apparent to those skilled in the art of the present disclosure. The general principles defined herein can be applied to other embodiments without departing from the scope of the present disclosure. Thus, the present invention is not limited to the embodiments presented herein. The invention should be interpreted in its broadest scope consistent with the principles and novel features presented herein.

In one embodiment of the present disclosure, the server may include other configurations for performing the server environment of the server. The server can include any type of device. The server is a digital device, and may be a digital device equipped with a processor and having computing power, such as a laptop computer, a notebook computer, a desktop computer, a web pad, and a mobile phone. The server may be a web server that handles services. The above-mentioned types of servers are only examples, and the present disclosure is not limited thereto.

In this specification, network functions may be used interchangeably with artificial neural networks and neural networks. In this specification, the network function may include one or more neural networks, and in this case, the output of the network function may be an ensemble of the output of the one or more neural networks.

In the present specification, the model may include a network function. The model may include one or more network functions, in which case the output of the model may be an ensemble of the output of one or more network functions.

1 is a block diagram of a computing device performing an operation for managing service entry according to an embodiment of the present disclosure.

The configuration of the computing device 100 illustrated in FIG. 1 is a simplified example. In one embodiment of the present disclosure, the computing device 100 may include other configurations for performing the computing environment of the computing device 100.

The computing device 100 may include a network unit 110, a processor 120, and a memory 130. The computing device of the present disclosure may include a game server of a game service company.

The network unit 110 may transmit / receive data, etc. for performing a game player management method according to an embodiment of the present disclosure to other computing devices, servers, and the like. The network unit 110 may transmit / receive data necessary for an embodiment of the present disclosure, such as game data, information on a substitute service list, user information, and information on whether to connect to the alternative service, to other computing devices, servers, and the like. For example, the network unit 110 may receive user information from a user terminal. Also, for example, the network unit 110 may receive information about whether a user accesses the alternative service from the alternative service server. The network unit 110 enables communication between a plurality of computing devices to distribute processing of a user's entry scheduling in each of the plurality of computing devices. The network unit 110 may enable communication between a plurality of computing devices so that learning of a model is distributed in each of the plurality of computing devices. The network unit 110 may enable communication between a plurality of computing devices to perform distributed processing for alternative services.

The processor 120 may include one or more cores, a central processing unit (CPU) of a computing device, a general purpose graphics processing unit (GPGPU), and a tensor processing unit (TPU). unit), and a processor for user entry scheduling or deep learning. The processor 120 may read a computer program stored in the memory 130 to perform a service entry management method according to an embodiment of the present disclosure. According to an embodiment of the present disclosure, the processor 120 may perform calculation for probability-based access control processing for service entry. According to an embodiment of the present disclosure, the processor 120 may perform calculation for learning a neural network. The processor 120 may perform processing of input data for learning in deep learning (DN), feature extraction from input data, error calculation, and weight update of the neural network using backpropagation. You can perform calculations for learning.

At least one of the CPU, GPGPU, and TPU of the processor 120 may process entry, wait for entry, and probability-based access control for the service entry attempt. At least one of the CPU, GPGPU, and TPU of the processor 120 may process training of the model. For example, the CPU and GPGPU can process the service entry control, train the model, and replace the model with the service operation. In addition, in an embodiment of the present disclosure, a processor for controlling a service entry, scheduling a service entry for a plurality of service entry, and alternative service operation may be processed by using processors of a plurality of computing devices together. Further, the computer program executed in the computing device according to an embodiment of the present disclosure may be a CPU, GPGPU, or TPU executable program.

In one embodiment of the present disclosure, the computing device 100 may distribute and process a service entry scheduling or model by using at least one of a CPU, GPGPU, and TPU. In addition, in one embodiment of the present disclosure, the computing device 100 may process a service entry scheduling or model in a distributed manner with other computing devices.

Hereinafter, a control method for an attempt to enter a service according to an embodiment of the present disclosure will be described.

The processor 120 may receive information on the pre-user authentication process from the user terminal through the network unit 110. The user authentication pre-processing may include an operation in which the processor 120 determines whether a corresponding service is executable in a user terminal. The user authentication pre-processing may include an operation in which the processor 120 transmits a control signal through the network unit 110 so that the corresponding service is executable in the user terminal when the corresponding service is not executable in the user terminal. have. When the file for executing the service is not installed in the user terminal, the processor 120 transmits a file for executing the service through the network unit 110 so that the file for executing the service is installed in the user terminal. You can. When a file for executing a corresponding service is installed in a user terminal, the processor 120 may receive version information of a file for executing a service through the network unit 110. The processor 120 may compare whether the latest version information stored in the memory 130 for executing the service matches the version information received from the user terminal through the network unit 110. When the latest version information stored in the memory 130 and the version information received from the user terminal through the network unit 110 do not match, the processor 120 corresponds to the latest version information through the network unit 110. Some or all of the update files may be transmitted to the user terminal, so that the latest version of the service is executed on the user terminal. The processor 120 may transmit an update file corresponding to the latest version information and a resource based on the update file to the user terminal, so that the service of the latest version is executed on the user terminal. The above description of the pre-user authentication process is merely an example, and the present disclosure is not limited thereto.

The processor 120 may receive user authentication information from the user terminal through the network unit 110. User authentication may include information to identify the user to other users. The processor 120 may receive a user ID and password, a user's mobile phone number, and authentication through a user authentication certificate from the user terminal through the network unit 110. The processor 120 may control the user terminal to execute another service application that has a user login for user authentication through the network unit 110. The processor 120 may receive user authentication information from the other service application server through the network unit 110. For example, the processor 120 of the game server A may transmit a control signal to execute the messenger application C in order to perform user authentication to the terminal of the user B through the network unit 110. For example, the processor 120 of the game server A may receive user authentication information from the messenger application C server through the network unit 110 to perform user authentication. The above description of user authentication is only an example, and the present disclosure is not limited thereto.

The processor 120 may receive an attempt to enter the service from the user terminal through the network unit 110. The processor 120 may control an attempt to enter the service based on the number of users of the service stored in the memory 130, user information attempting to enter the service, the number of access control operation setting users, and the maximum number of access users.

The processor 120 may process an attempt to enter the service when the number of accesses of the service is less than the number of access control operation set accesses for an attempt to enter the service. The service entry processing may mean that an identified user terminal can use the service based on the entry attempt with respect to an attempt to enter the service. The processor 120 may transmit a service entry notification to the user terminal through the network unit 110. The processor 120 may store information about a user who has entered the service in the memory 130.

식에 따라 서비스 접속자의 진입 처리 확률을 결정할 수 있다. 상기 로지스틱 회귀모델에 기초한

식에서 독립변수 x는 서비스의 현재 접속자수, 종속변수 y는 서비스 진입 확률, a는 서비스 진입 확률을 조정하기 위한 값, 그리고 b는 서비스의 접속자수에 따른 서비스 진입 확률을 조정하기 위한 값일 수 있다. a 및 b는 각각 임의의 값을 가질 수 있다. 독립변수 x인 서비스의 접속자수에 기초하여 종속변수 y인 서비스 진입 확률이 결정될 수 있다. 프로세서(120)는 서비스의 접속자수가 접속 제어 동작 설정 접속자수인 경우부터 최대 설정 접속자수인 경우까지 서비스의 접속자에게 확률 기반 접속 제어 처리를 할 수 있다. 도 4를 참조하면, 프로세서(120)는 접속 제어 동작 설정 접속자수인 경우부터 최대 설정 접속자수인 경우까지 상기 로지스틱 회귀모델에 기초한 확률 기반 접속 제어처리를 수행할 수 있다. 프로세서(120)는 상기 로지스틱 회귀모델식에서 a 및 b 중 적어도 하나의 값을 변경하여 서비스에 대한 서비스 진입 처리 확률을 변경할 수 있다. 프로세서(120)는 상기 로지스틱 회귀모델식에서 a 및 b 중 적어도 하나의 값을 변경하여 전체 서비스 접속자에 대한 서비스 진입 확률을 조정할 수 있다. 예를 들어, 도 4를 참조하면, 프로세서(120)가 상기 로지스틱 회귀모델식의 a 및 b 중 적어도 하나의 값을 증가시키는 경우 x 값(본 예시에서 서비스의 접속자수(310))이 동일한 값일 때 y 값(본 예시에서 서비스 진입 확률(410))이 증가할 수 있다. 상기 예시에서 로지스틱 회귀모델식의 a 및 b 중 적어도 하나의 값을 증가시키는 경우, 도 4의 그래프가 x축 방향으로 +b 만큼 및 y축 방향으로 +a 만큼 중 적어도 한 방향으로 평행 이동할 수 있다. 또한 예를 들어, 도 4를 참조하면, 프로세서(120)가 상기 로지스틱 회귀모델식의 a 및 b 중 적어도 하나의 값을 감소시키는 경우 x 값(본 예시에서 서비스의 접속자수(310))이 동일한 값일 때 y 값(본 예시에서 서비스 진입 확률(410))이 감소할 수 있다. 상기 예시에서 로지스틱 회귀모델식의 a 및 b 중 적어도 하나의 값을 감소시키는 경우, 도 4의 그래프가 x축 방향으로 -b 만큼 및 y축 방향으로 -a 만큼 중 적어도 한 방향으로 평행 이동할 수 있다. 예를 들어, 도 4를 참조하면, 프로세서(120)가 상기 로지스틱 회귀모델식의 b 값을 변경하는 경우, 도 4의 그래프는 -b 만큼 또는 +b 만큼 x축에 대해 평행이동 할 수 있다. 예를 들어, 도 4를 참조하면, 프로세서(120)가 상기 로지스틱 회귀모델식의 a 값을 변경하는 경우, 도 4의 그래프는 -a 만큼 또는 +a 만큼 y축에 대해 평행 이동할 수 있다. 예를 들어, 프로세서(120)는 전체 서비스 사용자에 대한 서비스 진입 확률을 변경하기 위하여, 상기 로지스틱 회귀모델식에서 서비스의 접속자수에 따른 서비스 진입 확률을 조정하기 위한 값인 b를 변경할 수 있다. 예를 들어, 프로세서(120)는 상기 로지스틱 회귀모델식에서 서비스의 접속자수에 따른 서비스 진입 확률을 조정하기 위한 값인 b를 증가시키는 경우 전체 서비스 접속자들의 서비스 진입 확률은 증가할 수 있고, 상기 b 값을 감소시키는 경우 전체 서비스 접속자들의 서비스 진입 확률은 감소할 수 있다. 프로세서(120)는 상기 로지스틱 회귀모델식에서 a 및 b 중 적어도 하나의 값을 변경하여 전체 서비스 접속자 중 일부 서비스 접속자에 대한 서비스 진입 확률을 조정할 수 있다. 프로세서(120)는 진입 시도한 서비스의 사용자의 게임 데이터에 기초하여 각각의 사용자에 대해 서비스 진입 확률을 조정할 수 있다. 예를 들어, 사용자 A의 게임 데이터 중 유료 재화 구입 횟수 항목 데이터가 사전 결정된 값 이상인 경우, 프로세서(120)는 사용자 A의 서비스 진입 확률을 증가시키기 위하여 상기 로지스틱 회귀모델식에서 a 및 b 중 적어도 하나의 값을 증가시킬 수 있다. 예를 들어, 프로세서(120)는 서비스의 일부 사용자에 대한 서비스 진입 확률을 변경하기 위하여, 상기 로지스틱 회귀모델식에서 서비스 진입 확률을 조정하기 위한 값인 a를 변경할 수 있다. 예를 들어, 프로세서(120)는 상기 로지스틱 회귀모델식에서 서비스 진입 확률을 조정하기 위한 값인 a를 증가시키는 경우 서비스의 일부 접속자들의 서비스 진입 확률은 증가할 수 있고, 상기 a 값을 감소시키는 경우 서비스의 일부 접속자들의 서비스 진입 확률은 감소할 수 있다. 예를 들어, 상기 로지스틱 회귀모델식에서 접속 제어 동작 설정 접속자수가 5,000, 최대 설정 접속자수가 8,000,

가 0, 그리고

1000인 경우, x값인 서비스의 접속자수가 6000(즉, 서비스의 접속자수가 접속 제어 동작 설정 접속자수(5000) + b(1000)인 경우)일 때의 서비스 진입 처리 확률은 50%일 수 있다. 전술한 확률 기반 접속 제어 처리에 대한 기재는 예시일 뿐이며, 본개시는 이에 제한되지 않는다. 예를 들어, 본 개시의 일 실시예에서 프로세서(120)는 서비스의 접속자의 변동 속도에 기초하여 a 및 b값을 조정할 수 있다. 예를 들어, 프로세서(120)는 서비스의 접속자가 급증하는 경우, 서비스의 접속자 수가 최대 접속자 수에 보다 천천히 도달하도록 하기 위하여 a 및 b값을 감소시켜 접속 제어 동작의 서비스 진입 처리 확률을 하향 조정할 수 있다. 프로세서(120)는 서비스의 접속자의 증가 속도가 낮은 새벽 시간대의 경우, 사용자의 불필요한 대기를 방지하기 위하여 프로세서는 a 및 b값을 증가시켜 접속 제어 동작의 서비스 진입 처리 확률을 상향 조정할 수 있다. 또한 프로세서(120)는 서비스 접속 제어 동작 설정 접속자수와 최대 설정 접속자 수의 비율에 기초하여 a 및 b 값을 조정할 수도 있다. 예를 들어, 서비스 접속 제어 동작 설정 접속자 수가 최대 설정 접속자 수에 가까울수록, 프로세서(120)는 a 및 b 값을 감소시켜 접속 제어 동작의 서비스 진입 처리 확률을 하향 조정할 수도 있다. The processor 120 attempts to enter the service according to the probability of entry determined based on the number of users of the service when the number of users of the service is greater than or equal to the number of access control operation settings and the maximum number of users for the service attempt to enter the service. A probability-based access control process may be performed on the attempt to enter the service, which is a service entry process or an entry waiting process. That is, it is common to process all the entry attempts received when the number of the maximum set of users is less than one, but in one embodiment of the present disclosure, even if the current number of users is less than the maximum number of set users, the user receives more than a predetermined number of users. Entry processing may be performed for the attempted entry, or standby processing may be performed, and entry processing or waiting processing may be determined with a probability determined based on the number of current users, the number of access control operation setting users, and probability correction. The processor 120 may control the service entry attempt so that the probability of entry processing for the entry attempt increases as the number of access users of the service approaches the number of access control operation setting users. The processor 120 may control an attempt to enter the service such that the probability of processing to wait for an entry attempt increases as the number of accesses of the service approaches the maximum number of accesses. The probability of entry processing and the probability of processing waiting for entry may be inversely related. The total sum of the probability of entry processing and the probability of processing waiting for entry may be 100%. Based on the logistic regression model, the processor 120 may determine the probability of processing for entering and waiting for the service according to the number of users of the service. The logistic regression model can be used to predict the likelihood of an independent variable by indicating the relationship between the dependent variable and the independent variable. According to an embodiment of the present disclosure, the dependent variable of the logistic regression model may be the number of users of the service, and the independent variable may be the probability of processing an entry or waiting for an entry. Processor 120 is based on a logistic regression model

According to the equation, it is possible to determine the probability of the service access entry. Based on the logistic regression model

In the equation, the independent variable x may be the current number of users of the service, the dependent variable y is the service entry probability, a is a value for adjusting the service entry probability, and b may be a value for adjusting the service entry probability according to the number of users of the service. a and b may each have any value. The probability of entering the service, which is the dependent variable y, may be determined based on the number of users of the service, which is the independent variable x. The processor 120 may perform probability-based access control processing to the accessor of the service, from the number of accessor of the service to the number of accessor setting operation accessor to the maximum number of accessor. Referring to FIG. 4, the processor 120 may perform probability-based access control processing based on the logistic regression model from the case of the access control operation setting access number to the maximum number of access access settings. The processor 120 may change a service entry processing probability for a service by changing at least one of a and b in the logistic regression model equation. The processor 120 may adjust a service entry probability for all service accessors by changing at least one of a and b in the logistic regression model equation. For example, referring to FIG. 4, when the processor 120 increases the value of at least one of a and b of the logistic regression model equation, the x value (in this example, the number of users connected to the service 310) may be the same value. When the y value (service entry probability 410 in this example) may increase. In the above example, when the value of at least one of a and b of the logistic regression model is increased, the graph of FIG. 4 may move in parallel in at least one of + b in the x-axis direction and + a in the y-axis direction. . Also, for example, referring to FIG. 4, when the processor 120 decreases at least one value of a and b in the logistic regression model equation, the x value (the number of users 310 of services in this example) is the same. When the value is y value (in this example, the service entry probability 410) may decrease. In the above example, when at least one value of a and b of the logistic regression model equation is reduced, the graph of FIG. 4 may move in parallel in at least one of -b in the x-axis direction and -a in the y-axis direction. . For example, referring to FIG. 4, when the processor 120 changes the b value of the logistic regression model equation, the graph of FIG. 4 may be translated about x axis by -b or + b. For example, referring to FIG. 4, when the processor 120 changes the a value of the logistic regression model equation, the graph of FIG. 4 may be shifted by -a or + a by y axis. For example, the processor 120 may change the value b, which is a value for adjusting the probability of entering the service according to the number of users of the service in the logistic regression model equation, in order to change the probability of entering the service for all service users. For example, when the processor 120 increases the value b for adjusting the service entry probability according to the number of users of the service in the logistic regression model, the service entry probability of all service users may increase, and the b value may be increased. If reduced, the probability of service entry of all service users may decrease. The processor 120 may adjust a service entry probability for some service accessors among all service accessors by changing at least one value of a and b in the logistic regression model equation. The processor 120 may adjust the service entry probability for each user based on the game data of the user of the service attempted to enter. For example, when the number of paid goods purchase item data among the game data of the user A is equal to or greater than a predetermined value, the processor 120 increases at least one of a and b in the logistic regression model equation to increase the probability of the user A entering the service. You can increase the value. For example, the processor 120 may change the value a for adjusting the probability of entering the service in the logistic regression model equation in order to change the probability of entering the service for some users of the service. For example, when the value of a for adjusting the service entry probability in the logistic regression model equation is increased, the processor 120 may increase the service entry probability of some users of the service and decrease the value of a. The probability of some users entering the service may decrease. For example, in the logistic regression model, the number of access control operation setting users is 5,000, the maximum number of setting access users is 8,000,

Is 0, and

In the case of 1000, the service entry processing probability when the number of accesses of the service having the value of x is 6000 (that is, the number of accesses of the service is the number of access control operation setting accessees 5000 + b (1000)) may be 50%. The description of the above-described probability-based access control processing is only an example, and the present disclosure is not limited thereto. For example, in one embodiment of the present disclosure, the processor 120 may adjust the values of a and b based on the rate of change of the accessor of the service. For example, when the number of users of a service increases rapidly, the processor 120 may decrease the values of a and b to decrease the a and b values so that the number of users of the service reaches the maximum number of users more slowly. have. The processor 120 may increase the a and b values of the processor in order to prevent unnecessary waiting of the user in the early morning period when the increase rate of the accessor of the service is low, and thus increase the probability of the service entry processing of the access control operation. In addition, the processor 120 may adjust the values of a and b based on the ratio of the service access control operation setting access number and the maximum setting access number. For example, as the number of service access control operation setting accessors approaches the maximum number of accessors, the processor 120 may decrease the values of a and b to lower the probability of access to the service of the access control operation.

식의 상수인

값을 변경함으로써,

인 기본 로지스틱 회귀 모델의 서비스 진입 처리 확률보다 더 높은 확률로 사용자 단말에 서비스 진입처리 확률을 제공할 수 있다. 예를 들어, 프로세서(120)는 상기 서비스의 진입 시도에 기초하여 식별되는 사용자의 최종 접속 기록에 기초하여, 사용자의 최종 접속 기록 시점부터 상기 서비스 진입 시도 시점까지의 시간 구간의 길이가 사전 결정된 시간 구간의 길이보다 긴 경우, 로지스틱 회귀 모델에 기초한 서비스 진입 처리 확률보다 사전 결정된 확률만큼 더 높은 확률로 서비스 진입 처리 확률을 제공할 수 있다. 프로세서(120)는 상기 서비스의 진입 시도에 기초하여 식별되는 사용자의 최종 접속 기록이 없는 경우(즉, 서비스의 신규 사용자), 로지스틱 회귀 모델에 기초한 서비스 진입 처리 확률보다 사전 결정된 확률만큼 더 높은 확률로 서비스 진입 처리 확률을 제공할 수 있다. 예를 들어, 사전 결정된 시간 구간의 길이가 2주, 사전 결정된 확률이 10%, 사용자의 최종 접속 기록 시점부터 서비스 진입 시도 시점까지의 시간 구간의 길이가 4주, 그리고 사용자의 서비스 진입 시도 시점에서의 서비스 접속자수에 기초한 로지스틱 회귀모델의 서비스 진입 처리 확률이 30%인 경우, 프로세서(120)는 상기 사용자의 진입 시도에 대한 진입 처리 확률을 40%로 설정하여 사용자의 진입 여부를 결정할 수 있다. 프로세서(120)는 상기 서비스의 진입 시도에 기초하여 식별되는 사용자의 게임 데이터 중 적어도 하나에 기초하여, 로지스틱 회귀 모델에 기초한 서비스 진입 처리 확률보다 더 높은 확률로 서비스 진입 처리 확률을 제공할 수 있다. 예를 들어, 프로세서(120)는 상기 서비스의 진입 시도에 기초하여 식별되는 사용자의 게임 데이터 중 유료 재화 구입 데이터에 기초하여, 상기 유료 재화 구입 데이터가 사전 결정된 값 이상인 경우, 로지스틱 회귀 모델에 기초한 서비스 진입 처리 확률보다 더 높은 확률로 서비스 진입 처리 확률을 제공할 수 있다. 전술한 진입 처리 확률을 보정하여 확률 기반 접속 제어 처리하는 기재는 예시일 뿐이며, 본개시는 이에 제한되지 않는다.The processor 120 may correct the service entry processing probability based on the user's game data identified based on the service entry attempt. For example, the processor 120 may increase the access probability in the probability-based access control process of the service based on at least one of the user's game data and the number of users of the service identified based on the entry attempt of the service. The user's game data may include all data related to the user's use of the service based on the service the user has attempted to enter. The user's game data may be data including all transactions in a service that the user attempts to enter. The processor 120 may provide the service entry processing probability with a higher probability than the service entry processing probability based on the logistic regression model, based on the game data of the user identified based on the attempt to enter the service. Processor 120 based on the user's game data of the logistic regression model

Constant of expression

By changing the value,

A service entry processing probability may be provided to a user terminal with a probability higher than a service entry processing probability of the in-basis logistic regression model. For example, the processor 120 may have a predetermined length of time from the user's last access record time to the service entry attempt time based on the user's last access record identified based on the service's attempt to enter the service. If it is longer than the length of the interval, the service entry processing probability may be provided with a probability that is higher than a predetermined probability than the service entry processing probability based on the logistic regression model. The processor 120 has a probability that is higher than a predetermined probability than a probability of processing a service entry based on a logistic regression model when there is no user's last access record identified based on an attempt to enter the service (ie, a new user of the service). It is possible to provide a service entry processing probability. For example, the length of the predetermined time period is 2 weeks, the predetermined probability is 10%, the length of the time period from the user's last access record time to the service entry attempt time is 4 weeks, and the user's service entry attempt time If the service entry processing probability of the logistic regression model based on the number of service accesses is 30%, the processor 120 may determine whether to enter the user by setting the entry processing probability for the user's entry attempt to 40%. The processor 120 may provide the service entry processing probability with a higher probability than the service entry processing probability based on the logistic regression model, based on at least one of the user's game data identified based on the entry attempt of the service. For example, the processor 120 may be based on a logistic regression model when the paid goods purchase data is greater than or equal to a predetermined value based on the paid goods purchase data among user game data identified based on the attempt to enter the service. A service entry processing probability may be provided with a higher probability than the entry processing probability. The description of the probability-based access control processing by correcting the above-described entry processing probability is only an example, and the present disclosure is not limited thereto.

When the number of accesses of a service is greater than or equal to the maximum number of accesses for an attempt to enter the service, the processor 120 may process the attempt to enter the service to wait for the service to enter. The service entry waiting process may mean to wait for service access without allowing service access of the user terminal identified based on the attempt to enter the service.

The processor 120 notifies service at least one of the user terminal processed to wait for service entry based on probability-based access control processing and at least one of the user terminal processed to wait for service entry based on the maximum number of connected users of the service. Can transmit. The processor 120 may store information about a user waiting to enter a service in the memory 130.

The processor 120 may store the waiting time for the service entry processing of the user by matching the information on the user waiting to enter the service in the memory 130. The processor 120 may store the waiting time for the entry processing based on the number of users of the service at the time of the entry attempt, for the user terminal processed to wait for the entry of the service in the memory 130. According to an embodiment of the present disclosure, the waiting time for the user's service entry processing may be determined based on the number of users of the service when the user enters. The waiting time for the user to enter the service may be shorter as the number of users accessing the service decreases when the user enters the service. The waiting time for the user to enter the service may be longer as the number of users accessing the service increases. For example, when the user enters the service, the waiting time for service entry processing when the number of users connected to the service is less than the maximum set number of users is set for the service entry processing when the number of users connected to the service is greater than or equal to the maximum set number of users when entering the service. It may be shorter than the waiting time. According to another embodiment of the present disclosure, a waiting time for a user's service entry processing may be determined based on at least one of a user's connection record and a user's game data. For example, if the length of the time interval from the user's last access point to the user's attempt to enter the service is longer than a predetermined time length, the user's waiting time is different users with the same number of users accessing the service when the user enters It can be shorter than that. For example, if there is no user's last access record (ie, a new user of the service), the waiting time of the user may be shorter than other users having the same number of users when the user enters the service. For example, if the amount of paid goods purchased from the user's game data is greater than a predetermined amount, the waiting time of the user may be shorter than other users having the same number of users when the user enters the service. The description of the waiting time for the service entry process of the user described above is only an example, and the present disclosure is not limited thereto.

The processor 120 may transmit a wait time notification for service entry processing to a user terminal that has been processed to wait for service entry through the network unit 110.

When receiving an entry processing attempt for an entry attempt processed to wait for service entry, the processor 120 may determine a service entry waiting or service entry processing based on a time interval from the service entry waiting processing to the entry processing attempt. . The processor 120 matches the information about the user waiting to enter the service in the memory 130 with respect to the entry attempt processed to wait for the service to enter, and the waiting time for the service entry processing of the stored user and the service entry waiting process starting from the processing Based on the time interval until the attempt, the service entry waiting or service entry processing may be determined. The processor 120 may determine the service entry processing when the time interval from the service entry waiting processing to the entry processing attempt is longer than the waiting time for the service entry processing stored in the memory 130. The processor 120 may determine a service entry wait process when a time interval from the service entry wait process to the entry process attempt is shorter than the wait time for the service entry process stored in the memory 130.

The processor 120 notifies the service entry when the waiting time for the service entry waiting process elapses from the service entry waiting process for an attempt to enter the service waiting for service entry to the user terminal processed to wait for service entry through the network unit 110. Can send. In one embodiment of the present disclosure, the service entry notification may be that the processor 120 transmits a push notification to the user terminal through the network unit 110. In another embodiment of the present disclosure, when the user terminal is connected by selecting an alternative service, the processor 120 transmits a push notification to the alternative service server through the network unit 110, and the alternative service server transmits a push notification to the user terminal. It may be sending a push notification. The above description of the service entry notification is only an example, and the present disclosure is not limited thereto.

Hereinafter, a method of providing an alternative service for waiting for entry according to an embodiment of the present disclosure will be described.

The processor 120 may transmit an alternative service list to the identified user terminal based on the entry attempt processed to wait for service entry to the user terminal through the network unit 110. The replacement service list is based on the replacement service output by calculating the replacement service judgment model including one or more network functions of the game data of the user, the replacement service selected based on the genre of the service, and the service execution history of the user terminal By doing so, it may include at least one of the selected replacement service and the promotion replacement service. The processor 120 may determine a service in the same genre as a service that the user terminal attempts to enter as an alternative service. The processor 120 may determine a service in a genre similar to the service that the user terminal attempts to enter as an alternative service. For example, when the service that the user terminal attempts to enter is an RPG genre, the processor 120 may determine a service included in the RPG genre as an alternative service. The processor 120 may determine an alternative service based on the service execution history executed by the user terminal. For example, when the service that the user terminal attempts to enter is A and B, in addition to the service that the user terminal is waiting to enter, the processor 120 determines at least one of the services A and B, which are services executed by the user terminal, as an alternative service. You can. The processor 120 may determine the promotion service as an alternative service. For example, by determining a newly released game as a promotion service, the processor 120 may provide the user terminal using the network unit 110. The description of the aforementioned alternative service list is merely an example, and the present disclosure is not limited thereto.

The processor 120 may output the replacement service by calculating the replacement service determination model including one or more network functions of the user's game data. The processor 120 may output an alternative service by calculating an alternative service determination model using reinforcement learning.

The processor 120 may determine the replacement service to be provided to the user terminal by calculating the game data of the user using the replacement service determination model. The replacement service determination model may include an alternative service determination policy submodel that analyzes game data of the user to determine an alternative service to be provided to the user terminal. The alternative service judgment model may consist of an artificial neural network. The user's game data may include all data related to the user's use of the service based on the service the user has attempted to enter. The user's game data may be data including all transactions in a service that the user attempts to enter. The user's game data may include a plurality of items. The game data may include in-game data and interaction data. In-game data may include achievements limited to characters and users in the game. Interaction data may include in-game characters and achievements other than the user. In-game data may include all information performed by characters in the game. Interaction data may include information about all interactions performed with other users. For example, the in-game data may include the number of purchases of paid goods by the user, the number of clearing stages, the game level, and the like. For example, the interaction data may include the number of times the user and other users chat, the number of times that the user has cooperated with other users to clear the stage, and the like. The processor 120 may output scores for each of the at least one candidate replacement service using the user's game data as an input of the service determination model. The candidate replacement service may include one or more replacement services. The candidate replacement service may include a service different from the service that the user attempted to enter. The processor 120 may determine to provide the user terminal with an alternative service having a maximum score among candidate alternative services calculated using the alternative service determination model. For example, candidate replacement services may include Service A, Service B, and Service C. For example, the processor 120 replaces a candidate by using the user's game data (in this example, the number of users purchasing paid goods, the user's access time, the user's chat time with other players, etc.) as the input of the service judgment model The score for each service can be output. For example, when the score of the service A is 8, the score of the service B is 15, and the score of the service C is 12, the processor 120 calculates using the service determination model, the score among the candidate replacement services It can be determined to provide the maximum replacement service B, which is the user terminal. The description of the alternative service decision described above is merely an example, and the present disclosure is not limited thereto.

The processor 120 may update the replacement service determination policy submodel of the replacement service determination model based on the usage record of the user terminal. In the replacement service determination model, the replacement service determination policy submodel may be updated based on the usage record of the user terminal for the replacement service. The usage record of the user terminal may include all data related to the user's use of the replacement service after the user terminal enters the replacement service. The usage record of the user terminal may be data including all transactions in the replacement service after the user terminal enters the replacement service. The user terminal's usage record may include a plurality of items. The usage record of the user terminal may include transaction data in an alternative service entered by the user corresponding to the above-described game data. The processor 120 may update the replacement service decision policy submodel of the replacement service determination model based on at least one of in-game data and interaction data included in the usage record of the user terminal. When the usage record of the user terminal is positive, the processor 120 may update the replacement service determination policy submodel of the replacement service determination model so that a probability of determining the corresponding replacement service is increased based on the game data. When the usage record of the user terminal is negative, the processor 120 may update the replacement service decision policy submodel of the replacement service determination model so that the probability of determining the corresponding replacement service based on the game data becomes low. For example, when the usage record of the user terminal is positive, it may be a case where the number of purchases of paid goods is increased among the usage records of the user terminal. For example, when the usage record of the user terminal is positive, it may be a case in which the total access time of the usage record of the user terminal is greater than or equal to a predetermined time or longer when compared with the total access time of game data. For example, when the usage record of the user terminal is negative, it may be a case in which the number of purchases of paid goods among the usage records of the user terminal decreases. That is, the purpose of the alternative service judgment model is to provide the alternative service desired by the user so that the user can use it during the waiting time. Therefore, when the user satisfactorily uses the replacement service, since the purpose of the service determination model is achieved, the replacement service decision submodel is updated so that the probability of providing the replacement service to the user or other users having similar game data is enhanced. can do. The above description of the alternative service decision policy update is merely an example, and the present disclosure is not limited thereto.

The processor 120 may receive an alternative service selection input for at least one included in the alternative service list from the user terminal through the network unit 110. The processor 120 may transmit a control signal to the user terminal so that the replacement service is executed through the network unit 110 when the replacement service is executable in the user terminal. The processor 120 may transmit a control signal to the user terminal to enable the user terminal to execute the replacement service through the network unit 110 when the replacement service is in a non-executable state in the user terminal. The processor 120 determines whether the replacement service is executable in the user terminal by receiving at least one of whether the replacement service is downloaded to the user terminal and version information of the replacement service from the user terminal through the network unit 110. You can. The processor 120 receives information including the download of the replacement service to the user terminal from the user terminal through the network unit 110, and the version of the replacement service received from the user terminal through the network unit 110 When the information coincides with the latest version information of the replacement service stored in the memory 130, it can be determined that the replacement service is executable in the user terminal. When the processor 120 receives information including that the replacement service is not downloaded to the user terminal from the user terminal through the network unit 110, the replacement service may determine that the replacement service is in an inoperable state. The processor 120 may transmit the replacement service file for downloading the replacement service to the user terminal through the network unit 110. The processor 120 receives information including the download of the replacement service to the user terminal from the user terminal through the network unit 110, and the version of the replacement service received from the user terminal through the network unit 110 If the information does not match the latest version information of the replacement service stored in the memory 130, it can be determined that the replacement service is in an inoperable state at the user terminal. The processor 120 may transmit at least one of the update file corresponding to the latest version information and the entire file corresponding to the latest version information to the user terminal through the network unit 110. For example, when the replacement service is not executed in the user terminal because the replacement service is not downloaded to the user terminal, and the processor 120 is the mobile terminal, the processor 120 may apply the replacement service application to the user terminal through the network unit 110. You can send this downloadable app store URL. For example, when the replacement service is not downloaded to the user terminal because the replacement service is not downloaded to the user terminal, and the user terminal is a PC, the processor 120 may provide the replacement service to the user terminal through the network unit 110. You can send the downloadable web page URL. The description of providing the aforementioned alternative service is merely an example, and the present disclosure is not limited thereto.

The processor of the replacement service server may receive user authentication information from the replacement service user terminal. User authentication of the replacement service may receive information to identify the user to other users.

When the user terminal receives that the user terminal is accessing the replacement service server from at least one replacement service server included in the replacement service list through the network unit 110, the processor 120 processes the service entry of the user terminal. It can be decided to reduce the waiting time for. The processor 120 may store the time in which the waiting time for service entry processing is reduced by matching the information about the user waiting for service entry in the memory 130. The processor 120 may reduce the waiting time for the service entry processing stored in the memory 130 by a predetermined time so that the waiting time for the service entry processing is reduced. The processor 120 may reduce the waiting time for the service entry processing stored in the memory 130 by a predetermined ratio so that the waiting time for the service entry processing is reduced. The processor 120 may determine the amount by which the time for service entry processing is reduced based on the connection of the replacement service server. For example, the processor 120 may determine an amount in which the time for service entry processing is reduced in proportion to the purchase amount of paid goods of the user terminal accessing the alternative service server. For example, the processor 120 may determine the amount by which the time for service entry processing is reduced based on the number of times the user terminal accessing the replacement service server has sent the replacement service recommendation notification to another user terminal. For example, the processor 120 may change and store 60 minutes of waiting time for service entry processing stored in the memory 130 for user A accessing the replacement service to 30 minutes. The above description of the decision to reduce the waiting time for service entry processing is merely an example, and the present disclosure is not limited thereto. According to an embodiment of the present disclosure, an alternative service may be provided to users, and when using the alternative service, a waiting time may be reduced, thereby driving user inflow to the alternative service and dynamically adjusting the user inflow of the service. .

The processor 120 may transmit a notification to the alternative service server to send a notification message indicating that the service entry order has been reached to the user terminal when the waiting time for service entry processing elapses through the network unit 110. The replacement service server may send a notification message informing the user terminal that the service entry order has been reached to at least one of the user terminal and the alternative service that the user is accessing based on the received notification message. For example, the notification message indicating that the service has entered the order may include a URL providing a path through which the service can be executed. The above description of the entry sequence notification is only an example, and the present disclosure is not limited thereto.

The service processing performance and speed of the server may be improved by controlling access based on probability using the service entry management method according to an embodiment of the present disclosure. By using the service entry management method according to an embodiment of the present disclosure, a service can be efficiently provided without raising a server limit, so that the processing of the server can be efficiently used.

By controlling access based on probability using the service entry management method according to an embodiment of the present disclosure, even when more users are connected than expected in situations such as opening a new service, opening a system check, opening a service, and events, etc. No problem. In addition, according to the service entry management method according to an embodiment of the present disclosure, it is possible to simply control the number of connected users based on probability, without complicated waiting processing.

The memory 130 may store a computer program for performing a service entry management method according to an embodiment of the present disclosure, and the stored computer program may be read and driven by the processor 120.

The memory 130 according to embodiments of the present disclosure may store a program for the operation of the processor 120 and input / output data (eg, service entry information, user information, alternative service access information, etc.) ) Can be stored temporarily or permanently. The memory 130 may store data related to a display and sound. The memory 130 is a flash memory type, a hard disk type, a multimedia card micro type, a card type memory (for example, SD or XD memory, etc.), RAM (Random Access Memory, RAM), Static Random Access Memory (SRAM), Read-Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Programmable Read-Only Memory (PROM), magnetic memory, magnetic It may include at least one type of storage medium among disks and optical disks.

2 is a diagram illustrating service entry management according to an embodiment of the present disclosure.

2 is a diagram illustrating a graph 210 when not using the service entry management according to an embodiment of the present disclosure and a graph 220 when using the service entry management according to an embodiment of the present disclosure.

The x-axis of the graph of FIG. 2 represents time 370, and the y-axis represents the number of users 310 of the service. If the service entry management according to an embodiment of the present disclosure is not used, when the users increase with time and the number of users 310 of the service is greater than the maximum number of users 330, the problem 212 is caused. Can occur. When the number of access users 310 of the service is greater than the maximum number of access users 330, the service may not be smoothly provided to all users who are accessing the server, or the waiting time for users to access the server may be increased. When the number of access users 310 of the service is greater than the maximum number of access users 330, the provision of the service to some or all users accessing the server may be stopped (ie, the server is down). In the case of using the service entry management according to an embodiment of the present disclosure, when the number of users 310 of the service is smaller than the number of users setting the connection removal operation 320 as the number of users increases over time, the service entry processing 340 is performed. Can be done. When using the service entry management according to an embodiment of the present disclosure, by performing a probability-based access control process in a section where 100% access was previously possible, the user's access can be delayed to increase the time until the server is saturated. The server can be used more efficiently or the load on the server can be reduced. When using the service entry management according to an embodiment of the present disclosure, it is possible to prevent a situation in which the server is stopped by receiving a service user until the server reaches an acceptable limit. When using the service entry management according to an embodiment of the present disclosure, when the number of access control operation setting access numbers 320 or more and the maximum setting access number 330 are less than, the probability based access control processing 350 is performed to perform A problem 212 that may occur when the service entry management according to an embodiment is not used may be prevented.

3 is a diagram illustrating service entry management according to an embodiment of the present disclosure.

According to an embodiment of the present disclosure, the server may perform service entry management based on the number of users 310 of the service. The server may perform a service entry process for a service access request when the number of users 310 of the service is less than the number of users 320 for setting the access control operation. When the number of access users 310 of the service is greater than or equal to the access control operation setting access number 320 and less than the maximum setting access number 330, the server enters the access according to the access probability determined based on the access access number 310 of the service. A probability-based access control process 350 may perform the entry attempt for the service, which processes an attempt to enter a service or wait for entry. The probability-based access control process 350 will be described later with reference to FIG. 4. When the number of accesses of the service is greater than or equal to the maximum number of accesses 330, the server may process the entry attempt for the service (360).

4 is a diagram illustrating service entry management according to an embodiment of the present disclosure.

4 is a diagram illustrating probability-based access control processing for service entry according to an embodiment of the present disclosure.

식에 따라 서비스 접속자의 서비스 진입 확률(410)을 결정할 수 있다. 상기 로지스틱 회귀모델에 기초한

식에서 독립변수 x는 서비스의 접속자수, 종속변수 y는 서비스 진입 확률, a는 서비스 진입 확률을 조정하기 위한 값, 그리고 b는 서비스의 접속자수에 따른 서비스 진입 확률을 조정하기 위한 값일 수 있다. a 및 b는 각각 임의의 값을 가질 수 있다. 독립변수 x인 서비스의 접속자수에 기초하여 종속변수 y인 서비스 진입 확률이 결정될 수 있다. 프로세서(120)는 서비스의 접속자수가 접속 제어 동작 설정 접속자수인 경우부터 최대 설정 접속자수인 경우까지 서비스의 접속자에게 확률 기반 접속 제어 처리를 할 수 있다. 예를 들어, 로지스틱 회귀모델식에서 a=0, b=(서비스의 접속자수(310))일 때, 독립변수인 서비스의 접속자수(310) x 값이 서비스의 제 1 접속자수(420)인 경우, 종속변수인 서비스 진입 확률(410) y 값은 50%일 수 있다. 프로세서(120)는 로지스틱 회귀모델식의 a 및 b 중 적어도 하나의 값을 조정함으로써 서비스의 사용자 전부 또는 일부에 대한 서비스 진입 확률(410)을 조정할 수 있다. 전술한 로지스틱 회귀모델식에 대한 기재는 예시일 뿐이며 본 개시는 이에 제한되지 않는다..The probability-based access control processing is performed on the server when the access number 310 of the service is greater than or equal to the access control operation setting access number 320 and less than the maximum setting access number 330 from the server. The probability-based access control processing may be performed such that the probability of entering the service increases as the number of accesses 310 of the service approaches the access control operation setting access number 320. Probability-based access control processing may be performed such that the service access probability 410 decreases (that is, increase the probability of waiting to enter) as the number of access users 310 of the service approaches the maximum number of access users 330. The probability of entry processing and the probability of processing waiting for entry may be inversely related. The total sum of the probability of entry processing and the probability of processing waiting for entry may be 100%. Probability-based access control processing may be performed based on a logistic regression model. In the probability-based access control process, the independent variable may be set as the number of users of the service 310 and the dependent variable as the service entry probability 410 in the logistic regression model. Probability-based access control processing is based on a logistic regression model.

According to the equation, the service access probability 410 of the service visitor may be determined. Based on the logistic regression model

In the equation, the independent variable x may be the number of users of the service, the dependent variable y is the service entry probability, a is a value for adjusting the service entry probability, and b may be a value for adjusting the service entry probability according to the number of users of the service. a and b may each have any value. The probability of entering the service, which is the dependent variable y, may be determined based on the number of users of the service, which is the independent variable x. The processor 120 may perform probability-based access control processing to the accessor of the service, from the number of accessor of the service to the number of accessor setting operation accessor to the maximum number of accessor. For example, in the logistic regression model equation, when a = 0, b = (the number of users of services 310), the value of the number of users 310 of services, which is an independent variable, is the first number of users of services 420 , The y value of the service entry probability 410 as a dependent variable may be 50%. The processor 120 may adjust the service entry probability 410 for all or some users of the service by adjusting at least one of a and b of the logistic regression model equation. The above description of the logistic regression model equation is merely an example, and the present disclosure is not limited thereto.

5 is a diagram illustrating an alternative service provision notification according to an embodiment of the present disclosure.

According to an embodiment of the present disclosure, the server may transmit at least one of a waiting time notification for service entry processing and an alternative service list to a user terminal that has been processed for service entry waiting. According to an embodiment of the present disclosure, the service server notifies the waiting time for service entry processing to the user terminal that has been processed to enter the service (in this embodiment, "game access is possible after 60 minutes."), Alternative service notification (In this embodiment, “How about playing another game?”) And a notification including that the waiting time for the service entry processing may be reduced when accessing the alternative service (in this embodiment, “another game If you are playing, the waiting time is cut in half. ”). The service server may transmit a list of alternative services to the user terminal that has been processed to enter the service. The above description of the alternative service provision notification is only an example, and the present disclosure is not limited thereto.

According to an embodiment of the present disclosure, the user terminal may display a display object for at least one of a waiting time notification for service entry processing and a list of alternative services. According to an embodiment of the present disclosure, the service server may indicate that the wait time for service entry processing may be reduced when a display object indicating a wait time for service entry processing, a display object representing an alternative service, and an alternative service are accessed. A control signal may be transmitted to a user terminal processed to wait for service entry to display a display object to be displayed. The service server may transmit a control signal to a user terminal that has been processed to enter a service to display a display object for displaying a list of alternative services.

6 is a flowchart of a service entry management method according to an embodiment of the present disclosure.

The computing device 100 may process an entry attempt to the service 610 when the number of accesses of the service is less than the number of access control operation set accesses for an attempt to enter the service.

The computing device 100 services the entry attempt according to the probability of entry determined based on the number of users of the service when the number of access users of the service is greater than or equal to the number of access control operation settings and the maximum number of access users for the entry attempt. A probability-based access control process 620 may perform the entry attempt for the service, the entry processing or the entry waiting processing. Probability-based access control processing increases the probability of the access processing for the entry attempt as the number of access users of the service approaches the access control operation setting access number, and the access attempt increases as the number of access users of the service approaches the maximum setting access number It is possible to increase the probability of processing the waiting for entry. The probability-based access control processing may increase the probability of the entry processing based on at least one of a user's access record and a user's game data identified based on an attempt to enter the service.

When the number of accesses of the service is greater than or equal to the maximum set number of accesses for the entry attempt, the computing device 100 may process the entry attempt for the service (630).

The computing device 100 may determine a waiting time for the entry processing, based on the number of users of the service at the time of the entry attempt, for the user terminal processed to wait for entry to the service. When receiving the entry processing attempt for the entry attempt processed to wait for the service entry, the computing device 100 determines the service entry waiting or service entry processing based on the time interval from the service entry waiting processing to the entry processing attempt. You can. The computing device 100 may compare the waiting time for the entry processing and the time interval from the service entry waiting processing to the entry processing attempt, and if the waiting time for the entry processing is longer, may process the service entry waiting, and perform the entry processing. If the waiting time is shorter, service entry can be handled.

The computing device 100 may transmit a service entry notification to the user terminal that has been queued for service entry when the waiting time for the service entry process has elapsed from the service entry wait process for an entry attempt processed for service entry wait.

The computing device 100 may transmit a list of alternative services to the identified user terminal based on the attempt to enter the service waiting to enter the service. The replacement service list is based on the replacement service output by calculating the replacement service judgment model including one or more network functions of the user's game data, the replacement service selected based on the genre of the service, and the service execution history of the user terminal. It may include at least one of the selected replacement service and the promotion replacement service. The computing device 100 may determine a service in the same genre as a service that the user terminal attempts to enter as an alternative service. The computing device 100 may determine a service in a genre similar to a service that the user terminal attempts to enter as an alternative service. The computing device 100 may determine an alternative service based on the service execution history executed by the user terminal. The computing device 100 may determine the promotion service as an alternative service. The alternative service determination model includes an alternative service determination policy submodel that analyzes game data of the user to determine an alternative service to be provided to the user terminal, and based on the user terminal's usage record for the alternative service. Alternative service decision policies may be updated.

The computing device 100 receives the alternative service selection input for at least one included in the alternative service list from the user terminal, so that the alternative service is executed when the alternative service is in an executable state on the user terminal. A control signal may be transmitted to the user terminal. The computing device 100 may transmit a control signal to the user terminal so that the user terminal can execute the replacement service when the replacement service is in a state in which the user terminal is not executable.

When the computing device 100 receives that the user terminal is accessing the replacement service server from at least one replacement service server included in the replacement service list, the waiting time for the service entry processing of the user terminal is reduced. You can decide as much as possible.

7 is a timing diagram of a service entry management method according to an embodiment of the present disclosure.

The service server 600 may transmit and / or receive the user terminal 500 and the user authentication pre-processing information (S102). The user authentication pre-processing may be for the service server 600 to determine whether the corresponding service is executable in the user terminal 500. In the case where the corresponding service is not executable in the user terminal 500 before the user authentication, the service server 600 transmits a control signal to the user terminal 500 so that the corresponding service is executable in the user terminal 500 It may include the operation.

The service server 600 may transmit and / or receive (S104) user authentication information with the user terminal 500. User authentication may include information to identify the user to other users.

The service server 600 may receive service entry attempt information from the user terminal 500 (S106). The service server 600 may perform service entry processing, probability-based access control processing, or service entry waiting processing based on the number of users of the service (S108). The probability-based access control process may control an attempt to enter a service such that an access processing probability for an entry attempt increases as the number of access users of the service approaches the number of access control operation setting access users. The probability-based access control process may control an attempt to enter a service such that the probability of processing to wait for an entry attempt increases as the number of accesses of the service approaches the maximum number of accesses.

In the case of the service entry waiting process based on the probability-based access control process, the service server 600 may match and store the user information and the waiting time for the entry process (S110). The service server 600 may transmit an alternative service list to the user terminal 500 processed to wait for the service entry (S112). The replacement service list is based on the replacement service output by calculating the replacement service judgment model including one or more network functions of the game data of the user, the replacement service selected based on the genre of the service, and the service execution history of the user terminal By doing so, it may include at least one of the selected replacement service and the promotion replacement service. The service server 600 may receive an alternative service selection input for one of the alternative service lists from the user terminal 500 processed to wait for the service entry (S114).

The user terminal 500 may transmit and / or receive (S116) pre-authentication processing information with the alternative service server 700. The user authentication pre-processing may be for the replacement service server 700 to determine whether the corresponding replacement service is executable in the user terminal 500. In the case where the corresponding alternative service is not executable in the user terminal 500 before the user authentication, the alternative service server 700 controls the user terminal 500 to execute the corresponding alternative service in the user terminal 500. And transmitting a signal.

The user terminal 500 may transmit and / or receive (S118) user authentication information with the alternative service server 700. User authentication may include information to identify the user to other users. The user terminal 500 may transmit the replacement service entry attempt information to the replacement service server 700 (S120).

The service server 600 may receive whether the user accesses the replacement service from the replacement service server 700 (S122). When receiving that the user is accessing the alternative service from the alternative service server 700, the service server 600 may reduce and store the waiting time for entry processing (S124).

The service server 600 may schedule an entry (S126) based on the user waiting to enter the service server and user information using the service. The service server 600 may transmit a service entry notification to the user terminal 500 in the order of entry, which is a user whose waiting time for service entry processing has elapsed through the entry scheduling (S128).

The service server 600 may perform the user terminal 500 that processes the entry, pre-user authentication (S130), and user authentication (S132) again. The service server 600 may receive service entry processing attempt information from the user terminal 500 (S134). The service server 600 may perform a service entry process or a service entry process wait process (S136) of the user terminal 500 attempting the service entry process.

8 is a block diagram illustrating logic for implementing a service entry management method according to an embodiment of the present disclosure.

According to an embodiment of the present disclosure, a service entry management method may be implemented by the following logic.

According to an embodiment of the present disclosure, a service entry management method includes: a logic 810 for processing an entry attempt for a service when the number of accesses of the service is less than the number of access control operation setting access numbers for an attempt to enter the service; When the number of accesses of the service is greater than or equal to the number of access control operation settings and less than the maximum number of accesses for the access attempt, the access attempt is processed or the wait for access is processed according to the access probability determined based on the number of accesses of the service. A logic 820 for processing the entry attempt for the service with probability based access control; And when the number of accesses of the service is greater than or equal to the maximum number of accesses, the logic 830 for processing the access attempt for the service to be waited for entering the service may be implemented.

In an alternative embodiment of the service entry management method, the method additionally processes the entry based on the number of users of the service at the time of the entry attempt, for the user terminal that is waiting to enter the service based on the probability-based access control process. It may be implemented by logic to determine the waiting time for.

In an alternative embodiment of the service entry management method, the method is further based on a time interval from the service entry wait process to the entry process attempt when receiving an entry process attempt for the service entry wait process entry attempt. It may be implemented by logic for determining a service entry waiting or service entry processing.

In an alternative embodiment of the service entry management method, when the waiting time for the service entry processing elapses from the service entry waiting process for the user terminal processed to wait for the service entry, the service entry waiting process user is additionally processed. It may be implemented by logic for transmitting a service entry notification to the terminal.

In an alternative embodiment of the service entry management method, the method may be additionally implemented by logic for transmitting an alternative service list to the user terminal processed to wait for service entry.

In an alternative embodiment of the service entry management method, the method additionally receives the user terminal from the at least one replacement service server included in the replacement service list when the user terminal is accessing the replacement service server. It may be implemented by logic to determine that the waiting time for service entry processing is reduced.

In an alternative embodiment of the service entry management method, when the method additionally receives an alternative service selection input for at least one included in the alternative service list from the user terminal, the alternative service is executable in the user terminal If is, logic for transmitting a control signal to the user terminal so that the replacement service is executed; And when the replacement service is in an inoperable state in the user terminal, it may be implemented by logic for transmitting a control signal to the user terminal so that the user terminal can execute the replacement service.

9 is a block diagram illustrating a module for implementing a service entry management method according to an embodiment of the present disclosure.

A service entry management method according to an embodiment of the present disclosure may be implemented by the following modules.

According to an embodiment of the present disclosure, a service entry management method includes: a module 910 for processing an entry attempt for a service when the number of accesses of a service is less than the number of access control operation setting access numbers for an attempt to enter the service; When the number of accesses of the service is greater than or equal to the number of access control operation settings and less than the maximum number of accesses for the access attempt, the access attempt is processed or the wait for access is processed according to the access probability determined based on the number of accesses of the service. A module 920 for processing the entry attempt for the service with probability based access control; And when the number of accesses of the service is greater than or equal to the maximum number of accesses, the module 930 may process the access attempt for the service to wait for access to the service.

In an alternative embodiment of the service entry management method, the method additionally processes the entry based on the number of users of the service at the time of the entry attempt, for the user terminal that is waiting to enter the service based on the probability-based access control process. It may be implemented by a module for determining the waiting time for.

In an alternative embodiment of the service entry management method, the method is further based on a time interval from the service entry wait process to the entry process attempt when receiving an entry process attempt for the service entry wait process entry attempt. It may be implemented by a module for determining a service entry waiting or service entry processing.

In an alternative embodiment of the service entry management method, when the waiting time for the service entry processing elapses from the service entry waiting process for the user terminal processed to wait for the service entry, the service entry waiting process user is additionally processed. It may be implemented by a module for transmitting a service entry notification to the terminal.

In an alternative embodiment of the service entry management method, the method may be additionally implemented by a module for transmitting a list of alternative services to the user terminal processed to wait for service entry.

In an alternative embodiment of the service entry management method, the method additionally receives the user terminal from the at least one replacement service server included in the replacement service list when the user terminal is accessing the replacement service server. It may be implemented by a module for determining that the waiting time for service entry processing is reduced.

In an alternative embodiment of the service entry management method, when the method additionally receives an alternative service selection input for at least one included in the alternative service list from the user terminal, the alternative service is executable in the user terminal A module for transmitting a control signal to the user terminal so that the replacement service is executed; And a module for transmitting a control signal to the user terminal to enable the user terminal to execute the replacement service when the replacement service is in an inoperable state in the user terminal.

10 is a block diagram illustrating a circuit for implementing a service entry management method according to an embodiment of the present disclosure.

According to an embodiment of the present disclosure, a service entry management method may be implemented by the following circuit.

According to an embodiment of the present disclosure, a service entry management method includes: a circuit 1010 for processing an entry attempt for a service when the number of accesses of the service is less than the number of access control operation setting access numbers for an attempt to enter the service; When the number of accesses of the service is greater than or equal to the number of access control operation settings and less than the maximum number of accesses for the access attempt, the access attempt is processed or the wait for access is processed according to the access probability determined based on the number of accesses of the service. A circuit 1020 for processing the entry attempt for the service with probability based access control; And when the number of accesses of the service is greater than or equal to the maximum number of accesses, the circuit 1030 may process the access attempt for the service to wait for service access.

In an alternative embodiment of the service entry management method, the method additionally processes the entry based on the number of users of the service at the time of the entry attempt, for the user terminal that is waiting to enter the service based on the probability-based access control process. It may be implemented by a circuit for determining the waiting time for.

In an alternative embodiment of the service entry management method, the method is further based on a time interval from the service entry wait process to the entry process attempt when receiving an entry process attempt for the service entry wait process entry attempt. It may be implemented by a circuit for determining a service entry waiting or service entry processing.

In an alternative embodiment of the service entry management method, when the waiting time for the service entry processing elapses from the service entry waiting process for the user terminal processed to wait for the service entry, the service entry waiting process user is additionally processed. It may be implemented by a circuit for transmitting a service entry notification to the terminal.

In an alternative embodiment of the service entry management method, the method may be additionally implemented by circuitry for transmitting an alternative service list to the user terminal processed to wait for service entry.

In an alternative embodiment of the service entry management method, the method additionally receives the user terminal from the at least one replacement service server included in the replacement service list when the user terminal is accessing the replacement service server. It may be implemented by circuitry for determining that the waiting time for service entry processing is reduced.

In an alternative embodiment of the service entry management method, when the method additionally receives an alternative service selection input for at least one included in the alternative service list from the user terminal, the alternative service is executable in the user terminal A circuit for transmitting a control signal to the user terminal so that the replacement service is executed; And a circuit for transmitting a control signal to the user terminal to enable the user terminal to execute the replacement service when the replacement service is in an inoperable state in the user terminal.

11 is a block diagram illustrating a means for implementing a service entry management method according to an embodiment of the present disclosure.

According to an embodiment of the present disclosure, a service entry management method may be implemented by the following means.

According to an embodiment of the present disclosure, a service entry management method includes: means (1210) for processing an entry attempt for a service when the number of accesses of the service is less than the number of access control operation setting access numbers for an attempt to enter the service; When the number of accesses of the service is greater than or equal to the number of access control operation settings and less than the maximum number of accesses for the access attempt, the access attempt is processed or the wait for access is processed according to the access probability determined based on the number of accesses of the service. Means for processing the entry attempt to the service based on probability based access control 1220; And when the number of accesses of the service is greater than or equal to the maximum number of accesses for the attempt to enter, it may be implemented by means 1230 for processing a wait for entering the service.

In an alternative embodiment of the service entry management method, the method additionally processes the entry based on the number of users of the service at the time of the entry attempt, for the user terminal that is waiting to enter the service based on the probability-based access control process. It may be implemented by means for determining the waiting time for.

In an alternative embodiment of the service entry management method, the method is further based on a time interval from the service entry wait process to the entry process attempt when receiving an entry process attempt for the service entry wait process entry attempt. It may be implemented by means for determining a service entry waiting or service entry processing.

In an alternative embodiment of the service entry management method, when the waiting time for the service entry processing elapses from the service entry waiting process for the user terminal processed to wait for the service entry, the service entry waiting process user is additionally processed. It may be implemented by means for transmitting a service entry notification to the terminal.

In an alternative embodiment of the service entry management method, the method may be additionally implemented by means for transmitting an alternative service list to the user terminal processed to wait for service entry.

In an alternative embodiment of the service entry management method, the method additionally receives the user terminal from the at least one replacement service server included in the replacement service list when the user terminal is accessing the replacement service server. It may be implemented by means for determining that the waiting time for service entry processing is reduced.

In an alternative embodiment of the service entry management method, when the method additionally receives an alternative service selection input for at least one included in the alternative service list from the user terminal, the alternative service is executable in the user terminal If, means for transmitting a control signal to the user terminal so that the replacement service is executed; And when the replacement service is in an inoperable state in the user terminal, it may be implemented by means for transmitting a control signal to the user terminal so that the user terminal can execute the replacement service.

12 is a block diagram of a computing device according to an embodiment of the present disclosure.

12 shows a simplified and general schematic diagram of an example computing environment in which embodiments of the present disclosure can be implemented.

Although the present disclosure has been described above in general with respect to computer-executable instructions that can be executed on one or more computers, those skilled in the art will appreciate that the present disclosure can be implemented in combination with other program modules and / or as a combination of hardware and software. will be.

Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. In addition, those of ordinary skill in the art may find that the methods of the present disclosure include single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, handheld computing devices, microprocessor-based or programmable consumer electronics, and the like (each of which is It will be appreciated that it may be implemented in other computer system configurations, including one that may operate in conjunction with one or more associated devices.

The described embodiments of the present disclosure may also be practiced in distributed computing environments where certain tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

Computers typically include a variety of computer readable media. Any computer-accessible medium can be a computer-readable medium. Computer-readable media includes volatile and non-volatile media, transitory and non-transitory media, removable and non-removable media. By way of example, and not limitation, computer readable media may include computer readable storage media and computer readable transmission media. Computer-readable storage media are volatile and nonvolatile media, temporary and non-transitory media, removable and non-removable implemented in any method or technology for storing information such as computer readable instructions, data structures, program modules or other data. Media. Computer storage media includes RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disk (DVD) or other optical disk storage devices, magnetic cassettes, magnetic tapes, magnetic disk storage devices or other magnetic storage devices, Or any other medium that can be accessed by a computer and used to store desired information.

Computer readable transmission media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and Includes all information delivery media. The term modulated data signal means a signal in which one or more of the characteristics of the signal are set or changed to encode information in the signal. By way of example, and not limitation, computer readable transmission media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, and other wireless media. Combinations of any of the above described media are also intended to be included within the scope of computer readable transmission media.

An exemplary environment 1100 is shown that implements various aspects of the present disclosure, including a computer 1102, and the computer 1102 includes a processing device 1104, a system memory 1106, and a system bus 1108. do. System bus 1108 connects system components, including, but not limited to, system memory 1106 to processing device 1104. The processing device 1104 can be any of a variety of commercial processors. Dual processor and other multiprocessor architectures may also be used as the processing unit 1104.

The system bus 1108 can be any of several types of bus structures that can be further interconnected to a memory bus, peripheral bus, and local bus using any of a variety of commercial bus architectures. System memory 1106 includes read-only memory (ROM) 1110 and random access memory (RAM) 1112. The basic input / output system (BIOS) is stored in a non-volatile memory 1110 such as ROM, EPROM, EEPROM, etc. This BIOS is a basic to help transfer information between components in the computer 1102 at the same time as during startup. Contains routines. The RAM 1112 may also include high-speed RAM, such as static RAM for caching data.

Computer 1102 is also an internal hard disk drive (HDD) 1114 (eg, EIDE, SATA)-this internal hard disk drive 1114 can also be configured for external use within a suitable chassis (not shown). Yes, magnetic floppy disk drive (FDD) 1116 (e.g., for reading from or writing to removable diskette 1118), and optical disk drive 1120 (e.g., CD-ROM Disc 1122, or for reading from or writing to other high-capacity optical media such as a DVD). The hard disk drive 1114, the magnetic disk drive 1116, and the optical disk drive 1120 are respectively connected to the system bus 1108 by the hard disk drive interface 1124, the magnetic disk drive interface 1126, and the optical drive interface 1128. ). Interface 1124 for external drive implementation includes at least one or both of Universal Serial Bus (USB) and IEEE 1394 interface technologies.

These drives and their associated computer-readable media provide non-volatile storage of data, data structures, computer-executable instructions, and the like. In the case of computer 1102, drives and media correspond to storing any data in a suitable digital format. Although the description of computer readable media above refers to HDDs, removable magnetic disks, and removable optical media such as CDs or DVDs, those skilled in the art will appreciate zip drives, magnetic cassettes, flash memory cards, cartridges, and the like. Other types of media readable by the computer, etc. may also be used in the exemplary operating environment and it will be appreciated that any such media may include computer executable instructions for performing the methods of the present disclosure.

A number of program modules may be stored in the drive and RAM 1112, including the operating system 1130, one or more application programs 1132, other program modules 1134, and program data 1136. All or part of the operating system, applications, modules and / or data may also be cached in RAM 1112. It will be appreciated that the present disclosure can be implemented in various commercially available operating systems or combinations of operating systems.

The user may input commands and information to the computer 1102 through one or more wired / wireless input devices, for example, pointing devices such as a keyboard 1138 and a mouse 1140. Other input devices (not shown) may include a microphone, IR remote control, joystick, game pad, stylus pen, touch screen, etc. These and other input devices are often connected to the processing unit 1104 through an input device interface 1142 connected to the system bus 1108, but the parallel port, IEEE 1394 serial port, game port, USB port, IR interface, And other interfaces.

The monitor 1144 or other type of display device is also connected to the system bus 1108 through an interface such as a video adapter 1146. In addition to the monitor 1144, the computer generally includes other peripheral output devices (not shown) such as speakers, printers, and the like.

The computer 1102 can operate in a networked environment using logical connections to one or more remote computers, such as remote computer (s) 1148 via wired and / or wireless communication. The remote computer (s) 1148 may be a workstation, computing device computer, router, personal computer, portable computer, microprocessor-based entertainment device, peer device, or other conventional network node, typically in computer 1102. It includes many or all of the components described with respect to, but for simplicity, only the memory storage device 1150 is shown. The illustrated logical connections include wired / wireless connections to a local area network (LAN) 1152 and / or a larger network, such as a wide area network (WAN) 1154. Such LAN and WAN networking environments are common in offices and companies, and facilitate enterprise-wide computer networks such as intranets, all of which can be connected to computer networks around the world, for example, the Internet.

When used in a LAN networking environment, the computer 1102 is connected to the local network 1152 via a wired and / or wireless communication network interface or adapter 1156. The adapter 1156 may facilitate wired or wireless communication to the LAN 1152, which also includes a wireless access point installed therein to communicate with the wireless adapter 1156. When used in a WAN networking environment, the computer 1102 may include a modem 1158, or connect to a communication computing device on the WAN 1154, or establish communication over the WAN 1154, such as through the Internet. Have other means. The modem 1158, which may be an internal or external and wired or wireless device, is connected to the system bus 1108 through a serial port interface 1142. In a networked environment, program modules described for the computer 1102 or portions thereof may be stored in the remote memory / storage device 1150. It will be appreciated that the network connections shown are exemplary and other means of establishing a communication link between computers may be used.

The computer 1102 is associated with any wireless device or object that is deployed and operates in wireless communication, such as a printer, scanner, desktop and / or portable computer, a portable data assistant (PDA), communication satellite, or wireless detectable tag. It operates to communicate with any equipment or place and telephone. This includes at least Wi-Fi and Bluetooth wireless technology. Accordingly, the communication may be a predefined structure as in a conventional network or simply ad hoc communication between at least two devices.

Wi-Fi (Wireless Fidelity) enables a connection to the Internet or the like without a wired connection. Wi-Fi is a wireless technology such as a cell phone that allows a device, for example, a computer to transmit and receive data indoors and outdoors, ie anywhere within the base station's coverage area. Wi-Fi networks use a wireless technology called IEEE 802.11 (a, b, g, etc.) to provide a secure, reliable and high-speed wireless connection. Wi-Fi can be used to connect computers to each other, to the Internet, and to a wired network (using IEEE 802.3 or Ethernet). Wi-Fi networks can operate in unlicensed 2.4 and 5 GHz radio bands, for example, at 11 Mbps (802.11a) or 54 Mbps (802.11b) data rates, or in products that include both bands (dual band). have.

One of ordinary skill in the art of the present disclosure will understand that information and signals can be represented using any of a variety of different technologies and techniques. For example, data, instructions, instructions, information, signals, bits, symbols and chips that can be referenced in the above description are voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields Or particles, or any combination thereof.

Those of ordinary skill in the art of the present disclosure may use various examples of logical blocks, modules, processors, means, circuits, and algorithm steps described in connection with the embodiments disclosed herein in electronic hardware, (convenience For the sake of understanding, it may be implemented by various forms of program or design code (referred to herein as “software”) or a combination of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the particular application and design constraints imposed on the overall system. Those skilled in the art of the present disclosure may implement the functions described in various ways for each particular application, but such implementation decisions should not be interpreted as being outside the scope of the present disclosure.

Various embodiments presented herein may be implemented as a method, apparatus, or article of manufacture using standard programming and / or engineering techniques. The term "manufactured article" includes a computer program, carrier, or media accessible from any computer-readable device. For example, computer-readable media include magnetic storage devices (eg, hard disks, floppy disks, magnetic strips, etc.), optical disks (eg, CDs, DVDs, etc.), smart cards, and flash memory Devices (eg, EEPROMs, cards, sticks, key drives, etc.), but are not limited to these. Also, various storage media presented herein include one or more devices and / or other machine-readable media for storing information.

It is understood that the specific order or hierarchy of steps in the processes presented is an example of exemplary approaches. Based upon design priorities, it is understood that the specific order or hierarchy of steps in the processes may be rearranged within the scope of the present disclosure. The accompanying method claims present elements of the various steps in a sample order, but are not meant to be limited to the specific order or hierarchy presented.

Descriptions of the presented embodiments are provided to enable any person of ordinary skill in the art to use or practice the present disclosure. Various modifications to these embodiments will be apparent to those skilled in the art of the present disclosure. The general principles defined herein can be applied to other embodiments without departing from the scope of the present disclosure. Thus, the present disclosure should not be limited to the embodiments presented herein, but should be interpreted in the broadest scope consistent with the principles and novel features presented herein.

Claims (1)

A computer program stored on a computer readable storage medium.

Images