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

Amit Mondal

dblp:01/659 · DBLP profile ↗
← Back
8ranked-venue papers
8as first author
1since 2021 · last 2025
0000-0001-9950-3502ORCID · reported

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

Computer networks · 7 · 7 first-authorSystems, architecture and hardware · 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
3 papers
Transport protocols and congestion control · 28% Routing and switching · 21% Network measurement and analytics · 20%
Network and information security
1 paper
Network security · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching
traffic engineering
0.112010
Upgrading mice to elephants: effects and end-point solutions · IEEE/ACM Trans. Netw. 2010
Wireless networking › wireless security
misbehavior detection
0.112007
When TCP Friendliness Becomes Harmful · INFOCOM 2007
Network performance modeling
statistical multiplexing
0.112007
When TCP Friendliness Becomes Harmful · INFOCOM 2007
Transport protocols and congestion control
TCP
0.112007
A Poisoning-Resilient TCP Stack · ICNP 2007
Transport protocols and congestion control › congestion control fairness
TCP friendliness
0.112007
When TCP Friendliness Becomes Harmful · INFOCOM 2007
Network measurement and analytics
traffic analysis
0.112007
When TCP Friendliness Becomes Harmful · INFOCOM 2007
Network security › attack strategy
denial-of-service attack
0.112007
A Poisoning-Resilient TCP Stack · ICNP 2007
Network measurement and analytics
workload characterization
0.012010
Upgrading mice to elephants: effects and end-point solutions · IEEE/ACM Trans. Netw. 2010

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

simulation · 0.2analytical modeling · 0.2internet experiments · 0.1
YearPublicationVenuePosition
2025 Artificial Neural Network Based Prediction Model for IR Drop Measurement in a VLSI Power Delivery Network
Amit Mondal, Tuhina Samanta
J. Electron. Test.1
2012 P2P as a CDN: A new service model for file sharing
Amit Mondal, Ionut Trestian, Aleksandar Kuzmanovic
Comput. Networks1
2010 A Case for WiFi Relay: Improving VoIP Quality for WiFi Users
abstract
Voice over Internet (VoIP) has been experiencing enormous growth in recent years. While posed to replace traditional PSTN for both enterprise and residential customers, VoIP has yet to achieve the same level of quality and reliability as PSTN. One key challenge is that a growing segment of customers is increasingly relying on WiFi connections. VoIP over WiFi (VoWiFi) experiences significant degradation in quality because of packet losses, mostly due to WiFi's low capacity, varying signal strength, interference, etc. To understand this problem, we have developed and deployed a comprehensive measurement platform in a global enterprise network. From large-scale real-world traces, we quantitatively analyze the impact of WiFi connections and study measures to mitigate such impact. Our results confirm that WiFi connections incur significantly more packet losses than wirelines, but these losses can be effectively concealed by sending each packet up to five times (heavy replication). Due to WiFi's inherent overhead, heavy replication only marginally increases WiFi airtime. To avoid the overhead on wirelines, we further propose a relay-based solution, where heavy replication only occurs between endpoints and nearby relays, and is removed before packets are transmitted on inter-branch long haul links or the public Internet. The solution has been implemented and deployed in the global enterprise network, and measurement results confirm that it can indeed greatly improve the performance of VoIP for WiFi users. In particular, it reduces the percentage of poor calls from 35% to 10%; and increases the percentage of acceptable ones from 45% to 70%.
Amit Mondal, Cheng Huang 0002, Jin Li 0001, Aleksandar Kuzmanovic
ICC1
2010 SureCall: Towards glitch-free real-time audio/video conferencing
abstract
Global enterprises are increasingly adopting unified communication solutions over traditional telephone systems. Such solutions provide integrated audio/video conferencing and messaging services, and enable flexible working environments by allowing mobile and dispersed users to communicate and collaborate easily and efficiently. The ultimate goal of unified communications is to ensure a smooth and best possible user experience across all scenarios. To address this challenge and understand the impact of various network scenarios on unified audio/video conferencing, we have developed a distributed experimental platform - SureCall - and deployed it on over 80 machines across a global enterprise and many residential networks. SureCall has collected worth of more than 6 months of packet-level audio/video conferencing traces. Through in-depth analysis of these traces, we have quantitatively compared how key performance metrics, such as packet loss and jitter, as well as the correlation between them, are affected by the enterprise and residential networks, by WiFi connections and VPN links, etc. In addition, we show how SureCall can serve as an ideal platform to design, experiment and validate new schemes and algorithms. We have developed a new audio quality classifier using the SureCall platform, which is being experimented with the recent release of Office Communicator solution for large-scale validation.
Amit Mondal, Ross Cutler, Cheng Huang 0002, Jin Li 0001, Aleksandar Kuzmanovic
IWQoS1
2010 Upgrading mice to elephants: effects and end-point solutions
Amit Mondal, Aleksandar Kuzmanovic
IEEE/ACM Trans. Netw.1
2009 Supporting application network flows with multiple QoS constraints
abstract
There is a growing need to support real-time applications over the Internet. Real-time interactive applications often have multiple quality-of-service (QoS) requirements which are application specific. Traditional provisioning of QoS in the Internet through IP routing - Intserv or Diffserv - faces many technical challenges, and is also deterred by the huge deployment issues. As an alternative, application providers often build their own application-specific overlay networks to meet their QoS requirements. In this paper, we present a unified framework which can serve diverse applications with multiple QoS constraints. Our scalable flow route management architecture, called MCQoS, employs a hybrid approach using a path vector protocol to disseminate aggregated path information combined with on-demand path discovery to find paths that match the diverse QoS requirements. It uses a distributed algorithm to dynamically adapt to an alternate path when the current path fails to satisfy the required QoS constraints. We do large-scale simulation and analysis to show that our approach is both efficient and scalable, and that it substantially outperforms the state of the art protocols in accuracy. Our simulation results show that MCQoS can reduce the false negative percentage to less than 1% compared with 5-10% in other approaches, and eliminates false positives, whereas other schemes have false positive rates of 10-20% with minimal increase in protocol overhead. Finally, we implemented and deployed our system on the Planetlab testbed for evaluation in a real network environment.
Amit Mondal, Puneet Sharma 0001, Sujata Banerjee, Aleksandar Kuzmanovic
IWQoS1
2007 A Poisoning-Resilient TCP Stack
abstract
We treat the problem of large-scale TCP poisoning: an attacker, who is able to monitor TCP packet headers in the network, can deny service to all flows traversing the monitoring point simply by injecting a single spoofed data or control packet into each of the flows. One of the entities responsible for this severe vulnerability is certainly the TCP protocol itself: it behaves as a "dummy" state machine that can more-than-easily become desynchronized by an attacker. In this paper, we explore ways for upgrading TCP endpoints into viable DoS-resilient protocol entities, capable of mitigating large-scale poisoning attacks. We show, by means of analytical modeling, simulations, and Internet experiments, how small upgrades implemented by the endpoints can dramatically improve resilience to attacks. The key mechanisms unique to our approach are (i) deferred protocol reaction, used to accurately detect poisoning attacks; (ii) forward nonces, applied to distinguish among different traffic sources during the attack; and (iii) self-clocking-based correlation, utilized for successfully detecting legitimate packet streams. Our solution solely relies on the protocol design, it is incrementally deployable, and TCP friendly.
Amit Mondal, Aleksandar Kuzmanovic
ICNP1
2007 When TCP Friendliness Becomes Harmful
abstract
Short TCP flows may suffer significant response-time performance degradations during network congestion. Unfortunately, this creates an incentive for misbehavior by clients ofinteractiveapplications(e.g., gaming, telnet, Web): to send "dummy" packets into the network at aTCP-fairrate even when they have no data to send, thus improving their performance in moments when they do have data to send. Even though no "law" is violated in this way, a large-scale deployment of such an approach has the potential to seriously jeopardize one of the core Internet's principles -statisticalmultiplexing. We quantify, by means of analytical modeling and simulation, gains achievable by the above misbehavior. Further, we explore techniques that both misbehaving and regular clients can apply to optimize their performance. Our research indicates that easy-to-implement application-level techniques are capable of dramatically reducing incentives for conducting the above transgressions, still without compromising the idea of statistical multiplexing.
Amit Mondal, Aleksandar Kuzmanovic
INFOCOM1