學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Search Results

Now showing 1 - 10 of 10

Thermal stability of selective chemical vapor deposited tungsten contact and effects of in situ N-2 plasma treatment
(1998-07-01)
Wang, MT
;
Wang, PC
;
Chuang, MC
;
Chen, LJ
;
Chen, MC
This work investigates the thermal stability of Al/W/p(+)-n junction diodes, in which the W contact was filled using selective chemical vapor deposition to a thickness of about 450 nm and served as diffusion barrier between the Al and the Si substrate. The effects of in situ N-2 plasma treatment on the barrier effectiveness were also investigated. The Al/W(450 nm)/p(+)-n junction diodes can sustain a 30 min furnace annealing up to 575 degrees C. With an in situ N-2 plasma treatment on the W surface caused a thin layer of WNx to form on the W surface, and the nitrified layer of WNx/W acting as barrier between the AZ and the Si substrate effectively suppressed WAl12 formation at elevated temperatures, resulting in a significant barrier improvement. N2 plasma treatment at 100 W for 300 s enabled the Al/WNx/W(450 nm)lp(+)-n junction diodes to sustain thermal annealing at temperatures up to 625 degrees C without degradation of electrical characteristics. (C) 1998 American Vacuum Society.
Design and analysis of traffic control for guaranteed services on the Internet
(2000-05-01)
Wang, PC
;
Chan, CT
;
Chen, YC
;
資訊工程學系
;
Department of Computer Science
Real-time communications services will be one of the most promising applications on the Internet. Real-time traffic usually utilizes a significant amount of resources while traversing through the network. To provide guaranteed service for delay-sensitive real-time applications, both resource reservation and effective traffic control are necessary. The resource reservation protocol (RSVP) was developed to deal with the former problem while various approaches have been proposed to solve the latter one. It is crucial for guaranteed services to maintain satisfactory performance through effective traffic control, which must be implemented in a feasible way and be able to work with RSVP. In this article, we present a flexible and effective traffic-control approach with a resource reservation scheme to accommodate delay-sensitive services on the Internet. We demonstrate that our approach features proven bounded end-to-end queueing delay for delay-sensitive applications and good resilience for resource allocation. In addition, our packet transmission discipline achieves significant improvement in end-to-end delay control.
A FIFO-based buffer management approach for the ATM GFR services
(2000-06-01)
Chan, CT
;
Hu, SC
;
Wang, PC
;
Chen, YC
;
資訊工程學系
We investigate the TCP packet transmission over the ATM Guaranteed Frame Rate (GFR) service using a selective packet-discard with buffer vacancy tracking strategy and a packet-based push-out buffering scheme. Our approach is based on FIFO queueing discipline, it features fair sharing of available resources as well as feasibility in hardware implementation.
An intelligent buffer management approach for GFR services in IP/ATM internetworks
(2000-08-30)
Wang, PC
;
Chan, CT
;
Chen, YC
;
資訊工程學系
;
Department of Computer Science
In ATM networks, the Guaranteed Frame Rate (GFR) service has been proposed to accommodate non-real-time traffic with packet size not exceeding a maximum length, such as TCP/IP based traffic. The GFR service not only guarantees a minimum throughput at the frame level, but also supports a fair share of available resources. In this article, we propose a buffering strategy called Intelligent Fair Buffer Allocation (IFBA) that provides minimum cell rate (MCR) guarantees and fair sharing to GFR virtual circuits (VCs). From the simulation results, we demonstrate that IFBA fulfills the requirements of GFR service as well as improves the TCP throughput using the FIFO scheduling. (C) 2000 Elsevier Science B.V. All rights reserved.
A fast IP routing lookup scheme
(2001-03-01)
Wang, PC
;
Chan, CT
;
Chen, YC
;
資訊工程學系
;
Department of Computer Science
A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. performs the IP address lookup in hardware in which the forwarding table can be compressed to fit into reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. In this letter, we claim that with a little extra memory, it is able to further reduce the lookup time to two memory accesses.
Performance enhancement of IP forwarding by reducing routing table construction time
(2001-05-01)
Wang, PC
;
Chan, CT
;
Chen, YC
;
資訊工程學系
;
Department of Computer Science
In previous work, Lampson et al, proposed an IP lookup algorithm which performs binary search on prefixes (BSP) [3], The algorithm is attractive for IPv6 because of its bounded worst-case memory requirement. Although for the sake of fast forwarding, the cost paid for the slowing down insertion is reasonable, the performance of routing-table reconstruction in BGP is too time-consuming to handle the frequent route updates. In this letter, we propose a fast forwarding-table construction algorithm which can handle more than 3600 route updates per second, Moreover, it is simple enough to fulfill the need of fast packet forwarding.
An efficient IP routing lookup by using routing interval
(2001-12-01)
Wang, PC
;
Chan, CT
;
Chen, YC
;
資訊工程學系
;
Department of Computer Science
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, this complicates the IP lookup. Currently, this process is mainly performed in software and several schemes have been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for IP lookups, our approach is not based on BMP and significantly reduces the complexity, thus the computation cost of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.
High-performance IP routing table lookup
(2002-02-15)
Wang, PC
;
Chan, CT
;
Chen, YC
;
資訊工程學系
;
Department of Computer Science
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, which complicates the IP lookup. Currently, this process is mainly done in software and several schemes have been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the stew generation routers, in this article we propose a fast IP address lookup scheme, which significantly reduces the forwarding table to fit into SRAM with very low cost. It can also be implemented in hardware using the pipeline technique. By using our proposed method, the required memory space can be 90-170 Kb less than the previous scheme and three memory accesses for a lookup in the worst case. When implemented in hardware pipeline architecture, our mechanism can achieve one routing lookup per memory access. (C) 2002 Elsevier Science B.V. All rights reserved.
An efficient traffic control scheme for TCP over ATM GFR services
(2002-04-05)
Chan, CT
;
Wang, PC
;
Chen, YC
;
資訊工程學系
;
Department of Computer Science
In ATM networks, the guaranteed frame rate (GFR) service category has been defined to support user applications which are neither able to specify the range of traffic parameter values, nor able to comply with the behavior rules. It provides a packet-level rate guarantee with a given maximum packet size. The service specifies that the excessive traffic from a user should share the available resource fairly. In this paper, we investigate TCP/IP packet transmission over ATM by using a selective packet-discard strategy with tracking of the available buffer space and a packet push-out buffering scheme to accommodate the GFR service. The simulation results show that our proposed method fulfills the requirements of GFR service as well as improves the TCP throughput under the common FIFO scheduling. A feasible implementation approach is also addressed. (C) 2001 Elsevier Science B.V. All rights reserved.
Cost-utility analysis of tympanomastoidectomy for adults with chronic suppurative otitis media
(2005-09-01)
Wang, PC
;
Jang, CH
;
Shu, YH
;
Tai, CJ
;
Chu, KT
OBJECTIVE: To undertake cost-utility analysis for tympanomastoid surgery to analyze itscost-effectiveness in treating adult chronic suppurative otitis media (CSOM). METHODS: Seventy-seven patients with CSOM were evaluated with the Chronic Ear Survey (CES) before and 1 year after tympanomastoid surgery. Direct health care cost data during the 1st year after operation were retrieved. The utility gain was defined as change in the CES total score. The cost-utility ratio (CUR) was defined as cost per utility gain. Patients were stratified by disease type into wet-ear and dry-ear groups. RESULTS: The average total direct cost attributable to tympanomastoid surgery is (in New Taiwan dollars [NT$]) 45,716.3 in the 1st postoperative year, and the average CUR is NT$ 1850.9. The lower CUR of NT$ 1280.9 for the wet-ear group is due to the greater utility gain (37.6 +/- 3.4 versus 24.4 +/- 6.8, P < 0.05) despite its higher cost (NT$ 48,163.2 versus NT$ 38,419.7, P < 0.05). CONCLUSIONS: Treating continuously or intermittently draining ears is more cost-effective, as compared with managing a quiescent infection, because of its favorable utility gain. (C) 2005 American Academy of Otolaryngology.

學術出版;;Publications

Browse

Filters

Settings

Sort By

Results per page

🏛️國立陽明交通大學機構典藏

Search Results