Kddi Corporation

Kiddi Corporation

Kokusai Denshin Denwa Co., Ltd.

Ddi Corp.

Hajime Nakamura

Hiroyuki Yokoyama

Yasuhiko Hiehata

Hideyuki Koto

Takeshi Kitahara

Satoshi Konishi

Yoji Kishi

Hiroki Furuya

Masaki Fukushima

Toru Hasegawa

Toshio Kato

Akio Ishikawa

Shinichi Nomoto

Teruyuki Hasegawa

Atsushi Tagami

Hiroyuki Fukuoka

Satoshi Uemura

Kouji Nakao

Norihiro Fukumoto

Hideaki Yamada

A technique is disclosed of controlling a layer count of actual layers within a layered media stream having a maximum number 'M' of layers that include 'm(0&#x2266;m&#x2266;M)' video layers and an audio layer. The technique includes: receiving from at least one destination a quality event indicative of audio quality of the audio layer; calculating an estimated value of subjective quality of the received audio layer, based on the received quality event; calculating a quality value indicative of transmission quality of the media stream, based on the calculated subjective quality, and a ratio of a layer count &#x201c;m&#x201d; of at least one of the video layers, to the maximum number &#x201c;M;&#x201d; and, based on the calculated quality value, controlling a layer count of actual layers within the media stream.

Adaptive control of layer count of layered media stream

A control server, receives the number of user terminals U which have transited to the individual Web pages from a monitoring serverin Step S. In Step S, based on the received number of transitions U of the individual Web pages, application of control is decided by the control server. Here, based on the assumption that the number of transitions Uc to a Web page C including a transaction access or hyper link to the end serveraccurately represents the number of executed transactions, the number of transitions Uc to Web page C is compared with an upper limit value Cmax. When Uc&#x3c;Cmax, the process proceeds to Step Sand a control information is sent from the control serverto the user terminalsto cancel the application of control.

Transmission control system

A module transmits a request for line connection to a module at a communication time notified from a module. The module proceeds to line connection processing in response to the request for line connection and notifies the module of success or failure of line connection. The module notifies a log database of the notified success or failure of line connection. The log database records success or failure of line connection in a database as log data and notifies the module of the log data at predetermined time intervals. The module revises a communication time based on the log data and notifies the module of the revised communication time.

Wireless node

A throughput detectordetects a throughput R. A threshold value Rref of the throughput Rat which a network side can be presumed to be congested is stored in a threshold value storage unit. A comparatorcompares the current throughput Rwith the threshold value Rref. A release request unitrequests release of a wireless resource when the throughput Rfalls below the threshold value Rref. In response to the release request, a controllersuitably disconnects a physical layer or a logical layer of a wireless section to release the wireless resource. A release term determining unitdetermines a release term of the wireless resource. A resource request unitmakes the released wireless resource be acquired anew after the elapse of the release term to reconnect the wireless communication.

Traffic control method and apparatus for wireless communication

A communication permitted slot setting sectionrandomly and equally divides one prescribed cycle for each wireless terminal and sets some of them, respectively, as permitted slots 'p.' A communication assigning sectionassigns the total communication 'n' per one cycle pre-assigned to each wireless terminal to each permitted slot &#x201c;p.&#x201d; A communication timing determining sectionrandomly determines communication timings for each permitted slot &#x201c;p.&#x201d; A degree-of-congestion measuring sectionmeasures the degree of congestion of wireless resources. A connectivity estimating sectionestimates the connectivity M for each permitted slot. Each time a communication opportunity is consumed, a communication readjusting sectionassigns the communication opportunity to an permitted slot with a higher connectivity M at a higher probability in the next cycle.

Wireless terminal

A radio communication terminal includes a link-usage level calculating section that calculates usage level of a radio link, and a data reception continuation/suspension determining section that determines continuation of data reception or suspension of data reception according to the level of usage calculated by the link-usage level calculating section. The link-usage level calculating section calculates a current usage level indicating a level of usage of the radio link associated with current data reception in the radio communication terminal. The data reception continuation/suspension determining section determines continuation of data reception when the current usage level is equal to or higher than a reference level of usage being a threshold and determines suspension of data reception when the current usage level is lower than the reference level of usage.

Radio communication terminal

Control of readout of packets from a packet buffer is disclosed in which equal numbers of tokens are removed and used from token buckets having different bucket sizes; tokens are generated at token rates for the token buckets, wherein each token rate is preset such that the larger the token bucket size, the lower the token rate, and the generated tokens are added to the token buckets; a used-token count is measured for each token bucket, and a stored-token count is measured for each token bucket, with the stored-token count given a negative value if each token bucket is empty; and a number of data packets are read out of the packet buffer, which depends on the measured value of the used-token count for each token buffer.

Control of packet buffer using token buckets with different token bucket sizes

The invention is directed to a traffic control system. The traffic control system comprises a communication device. The communication device includes a traffic type differentiation unit for differentiating a traffic type of an application that generates traffic to be processed on a communication network, a traffic control execution unit for controlling the traffic according to a traffic control condition corresponding to the traffic type, and a setting change reception unit for receiving setting change information on the traffic type or setting change information on the traffic control condition from the communication network. The traffic control system also comprises a setting change information transmission device provided on the communication network for transmitting setting change information.

Traffic control system, traffic control method, communication device and computer program

Traffic control for a communication network using a token bucket. Tokens stored in the token bucket and data throughput to/from a data buffer are monitored, and a new token rate is determined based on the data throughput during the period that at least one token is stored in the token buffer.

Apparatus, method and computer program for traffic control

A radio communication apparatus has a battery, a transmit buffer for temporarily accumulating packets to be sent, a battery state monitoring unit for monitoring a battery state of the battery, and a traffic control unit. The traffic control unit determines a packet burst length and an interval time between the packet bursts in order to obtain charge recovery effect based on the battery state, and controls so as to take out data packets of the packet burst length from the transmit buffer for every interval time between the packet bursts of the packet burst.

Radio communication apparatus and traffic control method for extending drive-time of battery

A wavelength path switching node apparatus is provided that improves the utilization efficiency of wavelength resources by allocating wavelength paths by following traffic variations in packet units. A node apparatus on the wavelength path start point side includes: a packet distributing section that stores input packets in a buffer, fetches the packets from the buffer and distributes to an initial path and additional paths; a control section that allocates the additional paths based on distribution states of the packet units; and an optical switch that switches wavelength paths based on this control. A node apparatus on the wavelength path end point side includes: a monitoring section that monitors packets distributed to the initial path and the additional paths; a control section that allocates the additional paths based on distribution states of the packet units obtained by this monitoring; and an optical switch that switches wavelength paths based on this control.

Wavelength path switching node apparatus and wavelength path allocation method

An optical cross-connect for selecting a path between an access-line connected to a router and a trunk-line connected to another optical cross-connect the optical cross-connect has a hash-table H for randomly specifying a trunk-line number k as elements h(i,j)=k in the order of selection j for every access-line number i; and a path selection means for selecting a path of trunk-line number k with a busy flag that has been reset, in the order of selection j by using the hash-table H when a path addition to an access-line number i is requested, the path selection means setting the busy flags of all elements h that specify the selected trunk-line number k in the hash-table H.

Optical cross-connect with path selecting function

A system, including: a source node apparatus; a destination node apparatus; the source node apparatus and the destination node apparatus both being in an Internet Protocol/Wavelength Division Multiplexing network; an initial path connecting the source node apparatus to the destination node apparatus; a first router associated with the source node apparatus; a second router associated with the destination node apparatus; and a optical cross-connect associated with the source node apparatus and configured to add and delete at least one additional path between the first and second routers, the first optical cross-connect configured to add and delete the at least one additional path independently and asynchronously of a traffic variation without signaling the destination node apparatus.

System with node apparatuses in IP/WDM network

Data of traffic with long-range dependence characteristics is generated by a host terminal and transferred to a memory arranged on a board. The memory stores the traffic data comprising at least one of the number of IP packets output per unit time and total number of bytes, a set value of each parameter of the generated IP packets (i.e., packet length table) and an IP address table. A packet generation section refers to the data in the memory to generate traffic with long-range dependence characteristics at a speed corresponding to a high-speed network. As a result, the behavior of the network at the time of application of the load can be measured before the actual use of the network. According to the present invention, a traffic generation apparatus that can supply the actual network with a load close to the real traffic can be provided.

Traffic generation apparatus suitable for use in communication experiments

There is proposed a competitive buying and selling system that avoids unnatural bidding prices and exclusive possession of resources, stabilizes bidding prices, and provides such an environment that participants can bid easily. There are included a first step in which a server opens a subject of buying and selling and a successful bid evaluation function thereof to a plurality of clients, a second step in which each of the clients makes a participant determine the subject of buying and selling and a bidding price thereof by using the successful bid evaluation function, and notifies a determined result to the server, and a third step in which the server selects a bidding price of a participant who has indicated a highest evaluation value based on the successful bid evaluation function among all bidding prices notified from the clients and designates the participant as a successful bidder. The successful bid evaluation function is based on past bidding prices per unit volume and utilization efficiencies of resources knocked down in past. Furthermore, the successful bid evaluation function is based further on a resource occupation rate in bidding of this time.

Growing community of inventors

Saitama, Japan

Hajime Nakamura