MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Yannis Viniotis" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 5 documents found, showing 1 through 5.
ATOM RSS
  • Improvements of the SABUL Congestion Control Algorithm  
  • by Phoemphun Oothongsap, Yannis Viniotis, Mladen Vouk
  • …as alternatives to TCP for high speed data transfer. The purpose of this paper is to analyze the effects of SABUL congestion control algorithm and its parameters on SABUL bandwidth utilization by using extensive simulations. The simulation results show that SABUL congestion control parameters have a…
  • Add To MetaCart
  • Achieving End-to-end Delay Bounds by EDF Scheduling without Traffic Shaping  
  • by Kai Zhu, Yan Zhuang, Yannis Viniotis — 2001
  • …Earliest Deadline First scheduling with per-node traffic shaping (RC-EDF) has the largest schedulable region among all practical policies known today and has been considered a good solution for providing end-to-end packet delay bounds. In order to harness the traffic burstiness inside a network to s…
  • Cited by 5 (0 self) – Add To MetaCart
  • Delay-Constrained Shared Multicast Trees  
  • by Hussein F. Salama, Yannis Viniotis, Douglas S. Reeves
  • …We study the problem of constructing delay-constrained shared multicast trees for realtime applications in connection-oriented high-speed networks. We formulate the problem as a diameter-constrained minimum Steiner tree problem, and prove that it is NP-complete. Then we propose distributed, dynam…
  • Add To MetaCart
  • Evaluation of multicast routing algorithms for real-time communication on high-speed networks  
  • by Hussein F. Salama, Douglas S. Reeves, Yannis Viniotis — 1997 — IEEE Journal on Selected Areas in Communications
  • …Multicast (MC) routing algorithms capable of satisfying the quality of service (QoS) requirements of real-time applications will be essential for future high-speed networks. We compare the performance of all of the important MC routing algorithms when applied to networks with asymmetric link loads. …
  • Cited by 58 (4 self) – Add To MetaCart
  • A Distributed Algorithm for Delay-Constrained Unicast Routing  
  • by Hussein F. Salama, Douglas S. Reeves, Yannis Viniotis — 1997 — IEEE INFOCOM'97
  • …In this paper, we study the NP-hard delay-constrained least-cost path problem, and propose a simple, distributed heuristic solution: the delay-constrained unicast routing (DCUR) algorithm. DCUR requires limited network state information to be kept at each node: a cost vector and a delay vector. We p…
  • Cited by 78 (1 self) – Add To MetaCart
Help! Showing 1 through 5.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB