default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWei Kang Tsai
Person information
- affiliation: University of California, Irvine, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1986
[b1]Wei Kang Tsai:
Optimal quasi-static routing for virtual circuit networks subjected to stochastic inputs. Massachusetts Institute of Technology, Cambridge, MA, USA, 1986
Journal Articles
- 2010
- [j14]Jordi Ros, Wei Kang Tsai:
A lexicographic optimization framework to the flow control problem. IEEE Trans. Inf. Theory 56(6): 2875-2886 (2010) - 2002
- [j13]Wei Kang Tsai, Mahadevan Iyer, Jordi Ros:
Revisit the Strings versus Clouds Debate for the Internet Architecture Part I: Control, Scalability and QoS. J. Netw. Syst. Manag. 10(2): 135-141 (2002) - [j12]Wei Kang Tsai, Mahadevan Iyer, Jordi Ros:
Revisit the Strings versus Clouds Debate for the Internet Architecture - Part II: QoS, Control, Management, and TCP. J. Netw. Syst. Manag. 10(3): 267-275 (2002) - 2001
- [j11]Chai-Keong Toh, Wei Kang Tsai:
Intelligent control of QoS adaptation in next generation wireless broadband networks. J. High Speed Networks 10(1): 37-58 (2001) - 1999
- [j10]Wei Kang Tsai, John K. Antonio, Garng M. Huang:
Complexity of gradient projection method for optimal routing in data networks. IEEE/ACM Trans. Netw. 7(6): 897-905 (1999) - 1994
- [j9]John K. Antonio, Wei Kang Tsai, Garng M. Huang:
Time complexity of a path formulated optimal routing algorithm. IEEE Trans. Autom. Control. 39(2): 385-391 (1994) - [j8]Wei Kang Tsai, Garng M. Huang, Wei Lu:
Fast parallel recursive aggregation methods for simulation of dynamical systems. IEEE Trans. Autom. Control. 39(3): 534-540 (1994) - [j7]John K. Antonio, Wei Kang Tsai, Garng M. Huang:
Time complexity of a path formulated optimal routing algorithm (second printing). IEEE Trans. Autom. Control. 39(9): 1839-1844 (1994) - [j6]Alexander G. Parlos, Benito Fernández, Amir F. Atiya
, Jayakumar Muthusami, Wei Kang Tsai:
An accelerated learning algorithm for multilayer perceptron networks. IEEE Trans. Neural Networks 5(3): 493-497 (1994) - 1992
- [j5]John K. Antonio, Garng M. Huang, Wei Kang Tsai:
A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks. IEEE Trans. Computers 41(6): 710-724 (1992) - [j4]Showi-Min Shen, Hosame Abu-Amara, Wei Kang Tsai, Wei-Tek Tsai:
Simulation and theoretical results on cluster management and directory management in dynamic hierarchical networks. IEEE Trans. Commun. 40(2): 312-324 (1992) - 1991
- [j3]John K. Antonio, Wei Kang Tsai, Garng M. Huang:
A Highly Parallel Algorithm for Multistage Optimization Problems and Shortest Path Problems. J. Parallel Distributed Comput. 12(3): 213-222 (1991) - 1989
- [j2]Wei Kang Tsai, Pierce E. Cantrell:
A Simple Derivation of Transient Queue Statistics and Applications. Perform. Evaluation 10(2): 103-114 (1989) - [j1]Wei-Tek Tsai, C. V. Ramamoorthy, Wei Kang Tsai, Osamu Nishiguchi:
An Adaptive Hierarchical Routing Protocol. IEEE Trans. Computers 38(8): 1059-1075 (1989)
Conference and Workshop Papers
- 2007
- [c41]Dan-Han Tsai, Wei Kang Tsai, Pohao Huang:
Using Advertised Rate for Multi-Path Relative Maxmin Routing. CCNC 2007: 474-478 - [c40]Yi Pan, Wei Kang Tsai, Tatsuya Suda:
Applying Wavelet De-noising to Improve TCP Throughput in AQM queues with Existence of Unresponsive Traffic. ICCCN 2007: 541-548 - 2006
- [c39]Wei Kang Tsai, Pohao Huang, Thomas C. Liau, Dan-Han Tsai:
Theory of Multi-Path Maxmin Rate Allocation. ICON 2006: 1-6 - [c38]Dan-Han Tsai, Thomas C. Liau, Wei Kang Tsai:
Least Square Approach to Multi-Path Maxmin Rate Allocation. ICON 2006: 1-6 - 2005
- [c37]Calvin Shen, Henry Luk, Mehran Ramezani, Jordi Ros, Kevin Phan, Koji Tsuboi, Rod Allen, Wei Kang Tsai:
Solving the edge server streaming bottleneck with the separation principle. CCNC 2005: 307-312 - [c36]Lan Yang, Lee Hu, Wei Kang Tsai, Jordi Ros:
A New Server Bypass Architecture to Increase Storage Traffic Bandwidth. Communications in Computing 2005: 31-34 - 2004
- [c35]Mahadevan Iyer, Wei Kang Tsai:
Time-Optimal Network Queue Control: The Case of Multiple Congested Nodes. ICPADS 2004: 709-718 - 2003
- [c34]Mahadevan Iyer, Wei Kang Tsai:
Time-Optimal Network Queue Control: The Case of a Single Congested Node. INFOCOM 2003: 619-629 - [c33]Chai-Keong Toh, Wei Kang Tsai, Victor O. K. Li, Anthony D. Scott, Guillermo Guichal:
Transporting audio over wireless ad hoc networks: experiments & new insights. PIMRC 2003: 772-777 - [c32]Wei Kang Tsai, Peng Zheng, Boyun Tu, Chai-Keong Toh:
An integrated handoff solution for wireless ATM. WCNC 2003: 1254-1259 - 2002
- [c31]Wei Kang Tsai, Peng Zheng, Boyun Tu, Chai-Keong Toh:
Crossed path resolution protocol (COPTER) in wireless ATM. GLOBECOM 2002: 620-624 - [c30]Wei Kang Tsai, Jordi Ros:
A distributed multicast multi-rate maxmin flow control protocol. GLOBECOM 2002: 1470-1474 - [c29]Jordi Ros, Wei Kang Tsai:
Maxmin lambda allocation for DWDM networks. ICON 2002: 14-22 - [c28]Wei Kang Tsai, Boyun Tu, Peng Zheng, Chai-Keong Toh, Lee C. Hu:
MAQ: a multiplexed adaptive queuing protocol for QoS adaptation. WCNC 2002: 307-316 - 2001
- [c27]Jordi Ros, Wei Kang Tsai:
A Theory of Convergence Order of Maxmin Rate Allocation and an Optimal Protocol. INFOCOM 2001: 717-726 - 2000
- [c26]Wei Kang Tsai, Mahadevan Iyer:
Spatio-Temporal Max-Min Fair Rate Allocation. ICC (1) 2000: 480-484 - [c25]Wei Kang Tsai, Mahadevan Iyer:
Constraint Precedence in Max-Min Fair Rate Allocation. ICC (1) 2000: 490-494 - [c24]Jordi Ros, Wei Kang Tsai, Mahadeven Iyer:
Bottleneck branch marking for noise consolidation in multicast networks. ICON 2000: 57-67 - [c23]Jordi Ros, Wei Kang Tsai:
A general theory of constrained max-min rate allocation for multicast networks. ICON 2000: 327-335 - [c22]Rainfield Y. Yen, Kevin Wei Kang Tsai:
Identification of a Noiseless Nonlinear system by Gradient Method. ISMSE 2000: 259-264 - 1999
- [c21]Wei-Min Chiu, Wei Kang Tsai, Thomas C. Liau, Markos G. Troulis:
Time-domain channel equalizer design using the inverse power method. ICC 1999: 973-977 - [c20]Yuseok Kim, Wei Kang Tsai, Mahadevan Iyer, Jordi Ros:
Minimum Rate Guarantee Without Per-Flow Information. ICNP 1999: 155-162 - [c19]Jordi Ros, Wei Kang Tsai:
A theory of temporal-spatial flow control: the case of single bottleneck link. ICON 1999: 59-66 - [c18]Wei Kang Tsai, Yuseok Kim:
Re-Examining Maxmin Protocols: A Fundamental Study on Convergence, Complexity, Variations, and Performance. INFOCOM 1999: 811-818 - 1998
- [c17]Wei Kang Tsai, Lee Chuan Hu, Yuseok Kim:
A Temporal-Spatial Flow Control Protocol for ABR in Integrated Networks. IDMS 1998: 207-218 - 1997
- [c16]Wei Kang Tsai, Y. Ge, Garng M. Huang:
Stability Analysis of Intelligent Marking EPRCA for ABR Congestion. INFOCOM 1997: 380-387 - 1996
- [c15]Wei-Jing Guan, Wei Kang Tsai, Douglas M. Blough, Fan Chen:
A New Design of Enhanced Mesh Networks for Multicomputer Systems. PDPTA 1996: 565- - 1995
- [c14]Wei Kang Tsai, John K. Antonio, Garng M. Huang:
Complexity of Gradient Projection Method for Optimal Routing in Data Networks. INFOCOM 1995: 269-277 - 1994
- [c13]Yulin Chen, Wei Kang Tsai, Fadi J. Kurdahi, Tzong-Dar Her, Champaka Ramachandran:
A performance driven logic synthesis system using delay estimator. Great Lakes Symposium on VLSI 1994: 88-92 - 1993
- [c12]Yulin Chen, Wei Kang Tsai, Fadi J. Kurdahi:
A logic synthesis system based on global dynamic extraction and flexible cost. Great Lakes Symposium on VLSI 1993: 123-126 - [c11]Sung-Woo Park, Wei Kang Tsai:
Optimal Routing Algorithm for High-Speed (ATM) Networks. INFOCOM 1993: 972-979 - [c10]Wei-Jing Guan, Wei Kang Tsai, Douglas M. Blough:
An Analytical Model for Wormhole Routing in Multicomputer Interconnection Networks. IPPS 1993: 650-654 - 1992
- [c9]Sudheer Marisetti, Hosame Abu-Amara, Kevin Wei Kang Tsai:
Sensitivity of the objective functions for joint flow control and optimal routing in computer networks. LCN 1992: 326-334 - 1991
- [c8]Douglas M. Blough, Wei Kang Tsai:
Binary Hypermesh Networks for Parallel Processing. ICPP (1) 1991: 694-695 - [c7]Wei Kang Tsai, Nader Bagherzadeh, Young C. Kim:
Hypermesh: A Combined Quad Tree and Mesh Network for Parallel Processing. ICPP (1) 1991: 696-697 - [c6]Sung-Woo Park, Wei Kang Tsai:
Distributed Hierarchical Optimal Routing Using Aggregation/Disaggergation and Decomposition/Composition Techniques. IPPS 1991: 424-431 - 1990
- [c5]Wei Kang Tsai, Alexander G. Parlos, Benito Fernández:
An associative memory knowledge base for diagnostic and high level control functions. TAI 1990: 283-288 - [c4]Benito Fernández, Alexander G. Parlos, Wei Kang Tsai:
Nonlinear dynamic system identification using artificial neural networks (ANNs). IJCNN 1990: 133-141 - [c3]Wei Kang Tsai, Alexander G. Parlos, Benito Fernández:
ASDM-a novel neural network model based on sparse distributed memory. IJCNN 1990: 771-776 - 1989
- [c2]Wei Kang Tsai, Pierce E. Cantrell, Jeffrey Goos:
Fairness of Optimal Routing in Virtual Circuit Data Networks. INFOCOM 1989: 119-126 - [c1]John K. Antonio, Garng M. Huang, Wei Kang Tsai:
A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Structured Data Networks. INFOCOM 1989: 183-192
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
