scispace - formally typeset
Search or ask a question
Author

Y. Thomas Hou

Bio: Y. Thomas Hou is an academic researcher from Fujitsu. The author has contributed to research in topics: Distributed algorithm & Network packet. The author has an hindex of 2, co-authored 2 publications receiving 28 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: This paper summarizes the experience on the design of network bandwidth allocation policies and distributed rate calculation algorithms for packet-switched networks and discusses two rate allocation policies: the generalized max–min (GMM) and the weight-proportional max-min (WPMM) policies, both of which generalize the classical max–Min rate allocation policy.

18 citations

Proceedings ArticleDOI
07 Oct 1998
TL;DR: An in-depth survey on network bandwidth allocation policies and design methodologies of distributed rate calculation algorithms in packet-switched networks is presented and two rate allocation policies are discussed: the generalizedmax-min and the generic weight- proportional max-min policies.
Abstract: This paper presents an in-depth survey on network bandwidth allocation policies and discuss design methodologies of distributed rate calculation algorithms in packet-switched networks. In particular, we discuss two rate allocation policies: the generalized max-min and the generic weight- proportional max-min policies, both of which generalize the classical max-min rate allocation policy. For the design of distributed algorithms to achieve these two rate allocation policies, we focus on rate-based distributed flow control where special control packets are employed to achieve the information exchange between a source and the network. We categorize two broad classes of distributed rate calculation algorithms in the literature using live algorithms as illustrations. We compare the design tradeoffs between these two classes of algorithms in terms of performance objectives and implementation complexities and discuss important extensions within each class of algorithms.© (1998) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

10 citations


Cited by
More filters
Posted Content
TL;DR: An asynchronous distributed algorithm is presented for optimal rate calculation across the network, where optimality is understood in the maxmin sense and the algorithm quickly converges to the optimal rates and is shown to be well-behaved in transience.
Abstract: As the speed and the dynamic range of computer networks evolve, the issue of efficient traffic management becomes increasingly important. This work describes an approach to traffic management using explicit rate information provided to the source by the network. We present an asynchronous distributed algorithm for optimal rate calculation across the network, where optimality is understood in the maxmin sense. The algorithm quickly converges to the optimal rates and is shown to be well-behaved in transience.

262 citations

Journal ArticleDOI
TL;DR: This paper considers challenges of providing the desired quality of service or improving the transmission efficiency for H.264 video transmissions over wireless networks, and surveys existing mechanisms based on the protocol layers they work on.

26 citations

Proceedings ArticleDOI
25 Nov 2001
TL;DR: A mobile agent based approach for bandwidth allocation in multimedia communication based on the the network congestion monitored by the agents at the clients is proposed, which reduces the network control traffic used in traditional online bandwidth allocation policies.
Abstract: The allocation of bandwidth for multimedia traffic poses a technical challenge due to bursty and isochronous nature of applications. We propose a mobile agent based approach for bandwidth allocation in multimedia communication. It is based on the the network congestion monitored by the agents at the clients. The mobile agent hosted by the server will allocate bandwidth online to the applications within the requested range at regular intervals. Also, it keeps the aggregated bandwidth below the link bandwidth of server and clients. The approach reduces the network control traffic used in traditional online bandwidth allocation policies. The scheme is simulated and its performance is evaluated in terms of several parameters, like, bandwidth utilization, application rejection, agent response time, and agent migrations. The simulation results show that the use of agents increase flexibility and efficiency in end-to-end bandwidth allocation and operate asynchronously. The flexibility in using this technology is that, the allocation policies can be changed, customized and implemented easily.

20 citations

Journal ArticleDOI
TL;DR: This work proposes an adaptive bandwidth allocation scheme for multimedia applications by deploying the static and mobile agents that functions at the network nodes and adaptively finds an alternate patchup route for every congested/failed link and reallocates the bandwidth for the affected multimedia applications.

17 citations

Proceedings ArticleDOI
07 Nov 2002
TL;DR: This paper considers joint problems of adaptive bandwidth reservation and link rearrangement (rerouting) for multimedia traffic under the event of congestion/failures of link, and proposes a mobile agent based approach to achieve these objectives.
Abstract: The bandwidth reservation for multimedia traffic poses technical challenges due to the bursty and delay sensitive nature of applications. The objectives of bandwidth reservation schemes are: optimize network utilization, and minimize the packet losses and delays. The growth of multimedia services on the Internet and the possible discovery of programmable networks has made us investigate new techniques for resolving bandwidth issues in multimedia communication. Mobile agent technology seems to be a promising solution for network management and QoS control. In this paper, we consider joint problems of adaptive bandwidth reservation and link rearrangement (rerouting) for multimedia traffic under the event of congestion/failures of link, and propose a mobile agent based approach to achieve these objectives. The scheme is simulated using a multimedia traffic model. Simulation results show that the use of agents increases the network utilization, acceptance ratio of applications, flexibility and efficiency of bandwidth reservation. The flexibility in using agent technology is that the policies can be changed and implemented easily by encoding in the agents.

16 citations