default search action
Toyofumi Takenaka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c11]Haruki Omuro, Taiju Mikoshi, Toyofumi Takenaka:
Resilient multi-layer network designs and evaluations. APCC 2013: 81-86 - [c10]Taiju Mikoshi, Toyofumi Takenaka, Ryuta Sugiyama, Akeo Masuda, Kohei Shiomoto
, Atsushi Hiramatsu:
Virtual network designs and evaluations for IP over WDM networks. APCC 2013: 87-91 - 2012
- [c9]Yoshihiro Souda, Taiju Mikoshi, Toyofumi Takenaka:
High-speed topology construction method for network power saving. APCC 2012: 560-565 - [c8]Yusuke Sekine, Taiju Mikoshi, Toyofumi Takenaka:
Shared-Tree selection method for aggregated multicast. APCC 2012: 760-764 - 2011
- [j6]Taiju Mikoshi, Shinichi Momma, Toyofumi Takenaka:
PARC: Power Aware Routing and Clustering Scheme for Wireless Sensor Networks. IEICE Trans. Commun. 94-B(12): 3471-3479 (2011) - [c7]Taiju Mikoshi, Toyofumi Takenaka, Takayuki Fujiwara, Akeo Masuda, Kohei Shiomoto
Improvement of maximum admissible QoS traffic by traffic observations. HPSR 2011: 158-163 - [c6]Taiju Mikoshi, Toyofumi Takenaka, Ryuta Sugiyama, Akeo Masuda, Kohei Shiomoto:
Multi-layer network topology design for large-scale network. ITC 2011: 306-307 - 2010
- [j5]Tsutomu Makabe, Taiju Mikoshi, Toyofumi Takenaka:
WDM Multicast Tree Construction Algorithms and Their Comparative Evaluations. IEICE Trans. Commun. 93-B(9): 2282-2290 (2010) - [c5]Shinichi Momma, Taiju Mikoshi, Toyofumi Takenaka:
PARC: Power aware routing and clustering scheme for wireless sensor networks. Wireless Days 2010: 1-5
2000 – 2009
- 2009
- [j4]Taiju Mikoshi, Toyofumi Takenaka, Takayuki Fujiwara, Eiji Oki, Kohei Shiomoto
Optimization of input admissible traffic flow guaranteeing QoS. IEEE Commun. Lett. 13(1): 49-51 (2009) - 2008
- [j3]Takehiko Matsumoto, Toyofumi Takenaka:
Overlap Degree Aware Routing in All-Optical Routing Networks. IEICE Trans. Commun. 91-B(1): 212-220 (2008) - [c4]Tsutomu Makabe, Toyofumi Takenaka:
WDM Multicast Tree Construction Algorithms for Minimizing Blocking Probability under a Delay Constraint. ICCCN 2008: 566-571 - 2006
- [c3]Takehiko Matsumoto, Toyofumi Takenaka:
Overlap-Degree Aware Routing in All-Optical Networks. GLOBECOM 2006 - 2005
- [j2]Satosi Kato, Hidetosi Okamoto, Toyofumi Takenaka:
Load Balancing Routing Algorithm for Reverse Proxy Servers. IEICE Trans. Commun. 88-B(9): 3693-3700 (2005) - 2004
- [c2]Toyofumi Takenaka, Satosi Kato, Hidetosi Okamoto:
Adaptive load balancing content address hashing routing for reverse proxy servers. ICC 2004: 1522-1526
1990 – 1999
- 1990
- [c1]Kiyoshi Hayashi, Toshihiro Nishizono, Toyofumi Takenaka:
Distributed communication software specification based on the action superposition mechanism. COMPSAC 1990: 273-281
1980 – 1989
- 1983
- [j1]Kenichi Mase, Toyofumi Takenaka, Hisao Yamamoto, Masaaki Shinohara:
Go-Back-N ARQ Schemes for Point-to-Multipoint Satellite Communications. IEEE Trans. Commun. 31(4): 583-589 (1983)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: