Ariel Orda

IEEE/ACM Trans. Netw., 2020

A Game-Theoretic Analysis of Shared/Buy-in Computing Systems.

[BibT_eX]

[DOI]

IEEE Open J. Commun. Soc., 2020

An Efficient Algorithm for Finding Sets of Optimal Routes.

[BibT_eX]

[DOI]

Ido Zoref

CoRR, 2020

Combflex: a linear combinatorial auction for local energy markets.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Communications, 2020

Sequential Zeroing: Online Heavy-Hitter Detection on Programmable Hardware.

[BibT_eX]

[DOI]

Proceedings of the 2020 IFIP Networking Conference, 2020

Design of a Combinatorial Double Auction for Local Energy Markets.

[BibT_eX]

[DOI]

Proceedings of the Network Games, Control and Optimization - 10th International Conference, 2020

Discrete and stochastic coalitional storage games.

[BibT_eX]

[DOI]

Proceedings of the e-Energy '20: The Eleventh ACM International Conference on Future Energy Systems, 2020

Efficient distributed solutions for sharing energy resources at the local level: a cooperative game approach.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Conference on Decision and Control, 2020

2019

Coalitions in Routing Games: A Worst-Case Perspective.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2019

Exploiting Flexibility in Irrigation While Maintaining Optimal Crop Productivity.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Communications, 2019

The effect of ramp constraints on coalitional storage games.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM International Conference on Future Energy Systems, 2019

2018

Minimum-Weight Link-Disjoint Node-"Somewhat Disjoint" Paths.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2018

Detecting Cascades from Weak Signatures.

[BibT_eX]

[DOI]

Constantine Caramanis

Sanjay Shakkottai

IEEE Trans. Netw. Sci. Eng., 2018

2017

Tunable QoS-Aware Network Survivability.

[BibT_eX]

[DOI]

Jose Yallouz

IEEE/ACM Trans. Netw., 2017

No Packet Left Behind: Avoiding Starvation in Dynamic Topologies.

[BibT_eX]

[DOI]

Shay Vargaftik

Isaac Keslassy

IEEE/ACM Trans. Netw., 2017

Strategic Formation of Heterogeneous Networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2017

dRMT: Disaggregated Programmable Switching.

[BibT_eX]

[DOI]

Proceedings of the Conference of the ACM Special Interest Group on Data Communication, 2017

Packing strictly-shortest paths in a tree for QoS-aware routing.

[BibT_eX]

[DOI]

Proceedings of the 2017 IFIP Networking Conference, 2017

Stable user-defined priorities.

[BibT_eX]

[DOI]

Shay Vargaftik

Isaac Keslassy

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Proxy Voting for Better Outcomes.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Replication-Based Load Balancing.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2016

Tunable Survivable Spanning Trees.

[BibT_eX]

[DOI]

Jose Yallouz

Ori Rottenstreich

IEEE/ACM Trans. Netw., 2016

How Good is Bargained Routing?

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

Establishing Multiple Survivable Connections (Extended Version).

[BibT_eX]

[DOI]

Michael Keslassy

CoRR, 2016

Optics in Data Centers: Adapting to Diverse Modern Workloads.

[BibT_eX]

[DOI]

Proceedings of the 9th ACM International on Systems and Storage Conference, 2016

Reversing the supermarket: A distributed approach for handling elasticity in the cloud.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

Optimal link-disjoint node-"somewhat disjoint" paths.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Conference on Network Protocols, 2016

Composite-Path Switching.

[BibT_eX]

[DOI]

Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies, 2016

2015

Workload Factoring: A Game-Theoretic Perspective.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2015

Minimum Energy Routing and Jamming to Thwart Wireless Network Eavesdroppers.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2015

Localized Epidemic Detection in Networks with Overwhelming Noise.

[BibT_eX]

[DOI]

Chris Milling

Constantine Caramanis

Sanjay Shakkottai

Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

"Beat-Your-Rival" Routing Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Formation games of reliable networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Resource allocation and management in Cloud Computing.

[BibT_eX]

[DOI]

Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, 2015

"Don't let the stack get stuck": A novel approach for designing efficient stackable routers.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE International Conference on High Performance Switching and Routing, 2015

2014

Topology Design of Communication Networks: A Game-Theoretic Perspective.

[BibT_eX]

[DOI]

Ari Freund

IEEE/ACM Trans. Netw., 2014

Network formation games with heterogeneous players and the internet structure.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Economics and Computation, 2014

Constrained Maximum Flow in Stochastic Networks.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE International Conference on Network Protocols, 2014

2013

Guest editorial.

[BibT_eX]

[DOI]

Xavi Masip

Svetoslav Duhovnikov

Opt. Switch. Netw., 2013

Formation Games and the Internet Structure.

[BibT_eX]

[DOI]

CoRR, 2013

Worst-Case Coalitions in Routing Games.

[BibT_eX]

[DOI]

CoRR, 2013

Efficient wireless security through jamming, coding and routing.

[BibT_eX]

[DOI]

Proceedings of the 10th Annual IEEE International Conference on Sensing, 2013

Schedule first, manage later: Network-aware load balancing.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

2012

Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2012

Message from the general chairs.

[BibT_eX]

[DOI]

Francesco De Pellegrini

Proceedings of the 6th International Conference on Network Games, 2012

Workload factoring with the cloud: A game-theoretic perspective.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Survivable routing and regenerator placement in optical networks.

[BibT_eX]

[DOI]

Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

Distributed oblivious load balancing using prioritized job replication.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Network and Service Management, 2012

2011

Special Issue: Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks: selected papers from WiOpt 2010.

[BibT_eX]

[DOI]

Nidhi Hegde

Perform. Evaluation, 2011

Survivable impairment-aware traffic grooming in WDM rings.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Teletraffic Congress, 2011

Inter-carrier interconnection services: QoS, economics and business issues.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE Symposium on Computers and Communications, 2011

2010

Non-Cooperative Cost Sharing Games via Subsidies.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Designing Low-Capacity Backup Networks for Fast Restoration.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Impairment-aware path selection and regenerator placement in translucent optical networks.

[BibT_eX]

[DOI]

Proceedings of the 18th annual IEEE International Conference on Network Protocols, 2010

2009

EquiCast: Scalable multicast with selfish users.

[BibT_eX]

[DOI]

Idit Keidar

Roie Melamed

Comput. Networks, 2009

On-line survivable routing in WDM networks.

[BibT_eX]

[DOI]

Proceedings of the 21st International Teletraffic Congress, 2009

Protecting Against Network Infections: A Game Theoretic Perspective.

[BibT_eX]

[DOI]

Jasmina Omic

Piet Van Mieghem

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Topology Design and Control: A Game-Theoretic Perspective.

[BibT_eX]

[DOI]

Ari Freund

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

Toward a new route control model for multidomain optical networks.

[BibT_eX]

[DOI]

IEEE Commun. Mag., 2008

Maximum Coverage at Minimum Cost for Multi-Domain IP/MPLS Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Multi-Objective Topology Control in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Quasi-opportunistic Supercomputing in Grid Environments.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2008

2007

The power of tuning: a novel approach for the efficient design of survivable networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2007

Multipath routing algorithms for congestion minimization.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2007

Non-Cooperative Multicast and Facility Location Games.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2007

Bottleneck Routing Games in Communication Networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2007

Maximum-lifetime routing: system optimization & game-theoretic perspectives.

[BibT_eX]

[DOI]

Liane Lewin-Eytan

Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2007

Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

Optimal packet-level fec strategies in connections with large delay-bandwidth products.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2006

Efficient QoS partition and routing of unicast and multicast.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2006

On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains.

[BibT_eX]

[DOI]

Marcelo Yannuzzi

Xavier Masip-Bruin

Sergio Sánchez-López

Jordi Domingo-Pascual

Alex Sprintson

IEEE Commun. Mag., 2006

A Comparison of Exact and <i>epsilon</i>-Approximation Algorithms for Constrained Routing.

[BibT_eX]

[DOI]

Proceedings of the NETWORKING 2006, 2006

The Prediction Approach in QoS Routing.

[BibT_eX]

[DOI]

Eva Marín-Tordera

Xavier Masip-Bruin

Sergio Sánchez-López

Jordi Domingo-Pascual

Proceedings of IEEE International Conference on Communications, 2006

2005

A scalable approach to the partition of QoS requirements in unicast and multicast.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2005

Algorithms for computing QoS paths with restoration.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2005

QoS Routing: Challenges and Solution Approaches.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2005), 2005

Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas.

[BibT_eX]

[DOI]

Ben-Ami Yassour

Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2005

2004

Optimal sliding-window strategies in networks with long round-trip delays.

[BibT_eX]

[DOI]

Comput. Networks, 2004

Admission Control in Networks with Advance Reservations.

[BibT_eX]

[DOI]

Liane Lewin-Eytan

Algorithmica, 2004

QoS Provision and Routing with Stochastic Guarantees.

[BibT_eX]

[DOI]

Erez Biton

Proceedings of the 1st International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2004), 2004

Efficient Algorithms for Computing Disjoint QoS Paths.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Path Protection and Blocking Probability Minimization in Optical Networks.

[BibT_eX]

[DOI]

David Lee

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Optimal FEC strategies in connections with large delay-bandwidth products.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2004

2003

Precomputation schemes for QoS routing.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2003

Optimal Partition of QoS Requirements for Many-to-Many Connections.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2002

Optimal partition of QoS requirements on unicast paths and multicst trees.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2002

Optimal retrial and timeout strategies for accessing network resources.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2002

Computing shortest paths for any number of hops.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2002

Routing and Admission Control in Networks with Advance Reservations.

[BibT_eX]

[DOI]

Liane Lewin-Eytan

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

Atomic Resource Sharing in Noncooperative Networks.

[BibT_eX]

[DOI]

Telecommun. Syst., 2001

2000

Incentive pricing in multiclass systems.

[BibT_eX]

[DOI]

Telecommun. Syst., 2000

Dynamic service sharing with heterogeneous preferences.

[BibT_eX]

[DOI]

Israel Ben-Shahar

Queueing Syst. Theory Appl., 2000

Bandwidth allocation for guaranteed versus best effort service categories.

[BibT_eX]

[DOI]

Eitan Altman

Queueing Syst. Theory Appl., 2000

A market-based architecture for management of geographically dispersed, replicated Web servers.

[BibT_eX]

[DOI]

Mehmet Karaul

Decis. Support Syst., 2000

Dynamic storage allocation with known durations.

[BibT_eX]

[DOI]

Yael Petruschka

Discret. Appl. Math., 2000

QoS Routing: The Precomputation Perspective.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Networks with Advance Reservations: The Routing Perspective.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999

QoS Routing Mechanisms and OSPF Extensions.

[BibT_eX]

[DOI]

George Apostolopoulos

RFC, August, 1999

Routing with end-to-end QoS guarantees in broadband networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1999

The designer's perspective to atomic noncooperative networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1999

QoS routing in networks with inaccurate information: theory and algorithms.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1999

Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis.

[BibT_eX]

[DOI]

George Apostolopoulos

IEEE Netw., 1999

Modelling Asynchrony with a Synchronous Model.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 1999

Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Incentive Compatible Pricing Strategies for QoS Routing.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Best-Effort Resource Sharing by Users with QoS Requirements.

[BibT_eX]

[DOI]

Israel Ben-Shahar

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

1998

QoS routing in networks with uncertain parameters.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1998

Scheduled Hot-Potato Routing.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1998

1997

Virtual path bandwidth allocation in multiuser networks.

[BibT_eX]

[DOI]

Dimitrios E. Pendarakis

IEEE/ACM Trans. Netw., 1997

Achieving network optima using Stackelberg routing strategies.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1997

Capacity allocation under noncooperative routing.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1997

Optimal packet fragmentation and routing in computer networks.

[BibT_eX]

[DOI]

Networks, 1997

Efficient Test & Set Constructions for Faulty Shared Memory.

[BibT_eX]

[DOI]

Michael Merritt

Inf. Process. Lett., 1997

Formal Verification of a Distributed Computer System.

[BibT_eX]

[DOI]

Michael Merritt

Sonia R. Sachs

Formal Methods Syst. Des., 1997

Incentive Pricing in Multi-Class Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '97, 1997

QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '97, 1997

1996

Tight Bounds for Dynamic Storage Allocation.

[BibT_eX]

[DOI]

Michael Luby

SIAM J. Discret. Math., 1996

Distributed Shortest-Path Protocols for Time-Dependent Networks.

[BibT_eX]

[DOI]

Distributed Comput., 1996

An Adaptive Virtual Path Allocation Policy for Broadband Networks.

[BibT_eX]

[DOI]

Giovanni Pacifici

Dimitrios E. Pendarakis

Proceedings of the Proceedings IEEE INFOCOM '96, 1996

The Role of the Manager in a Noncooperative Network.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '96, 1996

1995

On continuous network flows.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1995

Architecting Noncooperative Networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 1995

Virtual Path Bandwidth Allocation in Multi-User Networks.

[BibT_eX]

[DOI]

Dimitrios E. Pendarakis

Proceedings of the Proceedings IEEE INFOCOM '95, 1995

The Designer's Perspective to Noncooperative Networks.

[BibT_eX]

Proceedings of the Proceedings IEEE INFOCOM '95, 1995

1994

A Structural Linearization Principle for Processes.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 1994

1993

Competitive routing in multiuser communication networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1993

Minimum delay routing in stochastic networks.

[BibT_eX]

[DOI]

Moshe Sidi

IEEE/ACM Trans. Netw., 1993

Competitive Routing in Multi-User Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

Optimal Routing with Packet Fragmentation in Computer Networks.

[BibT_eX]

[DOI]

1991

Location of central nodes in time varying computer networks.

[BibT_eX]

[DOI]