English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52047/87178 (60%)
Visitors : 8717017      Online Users : 97
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/52131

    Title: 提升電子郵件過濾處理效能研究
    Other Titles: A study on enhancement of e-mail filtering throughput
    Authors: 高銘鍾;Kao, Ming-chung
    Contributors: 淡江大學資訊管理學系碩士在職專班
    梁德昭;Liang, Te-chao
    Keywords: 等候理論;等候網路;郵件過濾;Queueing Theory;Queueing Network;E-Mail Filter
    Date: 2010
    Issue Date: 2010-09-23 16:52:55 (UTC+8)
    Abstract: 垃圾郵件氾濫的問題持續惡化,許多個人及企業導入垃圾郵件過濾機制,但因垃圾郵件過濾需仰賴多重過濾進程的判斷以提高判斷精準度,因此衍生整體郵件遞送延遲的問題。為降低垃圾郵件過濾機制所帶來的郵件遞送延遲,本研究試圖以提高郵件過濾機制每一階段處理效能的方法,使整體效處理效能上升以減少郵件延遲的情況。本研究取實際數據測得之平均郵件來速λ,固定每一過濾進程最小等候線,套用等候理論公式,藉此求取每一過濾進程較佳的數量配置s。

    本研究提供了一個改善郵件過濾效能的方法,並以實驗模擬的方法比較每一進程套用最佳的數量s後,與原來的每一過濾進程數量s=1的整體過濾效能差異。因每一個過濾進程使用同一硬體運算資源,共用CPU資源會產生背景切換(Context Switch)的影響,因此整體過濾效能提升幅度無法達到理想值。而s總數的上升過多時,因過於頻繁的CPU背景切換,整體過濾效能上升也會受限,故本研究再藉由設定每個過濾進程s數量的上限分別進行實測,以求取一個可讓整體過濾效能提高,但較少CPU背景切換影響的s數量配置。
    The spam spreading problem was getting worse continuously. Many people and enterprises took the antispam mechanism as their solution, but antispam mechanism relies on multiple filtering procedures to improve the accurate rate of determination. This may caused delayed delivery. This research tried to improve each filtering procedure performance, and raised whole filtering performance to reduce the delay of e-mails. According to the actual average e-mail arrival rate of λ, we fixed the minimal waiting line among filtering procedures and calculated the better service numbers of procedures "s" based on the formula of Queueing Theory.

    We provided a method of improving filtering performance and compared filtering performance difference between processing theoretical optimal service numbers of "s" and the original "s=1". Each procedure shared the computing resource of the same hardware, context switch may result in the improving of whole filtering performance could not match the theoretical optimal value. When numbers of procedures "s" increased, this will cause frequently context switch of CPU and limit the improving of filtering performance. Therefore we perform the experiment by restricting the numbers of "s" trying to find which number of service processes could improve the whole performance but less context switch.
    Appears in Collections:[資訊管理學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback