Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Umar Javed

dblp:46/10869 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0001-6030-598XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Internet architecture and protocols · 50% Network management and operations · 28% Routing and switching · 22%
Network and information security
1 paper
Network security · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network evolution
incremental deployment
0.212014
One tunnel is (often) enough · SIGCOMM 2014
Internet architecture and protocols
network resilience
0.212014
One tunnel is (often) enough · SIGCOMM 2014
Routing and switching
inter-domain routing
0.212013
PoiRoot: investigating the root cause of interdomain path changes · SIGCOMM 2013
Network management and operations › fault management › fault diagnosis
root cause analysis
0.212013
PoiRoot: investigating the root cause of interdomain path changes · SIGCOMM 2013
Network security › attack strategy
denial-of-service attack
0.112014
One tunnel is (often) enough · SIGCOMM 2014
Network management and operations › fault management
fault diagnosis
0.012013
PoiRoot: investigating the root cause of interdomain path changes · SIGCOMM 2013

Methods — techniques the papers use, named apart from their topics

tunneling · 0.4simulation · 0.2recursive algorithm · 0.2internet measurement · 0.2
YearPublicationVenuePosition
2022 A novel short receptive field based dilated causal convolutional network integrated with Bidirectional LSTM for short-term load forecasting
Umar Javed, Khalid Ijaz, Muhammad Jawad 0001, Ikramullah Khosa, Ejaz Ahmad Ansari, Khurram Shabih Zaidi, Muhammad Nadeem Rafiq, Noman Shabbir
Expert Syst. Appl.1
2014 One tunnel is (often) enough
abstract
A longstanding problem with the Internet is that it is vulnerable to outages, black holes, hijacking and denial of service. Although architectural solutions have been proposed to address many of these issues, they have had difficulty being adopted due to the need for widespread adoption before most users would see any benefit. This is especially relevant as the Internet is increasingly used for applications where correct and continuous operation is essential.
Simon Peter 0001, Umar Javed, Qiao Zhang 0001, Doug Woos, Thomas E. Anderson, Arvind Krishnamurthy
SIGCOMM2
2013 PoiRoot: investigating the root cause of interdomain path changes
abstract
Interdomain path changes occur frequently. Because routing protocols expose insufficient information to reason about all changes, the general problem of identifying the root cause remains unsolved. In this work, we design and evaluate PoiRoot, a real-time system that allows a provider to accurately isolate the root cause (the network responsible) of path changes affecting its prefixes. First, we develop a new model describing path changes and use it to provably identify the set of all potentially responsible networks. Next, we develop a recursive algorithm that accurately isolates the root cause of any path change. We observe that the algorithm requires monitoring paths that are generally not visible using standard measurement tools. To address this limitation, we combine existing measurement tools in new ways to acquire path information required for isolating the root cause of a path change. We evaluate PoiRoot on path changes obtained through controlled Internet experiments, simulations, and "in-the-wild" measurements. We demonstrate that PoiRoot is highly accurate, works well even with partial information, and generally narrows down the root cause to a single network or two neighboring ones. On controlled experiments PoiRoot is 100% accurate, as opposed to prior work which is accurate only 61.7% of the time.
Umar Javed, Ítalo S. Cunha, David R. Choffnes, Ethan Katz-Bassett, Thomas E. Anderson, Arvind Krishnamurthy
SIGCOMM1