Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)最新文献_第9页

SSM extensions: network layer support for multiple senders in SSM SSM扩展:网络层支持SSM中的多个发送方

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284152

K. Saraç, Pavan Namburi, K. Almeroth

引用次数: 9

A TCP socket buffer auto-tuning daemon 一个TCP套接字缓冲区自动调优守护进程

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284185

Shao Tao, L. Jacob, A. Ananda

引用次数: 6

Mandatory human participation: a new authentication scheme for building secure systems 强制人力参与:建立安全系统的新认证方案

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284222

Jun Xu, R. Lipton, Irfan Essa, Minho Sung, Yong Zhu

{"title":"Mandatory human participation: a new authentication scheme for building secure systems","authors":"Jun Xu, R. Lipton, Irfan Essa, Minho Sung, Yong Zhu","doi":"10.1109/ICCCN.2003.1284222","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284222","url":null,"abstract":"Mandatory human participation (MHP) is a novel authentication scheme that asks the question \"are you human?\" (Instead of \"who are you?\"), and upon the correct answer to this question, can prove a principal to be a human being instead of a computer program. MHP helps solve old and new problems in computer security that existing security measures cannot address properly, including password (or PIN number) guessing attacks and application-level denial of service. A key component of this \"are you human?\" authentication process is a character morphing algorithm that transforms a character string into its graphical form in such a way that a human being won't have any problem recognizing the original string, while a computer program (e.g., an optical character recognition program), will not be able to decipher it or make a correct guess with nonnegligible probability. The basic idea of the MHP scheme is to ask an agent to recognize the string before its login attempts or transaction requests can be honored. Here a protocol is needed to send a puzzle to an agent, check if the answer supplied by the agent is correct, and most importantly make sure that the agent cannot cheat in the process. A number of system and security issues that relate to the protocol need to be addressed for the protocol to be secure, efficient, robust, and user-friendly. The MHP scheme contributes to the foundation of the computer security by faithfully implementing novel security semantics, \"human,\" which existing cryptographic measures cannot express accurately. As many real-world security applications involve the interaction between a human and a computer, which naturally contains \"human\" as a part of its protocol semantics, we believe that the MHP scheme will find many new applications in the future.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128002939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 22

Call admission control in mobile cellular systems using fuzzy associative memory 基于模糊联想记忆的移动蜂窝系统呼叫接纳控制

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 1900-01-01 DOI: 10.1109/ICCCN.2003.1284155

Sivaramakrishna Mopati, D. Sarkar

{"title":"Call admission control in mobile cellular systems using fuzzy associative memory","authors":"Sivaramakrishna Mopati, D. Sarkar","doi":"10.1109/ICCCN.2003.1284155","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284155","url":null,"abstract":"In a mobile cellular system quality of service to mobile terminals (MTs) is measured by the probability of new call blocking P/sub b/, and the probability of forced termination, P/sub ft/. Since the available bandwidth in a cell is very limited, both P/sub b/ and P/sub ft/ cannot be reduced or avoided simultaneously. Usually keeping the P/sub ft/ below a designated level is accepted as the measure of quality of service. Admission of new calls is controlled to reduce P/sub ft/. However, there are at least three parameters (new call arrival rate, mean duration of calls, and mobility of users) that can and change dynamically. Moreover, these parameters are related with P/sub ft/ via complicated nonlinear equations. Therefore, call admission control (CAC) for maintaining a desired value of P/sub ft/ is a very challenging task. No CAC algorithm has been reported in the past that can function well with dynamic changes to all these three parameters. We proposed an algorithm that addresses this issue. The new algorithm uses a fuzzy controller to adjust the call preblocking load value with the changing traffic parameters. The fuzzy controller makes use of fuzzy associative memory (FAM) to maintain the required QoS. The use of new system in dynamic traffic conditions is illustrated. Providing the required level of QoS, the algorithm also increases the channel utilization. The proposed CAC with FAM is compared and contrasted with previous CACs.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115545692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

The mote connectivity protocol 远程连接协议

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 1900-01-01 DOI: 10.1109/ICCCN.2003.1284220

Young-ri Choi, M. Gouda, Moon C. Kim, A. Arora

引用次数: 29

An efficient scheduling discipline for packet switching networks using earliest deadline first round robin* 采用最早截止日期第一轮循环的分组交换网络的有效调度原则*

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 1900-01-01 DOI: 10.1109/ICCCN.2003.1284142

Deming Liu, Yann-Hang Lee

{"title":"An efficient scheduling discipline for packet switching networks using earliest deadline first round robin*","authors":"Deming Liu, Yann-Hang Lee","doi":"10.1109/ICCCN.2003.1284142","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284142","url":null,"abstract":"In this paper we propose a frame-oriented scheduling discipline, EDF-RR (earliest-deadline-first round-robin), for OQ (output-queued) switch architecture and data traffic consisting of fixed-length cells. Bandwidth reservation for an active session is performed by holding a number of cell slots for the session in frames. Each cell that is going to be transferred in a frame is assigned a virtual release time and a virtual deadline according to the bandwidth reservation scheme. The transmitting order of the cells in frames is thus determined by nonpreemptive nonidling EDF algorithm so that cells of a backlogged session in frames are distributed as uniformly as possible. Through the analysis applying real-time scheduling theory and network calculus as well as network simulation, EDF-RR takes the advantage of low computational complexity, and possesses tight delay bounds and lenient buffer requirements. The proposed scheduling discipline is appropriate for distributed real-time systems as we show that sessions can be configured based on message traffic models and deadline requirements. Also, a modified version of EDF-RR, called EDF-DRR, can be applied as traffic regulator when jitter requirements exist among active sessions.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134066732","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

A pay word-based micropayment protocol supporting multiple payments 一种支持多种支付的基于文字的小额支付协议

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 1900-01-01 DOI: 10.1109/ICCCN.2003.1284234

Sunhyoung Kim, Wonjun Lee

引用次数: 17

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) 第十二届计算机通信与网络国际会议论文集(IEEE Cat)。No.03EX712)

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 1900-01-01 DOI: 10.1109/ICCCN.2003.1284140

引用次数: 0