Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Viet Thang Nguyen

dblp:60/3202 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
0since 2021 · last 2008
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 3 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
3 papers
Optical networks · 66% Routing and switching · 34%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 61% Interconnection networks and networks-on-chip · 39%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Optical networks
optical switching
0.122008
Tunable laser-based design and analysis for fractional lambda switches · IEEE Trans. Commun. 2008
Design and Analysis of Tunable Laser-Based Fractional l Switching (FlS) · INFOCOM 2006
Routing and switching
switch architecture
0.112008
Tunable laser-based design and analysis for fractional lambda switches · IEEE Trans. Commun. 2008
Performance modeling and evaluation › queueing models
blocking probability
0.112008
Time Blocking Analysis in Time-Driven Switching Networks · INFOCOM 2008
Performance modeling and evaluation
queueing models
0.112008
Time Blocking Analysis in Time-Driven Switching Networks · INFOCOM 2008
Interconnection networks and networks-on-chip
switching network
0.112008
Time Blocking Analysis in Time-Driven Switching Networks · INFOCOM 2008
Routing and switching › switching
pipeline forwarding
0.012008
Time Blocking Analysis in Time-Driven Switching Networks · INFOCOM 2008
Interconnection networks and networks-on-chip › nonblocking networks
nonblocking switch
0.012008
Tunable laser-based design and analysis for fractional lambda switches · IEEE Trans. Commun. 2008

Methods — techniques the papers use, named apart from their topics

combinatorics · 0.2closed-form analysis · 0.2blocking probability analysis · 0.2
YearPublicationVenuePosition
2008 Time Blocking Analysis in Time-Driven Switching Networks
abstract
This paper presents a general closed-form analysis of the time-blocking probability in time-driven switching networks. Time-blocking occurs when transmission resources are available in both input and output, but there is no schedule, i.e., input and output resources are outside a pre-defined maximum scheduling delay that is allowed between them. This situation may happen in architectures based on pipeline forwarding of packets. The main constraints affecting the schedulability of resources are the load and the maximum scheduling delay. The analysis yields the exact blocking probabilities for all possible scheduling delays and under all load conditions for a node in isolation, as well as initial results for a network of nodes.
Viet Thang Nguyen, Miklós Telek
INFOCOM1
2008 Tunable laser-based design and analysis for fractional lambda switches
abstract
Fractional lambda switching (FlambdaS) is a novel approach for traffic management over all-optical networks with sub-wavelength provisioning capability. The unique characteristic of FlambdaS is the utilization of UTC (coordinated universal time) for switching with minimum or no buffers. Several central research issues are still open in FlambdaS and need to be formally defined and analyzed. In this paper, we introduce three novel switch designs that are based on the use of tunable lasers (which can be replaced in the future with wavelength converters). First, the paper presents analytical results of scheduling feasibility, which measures the total number of possible different schedules for each switch design. Then it is shown that the architecture with the highest scheduling feasibility is strictly non blocking in the space domain. Next, the paper provides a closed form analysis of the blocking probability in the time domain, which is applicable for any strictly non-space blocking switch, using combinatorics. In addition, the paper provides measures of the switching hardware complexity, which, for the strictly non-blocking architecture, has the same switching complexity as Clos interconnection network, i.e., O(N'radic(N')) where N' is the number of optical channels.
Viet Thang Nguyen, Renato Lo Cigno, Yoram Ofek
IEEE Trans. Commun.1
2007 Scalable Switching Testbed not "Stopping" the Serial Bit Stream
abstract
In order to achieve ultra scalable IP packet switching it is essential to minimize "stopping" of the serial bit streams. In our recent experimental work we demonstrated how this can be achieved with an ultra-scalable switching architecture reaching multi-terabits per second (10-100 Tb/s) in a single chassis. The implemented testbed uses only off-the-shelf optical and electronic components. The scalability of this architecture is the direct outcome of how global time (i.e., UTC - coordinated universal time) and pipeline forwarding are utilized. The paper presents the design of a prototype switch and experimental activity with it.
Mario Baldi, Michele Corrà, Giorgio Fontana, Guido Marchetto, Viet Thang Nguyen, Yoram Ofek, Danilo Severina, Thu-Huong Truong, Olga Zadedyurina
ICC6
2007 A Scalable Approach for Supporting Streaming Media: Design, Implementation and Experiments
abstract
Future Internet traffic will be dominated by on-demand streaming media flows, such as IPTV, 3D/HD video, gaming, virtual reality, and many more. Consequently, future network architectures will need to implementscalable IP packet switchingcapable of offeringpredictable performancesto such applications. Our recent experimental work demonstrated how an IP network can be implemented without "stopping" the serial bit streams. The deployed switch is very simple, scalable to 10-100 terabits per second in a single chassis, and suitable for all optical implementation. The implemented testbed uses only off-the-shelf optical and electronic components and was completed in 9-month.
Mario Baldi, Michele Corrà, Giorgio Fontana, Guido Marchetto, Viet Thang Nguyen, Yoram Ofek, Danilo Severina, Thu-Huong Truong, Olga Zadedyurina
ISCC6
2007 A Robust Localization Method for Mobile Robots Based on Ceiling Landmarks
Viet Thang Nguyen, Moon Seok Jeong, Sung Mahn Ahn, Seungbin Moon, Sung Wook Baik
MDAI1
2006 UTC based Controller for Scalable Time Driven Switching
abstract
As data traffic on the Internet continues to grow exponentially, there is a real need to solve the switch bottleneck by developing ultra-scalable switching fabrics and their control. Although in recent years there have been a lot of efforts to solve the switching fabric scalability problem, in the optical domain, the proposed solutions have been (very) expensive, (very) complex and (much) larger than electronic switching fabric alternatives. In order to increase scalability a coordinated universal time (UTC) based time-driven switching (TDS) is proposed. This novel low-complexity switching architecture capitalizes on the ubiquitous of UTC from GPS and Galileo. This work focuses on UTC-based FPGA (field programmable gate- array) controller that was implemented for controlling the TDS switch prototype at the University of Trento, Italy. The switch controller facilitate dynamic configuration of ultra scalable switch. The prototype is implemented using off-the-shelf components. TDS architecture is especially suitable to support high capacity streaming media applications over the Internet.
Michele Corrà, Viet Thang Nguyen, Yoram Ofek
GLOBECOM3
2006 Design and Analysis of Tunable Laser-Based Fractional l Switching (FlS)
Viet Thang Nguyen, Renato Lo Cigno, Yoram Ofek
INFOCOM1
2005 Wavelength Swapping using Tunable Lasers for Fractional λ Switching
abstract
Fractional Lambda Switching (FλS) is a novel proposal for the management of all-optical networks with sub-wavelength provisioning capability. The unique characteristic of FλS is the utilization of the UTC (coordinated universal time) for alignment and switching. Several central research issues are still open in FλS and need to be formally defined and analyzed. Within the scope of this paper, we introduce three novel switch architecture designs that are based on the use of tunable lasers. As an important goal, we introduce the notion “scheduling feasibility” that measure the number of possible different scheduling between an input and output time-frames.
Viet Thang Nguyen, Mario Baldi, Renato Lo Cigno, Yoram Ofek
LANMAN1