Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Takeshi Mizuike

dblp:20/5306 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2002
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 7 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
4 papers
Network optimization and economics · 43% Vehicular, aerial and satellite networks · 31% Wireless networking · 14%

Topics — the 12 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network optimization and economics
resource allocation
0.041997
Flexible Transmission Bandwidth Management with Effective Channel Reservation Techniques for NGSO MSS Networks · IEEE J. Sel. Areas Commun. 1997
Burst scheduling algorithms for SS/TDMA systems · IEEE Trans. Commun. 1991
Computer-Aided Planning of SS/TDMA Network Operation · IEEE J. Sel. Areas Commun. 1991
Vehicular, aerial and satellite networks
satellite communication
0.031991
Burst scheduling algorithms for SS/TDMA systems · IEEE Trans. Commun. 1991
Computer-Aided Planning of SS/TDMA Network Operation · IEEE J. Sel. Areas Commun. 1991
Optimization of frequency assignment · IEEE Trans. Commun. 1989
Wireless networking
channel assignment
0.011997
Flexible Transmission Bandwidth Management with Effective Channel Reservation Techniques for NGSO MSS Networks · IEEE J. Sel. Areas Commun. 1997
Network optimization and economics
column generation
0.011997
Flexible Transmission Bandwidth Management with Effective Channel Reservation Techniques for NGSO MSS Networks · IEEE J. Sel. Areas Commun. 1997
Network optimization and economics › resource allocation
dynamic resource management
0.011997
Flexible Transmission Bandwidth Management with Effective Channel Reservation Techniques for NGSO MSS Networks · IEEE J. Sel. Areas Commun. 1997
Vehicular, aerial and satellite networks
satellite networks
0.011997
Flexible Transmission Bandwidth Management with Effective Channel Reservation Techniques for NGSO MSS Networks · IEEE J. Sel. Areas Commun. 1997
Optical networks › optical switching › optical burst switching
burst scheduling
0.011991
Burst scheduling algorithms for SS/TDMA systems · IEEE Trans. Commun. 1991
Routing and switching
scheduling algorithms
0.011991
Burst scheduling algorithms for SS/TDMA systems · IEEE Trans. Commun. 1991
Vehicular, aerial and satellite networks › satellite communication
SS/TDMA
0.011991
Burst scheduling algorithms for SS/TDMA systems · IEEE Trans. Commun. 1991
Vehicular, aerial and satellite networks › satellite communication
SS/TDMA time slot assignment
0.011991
Computer-Aided Planning of SS/TDMA Network Operation · IEEE J. Sel. Areas Commun. 1991
Wireless networking › cognitive radio › spectrum management
frequency assignment
0.011989
Optimization of frequency assignment · IEEE Trans. Commun. 1989
Cellular and mobile networks › mobility management
handover
0.011997
Flexible Transmission Bandwidth Management with Effective Channel Reservation Techniques for NGSO MSS Networks · IEEE J. Sel. Areas Commun. 1997

Methods — techniques the papers use, named apart from their topics

simulation · 0.0linear programming · 0.0column generation · 0.0bin packing · 0.0traveling salesman problem · 0.0single machine scheduling · 0.0branch-and-bound · 0.0assignment problem formulation · 0.0
YearPublicationVenuePosition
2002 Large-scale CFO-SS (high-speed, long-range 2.4 GHz wireless LAN) network for educational Internet access
abstract
A 2.4 GHz wireless LAN network interconnecting schools and educational facilities is constructed employing CFO-SS (carrier frequency offset-spread spectrum) systems. The CFO-SS system provides high-speed (10 or 18 Mbit/s) and long-range transmission without reducing the transmission speed. Parameters of CFO-SS links such as radio channels, antenna polarizations and access modes are selected by considering the CFO-SS network architecture. Changing a radio channel by a network management software, CFO-SS keeps the link quality at a predetermined level under interference from other existing systems using the 2.4 GHz band. The throughput performance is improved with a window control protocol of CFO-SS.
Naoki Fuke, Takayuki Warabino, Hiroyasu Ishikawa, Hideyuki Shinonaga, Takeshi Mizuike
WCNC5
1999 Frequency and time slot assignment algorithms for FDMA/TDMA non-GEO MSS with multiple gateway Earth stations
abstract
FDMA/TDMA non-GEO MSS (mobile satellite services) systems generally require a pre-planned pool of radio resources, i.e., frequency and time slot plan (FTSP), for each gateway Earth station (GES) prior to the real-time channel allocation by the multiple GESs sharing the resources harmoniously. The time-variant nature of those systems implies that a dynamic FTSP planning method is crucial to the operation to cope with time-variant traffic demand and inter-beam interference condition. This paper proposes and compares two resource assignment algorithms (spread type algorithm and concentrated-type algorithm). Numerical evaluation demonstrates that the spread type algorithm is very effective and promising in the FTSP generation for such systems.
Satoshi Konishi, Shinichi Nomoto, Takeshi Mizuike
ICC3
1997 Flexible Transmission Bandwidth Management with Effective Channel Reservation Techniques for NGSO MSS Networks
abstract
This paper describes efficient transmission bandwidth management based on flexible channel assignment and effective grade of service (GOS) control methods for nongeostationary orbit mobile satellite service (NGSO MSS) networks. Our basic approach for the flexible channel assignment is to use linear programming (FLEXCA-LP), and to apply the column generation technique for further reduction of the total bandwidth requirement. These methods efficiently assign channels, taking account of moving spot beam coverage and dynamic traffic load variation for large-scale networks. The GOS is investigated for the channel assignment by FLEXCA-LP to make the GOS of ongoing calls better than that of fresh calls as stipulated in ITU-T Recommendations. We propose a few effective means to improve the results of FLEXCA-LP by reducing the disruption possibility of ongoing calls. One is to add channels utilizing a hysteresis concept. The others are effective use of GOS control techniques for NGSO MSS networks. These techniques are evaluated by a simulation study to identify promising techniques. Under time-variant conditions, we show that a reliable channel assignment plan is generated first by FLEXCA-LP considering the traffic load of fresh calls only and then by GOS control techniques to improve handover failure and call disruption rates.
Satoshi Konishi, Takeshi Mizuike, Yoji Kishi, Yu Watanabe
IEEE J. Sel. Areas Commun.2
1991 Computer-Aided Planning of SS/TDMA Network Operation
abstract
A computer-aided approach to the planning of SS/TDMA network operation is proposed. SS/TDMA is a sophisticated satellite communication network based on an onboard switch matrix, whose operation planning is formulated as a large-scale scheduling problem. An overall planning and scheduling model is presented to deal with practical SS/TDMA systems, such as a two-frequency channel network and nondisjoint beam coverage. For systematic planning suitable for a computer-aided approach, the entire scheduling process is divided into several steps, for each of which an efficient mathematical model is proposed. A linear programming model is used for distribution of traffic on a beam-to-beam basis and the generated switching sequence is further refined by a model using the traveling salesman problem. Burst scheduling is carried out by the Bin packing algorithm and scheduling models for practical networks allowing transponder hopping and multidestination bursts. An algorithm called enhanced rescheduling is presented to further improve the scheduling capability of the existing methods. The performance of the proposed methods is demonstrated by simulation results.>
Takeshi Mizuike, Yasuhiko Ito, Lan N. Nguyen, Eijiro Maeda
IEEE J. Sel. Areas Commun.1
1991 Burst scheduling algorithms for SS/TDMA systems
abstract
Efficient algorithms that generate a detailed operation plan for satellite-switched time-division multiple access (SS/TDMA) systems are proposed. A burst time plan generation problem is analyzed and two algorithms for burst scheduling are presented. The first method is an algorithm based upon a bin pack problem. The other algorithm schedules new bursts while reassigning already scheduled bursts by a single machine scheduling model. These algorithms are shown to be applicable to practical systems operating with transponder hopping and multidestination bursts. Simulation results for a number of example problems are presented.>
Takeshi Mizuike, Yasuhiko Ito, David J. Kennedy, Lan N. Nguyen
IEEE Trans. Commun.1
1989 Optimization of frequency assignment
abstract
A systematic method of determining carrier frequency assignment is proposed to minimize the cochannel interference in satellite communication systems. For the mathematical treatment of the problem, discrete positioning of carriers is introduced to avoid the nonlinear expression inherent in interference evaluation. The proposed method converts this nonlinear problem into the well-known assignment problem and enables the development of an algorithm based on the branch-and-bound method. Extended models of the proposed method are presented for practical application. To demonstrate the effectiveness of the method, computation results are shown for two typical problems. In both of the examples, cochannel interference is significantly reduced as the result of optimization of frequency assignment.>
Takeshi Mizuike, Yasuhiko Ito
IEEE Trans. Commun.1
1984 Optimization of Frequency Assignment
Takeshi Mizuike, Yasuhiko Ito, Takuro Muratani
ICC (2)1