default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTony Przygienda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i17]Zhaohui Zhang, Tony Przygienda, Ali Sajassi, Jorge Rabadan:
EVPN Broadcast, Unknown Unicast, or Multicast (BUM) Using Bit Index Explicit Replication (BIER). RFC 9624: 1-13 (2024)- 2023
- [i16]Tony Przygienda, Chris Bowers, Yiu Lee, Alankar Sharma, Russ White:
IS-IS Flood Reflection. RFC 9377: 1-19 (2023) - 2022
- [i15]Jeffrey (Zhaohui) Zhang, Antoni Przygienda, Andrew Dolganow, Hooman Bidgoli, IJsbrand Wijnands, Arkadiy Gulko:
Underlay Path Calculation Algorithm and Constraints for Bit Index Explicit Replication (BIER). RFC 9272: 1-6 (2022) - 2020
- [i14]Les Ginsberg, Paul Wells, Tony Li, Tony Przygienda, Shraddha Hegde:
Invalid TLV Handling in IS-IS. RFC 8918: 1-8 (2020)
2010 – 2019
- 2019
- [i13]Eric C. Rosen, Mahesh Sivakumar, Tony Przygienda, Sam Aldrin, Andrew Dolganow:
Multicast VPN Using Bit Index Explicit Replication (BIER). RFC 8556: 1-17 (2019) - 2018
- [i12]Les Ginsberg, Tony Przygienda, Sam Aldrin, Jeffrey (Zhaohui) Zhang:
Bit Index Explicit Replication (BIER) Support via IS-IS. RFC 8401: 1-12 (2018) - [i11]Peter Psenak, Nagendra Kumar Nainar, IJsbrand Wijnands, Andrew Dolganow, Tony Przygienda, Jeffrey (Zhaohui) Zhang, Sam Aldrin:
OSPFv2 Extensions for Bit Index Explicit Replication (BIER). RFC 8444: 1-12 (2018) - 2017
- [i10]IJsbrand Wijnands, Eric C. Rosen, Andrew Dolganow, Tony Przygienda, Sam Aldrin:
Multicast Using Bit Index Explicit Replication (BIER). RFC 8279: 1-43 (2017) - 2016
- [i9]Les Ginsberg, Paul Wells, Bruno Decraene, Tony Przygienda, Hannes Gredler:
IS-IS Minimum Remaining Lifetime. RFC 7987: 1-9 (2016)
2000 – 2009
- 2008
- [i8]Tony Przygienda, Naiming Shen, Nischal Sheth:
M-ISIS: Multi Topology (MT) Routing in Intermediate System to Intermediate Systems (IS-ISs). RFC 5120: 1-14 (2008) - [i7]Tony Li, Henk Smit, Tony Przygienda:
Domain-Wide Prefix Distribution with Two-Level IS-IS. RFC 5302: 1-16 (2008) - 2002
- [i6]Tony Przygienda:
Optional Checksums in Intermediate System to Intermediate System (ISIS). RFC 3358: 1-4 (2002) - [i5]Tony Przygienda:
Reserved Type, Length and Value (TLV) Codepoints in Intermediate System to Intermediate System. RFC 3359: 1-5 (2002) - 2000
- [i4]Patrick Droz, Tony Przygienda:
Proxy-PAR. RFC 2843: 1-13 (2000) - [i3]Tony Przygienda, Patrick Droz, Robert Haas:
OSPF over ATM and Proxy-PAR. RFC 2844: 1-14 (2000) - [i2]Tony Li, Tony Przygienda, Henk Smit:
Domain-wide Prefix Distribution with Two-Level IS-IS. RFC 2966: 1-14 (2000)
1990 – 1999
- 1999
- [j4]Ralf C. Hauser, Tony Przygienda, Gene Tsudik:
Lowering security overhead in link state routing. Comput. Networks 31(8): 885-894 (1999) - [j3]Hong-Yi Tzeng, Tony Przygienda:
On fast address-lookup algorithms. IEEE J. Sel. Areas Commun. 17(6): 1067-1082 (1999) - [j2]Tony Przygienda, Patrick Droz, Colin H. West:
Proxy PNNI Augmented Routing (Proxy PAR). Telecommun. Syst. 11(3-4): 241-251 (1999) - [c3]V. Fayet, Denis A. Khotimsky, Tony Przygienda:
Hop-by-Hop Routing with Node-Dependent Topology Information. INFOCOM 1999: 79-87 - [i1]George Apostolopoulos, Sanjay Kamat, Doug Williams, Roch Guérin, Ariel Orda, Tony Przygienda:
QoS Routing Mechanisms and OSPF Extensions. RFC 2676: 1-50 (1999) - 1997
- [c2]Ralf C. Hauser, Tony Przygienda, Gene Tsudik:
Reducing the Cost of Security in Link-State Routing. NDSS 1997: 93-101 - 1996
- [c1]Olivier Crochat, Jean-Yves Le Boudec, Tony Przygienda:
A Path Selection Method in ATM Using Pre-Computation. International Zurich Seminar on Digital Communications 1996: 1-12 - 1995
- [j1]Jean-Yves Le Boudec, Tony Przygienda:
A Route Pre-Computation Algorithm for Integrated Services Network. J. Netw. Syst. Manag. 3(4): 427-449 (1995)
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-09-29 00:24 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:
