[go: up one dir, main page]

WO2014196341A1 - Dispositif de relai de contenu, procédé de relai de flux de contenu, et support d'enregistrement - Google Patents

Dispositif de relai de contenu, procédé de relai de flux de contenu, et support d'enregistrement Download PDF

Info

Publication number
WO2014196341A1
WO2014196341A1 PCT/JP2014/063135 JP2014063135W WO2014196341A1 WO 2014196341 A1 WO2014196341 A1 WO 2014196341A1 JP 2014063135 W JP2014063135 W JP 2014063135W WO 2014196341 A1 WO2014196341 A1 WO 2014196341A1
Authority
WO
WIPO (PCT)
Prior art keywords
content
transfer
flow
priority
destination
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/JP2014/063135
Other languages
English (en)
Japanese (ja)
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.)
NEC Corp
Original Assignee
NEC Corp
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
Application filed by NEC Corp filed Critical NEC Corp
Priority to JP2015521368A priority Critical patent/JP6341201B2/ja
Publication of WO2014196341A1 publication Critical patent/WO2014196341A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements

Definitions

  • the present invention relates to a content relay device that relays a plurality of content transfer flows simultaneously, and relates to a content relay device and a relay method thereof that reduce the average content transfer time.
  • FTTH Fiber To The Home
  • LTE long term evolution
  • LTE-Advanced and WiMAX2 Worldwide Interoperability for Microwave Access 2
  • the allocated disk space can be used for content sharing / publication.
  • SNS is a service provided by a community-type website that supports the connection between people, and also functions as a content server that shares and publishes content.
  • a content transfer flow is generated between a terminal and a server when content is uploaded to or downloaded from an online space.
  • These application services have a problem that the content transfer time increases due to congestion of the network and content server.
  • QoS for each content transfer flow, optimization of the communication resource allocation amount, energy consumption, and the like.
  • the content server it is necessary to consider the disk size, cache size, processing capability, energy consumption, and the like.
  • the resource management for these optimizations is all allocation optimization processing within a finite number, and is also in a relationship with other content transfer flows.
  • the transfer processing of the large size content increases the average transfer time of the entire system.
  • the information provider would like to upload the content quickly and provide the content quickly to the user, and it would be nice if the user side could also access the content comfortably.
  • a telecommunication carrier that provides an access network and a backbone, ISP (Internet Service Provider) will also want to provide users with a comfortable content transmission path.
  • ISP Internet Service Provider
  • Non-Patent Document 1 discloses a method in which the content server shortens the average content transfer time by performing transfer scheduling according to the transfer content size for each content transfer flow. . Further, in Patent Document 1, in a packet relay device that relays a content transfer flow between a content server and a terminal, transfer scheduling approximately according to each content size is executed to reduce the average content transfer time. The method is disclosed. In this method, received packets stored in a connection queue with a small amount of data transfer after connection establishment are given priority over received packets stored in a connection queue with a large amount of data transfer after connection establishment. Forward.
  • Non-Patent Document 1 As mentioned in the above prior art, optimization focusing on the past content average transfer time has been studied. However, the inventors consider a more efficient network relay device. At this time, in addition to considering some factors, a general-purpose optimization method for relaying many content transfers simultaneously and at high speed is examined. If the technical problems of Non-Patent Document 1 and Patent Document 1 are listed, it can be pointed out that when there are a plurality of content servers, the average content transfer time as a whole system cannot be shortened. In the technique described in Non-Patent Document 1, transfer scheduling is performed for each content server, and the average transfer time is reduced for each content server. For this reason, a portion in which the average content transfer time cannot be minimized occurs in the entire system.
  • Non-Patent Document 1 and Patent Document 1 the inventors cannot reduce the average content transfer time as a whole system only by performing transfer scheduling based only on the content size for each content transfer flow.
  • the technique of Patent Document 1 also has a problem that the content size is not reliably grasped. For this reason, it is impossible to reduce the average transfer time of reliable contents. This is because transfer scheduling is performed in the transport layer, and the content size for each content transfer flow is estimated from the data transfer amount after the connection is established.
  • the present invention provides a content relay device, a content flow relay method, and a recording medium capable of reducing the average transfer time over all contents as a whole relay mechanism when relaying a plurality of content transfer flows simultaneously.
  • the content relay device includes a data storage unit that temporarily stores content data when relaying a plurality of content transfer flows, and a transfer priority for the stored content data toward a destination receiving device group.
  • a data transfer unit that transfers the content transfer flow as a content transfer flow
  • a flow priority calculation unit that calculates a priority for the plurality of content transfer flows
  • a priority destination for the destinations of the plurality of content transfer flows.
  • the content flow relay method when relaying a plurality of content transfer flows, the content data is temporarily stored in a storage unit, and the stored content data is transferred to a destination receiving device group. Transfer each content transfer flow reflecting the priority.
  • the priority order is calculated for the plurality of content transfer flows to be relayed, and the priority destination is selected for the destination of the plurality of content transfer flows.
  • the priority order of the content forwarding flow to the preferred destination reflects the flow priority order for the remaining content forwarding flows.
  • the transfer priority of each transfer flow is determined sequentially in the order of transfer and received.
  • a recording medium recording a program according to the present invention is stored in a control unit of a device that operates as a content relay device, and a data storage unit that temporarily stores content data when relaying a plurality of content transfer flows.
  • a data transfer unit that transfers the content data to the destination receiving device group as a content transfer flow by reflecting the transfer priority, and a flow priority calculation unit that calculates a priority for the plurality of content transfer flows; , Based on the priority order selection unit for selecting a priority destination for the destinations of the plurality of content transfer flows, and the priority order for the transfer flow to be relayed and the selection result for the priority destination.
  • the remaining content transfer flow The order in which the rank order is forwarded is reflected, characterized in that to operate as scheduling part, for sequentially determining the transfer priority of the individual transfer flow.
  • a content relay apparatus capable of reducing the average transfer time over all contents as a whole relay mechanism when simultaneously relaying a plurality of content transfer flows are provided. it can.
  • FIG. 1 is a block diagram illustrating a configuration of a content relay apparatus according to the embodiment.
  • FIG. 2 is a network configuration diagram for explaining the operation of the content relay apparatus according to the embodiment.
  • FIG. 3 is a flowchart illustrating an operation example of the content relay apparatus according to the embodiment.
  • FIG. 4 is an explanatory diagram illustrating an operation result example of the content relay device according to the embodiment.
  • FIG. 5 is an explanatory diagram illustrating an operation result example of the content relay device according to the embodiment.
  • FIG. 6 is an explanatory diagram illustrating an operation result example of the content relay device according to the embodiment.
  • the embodiment of the present invention includes a content relay device 100 and a communication network including a WAN (Wide Area Network), a dedicated line, an access line, and the like.
  • the communication network may be a wireless connection.
  • the communication network side includes a reception device group and a transmission device group.
  • the communication network also includes a relay device (previous device) that becomes an adjacent transfer source of a flow and a relay device (next device) that becomes an adjacent transfer destination of a flow in relation to content transmission.
  • an arbitrary transmitting device group registers content in a receiving device that is a destination via the content relay device 100.
  • Each transmission device may be a computer having a function of transmitting content.
  • Each receiving device may be a computer having a function of receiving content. It is also possible for an arbitrary transmission device to simultaneously transmit a plurality of content transfer flows to the same or different devices (same or different destination IP addresses). Similarly, any receiving device can simultaneously receive a plurality of content transfer flows from the same or different devices (same or different source IP addresses).
  • the receiving device may correspond to a content server and the transmitting device may correspond to a terminal.
  • the receiving device may correspond to a terminal
  • the transmitting device may correspond to a content server.
  • the content relay apparatus 100 is divided into a general relay control unit 110, a storage unit 120, and a communication unit 130.
  • the specific configuration of the present invention is not limited to the configuration of the present embodiment, and the block configuration can be appropriately separated and merged.
  • the relay control unit 110 of the content relay apparatus 100 includes a data storage unit 111, a flow priority order calculation unit 112, a priority destination selection unit 113, a schedule unit 114, and a data transfer unit 115.
  • the data storage unit 111 uses the storage unit 120 to buffer content transfer traffic from the transmission source to the reception destination.
  • the flow priority calculation unit 112 calculates a priority between flows for a plurality of content transfer flows.
  • the flow priority calculation unit 112 preferably includes a configuration capable of estimating the untransmitted content size and the remaining processing time for each content transfer flow.
  • the remaining processing time for each content transfer flow may be estimated, and the priority for each flow may be calculated in accordance with each remaining processing time.
  • the unsent content size estimation process for example, the unsent content size can be obtained from the content size obtained by header analysis and the buffered size.
  • the remaining processing time estimation process the remaining processing time can be obtained from the content size and the transfer rate. It is desirable that the priorities be ranked so that all contents are transferred at the fastest speed when the current state is maintained. Note that prioritization may be changed based on other factors (for example, priority assigned to content, content type, communication protocol, etc.).
  • the priority destination selection unit 113 estimates the available bandwidth between the content relay device 100 and the receiving device (destination IP address) for each content transfer flow, and determines a destination that has priority on the basis of the available bandwidth. It is desirable to be configured to select. A plurality of preferential destinations may be determined and operated. Note that when the receiving device is a mobile terminal or a terminal that dynamically changes the IP address, the transfer rate varies greatly. Therefore, the speed variation rate may be obtained and it may be determined based on the variation rate whether or not it is included in the priority destination. In other words, it may be set so that priority setting is not performed for a destination having an indeterminate transfer rate.
  • the scheduling unit 114 determines the transfer priority of each content transfer flow based on the flow priority and the selection result of the priority destination for the content transfer flows to be relayed simultaneously, and schedules the sequential transfer order. And registered in the schedule storage unit 122. In this scheduling, the transfer priority of each transfer flow is determined in the order in which the flow priority order is reflected for the remaining content transfer flows after the priority of the transfer flow to the priority destination. In addition, prioritize all transfer flows that have been selected without giving priority to all transfer flows to priority destinations, and then schedule the remaining content transfer flows to reflect the flow priority order. Therefore, more efficient relay can be achieved.
  • the content relay device 100 sequentially sets a queue for each content transfer flow (a memory for storing data waiting for transmission) in the buffer area 121. Then, the new content transfer flow is buffered together with other transfer flows. At this time, the content relay apparatus 100 has already relayed a plurality of content transfer flows.
  • the data transfer unit 115 sends the content data stored in the queue for each content transfer flow to the destination receiving device in accordance with the schedule reflecting the transfer priority of each content transfer flow registered in the schedule storage unit 122 Forward towards. In this data transfer process, each content transfer flow is sent out so as to be received by one or more relay apparatuses serving as adjacent transfer destinations.
  • the storage unit 120 of the content relay apparatus 100 includes a ROM (Read Only Memory), a RAM (Random Access Memory), an EEPROM (Electrically Erasable Programmable Read Only Memory), a nonvolatile RAM, a flash memory, a disk, and the like.
  • a buffer area 121 and a schedule storage unit 122 are included.
  • a queue is set for each content transfer flow for an arbitrary transmitting / receiving device (an arbitrary receiving device and an arbitrary transmitting device).
  • the schedule storage unit 122 the transfer priority of the content transfer flow determined by the schedule unit 114 is registered.
  • the communication unit 130 of the content relay apparatus 100 is connected to various communication devices including a reception apparatus group and a transmission apparatus group via a communication network such as an adjacent relay apparatus, and enables data transmission / reception.
  • a content transfer flow from an arbitrary transmission device to a specific reception device occurs through the content transfer device 100
  • the content relay device 100 identifies the content transfer flow and places a new content transfer flow queue in the buffer area 121. Set and start buffering of new content transfer flows.
  • the content relay device 100 uses the content data stored in the queue for each content transfer flow for each receiving device. Forward to the destination.
  • FIG. 2 is a logical configuration diagram illustrating a network configuration for explaining the operation of the content relay apparatus 100.
  • the available bandwidth between the content relay device 100 and the receiving device 200-1 is X1 (bps)
  • the available bandwidth between the receiving device 200-2 is X2 (bps)
  • the available bandwidth is assumed to be Xn (bps).
  • the values of X1, X2,..., Xn can be estimated from past content (content) transfer rates between the content relay apparatus 100 and the receiving apparatus 200. It is desirable to obtain the rate of change in speed.
  • the transfer rate may be obtained and used for each time zone.
  • the usable bandwidth between the content relay apparatus 100 and the communication network 400B is assumed to be XT (bps).
  • the value of XT can be estimated from the total value of the content transfer rates when the content relay device 100 simultaneously transfers content to a plurality of receiving devices 200 that are the destinations.
  • the available bandwidth is also related to the bandwidth limitation control for the communication network 400B.
  • the content relay apparatus 100 sets a queue for each content transfer flow and starts buffering the content transfer flow (S101).
  • the content relay apparatus 100 sets the flow priority order in ascending order of the residual processing time value of each content transfer flow (S102).
  • the remaining processing time can be calculated by, for example, “untransmitted content size ⁇ available bandwidth of receiving device (destination IP address)”.
  • the content relay device 100 performs estimation processing on the available bandwidth between the content relay device 100 and each receiving device 200 in advance or dynamically, and absolute conditions and / or relative conditions based on the individual available bandwidths. Based on the above, a receiving device (destination IP address) having priority is selected (S103).
  • an available bandwidth is set as Xi
  • a destination where the available bandwidth Xi is equal to or smaller than a threshold value (XT / n) is selected as a priority destination. If this condition “Xi ⁇ (XT / n)” is satisfied, a plurality of destinations may be selected as priority destinations. In addition, a priority order may be set relatively within a plurality of destinations that satisfy the conditions.
  • the content relay device 100 selects a predetermined number in order from the highest priority transfer flow in the content transfer flow sent to the priority destination for each priority receiving device, and executes prioritization according to the flow priority (S104).
  • a transfer flow with the highest priority is selected from the transfer flow group sent to each priority destination, and the flow priority is high in the maximum transfer flow group.
  • the transfer priority may be set in order. For the upper range, an arbitrary number from the upper level or a flow having a predetermined threshold value or more may be selected.
  • the content relay apparatus 100 determines the transfer priority based on each flow priority so that the remaining transfer flow group that has not been determined in S104 is lower than the determined transfer flow group. (S105).
  • prioritization according to the flow priority order in the content transfer flow group to the priority destination is performed, and then the priority order is lower in the content transfer flow group.
  • This content transfer flow group may be operated so as to determine the transfer priority based on the flow priority order together with the remaining content transfer flow groups.
  • the lower range can be selected such as the remaining flow group excluding an arbitrary number from the upper level, the flow group within a predetermined ratio from the lower level, and all the flow groups below a predetermined threshold.
  • the content relay apparatus 100 performs scheduling (S106) by reflecting the transfer priority of each determined content transfer flow group, and sets the content data stored in the queue for each content transfer flow as the destination. Is appropriately sent to the receiving apparatus 200 (S107).
  • the content average transfer times at which the transmission device 300-1 and the transmission device 300-2 finish transmitting the content data to the reception device 200-1 and the reception device 200-2 are different in priority
  • the simulation results are shown in the trial instead of the sequencing technique. Also, the simulation examples in each figure have different network network transfer rates.
  • a priority ordering technique to be compared a general packet FIFO (First In First Out) technique used in the current Internet, the disclosed technique disclosed in Non-Patent Document 1, and the priority ordering technique described in the above embodiment are used. Applied.
  • the resource amount of the content relay apparatus 100 used in each prioritization technique the same amount that does not cause congestion is assigned. In FIG.
  • the available bandwidth between the content relay device 100 and the communication network 400B is 10 MByte / s
  • the available bandwidth between the content relay device 100 and the reception device 200-1 is 1 MByte / s
  • the content relay device 100 and the reception are received. It is assumed that the available bandwidth between the devices 200-1 is 10 MByte / s.
  • the average transfer time is 5.6 seconds in the case of the Packet FIFO and the proposed technology, which is smaller than the average transfer time of 6.0 seconds in the case of the prior art disclosed in Non-Patent Document 1. The value is shown. In FIG.
  • the usable bandwidth between the content relay device 100 and the communication network 400B is 10 MByte / s
  • the usable bandwidth between the content relay device 100 and the receiving device 200-1 is 5 Mbyte / s
  • the content relay device 100 and the reception are received. It is assumed that the available bandwidth between the devices 200-1 is 10 MByte / s. At this time, in all cases, the average transfer time was 2.0 seconds, and there was no difference in value between the technologies.
  • the usable bandwidth between the content relay device 100 and the communication network 400B is 10 MByte / s
  • the usable bandwidth between the content relay device 100 and the receiving device 200-1 is 9 MByte / s
  • the content relay device 100 and the reception are received.
  • the available bandwidth between the devices 200-1 is 10 MByte / s.
  • the average transfer time is 2.0 seconds in the case of the packet FIFO, and 1.6 seconds is shown in the case of the prior art disclosed in Non-Patent Document 1 and the proposed technology, which is a smaller value.
  • the average transfer time in the case of the Packet FIFO and the prior art disclosed in Non-Patent Document 1 may be relatively larger than other technologies, whereas In this case, the average transfer time was always equal or smaller than other technologies.
  • this content relay apparatus can reduce the average content transfer time as a whole system even in a situation where a plurality of transmission apparatuses (eg, content servers) exist for each content transfer flow. .
  • the size of the transfer content can be reflected in the operation. That is, according to the present invention, when a plurality of content transfer flows are simultaneously relayed, the content relay apparatus, the content flow relay method, and the recording medium capable of reducing the average transfer time over the entire content as the entire relay mechanism Can provide.
  • the specific configuration of the present invention is not limited to the above-described embodiment, and changes such as separation and merging of block configurations and replacement of procedures are free as long as the gist of the present invention and the functions described are satisfied. . Moreover, what is necessary is just to implement
  • a content relay program is expanded in the RAM, and hardware such as a control unit (CPU) is operated based on this program to realize various means.
  • the program may be recorded in a fixed manner on a recording medium and distributed.
  • the program recorded on the recording medium is read into a memory via a wired, wireless, or recording medium itself, and operates a control unit or the like.
  • Examples of the recording medium include an optical disk, a magnetic disk, a semiconductor memory device, and a hard disk.
  • the information processing apparatus operating as the content relay apparatus is based on the content relay program developed in the RAM, the data storage means, the flow priority order calculation means, the priority destination selection means. It can be realized by operating as a schedule unit and a data transfer unit.
  • a data storage unit that temporarily stores content data when relaying a plurality of content transfer flows;
  • a data transfer unit that transfers the stored content data to the destination receiving device group as a content transfer flow reflecting the transfer priority;
  • a flow priority calculation unit for calculating a priority for the plurality of content transfer flows;
  • a priority destination selection unit that selects a priority destination for the destinations of the plurality of content transfer flows; Based on the priority order regarding the forwarding flow to be relayed and the selection result regarding the preferred destination, the priority order of the content forwarding flow to the preferred destination is reflected on the remaining content forwarding flows, and the flow priority order is reflected.
  • a schedule part for sequentially determining the transfer priority of each transfer flow in the transfer order comprising: [Appendix 2] The content relay according to the above supplementary note, wherein the priority destination selection unit estimates a usable bandwidth between the own device and each destination device, and selects a priority destination on the basis of the usable bandwidth. apparatus. [Appendix 3] The content relay apparatus according to the above supplementary note, wherein the flow priority calculation unit estimates a residual processing time for each content transfer flow, and calculates a priority of each flow based on the residual processing time.
  • the flow priority calculation unit uses the value obtained by dividing the untransmitted content size by the available bandwidth between the own device and the destination device for each content transfer flow as the remaining processing time, and individually using the remaining processing time as a reference.
  • the content relay apparatus according to the above supplementary note, wherein the priority order of the flows is calculated.
  • the priority destination selection unit selects, as a priority destination, a destination that is equal to or smaller than a value obtained by dividing the usable bandwidth value of the communication network between the own device and each destination device by the number of destination devices.
  • the content relay device according to the above supplementary note.
  • the scheduling unit prioritizes a part of the content transfer flow to be prioritized based on the priority order regarding the forwarding flow to be relayed and a selection result regarding the prioritized destination, and then the remaining content.
  • the content relay device according to the above-mentioned supplementary note, wherein the transfer flows are scheduled sequentially by determining the transfer priority of each transfer flow in the transfer order reflecting the flow priority order.
  • the scheduling unit has a flow priority level in the upper range of the content transfer flow group for each priority destination for each priority destination based on the priority order regarding the forwarding flow to be relayed and the selection result regarding the priority destination.
  • the content relay device After selecting a transfer flow and performing prioritization according to the flow priority order across the selected upper transfer flow group, the rest including the content transfer flow for the priority destination not selected in the upper range
  • the content relay device according to the above supplementary note, wherein a transfer priority based on the flow priority order is determined for the content transfer flow group.
  • the scheduling unit executes prioritization according to the flow priority order in the content transfer flow group to the priority destination based on the priority order regarding the forwarding flow to be relayed and the selection result concerning the priority destination.
  • a priority order is calculated for the plurality of content transfer flows to be relayed, and a priority destination is selected for a destination of the plurality of content transfer flows. Based on the priority order regarding the forwarding flow to be relayed and the selection result regarding the preferred destination, the priority order of the content forwarding flow to the preferred destination is reflected, and the order of flow priority is reflected for the remaining content forwarding flows.
  • the transfer priority of each transfer flow is sequentially determined in the transfer order, and a plurality of received content transfer flows are sent to each destination.
  • the priority destination is selected by estimating the available bandwidth between the own device and each destination device, and selecting the preferred destination on the basis of the available bandwidth. Relay method.
  • a destination that is equal to or smaller than the value obtained by dividing the available bandwidth of the communication network between the own device and each destination device by the number of destination devices is selected as the priority destination.
  • the content flow relay method as described in the above supplementary note.
  • the relay apparatus prioritizes a part of the content transfer flow to be given priority to the priority destination based on the priority order regarding the transfer flow to be relayed and a selection result relating to the priority destination, and then the remaining content.
  • the content flow relay method according to the above supplementary note, wherein the transfer priority of each individual transfer flow is sequentially determined in the order of transfer flow reflecting the order of flow priority.
  • the relay device based on the priority order for the forwarding flow to be relayed and the selection result for the preferred destination, has a flow priority in the upper range of the content forwarding flow group for each priority destination for each priority destination. After selecting a transfer flow group and performing prioritization according to the flow priority order among the selected upper transfer flow group, the rest including content transfer flows for priority destinations not selected in the upper range.
  • the content flow relay method according to the above supplementary note, wherein transfer priority based on the flow priority order is determined for the content transfer flow group.
  • the relay device performs prioritization according to the flow priority order in the content transfer flow group to the priority destination based on the priority order regarding the forwarding flow to be relayed and the selection result concerning the priority destination.
  • the relay device sequentially sets the new content transfer flow queue in the buffer area each time a new content transfer flow is received, and buffers the new content transfer flow together with other content transfer flows in the buffer area. As you ring, Reflecting the transfer priority for each transfer flow registered in the schedule storage unit, the content data stored in each queue for each transfer flow is sent to the next device toward each destination.
  • the content flow relay method as described in the above supplementary note.
  • the control unit of the device that operates as the content relay device, A data storage unit that temporarily stores content data when relaying a plurality of content transfer flows; A data transfer unit that transfers the stored content data to the destination receiving device group as a content transfer flow reflecting the transfer priority; A flow priority calculation unit for calculating a priority for the plurality of content transfer flows; A priority destination selection unit that selects a priority destination for the destinations of the plurality of content transfer flows; Based on the priority order regarding the forwarding flow to be relayed and the selection result regarding the preferred destination, the priority order of the content forwarding flow to the preferred destination is reflected on the remaining content forwarding flows, and the flow priority order is reflected.
  • a schedule part that sequentially determines the transfer priority of each transfer flow in the transfer order The recording medium which recorded the program characterized by operating as.
  • the priority destination selection unit operates to estimate a usable bandwidth between the own device and each destination device, and to select a priority destination on the basis of the usable bandwidth.
  • a recording medium on which the program described above is recorded.
  • the flow priority calculation unit operates to estimate a residual processing time for each content transfer flow and calculate a priority of each flow based on the residual processing time.
  • the flow priority calculation unit uses the value obtained by dividing the untransmitted content size by the available bandwidth between the own device and the destination device as the remaining processing time, and individually using the remaining processing time as a reference.
  • the priority destination selection unit selects, as a priority destination, a destination that is equal to or smaller than a value obtained by dividing the usable bandwidth value of the communication network between the own device and each destination device by the number of destination devices.
  • a recording medium on which the program according to the above supplementary note is recorded.
  • the scheduling unit Based on the priority for the transfer flow to be relayed and the selection result for the preferential destination, the scheduling unit gives priority to a part of the content transfer flow to the preferential destination and prioritizes the remaining content.
  • the scheduling unit Based on the priority order for the forwarding flow to be relayed and the selection result for the preferential destination, the scheduling unit has a flow priority order in the upper range of the content transfer flow group for each preferential destination for each preferential destination.
  • the rest including content transfer flows for priority destinations not selected in the upper range
  • the scheduling unit After performing the scheduling according to the flow priority within the content transfer flow group to the priority destination based on the priority order regarding the forwarding flow to be relayed and the selection result regarding the priority destination, the scheduling unit, The above-mentioned supplementary note, wherein the content transfer flow group having a lower priority in the content transfer flow group is operated so as to determine the transfer priority based on the flow priority order together with the remaining content transfer flow groups.
  • the new content transfer flow queue is sequentially set in the buffer area, and the data storage unit buffers the new content transfer flow together with other content transfer flows. Reflecting the transfer priority for each transfer flow registered in the schedule storage unit by the schedule unit, the content data stored in each queue for each transfer flow is sent to the next device to each destination.
  • the present invention can be applied to a network used for services such as online storage and SNS, and is useful for various daily information exchanges.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Transfer Between Computers (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un dispositif de relai de contenu qui relaye simultanément une pluralité de flux de transfert de contenu, et qui possède : une partie accumulation de données qui accumule temporairement des données de contenu ; une partie transfert de données qui reflète le degré de priorité de transfert vers un groupe de dispositifs récepteurs destinataires, et en assure un transfert individuel en tant que flux de transfert de contenu ; une partie calcul de position de priorité de flux qui pour la pluralité de flux de transfert de contenu, soumet une position prioritaire à un traitement arithmétique ; une partie sélection de destinataire prioritaire qui choisit un destinataire prioritaire en ce qui concerne les destinataires de la pluralité de flux de transfert de contenu ; et une partie programme qui, après établissement de la priorité du flux de transfert de contenu vers le destinataire prioritaire sur la base de résultats de choix relatifs à la position prioritaire et au destinataire prioritaire pour le flux de transfert relayé, définit successivement le degré de priorité de transfert de chacun des flux de transfert, selon un ordre transféré dans l'ordre de position prioritaire de flux, pour les flux de transfert de contenu restant,
PCT/JP2014/063135 2013-06-06 2014-05-12 Dispositif de relai de contenu, procédé de relai de flux de contenu, et support d'enregistrement Ceased WO2014196341A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2015521368A JP6341201B2 (ja) 2013-06-06 2014-05-12 コンテンツ中継装置、コンテンツフロー中継方法およびプログラム

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2013119679 2013-06-06
JP2013-119679 2013-06-06

Publications (1)

Publication Number Publication Date
WO2014196341A1 true WO2014196341A1 (fr) 2014-12-11

Family

ID=52007994

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2014/063135 Ceased WO2014196341A1 (fr) 2013-06-06 2014-05-12 Dispositif de relai de contenu, procédé de relai de flux de contenu, et support d'enregistrement

Country Status (2)

Country Link
JP (1) JP6341201B2 (fr)
WO (1) WO2014196341A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114488277A (zh) * 2020-10-23 2022-05-13 中国石油化工股份有限公司 一种低功耗地震仪及地震仪数据流控制方法
JPWO2022168264A1 (fr) * 2021-02-05 2022-08-11

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003229896A (ja) * 2002-02-01 2003-08-15 Fujitsu Ltd パケット伝送のスケジューリング装置及びパケット伝送のスケジューリング方法
JP2007251653A (ja) * 2006-03-16 2007-09-27 Sony Corp 通信装置及び送信制御方法及び送信制御プログラム
US20100085923A1 (en) * 2006-09-19 2010-04-08 Telefonaktiebolaget Lm Ericsson (Publ) Scheduling of users on a shared radio resource using a combination of link quality and traffic information

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003229896A (ja) * 2002-02-01 2003-08-15 Fujitsu Ltd パケット伝送のスケジューリング装置及びパケット伝送のスケジューリング方法
JP2007251653A (ja) * 2006-03-16 2007-09-27 Sony Corp 通信装置及び送信制御方法及び送信制御プログラム
US20100085923A1 (en) * 2006-09-19 2010-04-08 Telefonaktiebolaget Lm Ericsson (Publ) Scheduling of users on a shared radio resource using a combination of link quality and traffic information

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
SAMULI AALTO: "Flow-level stability and performance of channel-aware priority-based schedulers", NEXT GENERATION INTERNET (NGI), 2010 6TH EURO-NF CONFERENCE ON, 2 June 2010 (2010-06-02) *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114488277A (zh) * 2020-10-23 2022-05-13 中国石油化工股份有限公司 一种低功耗地震仪及地震仪数据流控制方法
JPWO2022168264A1 (fr) * 2021-02-05 2022-08-11
WO2022168264A1 (fr) * 2021-02-05 2022-08-11 日本電気株式会社 Système de communication, dispositif relais et procédé de relais
JP7533637B2 (ja) 2021-02-05 2024-08-14 日本電気株式会社 通信システム、中継装置及び中継方法

Also Published As

Publication number Publication date
JP6341201B2 (ja) 2018-06-13
JPWO2014196341A1 (ja) 2017-02-23

Similar Documents

Publication Publication Date Title
Liu et al. Delay-optimized video traffic routing in software-defined interdatacenter networks
US9986563B2 (en) Dynamic allocation of network bandwidth
KR101468833B1 (ko) 계층적 프로파일 스케줄링 및 쉐이핑
US9276873B2 (en) Time-based QoS scheduling of network traffic
CN108259383B (zh) 一种数据的传输方法和网络设备
JP5303452B2 (ja) ピアツーピア（ｐ２ｐ）コンテンツ配信ネットワークを使用したビデオ・サービスの遅延ダウンロード
US20200358717A1 (en) Enhance communication of network traffic
US9042355B2 (en) Quality of service (QoS) for satellite communications network
US10044632B2 (en) Systems and methods for adaptive credit-based flow
WO2014169289A1 (fr) Largeur de bande à la demande dans des réseaux sdn
WO2019157978A1 (fr) Procédé de planification de paquet, premier dispositif de réseau et support de stockage lisible par ordinateur
JP2013510464A (ja) ネットワークリソース管理の方法および配置構成
CN117118911A (zh) 数据传输方法及装置
JP6341201B2 (ja) コンテンツ中継装置、コンテンツフロー中継方法およびプログラム
JP5476975B2 (ja) ネットワーク間データ配信システム、情報通信端末、コンテンツ配信サーバ
US10439947B2 (en) Method and apparatus for providing deadline-based segmentation for video traffic
JP6886874B2 (ja) エッジ装置、データ処理システム、データ送信方法、及びプログラム
Li et al. Towards QoE named content-centric wireless multimedia sensor networks with mobile sinks
JP6144559B2 (ja) 並列分散管理装置、プログラム及び並列分散処理システム
JP2016046669A (ja) パケット処理装置、プログラム及び方法
JP2005210347A (ja) 通信制御装置、および通信制御方法、並びにコンピュータ・プログラム
He et al. Towards smart routing: Exploiting user context for video delivery in mobile networks
JP6633500B2 (ja) 通信装置
JP2014147019A (ja) 通信装置、通信方法及び通信プログラム
EP3364616A1 (fr) Dispositif et procédé d'attribution de ressources a des réseaux d'accès selon un paramètre d'état de chacun

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: 14806854

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2015521368

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14806854

Country of ref document: EP

Kind code of ref document: A1