WO2015130010A1 - Procédé et appareil de sélection d'antémémoire optimale compte tenu de l'état de canal et des informations de mouvement d'un utilisateur d'antémémoire - Google Patents

Procédé et appareil de sélection d'antémémoire optimale compte tenu de l'état de canal et des informations de mouvement d'un utilisateur d'antémémoire Download PDF

Info

Publication number
WO2015130010A1
WO2015130010A1 PCT/KR2015/000441 KR2015000441W WO2015130010A1 WO 2015130010 A1 WO2015130010 A1 WO 2015130010A1 KR 2015000441 W KR2015000441 W KR 2015000441W WO 2015130010 A1 WO2015130010 A1 WO 2015130010A1
Authority
WO
WIPO (PCT)
Prior art keywords
cache
user
candidate
channel state
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/KR2015/000441
Other languages
English (en)
Korean (ko)
Inventor
최준균
박상돈
박만선
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Korea Advanced Institute of Science and Technology KAIST
Original Assignee
Korea Advanced Institute of Science and Technology KAIST
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from KR1020140044845A external-priority patent/KR20150101346A/ko
Application filed by Korea Advanced Institute of Science and Technology KAIST filed Critical Korea Advanced Institute of Science and Technology KAIST
Publication of WO2015130010A1 publication Critical patent/WO2015130010A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0226—Traffic management, e.g. flow control or congestion control based on location or mobility
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions

Definitions

  • the present invention relates to an optimal cache selection method and apparatus using mobile information and channel state by transmitting mobile information to a central management station when a mobile cache user uses the cache wirelessly.
  • the technical problem to be achieved by the present invention is to provide a method and apparatus for solving the mobile traffic problem that occurs as the smartphone market is activated with the recent growth of wireless networks. It also provides an optimal cache selection algorithm for which cache a mobile user should access.
  • the optimal cache selection method considering the cache user's movement information and channel state proposed by the present invention controls the cache user to transmit channel state information with the cache connected at the cache user's location to the central station. Collecting information on the cache user and the cache candidate at the central station; predicting a channel state between the cache user and the cache candidate using the information on the cache user and the cache candidate; The method may include selecting an optimal cache based on the total amount of data transmission for a predetermined time using the established channel state.
  • the simulation may be simulated using obstacle information and distance information between the cache user and the cache candidate.
  • Predicting a channel state between the cache user and the cache candidate using the information on the cache user and the cache candidate may include channel state between the cache user and the cache candidate using future location information of the cache user. Can be predicted.
  • the step of selecting an optimal cache based on the total amount of data transmission for a predetermined time by using the predicted channel state is that the cache user receives data directly from the central station rather than accessing a specific cache. If it has, it can receive data directly from the central station.
  • the optimal cache selection apparatus considering the movement information and channel state of the cache user proposed in the present invention is the channel state information with the cache connected at the location of the cache user and the cache user and the cache candidates
  • the channel state predictor is configured to determine whether the distance between the cache user and the cache candidate is less than or equal to a predetermined minimum required distance, and when the channel state data exists between the cache user and the cache candidate, the channel state is changed to a past channel state. It may include a calculation unit to approximate using.
  • the determining unit may determine whether channel state data exists between the cache user and the cache candidate when the distance between the cache user and the cache candidate is less than or equal to a predetermined minimum required distance.
  • the determination unit may exclude the cache candidate from the optimal cache candidate of the cache user.
  • the calculator may simulate a channel state between the cache user and the cache candidate.
  • the channel state predictor may predict a channel state between the cache user and the cache candidate by using the future location information of the cache user.
  • the cache selector may allow the cache user to receive data directly from the central station if receiving the data directly from the central station rather than accessing a specific cache has a higher transmission rate.
  • FIG. 1 is a flowchart illustrating an optimal cache selection method considering channel information and movement information of a cache user according to an embodiment of the present invention.
  • FIG. 2 is a flowchart illustrating a process of predicting a channel state between a cache user and a cache candidate according to an embodiment of the present invention.
  • FIG 3 is an exemplary view for explaining an optimal cache selection process according to an embodiment of the present invention.
  • FIG. 4 is a diagram illustrating a configuration of an optimum cache selecting apparatus considering channel information and movement information of a cache user according to an embodiment of the present invention.
  • FIG. 1 is a flowchart illustrating an optimal cache selection method considering channel information and movement information of a cache user according to an embodiment of the present invention.
  • the optimal cache selection method in consideration of the cache user's movement information and the channel state includes controlling the cache user to transmit channel state information with the cache connected at the cache user's location to the central station (110), and the cache user at the central station. And collecting information about the cache candidate (120), estimating a channel state between the cache user and the cache candidate by using the information about the cache user and the cache candidate (130), and determining a predetermined channel state by using the predicted channel state. And selecting 140 the optimal cache based on the total amount of data transfer over time.
  • the cache user may be controlled to transmit channel state information with the cache connected at the cache user's location to the central station.
  • the proposed cache selection method may know the future location information of the cache user. For example, when a cache user uses navigation, the cache user may know future location information by entering a destination. As another example, when the cache user moves in a straight path, the future location information may be known by predicting a future movement path by using the movement path of the cache user for a predetermined time.
  • the central station may collect information about cache users and cache candidates.
  • the central management station may collect location information for a predetermined time of the entire cache user in the x-y coordinate system.
  • location information of cache candidates, obstacle information within a predetermined radius, and channel state statistics may be collected.
  • the information about the cache user and the cache candidate can be used to select an optimal cache for the cache user.
  • the channel state between the cache user and the cache candidate may be predicted using the information about the cache user and the cache candidate.
  • the central management station may use the cache user's future location information to predict the channel state between the cache user and the cache candidate.
  • channel state prediction may be predicted with the following priority order.
  • the channel state can be predicted using the existing channel state statistics information.
  • the channel state can be predicted using information such as an obstacle and a distance to the cache candidate.
  • Predicting a channel state between the cache user and the cache candidate using information about the cache user and the cache candidate may include determining whether a distance between the cache user and the cache candidate is less than or equal to a predetermined minimum required distance, and between the cache user and the cache candidate. Determining whether channel state data exists between the cache user and the cache candidate when the distance is less than or equal to the predetermined minimum required distance; and when the distance between the cache user and the cache candidate is greater than or equal to the predetermined minimum required distance, the corresponding cache candidate is determined by the cache user. Excluding from the optimal cache candidate, approximating the channel state using the past channel state if there is channel state data between the cache user and the cache candidate, and caching if there is no channel state data between the cache user and the cache candidate. Simulate channel state between user and cache candidate It may include the step. It will be described in more detail with reference to FIG.
  • an optimal cache may be selected based on the total amount of data transmission for a predetermined time using the predicted channel state. In this case, when the cache user receives data directly from the central station rather than accessing a specific cache, the cache user may receive data directly from the central station.
  • FIG. 2 is a flowchart illustrating a process of predicting a channel state between a cache user and a cache candidate according to an embodiment of the present invention.
  • the channel state between the cache user and the cache candidate is predicted using the information about the cache user and the cache candidate, and the distance between the cache user and the cache candidate is less than or equal to a predetermined minimum required distance. Determining whether it is 210; if the distance between the cache user and the cache candidate is less than or equal to a predetermined minimum required distance, determining whether channel state data exists between the cache user and the cache candidate (221); and between the cache user and the cache candidate If the distance is greater than or equal to a predetermined minimum required distance, the cache candidate is excluded from the cache user's optimal cache candidate (222). If there is channel state data between the cache user and the cache candidate, the channel state is used by using the past channel state. Approximating step 231, if there is no channel state data between the cache user and the cache candidate, And simulating a channel state between a cache user and a cache candidate (232).
  • step 210 it may be determined whether the distance between the cache user and the cache candidate is less than or equal to a predetermined minimum required distance.
  • the presence of the channel state data between the cache user and the cache candidate may be determined according to the determination result of the predetermined minimum required distance, or the cache candidate may be excluded from the cache user's optimal cache candidate.
  • step 221 it may be determined in step 221 whether channel state data exists between the cache user and the cache candidate.
  • the cache candidate may be excluded from the cache user's optimal cache candidate in step 222.
  • the channel state may be approximated using the past channel state in step 231.
  • step 232 it can simulate the channel state between the cache user and the cache candidate.
  • the simulation can be simulated using obstacle information and distance information between the cache user and the cache candidate.
  • the optimal cache selection process may select an optimal cache that can receive the most data for the next T 'time using a channel state for a predetermined T time.
  • a cache user may receive data directly from the central station.
  • a cache candidate that is too far away for the cache user will not be selected by the user, so the minimum required distance can be set to exclude the cache beyond that distance.
  • the cache user 320 may transmit channel state information to the central station 310 with a plurality of cache candidates 331, 332, and 333 connected at the location of the cache user 320. Then, the central station 310 may collect information about the cache user 320 and the plurality of cache candidates 331, 332, 333. Subsequently, information about the cache user 320 and the plurality of cache candidates 331, 332, and 333 may be used to predict a channel state between the cache user 320 and the plurality of cache candidates 331, 332, and 333. For example, the location information of the plurality of cache candidates 331, 332, and 333, the location information 354, the channel state statistics, etc. are used during the T time of the obstacle 353 information cache user in the overall radius R 351. The channel state between the user 320 and the plurality of cache candidates 331, 332, and 333 may be predicted.
  • the distance between the cache user 320 and the plurality of cache candidates 331, 332, and 333 is equal to or less than a predetermined minimum required distance. For example, it may be determined whether the plurality of cache candidates 331, 332, and 333 are located within the overall radius R 351. When the distance between the cache user 320 and the plurality of cache candidates 331, 332, and 333 is greater than or equal to a predetermined minimum required distance, the cache candidate may be excluded from the cache user's optimal cache candidate.
  • the channel state data between the cache user 320 and the plurality of cache candidates 331, 332, 333 may be used. You can check the existence. If channel state data exists between the cache user 320 and the plurality of cache candidates 331, 332, and 333, the channel state may be approximated using the past channel state.
  • the channel state between the cache user 320 and the plurality of cache candidates 331, 332, 333 can be simulated.
  • FIG. 4 is a diagram illustrating a configuration of an optimum cache selecting apparatus considering channel information and movement information of a cache user according to an embodiment of the present invention.
  • the optimum cache selection apparatus considering the user's movement information and the channel state may include a collector 410, a channel state predictor 420, and a cache selector 430.
  • the collection unit 410 may collect channel state information with the cache connected at the location of the cache user, and information about the cache user and the cache candidate.
  • the channel state predictor 420 may predict a channel state between the cache user and the cache candidate using information on the cache user and the cache candidate.
  • the channel state predictor 420 may predict the channel state between the cache user and the cache candidate by using the future location information of the cache user.
  • the channel state predictor 420 may include a determiner 421 and a calculator 322.
  • the determination unit 421 may determine whether the distance between the cache user and the cache candidate is less than or equal to a predetermined minimum required distance. In addition, when the distance between the cache user and the cache candidate is less than or equal to a predetermined minimum required distance, the determination unit 421 may determine whether channel state data exists between the cache user and the cache candidate. When the distance between the cache user and the cache candidate is greater than or equal to a predetermined minimum required distance, the cache candidate may be excluded from the optimal cache candidate of the cache user.
  • the calculator 322 may approximate the channel state using the past channel state. In addition, when there is no channel state data between the cache user and the cache candidate, it is possible to simulate the channel state between the cache user and the cache candidate.
  • the cache selector 430 may select an optimal cache based on the total data transfer amount for a predetermined time using the predicted channel state.
  • the cache selector 430 may allow the cache user to receive data directly from the central station if the cache user receives data directly from the central station rather than accessing a specific cache.
  • the apparatus described above may be implemented as a hardware component, a software component, and / or a combination of hardware components and software components.
  • the devices and components described in the embodiments may be, for example, processors, controllers, arithmetic logic units (ALUs), digital signal processors, microcomputers, field programmable arrays (FPAs), It may be implemented using one or more general purpose or special purpose computers, such as a programmable logic unit (PLU), microprocessor, or any other device capable of executing and responding to instructions.
  • the processing device may execute an operating system (OS) and one or more software applications running on the operating system.
  • the processing device may also access, store, manipulate, process, and generate data in response to the execution of the software.
  • OS operating system
  • the processing device may also access, store, manipulate, process, and generate data in response to the execution of the software.
  • processing device includes a plurality of processing elements and / or a plurality of types of processing elements. It can be seen that it may include.
  • the processing device may include a plurality of processors or one processor and one controller.
  • other processing configurations are possible, such as parallel processors.
  • the software may include a computer program, code, instructions, or a combination of one or more of the above, and configure the processing device to operate as desired, or process it independently or collectively. You can command the device.
  • Software and / or data may be any type of machine, component, physical device, virtual equipment, computer storage medium or device in order to be interpreted by or to provide instructions or data to the processing device. Or may be permanently or temporarily embodied in a signal wave to be transmitted.
  • the software may be distributed over networked computer systems so that they may be stored or executed in a distributed manner.
  • Software and data may be stored on one or more computer readable recording media.
  • the method according to the embodiment may be embodied in the form of program instructions that can be executed by various computer means and recorded in a computer readable medium.
  • the computer readable medium may include program instructions, data files, data structures, etc. alone or in combination.
  • the program instructions recorded on the media may be those specially designed and constructed for the purposes of the embodiments, or they may be of the kind well-known and available to those having skill in the computer software arts.
  • Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks, such as floppy disks.
  • Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like.
  • the hardware device described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé et un appareil destinés à sélectionner une antémémoire optimale compte tenu de l'état de canal et des informations de mouvement d'un utilisateur d'antémémoire. Le procédé de sélection d'antémémoire optimale compte tenu de l'état de canal et des informations de mouvement d'un utilisateur d'antémémoire, selon la présente invention, peut comporter les étapes consistant à: réaliser une commande de telle façon qu'un utilisateur d'antémémoire envoie à une station centrale des informations sur un état de canal avec une antémémoire reliée dans la position de l'utilisateur d'antémémoire; recueillir, au niveau de la station centrale, des informations sur une antémémoire candidate et l'utilisateur d'antémémoire; prédire un état de canal entre l'utilisateur d'antémémoire et l'antémémoire candidate en utilisant les informations sur l'antémémoire candidate et l'utilisateur d'antémémoire; et sélectionner une antémémoire optimale d'après la quantité totale d'émission de données pendant un temps prédéterminé en utilisant l'état de canal prédit.
PCT/KR2015/000441 2014-02-25 2015-01-15 Procédé et appareil de sélection d'antémémoire optimale compte tenu de l'état de canal et des informations de mouvement d'un utilisateur d'antémémoire Ceased WO2015130010A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20140021715 2014-02-25
KR10-2014-0021715 2014-02-25
KR10-2014-0044845 2014-04-15
KR1020140044845A KR20150101346A (ko) 2014-02-25 2014-04-15 캐시 사용자의 이동 정보와 채널상태를 고려한 최적 캐시 선택 방법 및 장치

Publications (1)

Publication Number Publication Date
WO2015130010A1 true WO2015130010A1 (fr) 2015-09-03

Family

ID=54009287

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2015/000441 Ceased WO2015130010A1 (fr) 2014-02-25 2015-01-15 Procédé et appareil de sélection d'antémémoire optimale compte tenu de l'état de canal et des informations de mouvement d'un utilisateur d'antémémoire

Country Status (1)

Country Link
WO (1) WO2015130010A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20120108307A (ko) * 2011-03-23 2012-10-05 삼성전자주식회사 무선 통신 시스템 및 그 무선 통신 시스템에서 컨텐츠 전송 방법
KR20130107960A (ko) * 2012-03-23 2013-10-02 에스케이텔레콤 주식회사 컨텐츠 전송 시스템, 이를 위한 방법 및 장치
KR20130122196A (ko) * 2012-04-30 2013-11-07 에스케이텔레콤 주식회사 핸드오버를 고려한 모바일 컨텐츠 제공 방법 및 이를 위한 장치

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20120108307A (ko) * 2011-03-23 2012-10-05 삼성전자주식회사 무선 통신 시스템 및 그 무선 통신 시스템에서 컨텐츠 전송 방법
KR20130107960A (ko) * 2012-03-23 2013-10-02 에스케이텔레콤 주식회사 컨텐츠 전송 시스템, 이를 위한 방법 및 장치
KR20130122196A (ko) * 2012-04-30 2013-11-07 에스케이텔레콤 주식회사 핸드오버를 고려한 모바일 컨텐츠 제공 방법 및 이를 위한 장치

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
PARK, SANG DON ET AL.: "Algorithm of Main Station and Cache Users for Optimize Cache Usage in Wireless Mesh Networks", THE JOURNAL OF KICS AUTUMN CONFERENCE, November 2013 (2013-11-01), pages 1 - 2 *

Similar Documents

Publication Publication Date Title
US10333864B2 (en) Adaptive service chain management
TWI636275B (zh) 利用信標的無線測位服務方法、系統、裝置以及檔分配系統
US8863138B2 (en) Application service performance in cloud computing
JP6571161B2 (ja) アプリケーショントポロジ関係を探索するための方法、装置、およびシステム
CN107967164B (zh) 一种虚拟机热迁移的方法及系统
JP7132297B2 (ja) 仮想ゲートウェイクラスタのグローバル障害に対する監視方法及び装置
KR102042046B1 (ko) 분산 클라우드 기반의 자율주행 시스템 및 방법
EP3439262B1 (fr) Procédé et système de téléchargement de données vers une plate-forme en nuage, passerelle et support lisible par machine
JP2018507498A (ja) 位置情報の収集が不要な災害通知サービス方法及びこのための災害通知サーバー、アプリケーションシステム
WO2016171404A1 (fr) Procédé et appareil d'émission et de réception de données d'image pour service de diffusion en flux de réalité virtuelle
KR102172169B1 (ko) 분산형 클라우드 기반 어플리케이션 실행 시스템, 이에 적용되는 장치 및 장치의 동작 방법
JP2018092626A (ja) ネットワークエッジが増強されたクラウドにロボットの機能を任せるためのシステム及び方法
US10951646B2 (en) Biology based techniques for handling information security and privacy
JP2013150134A5 (fr)
CN107172208A (zh) 服务器的部署方法及其系统
EP2740068A1 (fr) Procédé et appareil d'entrée de mot de passe à l'aide d'un jeu
CN108876857A (zh) 无人驾驶车辆的定位方法、系统、设备及存储介质
US9326161B2 (en) Application-driven control of wireless networking settings
CN110381310B (zh) 一种检测视觉系统的健康状态的方法及装置
CN110034979A (zh) 一种代理资源监测方法、装置、电子设备及存储介质
WO2015130010A1 (fr) Procédé et appareil de sélection d'antémémoire optimale compte tenu de l'état de canal et des informations de mouvement d'un utilisateur d'antémémoire
WO2022131525A1 (fr) Technique d'apprentissage distribuée asymétrique basée sur un serveur de paramètres
US20210278973A1 (en) Method of placing volume on closer storage from container
JP2025506864A (ja) 無線アクセスパラメータを介したａｉ／ｍｌアプリケーションのインターフェース管理のためのシステム、方法、デバイス、及びプログラム
US20230345289A1 (en) Method, electronic device and computer program product for data transmission

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15755322

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15755322

Country of ref document: EP

Kind code of ref document: A1