Information processing apparatus, information processing method, and computer program product

Patent metadata

Field	Value
Publication number	US-11032208-B2
Application number	US-201916551791-A
Country	US
Kind code	B2
Filing date	Aug 27, 2019
Priority date	Mar 14, 2019
Publication date	Jun 8, 2021
Grant date	Jun 8, 2021

Abstract

According to an embodiment, an information processing apparatus includes one or more processors. The processors prefetch a scheduling entry corresponding a future time period in advance from scheduling information including one or more scheduling entries, each entry of which contains a transmission state and an interval for each of one or more transmission queues. The processors determine a starting time of transmission for one or more frames waiting for transmission in each queue, based on the scheduling entry. At least one of timing of the prefetching process and timing of the scheduling process is determined based on a result of comparison of a time difference and one or more thresholds. The time difference is a difference between current time and future time where the future time is a candidate for starting time of transmission.

First claim

What is claimed is:

1. An information processing apparatus comprising:
one or more processors configured to:
perform a prefetching process that prefetches a scheduling entry corresponding a future time period in advance from scheduling information including one or more scheduling entries, each entry of which at least contains a transmission state and an interval for each of one or more transmission queues; and
perform a scheduling process that determines a starting time of transmission for one or more frames waiting for transmission in each queue, based on the scheduling entry, wherein

at least one of timing of the prefetching process and timing of the scheduling process is determined, based on a result of comparison of a time difference and one or more thresholds, where the time difference is a difference between current time and future time, the future time being a candidate for starting time of transmission, and
the processors are configured to:
evaluate each frame waiting for transmission in each queue and determine one or more schedulable frames, when the time difference is more than a first threshold, and the time difference is not more than a third threshold, wherein the first threshold is equal to or less than the third threshold,
perform no evaluation to determine one or more schedulable frames, when the time difference is equal to or less than the first threshold, or the time difference is more than the third threshold, and
schedule the starting time of transmission of the one or more schedulable frames.

2. The apparatus according to claim 1 , wherein the processors are configured to:
measure elapsed time of at least any part of the prefetching process, the scheduling process, schedulability evaluation process, and transmission of the one or more frames that are scheduled; and
calculate the thresholds based on the elapsed time.

3. The apparatus according to claim 1 , the processors are configured to start transmission of the one or more frames, based on the starting time of transmission of each frame.

4. An information processing apparatus comprising:
one or more processors configured to:
perform a prefetching process that prefetches a scheduling entry corresponding a future time period in advance from scheduling information including one or more scheduling entries, each entry of which at least contains a transmission state and an interval for each of one or more transmission queues; and
perform a scheduling process that determines a starting time of transmission for one or more frames waiting for transmission in each queue, based on the scheduling entry, wherein

at least one of timing of the prefetching process and timing of the scheduling process is determined, based on a result of comparison of a time difference and one or more thresholds, where the time difference is a difference between current time and future time, the future time being a candidate for starting time of transmission, and
the processors are configured to:
trigger prefetching next entry from the scheduling information, based on an available time for transmission for each and every queue at the future time, and decrease the available time for transmission, when the tune difference is equal to or less than the first threshold.

5. The apparatus according to claim 4 , wherein the processors are configured to decrease the available time for transmission based on at least any combination of the current time, the future time, the thresholds and an offset value.

6. The apparatus according to claim 4 , wherein the processors are configured to:
evaluate each frame waiting for transmission in each queue and determine one or more schedulable frames, when the time difference is more than the first threshold,
schedule the starting time of transmission of the one or more schedulable frames, and
decrease the available time for transmission, when o schedulable frames exist, and when the time difference is more than the first threshold, and the time difference is not more than a second threshold, where the first threshold is equal to or less than the second threshold.

7. An information processing apparatus comprising:
one or more processors configured to:
perform a prefetching process that prefetches a scheduling entry corresponding a future time period in advance from scheduling information including one or more scheduling entries, each entry of which at least contains a transmission state and an interval for each of one or more transmission queues; and
perform a scheduling process that determines a starting time of transmission for one or more frames waiting for transmission in each queue, based on the scheduling entry, wherein

at least one of timing of the prefetching process and timing of the scheduling process is determined, based on a result of comparison of a time difference and one or more thresholds, where the time difference is a difference between current time and future time, the future time being a candidate for starting time of transmission, and
the processors are configured to update the future time forward, when e time difference is equal to or less than the thresholds.

8. The apparatus according to claim 7 , wherein the processors are configured to update the future time, based on at least any combination of the current time, the future time, the thresholds, and an offset value.

9. An information processing method comprising:
performing a prefetching process that prefetches a scheduling entry corresponding a future time period in advance from scheduling information including one or more scheduling entries, each entry of which at least contains a transmission state and an interval for each of one or more transmission queues; and
performing a scheduling process that determines a starting time of transmission for one Or more frames waiting for transmission in each queue, based on the scheduling entry, wherein
at least one of timing of the prefetching process and timing of the scheduling process is determined, based on a result of comparison of a time difference and one or more thresholds, where the time difference is a difference between current time and future time, the future time being a candidate for starting time of transmission, and
the information processing method further comprising:
performing an evaluating process
that evaluates each frame waiting for transmission in each queue and determine one or more schedulable frames, when the time difference is more than a first threshold, and the time difference is not more than a third threshold, wherein the first threshold is equal to or less than the third threshold, and
that performs no evaluation to determine one or more schedulable frames, when the time difference is equal to or less than the first threshold, or the time difference is more than the third threshold wherein

the scheduling process includes a scheduling the starting time of transmission of the one or more schedulable frames.

10. A non-transitory computer-readable medium including programmed instructions, the instructions causing a computer to execute:
performing a prefetching process that prefetches a scheduling entry corresponding a future time period in advance from scheduling information including one or more scheduling entries, each entry of which at least contains a transmission state and an interval for each of one or more transmission queues; and
performing a scheduling process that determines a starting time of transmission for one or more frames waiting for transmission in each queue, based on the scheduling entry, wherein
at least one of timing of the prefetching process and timing of the scheduling process is determined, based on a result of comparison of a time differ

Assignees

• Toshiba Kk
• KABUSHIKl KAISHA TOSHIBA

Inventors

• Oge Yasin
• Kobayashi Yuta
• Yamaura Takahiro

Classifications

• H04L67/12

  specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks · CPC title

• H04L49/9023

  for implementing a jitter-buffer · CPC title

• H04L47/56 Primary

  implementing delay-aware scheduling · CPC title

• H04L47/622 Primary

  Queue service order · CPC title

• H04L67/5681

  Pre-fetching or pre-delivering data based on network characteristics · CPC title