Ken-ichi Sato

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hiroto Ishida

> Home > Persons > Ken-ichi Sato

Publications

2015
[j60]
- view
  authority control:
- export record
  dblp key:
  - journals/jocnet/IshidaHS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jocnet/IshidaHS15
Hiroto Ishida, Hiroshi Hasegawa, Ken-ichi Sato:
Hardware Scale and Performance Evaluation of a Compact Subsystem Modular Optical Cross Connect That Adopts Tailored Add/Drop Architecture. JOCN 7(6): 586-596 (2015)
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/ofc/IshidaHS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ofc/IshidaHS15
Hiroto Ishida, Hiroshi Hasegawa, Ken-ichi Sato:
Highly scalable subsystem modular OXC nodes that host tailored add/drop mechanism. OFC 2015: 1-3
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/ofc/TakashinaIMHSW15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ofc/TakashinaIMHSW15
Shoichi Takashina, Hiroto Ishida, Yojiro Mori, Hiroshi Hasegawa, Ken-ichi Sato, Toshio Watanabe:
Demonstration of large-port-count and compact ROADM that exhibits virtual-C/D/C performance. OFC 2015: 1-3
2014
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/ofc/IshidaHS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ofc/IshidaHS14
Hiroto Ishida, Hiroshi Hasegawa, Ken-ichi Sato:
Hardware scale and performance evaluation of compact OXC add/drop architecture. OFC 2014: 1-3

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.