Yaguang Kong - IEEE Xplore Author Profile

Scheduled Maintenance on Monday 1/13/2025

Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.

IEEE.org
IEEE Xplore
IEEE SA
IEEE Spectrum
More Sites

- Donate
- Personal Sign In

Access provided by:

MIT Libraries

Access provided by:

MIT Libraries

ADVANCED SEARCH

Author details

Yaguang Kong

Publications

20

Citations

131

Publications by Year

20062024

Co-Authors:

Li ChaiJie ChenZhangping ChenHonghuan ChenShixing Chen

Show All Co-Authors (47)

Yaguang Kong

Affiliation

College of Automation

Hangzhou Dianzi University

Hangzhou, China

Publication Topics

Evaluation Of Function,
Adaptive Control,
Control Protocol,
Control Strategy,
Convolutional Neural Network,
Graph Theory,
Information Of Agents,
Multi-agent Systems,
Neural Network,
Output Power,
Resonance Frequency,
Stability Of System

Biography

Yaguang Kong received the B.Sc. and Ph.D. degrees in control science and engineering from Zhejiang University, Hangzhou, China, in 1997 and 2002 respectively.,He is currently a Professor with the School of Automation, Hangzhou Dianzi University. His research interests include computer vision, deep learning, ultrasonic machining, and industry automation.(Based on document published on 29 August 2023).

Publications

20

Citations

131

Publications by Year

20062024

Co-Authors:

Li Chai
Jie Chen
Zhangping Chen
Honghuan Chen
Shixing Chen

Show All Co-Authors (47)

Author's Published Works

Search History

Showing 1-25 of 383 results

Conferences (255)

Journals (115)

Magazines (9)

Early Access Articles (4)

Sort

Filter Results

Show

Subscribed Content

Open Access Only

Range
Single Year
Eiji Oki(316)
Fujun He(76)
Takehiro Sato(68)
E. Oki(66)
Bijoy Chand Chatterjee(61)
Graduate School of Informatics, Kyoto University, Kyoto, Japan(129)
Kyoto University, Kyoto, Japan(49)
Department of Information and Communication Engineering, University of Electro-Communications, Tokyo, Japan(28)
South Asian University, New Delhi, India(21)
NTT Network Service Systems Laboratories, Musashino, Tokyo, Japan(15)
IEEE Transactions on Network and Service Management(39)
IEEE Access(17)
IEEE Communications Letters(12)
Journal of Optical Communications and Networking(9)
IEEE Communications Magazine(8)
IEEE(381)
IEICE(1)
KICS(1)
Datasets(1)
Media(1)
Yokohama, Japan(12)
Beijing, China(8)
Budapest, Hungary(8)
Kyoto, Japan(8)
Tokyo, Japan(8)
Computation Time(94)
Integer Linear Programming Problem(81)
Virtual Network Functions(70)
Heuristic Algorithm(66)
Traffic Demand(66)

Select All on Page

Sort By

Results

AnDefrag: Analytical Model for Blocking Probabilities Considering Defragmentation in Spectrally-Spatially Elastic Optical Networks

Imran Ahmed;Eiji Oki;Bijoy Chand Chatterjee

IEEE Transactions on Networking

Year: 2025 | Early Access Article |

In recent years, space division multiplexing (SDM) technology, particularly multi-core and multi-mode fibers (MCMMFs), has been investigated to overcome physical limitations and enhance transport capacity. When SDM is integrated with elastic optical networks (EONs), it gives rise to an emerging technology known as spectrally-spatially elastic optical networks (SS-EONs). However, SS-EONs face signi...Show More

AnDefrag: Analytical Model for Blocking Probabilities Considering Defragmentation in Spectrally-Spatially Elastic Optical Networks

Imran Ahmed;Eiji Oki;Bijoy Chand Chatterjee

IEEE Transactions on Networking

Year: 2025 | Early Access Article |

Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications

Masaki Oda;Akio Kawabata;Eiji Oki

IEEE Networking Letters

Year: 2025 | Early Access Article |

This paper proposes two polynomial-time approximation algorithms for allocating servers to design a consistency-aware multi-server network for delay-sensitive applications. Each algorithm selects servers and determines the main-secondary server pairs to minimize the total delay. Previous work has not provided any polynomial-time algorithm. The proposed algorithms are theoretically guaranteed to ou...Show More

Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications

Masaki Oda;Akio Kawabata;Eiji Oki

IEEE Networking Letters

Year: 2025 | Early Access Article |

Design of Multiple-Plane Twisted and Folded Clos Network Guaranteeing Admissible Blocking Probability

Eiji Oki;Ryotaro Taniguchi;Kazuya Anazawa;Takeru Inoue

IEEE Transactions on Network and Service Management

Year: 2025 | Early Access Article |

Future advancements in data centers are anticipated to incorporate advanced circuit switching technologies, especially optical switching, which achieve high transmission capacity and energy efficiency. Previous studies addressed a Clos-network design problem to guarantee an admissible blocking probability to maximize the switching capacity, which is defined by the number of terminals connected to ...Show More

Design of Multiple-Plane Twisted and Folded Clos Network Guaranteeing Admissible Blocking Probability

Eiji Oki;Ryotaro Taniguchi;Kazuya Anazawa;Takeru Inoue

IEEE Transactions on Network and Service Management

Year: 2025 | Early Access Article |

Flow Update Model Based on Probability Distribution of Migration Time in Software-Defined Networks

Reo Uneyama;Takehiro Sato;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2025 | Volume: 22, Issue: 1 | Journal Article |

HTML

In a software-defined network (SDN), routes of packet flows need to be updated in situations such as maintenance and router replacement. Each flow is migrated from its old path to new path. The SDN update has an asynchronous nature; the time when the switches process commands by the controller varies depending on flows. Therefore, it is difficult to control an order of flow migrations, and packets...Show More

Flow Update Model Based on Probability Distribution of Migration Time in Software-Defined Networks

Reo Uneyama;Takehiro Sato;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2025 | Volume: 22, Issue: 1 | Journal Article |

A Machine Learning Approach to Estimating Queuing Delay on Routers: The Multiple-Hop Case

Khondaker Salehin;Travis Ricker;Yi Wang;Alex Chen;Eiji Oki

2024 34th International Telecommunication Networks and Applications Conference (ITNAC)

Year: 2024 | Conference Paper |

HTML

Compression and Decompression (CoDe) is an active, state-of-the-art scheme for measuring queuing delay on Internet routers that utilizes an unsupervised learning algorithm for data processing. In this paper, we present a comparative evaluation of CoDe over a multiple-hop path under demanding traffic conditions using ns-3 simulation. This is the first evaluation of this kind because prior study of ...Show More

A Machine Learning Approach to Estimating Queuing Delay on Routers: The Multiple-Hop Case

Khondaker Salehin;Travis Ricker;Yi Wang;Alex Chen;Eiji Oki

2024 34th International Telecommunication Networks and Applications Conference (ITNAC)

Year: 2024 | Conference Paper |

Robust Deployment Model for Parallelized Service Function Chains Against Uncertain Traffic Arrival Rates

Chenlu Zhang;Takehiro Sato;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Early Access Article |

In network function virtualization, a network service is provided by a service function chain (SFC), which consists of a chain of virtual network functions (VNFs) within a specific order. SFC parallelism allows parallel processing among VNFs to reduce the end-to-end service delay. Existing works handle the service delay without considering traffic uncertainty, which leads to degraded performance o...Show More

Robust Deployment Model for Parallelized Service Function Chains Against Uncertain Traffic Arrival Rates

Chenlu Zhang;Takehiro Sato;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Early Access Article |

Optical circuit switched three-stage twisted-folded Clos-network design model guaranteeing admissible blocking probability

Ryotaro Taniguchi;Takeru Inoue;Kazuya Anazawa;Eiji Oki

Journal of Optical Communications and Networking

Year: 2024 | Volume: 16, Issue: 11 | Journal Article |

Some data center networks have already started to use optical circuit switching (OCS) with potential performance benefits, including high capacity, low latency, and energy efficiency. This paper addresses a switching network design to maximize the network radix, i.e., the number of terminals connected to the network under the condition that a specified number of identical switches with the size $N...Show More

Optical circuit switched three-stage twisted-folded Clos-network design model guaranteeing admissible blocking probability

Ryotaro Taniguchi;Takeru Inoue;Kazuya Anazawa;Eiji Oki

Journal of Optical Communications and Networking

Year: 2024 | Volume: 16, Issue: 11 | Journal Article |

Node-Oriented Slice Reconfiguration Based on Spatial and Temporal Traffic Prediction in Metro Optical Networks

Bowen Bao;Hui Yang;Qiuyan Yao;Jie Zhang;Bijoy Chand Chatterjee;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Volume: 21, Issue: 6 | Journal Article |

HTML

Given the spring-up of diverse new applications with different requirements in metro optical networks, network slicing provides a virtual end-to-end resource connection with customized service provision. To improve the quality-of-service (QoS) of slices with long-term operation in networks, it is beneficial to reconfigure the slice adaptively, referring to the future traffic state. Considering the...Show More

Node-Oriented Slice Reconfiguration Based on Spatial and Temporal Traffic Prediction in Metro Optical Networks

Bowen Bao;Hui Yang;Qiuyan Yao;Jie Zhang;Bijoy Chand Chatterjee;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Volume: 21, Issue: 6 | Journal Article |

Toward Increasing Switching Capacity of Twisted and Folded Clos Network Guaranteeing Admissible Blocking Probability

Eiji Oki;Haruto Taka;Takeru Inou

2024 24th International Conference on Transparent Optical Networks (ICTON)

Year: 2024 | Conference Paper |

HTML

Anticipated is the establishing of a future data center network, built with a Clos network comprising optical-circuit switches to manage the increasing traffic volume. A twisted and folded Clos network (TF-Clos) expands the switching capacity under a strict non-blocking (SNB) condition compared to a folded Clos network. If we relax the SNB condition, where we allow an admissible blocking probabili...Show More

Toward Increasing Switching Capacity of Twisted and Folded Clos Network Guaranteeing Admissible Blocking Probability

Eiji Oki;Haruto Taka;Takeru Inou

2024 24th International Conference on Transparent Optical Networks (ICTON)

Year: 2024 | Conference Paper |

Cooperative Task Offloading for Multi-Access Edge-Cloud Networks: A Multi-Group Multi-Agent Deep Reinforcement Learning

Akito Suzuki;Masahiro Kobayashi;Eiji Oki

2024 33rd International Conference on Computer Communications and Networks (ICCCN)

Year: 2024 | Conference Paper |

HTML

Cloud computing (CC) and edge computing (EC) enhance the performance of end devices (EDs) with limited computational power by offloading tasks to cloud and edge servers, respectively. Multi-access edge computing (MEC) further advances EC by integrating wireless network resources, thus improving mobile service efficiency. While CC is well-suited for intensive computational tasks, it may face latenc...Show More

Cooperative Task Offloading for Multi-Access Edge-Cloud Networks: A Multi-Group Multi-Agent Deep Reinforcement Learning

Akito Suzuki;Masahiro Kobayashi;Eiji Oki

2024 33rd International Conference on Computer Communications and Networks (ICCCN)

Year: 2024 | Conference Paper |

Efficient fiber-inspection and certification method for optical-circuit-switched datacenter networks

Kazuya Anazawa;Takeru Inoue;Toru Mano;Hideki Nishizawa;Eiji Oki

Journal of Optical Communications and Networking

Year: 2024 | Volume: 16, Issue: 8 | Journal Article |

Datacenter networks (DCNs) consisting of optical circuit switches (OCSs) have been considered as a promising solution to dramatically improve their transmission capacity, energy efficiency, and communication latency. To scale optical-circuit-switched DCNs (OCS DCNs), hierarchical OCSs with tens of thousands of optical fibers need to be installed, and they should be inspected before starting datace...Show More

Efficient fiber-inspection and certification method for optical-circuit-switched datacenter networks

Kazuya Anazawa;Takeru Inoue;Toru Mano;Hideki Nishizawa;Eiji Oki

Journal of Optical Communications and Networking

Year: 2024 | Volume: 16, Issue: 8 | Journal Article |

Multiple-Backup Resource Allocation Model for Virtual Machines With Probabilistic Protection

Kento Yokouchi;Ryuta Shiraki;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Volume: 21, Issue: 5 | Journal Article |

HTML

For cloud providers, it is essential to improve the quality of service that depends on the failure probability of protection and the computing capacity cost such as backup resources. Existing studies addressed a protection approach to reduce the required backup capacity by sharing backup capacity among multiple primary resources. Still, the sharing effect is limited, and there is room to enhance i...Show More

Multiple-Backup Resource Allocation Model for Virtual Machines With Probabilistic Protection

Kento Yokouchi;Ryuta Shiraki;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Volume: 21, Issue: 5 | Journal Article |

VNEavXT: Offline Virtual Network Embedding Model Considering Crosstalk-Avoided Approach in Spectrally-Spatially Elastic Optical Networks

Vinay Kumar;Joy Halder;Abhijit Mitra;Eiji Oki;Bijoy Chand Chatterjee

IEEE Transactions on Network Science and Engineering

Year: 2024 | Volume: 11, Issue: 5 | Journal Article |

Cited by: Papers (1)

HTML

Infrastructure as a service and network virtualization facilitates the network provider/operator to lease out the resources among different stakeholders, hence promoting the sharing of network resources among stakeholders. At the same time, spectrally-spatially elastic optical networks (SS-EONs) have emerged as a prominent solution to release pressures out of the backhaul network by overcoming the...Show More

VNEavXT: Offline Virtual Network Embedding Model Considering Crosstalk-Avoided Approach in Spectrally-Spatially Elastic Optical Networks

Vinay Kumar;Joy Halder;Abhijit Mitra;Eiji Oki;Bijoy Chand Chatterjee

IEEE Transactions on Network Science and Engineering

Year: 2024 | Volume: 11, Issue: 5 | Journal Article |

Latency-Aware Cache Mechanism for Resolver Service of Domain Name Systems

Ibirisol Fontes Ferreira;Eiji Oki

NOMS 2024-2024 IEEE Network Operations and Management Symposium

Year: 2024 | Conference Paper |

HTML

The domain name system (DNS) is essential to access Internet services. However, although DNS has become a vital part of Internet users in the network and facilitates the process, it is still a critical part of the service chain. This is principally due to its resolver component, which can negatively impact the final user experience of consuming services. Furthermore, to improve service quality and...Show More

Latency-Aware Cache Mechanism for Resolver Service of Domain Name Systems

Ibirisol Fontes Ferreira;Eiji Oki

NOMS 2024-2024 IEEE Network Operations and Management Symposium

Year: 2024 | Conference Paper |

Algorithm for Server Allocation in Delay-Sensitive Internet-of-Things Monitoring Services

Shoya Imanaka;Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki

2024 International Conference on Computing, Networking and Communications (ICNC)

Year: 2024 | Conference Paper |

HTML

This paper proposes a polynomial-time algorithm for a server allocation problem in delay-sensitive Internet-of-Things (IoT) monitoring services. The server allocation problem determines the appropriate servers to which the database and application are allocated to minimize the maximum delay between the latest update of reference data and the start of application processing for monitoring data. The...Show More

Algorithm for Server Allocation in Delay-Sensitive Internet-of-Things Monitoring Services

Shoya Imanaka;Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki

2024 International Conference on Computing, Networking and Communications (ICNC)

Year: 2024 | Conference Paper |

Probabilistic Protection for Both Computing and Transmission Capacities of Virtual Networks Under Multiple Facility Node Failures

Fujun He;Mitsuki Ito;Takehiro Sato;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Volume: 21, Issue: 4 | Journal Article |

HTML

This paper proposes a backup computing and transmission capacity allocation model for virtual networks that minimizes the required backup computing capacity under multiple facility node failures. The proposed model adopts the probabilistic protection, where the probability that the protection fails due to insufficient capacity is restricted not to be greater than a given survivability parameter, b...Show More

Probabilistic Protection for Both Computing and Transmission Capacities of Virtual Networks Under Multiple Facility Node Failures

Fujun He;Mitsuki Ito;Takehiro Sato;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Volume: 21, Issue: 4 | Journal Article |

DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks

Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki

IEEE Networking Letters

Year: 2024 | Volume: 6, Issue: 2 | Journal Article |

HTML

This letter proposes a delay-sensitive network design scheme, DSND, for multi-service slice networks. DSND contributes to a virtual processing system where users can share the same application space regardless of distance-related delays. DSND introduces the service slice and service virtual time concepts. A service slice is a virtual network comprising user and server nodes. A service virtual time...Show More

DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks

Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki

IEEE Networking Letters

Year: 2024 | Volume: 6, Issue: 2 | Journal Article |

A Distributed Processing Communication Scheme for Real-Time Applications over Wide-Area Networks

Sanetora Hiragi;Bijoy Chand Chatterjee;Eiji Oki;Akio Kawabata

2024 IEEE 21st Consumer Communications & Networking Conference (CCNC)

Year: 2024 | Conference Paper |

HTML

Low-delay networking and edge computing will enable mission-critical applications to be delivered over wide-area networks. We consider this trend to be the realization that all users can share an application space without feeling any distance difference. We propose a distributed processing scheme that keeps the order of event occurrence regardless of the distance between users and an application s...Show More

A Distributed Processing Communication Scheme for Real-Time Applications over Wide-Area Networks

Sanetora Hiragi;Bijoy Chand Chatterjee;Eiji Oki;Akio Kawabata

2024 IEEE 21st Consumer Communications & Networking Conference (CCNC)

Year: 2024 | Conference Paper |

Design model of a twisted and folded Clos network with multi-step grouped intermediate switches guaranteeing admissible blocking probability

Haruto Taka;Takeru Inoue;Eiji Oki

Journal of Optical Communications and Networking

Year: 2024 | Volume: 16, Issue: 3 | Journal Article |

Cited by: Papers (2)

A future data center network is expected to be constructed by a Clos network consisting of optical-circuit switches to deal with traffic growth. A previous model addressed a Clos-network design problem that divides the set of intermediate switches by each role for request routing to guarantee an admissible blocking probability to maximize the switching capacity. However, the previous model divides...Show More

Design model of a twisted and folded Clos network with multi-step grouped intermediate switches guaranteeing admissible blocking probability

Haruto Taka;Takeru Inoue;Eiji Oki

Journal of Optical Communications and Networking

Year: 2024 | Volume: 16, Issue: 3 | Journal Article |

CMND: Consistent-Aware Multi-Server Network Design Model for Delay-Sensitive Applications

Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki

IEICE Transactions on Communications

Year: 2024 | Volume: E107-B, Issue: 3 | Journal Article |

HTML

This paper proposes a network design model, considering data consistency for a delay-sensitive distributed processing system. The data consistency is determined by collating the own state and the states of slave servers. If the state is mismatched with other servers, the rollback process is initiated to modify the state to guarantee data consistency. In the proposed model, the selected servers and...Show More

CMND: Consistent-Aware Multi-Server Network Design Model for Delay-Sensitive Applications

Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki

IEICE Transactions on Communications

Year: 2024 | Volume: E107-B, Issue: 3 | Journal Article |

Service Deployment for Parallelized Function Chains Considering Traffic-Dependent Delay

Chenlu Zhang;Takehiro Sato;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Volume: 21, Issue: 2 | Journal Article |

Cited by: Papers (2)

HTML

In network function virtualization, virtual network functions (VNFs) are usually chained in specific orders to generate service function chains (SFCs). Recently, SFC parallelism has been presented to enable VNFs to run in parallel to reduce the end-to-end service delay. Existing works handle the issue of unbalanced parallel branches by assuming predefined linear delay models, which have limitation...Show More

Service Deployment for Parallelized Function Chains Considering Traffic-Dependent Delay

Chenlu Zhang;Takehiro Sato;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Volume: 21, Issue: 2 | Journal Article |

AnalyticalBP: Analytical Model for Blocking Probabilities Considering Crosstalk-Avoided Approach in Spectrally-Spatially Elastic Optical Networks

Imran Ahmed;Roshan Kumar Rai;Mukulika Maity;Eiji Oki;Bijoy Chand Chatterjee

IEEE Transactions on Communications

Year: 2024 | Volume: 72, Issue: 3 | Journal Article |

Cited by: Papers (5)

HTML

A well-known drawback of spectrally-spatially elastic optical networks (SS-EONs) is crosstalk, which increases blocking probability; evaluating blocking probability analytically is challenging due to additional constraints. Not surprisingly, all the existing studies at this time mainly use simulation-based techniques to quantify blocking probabilities in multi-core and multi-mode fibers-based SS-E...Show More

AnalyticalBP: Analytical Model for Blocking Probabilities Considering Crosstalk-Avoided Approach in Spectrally-Spatially Elastic Optical Networks

Imran Ahmed;Roshan Kumar Rai;Mukulika Maity;Eiji Oki;Bijoy Chand Chatterjee

IEEE Transactions on Communications

Year: 2024 | Volume: 72, Issue: 3 | Journal Article |

Twisted and Folded Clos-Network Design Model With Two-Step Blocking Probability Guarantee

Haruto Taka;Takeru Inoue;Eiji Oki

IEEE Networking Letters

Year: 2024 | Volume: 6, Issue: 1 | Journal Article |

Cited by: Papers (3)

HTML

A data center network often employs a Clos-network structure due to scalability nature. A previous design model analyzed blocking probability to guarantee the quality of Clos network. However, the conditions to guarantee the blocking probability in these models are stringent, which shrinks the switching capacity. This letter proposes a model that relaxes network design constraints to maximize swit...Show More

Twisted and Folded Clos-Network Design Model With Two-Step Blocking Probability Guarantee

Haruto Taka;Takeru Inoue;Eiji Oki

IEEE Networking Letters

Year: 2024 | Volume: 6, Issue: 1 | Journal Article |

Unavailability-Aware Backup Allocation Model Based on Two-Stage Shared Protection for Middleboxes

Nozomi Kita;Fujun He;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Volume: 21, Issue: 1 | Journal Article |

Cited by: Papers (1)

HTML

Middleboxes work as software which runs on a general-purpose server by adopting network function virtualization. The unavailability of middlebox is a key metric. The previous study considers allocating backup servers to middleboxes to reduce the unavailability. While it adopts shared protection to save backup capacity, resource sharing has not been sufficiently explored as each middlebox can only ...Show More

Unavailability-Aware Backup Allocation Model Based on Two-Stage Shared Protection for Middleboxes

Nozomi Kita;Fujun He;Eiji Oki

IEEE Transactions on Network and Service Management

Year: 2024 | Volume: 21, Issue: 1 | Journal Article |

Scheduling Model for Congestion-Free Virtualized Network Update

Takehiro Sato;Takashi Kurimoto;Shigeo Urushidani;Eiji Oki

GLOBECOM 2023 - 2023 IEEE Global Communications Conference

Year: 2023 | Conference Paper |

HTML

This paper proposes a scheduling model for updating resource allocations for virtualized networks (VNs) without congestion. The proposed model determines the schedule of migrating traffic flows on VNs from old routes to new routes. The model aims to minimize the number of rounds required to complete the update of all existing VNs. We evaluate the performance of model in terms of the percentage of ...Show More

Scheduling Model for Congestion-Free Virtualized Network Update

Takehiro Sato;Takashi Kurimoto;Shigeo Urushidani;Eiji Oki

GLOBECOM 2023 - 2023 IEEE Global Communications Conference

Year: 2023 | Conference Paper |

IEEE Personal Account

Change username/password

Purchase Details

Payment Options
View Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

Follow

About IEEE Xplore | Contact Us | Help | Accessibility | Terms of Use | Nondiscrimination Policy | IEEE Ethics Reporting | Sitemap | IEEE Privacy Policy

A public charity, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.

© Copyright 2025 IEEE - All rights reserved, including rights for text and data mining and training of artificial intelligence and similar technologies.

IEEE Account

Change Username/Password
Update Address

Purchase Details

Payment Options
Order History
View Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical Interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

About IEEE Xplore
Contact Us
Help
Accessibility
Terms of Use
Nondiscrimination Policy
Sitemap
Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Test Whats new message.