Works (4)

Updated: July 5th, 2023 16:04

2011 journal article

Anomalous Loss Performance for Mixed Real-Time and TCP Traffic in Routers With Very Small Buffers

IEEE-ACM TRANSACTIONS ON NETWORKING, 19(4), 933–946.

By: A. Vishwanath*, V. Sivaraman* & G. Rouskas n

Contributors: G. Rouskas n, V. Sivaraman* & A. Vishwanath*

author keywords: Anomalous loss performance; mixed TCP and real-time traffic; optical packet switched (OPS) networks; routers with very small buffers
topics (OpenAlex): Advanced Optical Network Technologies; Network Traffic and Congestion Control; Software-Defined Networks and 5G
TL;DR: This study is the first to consider interactions between real-time and TCP traffic in very small (potentially all-optical) buffers and informs router manufacturers and network operators of the factors to consider when dimensioning such small buffer sizes for desired performance balance. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

2000 journal article

A reservation protocol for broadcast WDM networks and stability analysis

COMPUTER NETWORKS, 32(2), 211–227.

By: V. Sivaraman* & G. Rouskas n

Contributors: G. Rouskas n & V. Sivaraman*

author keywords: single-hop optical networks; wavelength division multiplexing (WDM); reservation protocols; Markov modulated Bernoulli process (MMBP)
topics (OpenAlex): Advanced Optical Network Technologies; Network Traffic and Congestion Control; Interconnection Networks and Systems
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

1998 journal article

Graphical basis partitions

GRAPHS AND COMBINATORICS, 14(3), 241–261.

By: J. Nolan n, V. Sivaraman n, C. Savage n & P. Tiwari n

topics (OpenAlex): Digital Image Processing Techniques; Topological and Geometric Data Analysis; Graph theory and applications
TL;DR: Empirical evidence is given which leads to conjecture that, as n approaches infinity, the fraction of basis partitions of n which are graphical approaches the same limit as the fraction that is the degree sequence of a simple, undirected graph. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1997 article

Packet scheduling in broadcast WDM networks with arbitrary transceiver tuning latencies

Rouskas, G. N., & Sivaraman, V. (1997, June). IEEE-ACM TRANSACTIONS ON NETWORKING, Vol. 5, pp. 359–370.

By: G. Rouskas n & V. Sivaraman n

Contributors: G. Rouskas n & V. Sivaraman n

author keywords: optical networks; packet scheduling tuning latency; wavelength-division multiplexing
topics (OpenAlex): Advanced Optical Network Technologies; graph theory and CDMA systems; Interconnection Networks and Systems
TL;DR: It is shown that it is possible to appropriately dimension the network to minimize the effects of even large values of the tuning latency, and develop heuristics which give schedules of length equal or very close to the lower bound. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2025) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.