EDBT 2026 Demo / reviewers in the wild / expert
Yasuhiko Ito
dblp:84/3203
· DBLP profile ↗
6ranked-venue papers
1as first author
0since 2021 · last 1992
0000-0002-9676-6961ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 6 · 1 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
5 papers |
Vehicular, aerial and satellite networks · 53% Network optimization and economics · 24% Optical networks · 8% |
Topics — the 11 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Vehicular, aerial and satellite networks
satellite communication |
0.0 | 4 | 1992 | SS/FDMA Router for Flexible Satellite Communications Networks · IEEE J. Sel. Areas Commun. 1992 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 |
Network optimization and economics
resource allocation |
0.0 | 4 | 1991 | 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 |
Optical networks › optical switching › optical burst switching
burst scheduling |
0.0 | 1 | 1991 | Burst scheduling algorithms for SS/TDMA systems · IEEE Trans. Commun. 1991 |
Routing and switching
scheduling algorithms |
0.0 | 1 | 1991 | Burst scheduling algorithms for SS/TDMA systems · IEEE Trans. Commun. 1991 |
Vehicular, aerial and satellite networks › satellite communication
SS/TDMA |
0.0 | 1 | 1991 | Burst scheduling algorithms for SS/TDMA systems · IEEE Trans. Commun. 1991 |
Vehicular, aerial and satellite networks › satellite communication
SS/TDMA time slot assignment |
0.0 | 1 | 1991 | Computer-Aided Planning of SS/TDMA Network Operation · IEEE J. Sel. Areas Commun. 1991 |
Wireless networking › cognitive radio › spectrum management
frequency assignment |
0.0 | 1 | 1989 | Optimization of frequency assignment · IEEE Trans. Commun. 1989 |
Vehicular, aerial and satellite networks › satellite networks
VSAT network |
0.0 | 1 | 1992 | SS/FDMA Router for Flexible Satellite Communications Networks · IEEE J. Sel. Areas Commun. 1992 |
Vehicular, aerial and satellite networks
satellite networks |
0.0 | 1 | 1979 | Effective Utilization of Geostationary Orbit Through Optimization · IEEE Trans. Commun. 1979 |
Cellular and mobile networks
interference management |
0.0 | 1 | 1979 | Effective Utilization of Geostationary Orbit Through Optimization · IEEE Trans. Commun. 1979 |
Vehicular, aerial and satellite networks › satellite networks
intersatellite interference |
0.0 | 1 | 1979 | Effective Utilization of Geostationary Orbit Through Optimization · IEEE Trans. Commun. 1979 |
Methods — techniques the papers use, named apart from their topics
bin packing · 0.0proof-of-concept model · 0.0computer simulation · 0.0traveling salesman problem · 0.0single machine scheduling · 0.0simulation · 0.0linear programming · 0.0branch-and-bound · 0.0assignment problem formulation · 0.0nonlinear programming · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | SS/FDMA Router for Flexible Satellite Communications NetworksabstractThe subchannel switched frequency-division multiple-access (SS/FDMA) system improve the routing flexibility of transponder banks in channelized multibeam satellites. This system can efficiently be utilised to construct a VSAT (very small aperture terminal) network and/or a business satellite communications network using small aperture terminals. The authors address the application of the SS/FDMA system to such networks. A proof-of-concept (POC) model of SS/FDMA onboard equipment called the SS/FDMA router is described in terms of its configuration and measured electrical performance. Results of transmission experiments using the POC model as well as computer simulations are presented. In addition, a redundant SS/FDMA router configuration is proposed, and its reliability is calculated for a 15-year satellite mission time. Finally, estimated values of volume, mass, and DC power consumption of the redundant SS/FDMA router are presented.> Hideyuki Shinonaga, Yasuhiko Ito |
IEEE J. Sel. Areas Commun. | 2 |
| 1991 | Computer-Aided Planning of SS/TDMA Network OperationabstractA 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. | 2 |
| 1991 | Burst scheduling algorithms for SS/TDMA systemsabstractEfficient 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. | 2 |
| 1989 | Optimization of frequency assignmentabstractA 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. | 2 |
| 1984 | Optimization of Frequency Assignment
Takeshi Mizuike, Yasuhiko Ito, Takuro Muratani |
ICC (2) | 2 |
| 1979 | Effective Utilization of Geostationary Orbit Through OptimizationabstractThe limitation in the effective use of the geostationary orbit is the intersatellite interference problem. A theoretical approach to realize an optimal usage of the orbit is provided in this paper, with particular attention to the constraints of service arcs, existence of spotbeam operating systems and different frequency plannings. The problem is formulated as a nonlinear programming problem and the sequential unconstrained minimization technique is applied to solve it numerically. Example computations are also given and various interference criteria are evaluated in terms of orbit utilization. Yasuhiko Ito, Toshio Mizuno, Takuro Muratani |
IEEE Trans. Commun. | 1 |