10 citations · 32 across the 11 of their papers we have counts for
9 papers · 1 filter
Fast-MCS: A Scalable Open-Source Tool to Find Minimal Cut Sets
Shakthivelu Janardhanan, Yaxuan Chen, Wolfgang Kellerer +1
A network is represented as a graph consisting of nodes and edges. A cut set for a source-destination pair in a network is a set of elements that, when failed, cause the source-des…
Planning Optical Networks for Unexpected Traffic Growth
Sai Kireet Patri, Achim Autenrieth, Jörg-Peter Elbers +1
A lightpath configuration algorithm considering a multi-period traffic model is presented and evaluated to a realistic German core network study.~Strategically exploiting BVT exces…
HeCSON: Heuristic for Configuration Selectionin Optical Network Planning
Sai Kireet Patri, Achim Autenrieth, Danish Rafique +2
We present a transceiver configuration selection heuristic combining Enhanced Gaussian Noise (EGN) models, which shows a 40\% increase in throughput and 87\% decrease in execution…
Game theoretic pricing policy in online media delivery platforms
Anubhab Banerjee, Carmen Mas Machuca
Residential users get most of their preferred content (e.g., films, news) from their wireless access point, which is connected to content providers through one or several network p…
Bounded Dijkstra (BD): Search Space Reduction for Expediting Shortest Path Subroutines
Amaury Van Bemten, Jochen W. Guck, Carmen Mas Machuca +1
The shortest path (SP) and shortest paths tree (SPT) problems arise both as direct applications and as subroutines of overlay algorithms solving more complex problems such as the c…
HNLB: Utilizing Hardware Matching Capabilities of NICs for Offloading Stateful Load Balancers
Raphael Durner, Amir Varasteh, Max Stephan +2
In order to scale web or other services, the load on single instances of the respective service has to be balanced. Many services are stateful such that packets belonging to the sa…