default search action
Yingzhen Qu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i11]Acee Lindem, Sharmila Palani, Yingzhen Qu:
YANG Data Model for OSPFv3 Extended Link State Advertisements (LSAs). RFC 9587: 1-25 (2024) - [i10]Edward J. Birrane III, Nicolas Kuhn, Yingzhen Qu, Rick Taylor, Li Zhang:
Time-Variant Routing (TVR) Use Cases. RFC 9657: 1-14 (2024) - [i9]Job Snijders, Ben Cartwright-Cox, Yingzhen Qu:
Border Gateway Protocol 4 (BGP-4) Send Hold Timer. RFC 9687: 1-8 (2024) - 2023
- [i8]Acee Lindem, Yingzhen Qu:
A YANG Data Model for RIB Extensions. RFC 9403: 1-22 (2023) - 2022
- [i7]Derek M. Yeung, Yingzhen Qu, Jeffrey (Zhaohui) Zhang, Ing-Wher Chen, Acee Lindem:
YANG Data Model for the OSPF Protocol. RFC 9129: 1-116 (2022) - 2021
- [i6]Stephane Litkowski, Yingzhen Qu, Acee Lindem, Pushpasis Sarkar, Jeff Tantsura:
YANG Data Model for Segment Routing. RFC 9020: 1-39 (2021) - [i5]Yingzhen Qu, Jeff Tantsura, Acee Lindem, Xufeng Liu:
A YANG Data Model for Routing Policy. RFC 9067: 1-38 (2021) - [i4]Alexander Clemm, Yingzhen Qu, Jeff Tantsura, Andy Bierman:
Comparison of Network Management Datastore Architecture (NMDA) Datastores. RFC 9144: 1-16 (2021) - 2020
- [c6]Haoyu Song
, Zhaobo Zhang, Yingzhen Qu, James N. Guichard:
Adaptive Addresses for Next Generation IP Protocol in Hierarchical Networks. ICNP 2020: 1-6 - [c5]Lin Han, Yingzhen Qu, Lijun Dong, Richard Li
A Framework for Bandwidth and Latency Guaranteed Service in New IP Network. INFOCOM Workshops 2020: 85-90
2010 – 2019
- 2018
- [c4]Toerless Eckert, Yingzhen Qu, Uma Chunduri:
Preferred Path Routing (PPR) Graphs - Beyond Signaling Of Paths To Networks. CNSM 2018: 384-390 - [c3]Lin Han, Yingzhen Qu, Lijun Dong, Richard Li
Flow-level QoS assurance via IPv6 in-band signalling. WOCC 2018: 1-5 - [i3]Ladislav Lhotka, Acee Lindem, Yingzhen Qu:
A YANG Data Model for Routing Management (NMDA Version). RFC 8349: 1-80 (2018) - 2017
- [i2]Acee Lindem, Yingzhen Qu, Derek M. Yeung, Ing-Wher Chen, Jeffrey Zhang:
YANG Data Model for Key Chains. RFC 8177: 1-25 (2017) - [i1]Xufeng Liu, Yingzhen Qu, Acee Lindem, Christian E. Hopps, Lou Berger:
Common YANG Data Types for the Routing Area. RFC 8294: 1-43 (2017)
2000 – 2009
- 2006
- [c2]Yingzhen Qu, Promade K. Verma:
Maximization of Throughput under a Fairness Constraint in DWDM-based Optical Networks. Wireless and Optical Communications 2006: 225-229 - 2004
- [j1]Yingzhen Qu, Pramode K. Verma:
Limits on the traffic carrying capacity of optical networks with an arbitrary topology. IEEE Commun. Lett. 8(10): 641-643 (2004) - [c1]Yingzhen Qu, Pramode K. Verma, John Y. Cheung:
Enhancing the Carrying Capacity of a DWDM Network. ICPP Workshops 2004: 415-421
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-11-25 23:39 CET 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: