Browsing by Author "Shieh, Shiuh-Pyng"

Now showing 1 - 4 of 4

An Authentication Protocol Without Trusted Third Party
(1997-05-01)
Shieh, Shiuh-Pyng
;
Yang, Wen-Her
;
Sun, Hun-Min
;
資訊工程學系
;
Department of Computer Science
A secure authentication protocol which supports both the privacy of messages and the authenticity of communicating parties is proposed. The trusted third party (key information center) is not needed once the secure network system is set up. Mutual authentication and key distribution can be achieved with two messages merely between two parties involved.
An Authentication Protocol Without Trusted Third Party
(1997-05-01)
Shieh, Shiuh-Pyng
;
Yang, Wen-Her
;
Sun, Hun-Min
;
資訊工程學系
;
Department of Computer Science
A secure authentication protocol which supports both the privacy of messages and the authenticity of communicating parties is proposed. The trusted third party (key information center) is not needed once the secure network system is set up. Mutual authentication and key distribution can be achieved with two messages merely between two parties involved.
Balancing Workload and Recovery Load on Distributed Fault-Tolerant VOD Systems
(1998-10-01)
Shyu, Ing-Jye
;
Shieh, Shiuh-Pyng
;
資訊工程學系
;
Department of Computer Science
This letter presents a new code sequence for dispatching playback jobs among distributed video-on-demand servers. The dispatch accordingly has the property of evenly distributing workload among all servers and balancing recovery load on surviving servers if one of the servers fails. In this letter we give an O((n - 1)!) algorithm for efficiently finding a dispatch sequence for n servers.
Balancing Workload and Recovery Load on Distributed Fault-Tolerant VOD Systems
(1998-10-01)
Shyu, Ing-Jye
;
Shieh, Shiuh-Pyng
;
資訊工程學系
;
Department of Computer Science
This letter presents a new code sequence for dispatching playback jobs among distributed video-on-demand servers. The dispatch accordingly has the property of evenly distributing workload among all servers and balancing recovery load on surviving servers if one of the servers fails. In this letter we give an O((n - 1)!) algorithm for efficiently finding a dispatch sequence for n servers.