![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Nagao Ogino
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j27]Nagao Ogino
:
Robust Design of Interdependent Networks Considering Intra-Network Support Flow. IEEE Trans. Netw. Serv. Manag. 20(4): 4170-4185 (2023) - 2022
- [j26]Nagao Ogino, Takeshi Kitahara:
Monitoring Trails Computation within Allowable Expected Period Specified for Transport Networks. IEICE Trans. Commun. 105-B(1): 21-33 (2022) - [j25]Nagao Ogino:
Resilient Virtual Network Embedding Ensuring Connectivity under Substrate Node Failures. IEICE Trans. Commun. 105-B(5): 557-568 (2022) - 2020
- [c13]Nagao Ogino, Takeshi Kitahara:
Virtual Network Embedding Satisfying Resiliency of Cooperative Services. DRCN 2020: 1-8
2010 – 2019
- 2019
- [j24]Nagao Ogino
, Takeshi Kitahara:
Greedy computation of all-optical monitoring trails to minimize total monitoring cost. Opt. Switch. Netw. 32: 1-13 (2019) - [c12]Nagao Ogino, Takeshi Kitahara:
Distance-Based Virtual Network Embedding to Achieve Resilient Cooperative IoT Services. DRCN 2019: 75-82 - 2018
- [j23]Nagao Ogino, Takeshi Kitahara:
An Efficient Content Search Method Based on Local Link Replacement in Unstructured Peer-to-Peer Networks. IEICE Trans. Commun. 101-B(3): 740-749 (2018) - [j22]Nagao Ogino
, Takeshi Kitahara, Shin'ichi Arakawa, Go Hasegawa
, Masayuki Murata:
Lightweight Boolean Network Tomography Based on Partition of Managed Networks. J. Netw. Syst. Manag. 26(2): 284-313 (2018) - 2017
- [j21]Nagao Ogino
, Takeshi Kitahara, Shin'ichi Arakawa, Masayuki Murata:
Virtual network embedding with multiple priority classes sharing substrate resources. Comput. Networks 112: 52-66 (2017) - 2016
- [j20]Lu Chen
, Shin'ichi Arakawa, Hideyuki Koto, Nagao Ogino, Hidetoshi Yokota, Masayuki Murata
:
An evolvable network design approach with topological diversity. Comput. Commun. 76: 101-110 (2016) - [c11]Nagao Ogino, Takeshi Kitahara, Shin'ichi Arakawa, Go Hasegawa
, Masayuki Murata:
Decentralized boolean network tomography based on network partitioning. NOMS 2016: 162-170 - 2015
- [j19]Nagao Ogino, Hidetoshi Yokota:
Route Computation for Reliable Delivery of Threshold Secret Shared Content. IEICE Trans. Commun. 98-B(1): 209-218 (2015) - [j18]Nagao Ogino, Yuto Nakamura, Shigehiro Ano:
Optimization of Multicast Delivery for Threshold Secret Shared Content. IEICE Trans. Commun. 98-B(12): 2419-2430 (2015) - 2014
- [c10]Nagao Ogino, Hidetoshi Yokota:
Reliable delivery route computation for threshold secret shared content. DRCN 2014: 1-8 - [c9]Nagao Ogino, Hidetoshi Yokota:
Multicast delivery scheme for threshold secret shared content. GLOBECOM 2014: 1232-1238 - [c8]Lu Chen, Shin'ichi Arakawa, Masayuki Murata
, Hideyuki Koto, Nagao Ogino, Hidetoshi Yokota:
Designing an evolvable network with topological diversity. INFOCOM Workshops 2014: 789-794 - 2013
- [j17]Nagao Ogino, Hideyuki Koto, Hajime Nakamura, Shigehiro Ano:
Simplification of Service Functions Resulting from Growth in Scale of Networks. IEICE Trans. Commun. 96-B(9): 2224-2234 (2013) - [j16]Nagao Ogino, Shigehiro Ano:
Peer-to-Peer Content Multicast Using Off-Peak Periods in Wireless Access Links. IEICE Trans. Commun. 96-B(11): 2845-2855 (2013) - [c7]Nagao Ogino, Hidetoshi Yokota:
A heuristic computation method for monitoring trails terminated at specified nodes. CAMAD 2013: 217-222 - 2012
- [j15]Nagao Ogino, Hajime Nakamura:
All-Optical Monitoring Path Computation Using Lower Bounds of Required Number of Paths. IEICE Trans. Commun. 95-B(8): 2576-2585 (2012) - [j14]Nagao Ogino, Hajime Nakamura:
An Adaptive Method to Acquire QoS Class Allocation Policy Based on Reinforcement Learning. IEICE Trans. Commun. 95-B(9): 2828-2837 (2012) - [j13]Nagao Ogino, Takuya Omi, Hajime Nakamura:
Route Computation Method for Secure Delivery of Secret Shared Content. IEICE Trans. Commun. 95-B(11): 3456-3463 (2012) - 2011
- [j12]Nagao Ogino, Hajime Nakamura:
Telecommunications Network Planning Method Based on Probabilistic Risk Assessment. IEICE Trans. Commun. 94-B(12): 3459-3470 (2011) - [c6]Nagao Ogino, Hajime Nakamura:
All-Optical Monitoring Path Computation Based on Lower Bounds of Required Number of Paths. ICC 2011: 1-6 - 2010
- [j11]Nagao Ogino, Hajime Nakamura:
An Inter-Domain Path Computation Scheme Adaptive to Traffic Load in Domains. IEICE Trans. Commun. 93-B(4): 907-915 (2010)
2000 – 2009
- 2009
- [j10]Nagao Ogino, Hajime Nakamura:
An Efficient Multicast Forwarding Method for Optical Bursts under Restricted Number of Burst Replicas. IEICE Trans. Commun. 92-B(3): 828-837 (2009) - [j9]Nagao Ogino, Hajime Nakamura:
Adaptive QoS Class Allocation Schemes in Multi-Domain Path-Based Networks. IEICE Trans. Commun. 92-B(3): 898-908 (2009) - 2006
- [j8]Nagao Ogino, Hideaki Tanaka:
Optical Network Design Considering Transmission Equipment Failure and the Maintenance of Two Transmission Lines. IEICE Trans. Commun. 89-B(8): 2134-2142 (2006) - [j7]Nagao Ogino, Hideaki Tanaka:
Optimum Arrangement of Reliable Label-Switched Paths in MPLS Over Optical Networks. Telecommun. Syst. 31(1): 29-41 (2006) - 2005
- [j6]Nagao Ogino, Hideaki Tanaka:
Deflection Routing for Optical Bursts Considering Possibility of Contention at Downstream Nodes. IEICE Trans. Commun. 88-B(9): 3660-3667 (2005) - [j5]Nagao Ogino, Hideaki Tanaka:
A Distributed Route Computation Method to Promote Bandwidth Sharing between Backup Lightpaths. IEICE Trans. Commun. 88-B(10): 3930-3940 (2005) - [j4]Nagao Ogino, Naritoshi Arahata:
A Decentralized Optical Bursts Routing Based on Adaptive Load Splitting into Pre-Calculated Multiple Paths. IEICE Trans. Commun. 88-B(12): 4507-4516 (2005) - 2003
- [c5]Nagao Ogino, Hideaki Tanaka:
Performance improvement due to secondary LSP re-routing in MPLS over optical networks. GLOBECOM 2003: 2617-2622 - 2002
- [j3]Nagao Ogino:
Performance Analysis of Bidding Policy for Competitive Network Providers. Telecommun. Syst. 21(1): 65-86 (2002) - 2001
- [c4]Nagao Ogino, Masatoshi Suzuki:
Proposal of an Inter-AS Policy Routing and a Flow Pricing Scheme to Improve ASes' Profits. ICN (1) 2001: 673-686 - 2000
- [j2]Nagao Ogino:
Connection establishment protocol based on mutual selection by users and network providers. Decis. Support Syst. 28(1-2): 61-70 (2000)
1990 – 1999
- 1999
- [c3]Masakatsu Kosuga, Tatsuya Yamazaki, Nagao Ogino, Jun Matsuda:
Adaptive QoS Management Using Layered Multi-Agent System for Distributed Multimedia Applications. ICPP 1999: 388-394 - [c2]Masakatsu Kosuga, Tatsuya Yamazaki, Nagao Ogino, Jun Matsuda:
An Agent-Based Adaptive QoS Management Framework and Its Applications. IDMS 1999: 371-376 - 1998
- [c1]Nagao Ogino:
Connection establishment protocol based on mutual selection by users and network providers. ICE 1998: 60-67 - 1991
- [j1]Nagao Ogino, Yoshikazu Ikeda:
ATM video signal multiplexer with congestion control function. Signal Process. Image Commun. 3(4): 333-343 (1991)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint