default search action
Abishek Gopalan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c9]Satyajeet Singh Ahuja, Varun Gupta, Vinayak Dangui, Soshant Bali, Abishek Gopalan, Hao Zhong, Petr Lapukhov, Yiting Xia, Ying Zhang:
Capacity-efficient and uncertainty-resilient backbone network planning with hose. SIGCOMM 2021: 547-559
2010 – 2019
- 2017
- [c8]Onur Turkcu, Abishek Gopalan, Biao Lu, Steve Sanders, Parthiban Kandappan:
Benefits of higher modulation in flexible grid networks using optical WDM and digital OTN switching. OFC 2017: 1-3 - 2016
- [j7]Abishek Gopalan, Srinivasan Ramasubramanian:
IP Fast Rerouting and Disjoint Multipath Routing With Three Edge-Independent Spanning Trees. IEEE/ACM Trans. Netw. 24(3): 1336-1349 (2016) - [j6]Theodore Elhourani, Abishek Gopalan, Srinivasan Ramasubramanian:
IP Fast Rerouting for Multi-Link Failures. IEEE/ACM Trans. Netw. 24(5): 3014-3025 (2016) - [c7]Abishek Gopalan, Onur Turkcu, Biao Lu, Snigdho Bardalai, Parthiban Kandappan:
A comparison of network bandwidth efficiencies among various multi-layer network architectures. ANTS 2016: 1-3 - [i1]Gábor Enyedi, András Császár, Alia Atlas, Chris Bowers, Abishek Gopalan:
An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR). RFC 7811: 1-118 (2016) - 2015
- [c6]Onur Turkcu, Soumya Roy, Abishek Gopalan, Matthew Mitchell, Biao Lu:
Comparing networks with capacity-fixed and spectrally-fixed line modules implementing multiple coherent modulations. ECOC 2015: 1-3 - 2014
- [j5]Abishek Gopalan, Srinivasan Ramasubramanian:
Corrigendum to: "A counterexample for the proof of implication conjecture on independent spanning trees" [Information Processing Letters 113 (14-16) (2013) 522-526]. Inf. Process. Lett. 114(1-2): 84 (2014) - [j4]Abishek Gopalan, Srinivasan Ramasubramanian:
On the Maximum Number of Linearly Independent Cycles and Paths in a Network. IEEE/ACM Trans. Netw. 22(5): 1373-1388 (2014) - [j3]Abishek Gopalan, Srinivasan Ramasubramanian:
Fast Recovery From Link Failures in Ethernet Networks. IEEE Trans. Reliab. 63(2): 412-426 (2014) - [c5]Theodore Elhourani, Abishek Gopalan, Srinivasan Ramasubramanian:
IP fast rerouting for multi-link failures. INFOCOM 2014: 2148-2156 - 2013
- [b1]Abishek Gopalan:
Graph Algorithms for Network Tomography and Fault Tolerance. University of Arizona, Tucson, USA, 2013 - [j2]Abishek Gopalan, Srinivasan Ramasubramanian:
A counterexample for the proof of implication conjecture on independent spanning trees. Inf. Process. Lett. 113(14-16): 522-526 (2013) - [c4]Abishek Gopalan, Srinivasan Ramasubramanian:
Fast recovery from link failures in Ethernet networks. DRCN 2013: 1-10 - 2012
- [j1]Abishek Gopalan, Srinivasan Ramasubramanian:
On Identifying Additive Link Metrics Using Linearly Independent Cycles and Paths. IEEE/ACM Trans. Netw. 20(3): 906-916 (2012) - [c3]Sean Whitsitt
, Abishek Gopalan, Sangman Cho, Jonathan Sprinkle
On the Extraction and Analysis of a Social Network with Partial Organizational Observation. ECBS 2012: 249-256 - 2011
- [c2]Abishek Gopalan, Srinivasan Ramasubramanian:
Multipath routing and dual link failure recovery in IP networks using three link-independent trees. IEEE ANTS 2011: 1-6
2000 – 2009
- 2008
- [c1]Sandeep Kour Ahuja, Abishek Gopalan, Srinivasan Ramasubramanian:
Joint routing and channel assignment in multi-channel wireless infrastructure networks. BROADNETS 2008: 351-358
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-28 01:30 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: