OrdaAriel

发表

The designer's perspective to atomic noncooperative networks

LibmanLavy, OrdaAriel, 1999 .

How Good is Bargained Routing

OrdaAriel, BlocqGideon, 2016 .

Tunable survivable spanning trees

OrdaAriel, RottenstreichOri, YallouzJose, 2016 .

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

LibmanLavy, OrdaAriel, 2004 .

Dynamic power allocation under arbitrary varying channels

OrdaAriel, MenacheIshai, Lewin-EytanLiane, 2012 .

QoS routing in networks with uncertain parameters

OrdaAriel, H LorenzDean, 1998 .

Competitive routing in multiuser communication networks

OrdaAriel, RomRaphael, ShimkinNahum, 1993 .

Computing shortest paths for any number of hops

OrdaAriel, GuérinRoch, 2002 .

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

OrdaAriel, RomRaphael, 1990 .

Topology design of communication networks

OrdaAriel, FreundAri, NahirAmir, 2014 .

Multipath routing algorithms for congestion minimization

OrdaAriel, BannerRon, 2007 .