Please use this identifier to cite or link to this item:
Title: An Internet-based distributed manufacturing system utilizing a recurrent neural network controller for dynamic buffer size tuning to prevent user-level buffer overflow and shorten the service roundtrip time
Authors: Lin, WWK
Wong, AKY
Dillon, ST
Keywords: Internet
Manufacturing data processing
Recurrent neural nets
Issue Date: 2005
Publisher: IEEE
Source: 2005 3rd IEEE International Conference on Industrial Informatics, 2005 : INDIN '05, 10-12 August 2005, p. 275-280 How to cite?
Abstract: An Internet-based distributed manufacturing system usually consists of a network/grid of autonomous centers that collaborate together. Each center may receive world-wide customer orders and collaborates with other friendly manufacturers, sub-contractors, agents, and suppliers to maximize the sales and quality of the goods. The centers together strike a consistent balance in terms of manufacturing speed, quality, material costs, and workload. The queue maintained by the front-end server/coordinator in each center usually contains requests from different internal and external sources. The merged traffic from these sources can inundate the queue buffer and cause overflow easily in high loading situations. As a result this leads to request retransmissions, unreliable collaborations, and unhappy customers. One way to eliminate buffer overflow in non-persistent (transient) situations is to tune the buffer size on the fly to ensure that it always cover the queue length. The recurrent NNC (neural network controller) or R-NNC proposed in this paper can achieve efficacious dynamic buffer size tuning at the user level for autonomous centers in an Internet-based distributed manufacturing system.
ISBN: 0-7803-9094-6
DOI: 10.1109/INDIN.2005.1560389
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 29, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 14, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.