发布求助
文献互助 智能选刊 最新文献

Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003最新文献

筛选
英文 中文
AGAPE: a location-aware group membership middleware for pervasive computing environments AGAPE:用于普适计算环境的位置感知组成员中间件
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 Pub Date : 2003-09-23 DOI: 10.1109/ISCC.2003.1214274
Dario Bottazzi, Antonio Corradi, R. Montanari
{"title":"AGAPE: a location-aware group membership middleware for pervasive computing environments","authors":"Dario Bottazzi, Antonio Corradi, R. Montanari","doi":"10.1109/ISCC.2003.1214274","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214274","url":null,"abstract":"The widespread diffusion of mobile computing along with the integration of telecommunication systems and the Internet enables a scenario where the promise of ubiquitous computing is starting to be realised. This scenario calls for novel services that can be deployed on-demand close to the user and customised to not only client needs, but also to the client current location. In particular, group membership management services should exploit the visibility of client location to organise effective solutions for group communication and interoperation and to promote the design and development of advanced collaborative applications, such as traffic management and e-care ones. The paper describes a middleware for group membership management (AGAPE) that exploits both the visibility of users position and the heterogeneous characteristics of the access terminals to facilitate interoperation in a pervasive computing scenario.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128089343","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}
引用次数: 19
MF (minority first) scheme for defeating distributed denial of service attacks MF(少数优先)方案，用于击败分布式拒绝服务攻击
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 Pub Date : 2003-09-23 DOI: 10.1109/ISCC.2003.1214283
Gaeil An, Kiyoung Kim, Jong-Su Jang
{"title":"MF (minority first) scheme for defeating distributed denial of service attacks","authors":"Gaeil An, Kiyoung Kim, Jong-Su Jang","doi":"10.1109/ISCC.2003.1214283","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214283","url":null,"abstract":"The one of the biggest barrier that hinders Internet development is security problem caused by malicious user. In this paper, we deal with distributed denial of service (DDoS) attacks that monopolize network resource, thus result in network or system congestion. Under DDoS attack, its very difficult to provide legitimate users with their fair share of available network resource. This paper proposes MF (minority first) as a traffic metering and control scheme that can provide quick weakness of DDoS attack, while protecting legitimate user's traffic. The key idea of MF scheme is to provide good quality of service (QoS) to sources that use the network resource properly and poor QoS to sources that use network resource so excessively as to result in network congestion. MF scheme is composed of both source-traffic-trunk based metering and queue mapping mechanism for controlling malicious DDoS traffic and legitimate traffic. To show our scheme's excellence, its performance is measured and compared with that of the existing queuing services and static rate-limit through simulation.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125352232","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}
引用次数: 6
Efficient rate adaptation of precompressed video to network constraints via controlled noise injection 通过控制噪声注入实现预压缩视频对网络约束的有效速率自适应
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 Pub Date : 2003-09-23 DOI: 10.1109/ISCC.2003.1214227
Ugur Sezer, S. H. Oguz, P. Ramanathan
{"title":"Efficient rate adaptation of precompressed video to network constraints via controlled noise injection","authors":"Ugur Sezer, S. H. Oguz, P. Ramanathan","doi":"10.1109/ISCC.2003.1214227","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214227","url":null,"abstract":"In our prior work, we presented an algorithm called largest magnitude coefficient selection (LMCS) for realizing the signal-to-noise-ratio (SNR) scaling an already encoded video object to an alternate (lower) rate (higher) distortion level. We showed that LMCS retains semantically important image features and successfully avoids the common artifacts of blur and ringing noise. However, it suffers from a significant coding inefficiency problem. In this paper, we first identify the mechanisms, which lead to the problem, and consequently present a novel technique called pivoting in order to alleviate it. The comparison of the resulting algorithm, LMCS-pivot, against the conventional SNR scaling techniques demonstrates its effectiveness according to both objective and subjective performance measures.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126912935","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}
引用次数: 1
FSP: federation of service providers on the Internet FSP:因特网上服务提供商的联盟
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 Pub Date : 2003-09-23 DOI: 10.1109/ISCC.2003.1214278
E. Chen, A. Yonezawa
{"title":"FSP: federation of service providers on the Internet","authors":"E. Chen, A. Yonezawa","doi":"10.1109/ISCC.2003.1214278","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214278","url":null,"abstract":"Researchers of active networks have been working on ways to make intermediate nodes (routers or switches) programmable, in order to accelerate the creation of new network services and to meet ever-changing user demands. However, one area has often been neglected: solution deployment on multi-provider networks. Because the Internet is composed of networks governed by different management entities with different policies, deploying new network solutions across different domains requires some form of contract to be already in place among the domains involved. We propose a framework we call FSP (federation of service providers), which will automatically allow management entities in different domains to formulate mutual agreements. Our framework is applicable, not only to active networks, but also to future solutions that could be deployed using existing devices.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122172111","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}
引用次数: 0
Performance evaluation of hop-by-hop local mobility agents probing for mobile IPv6 逐跳本地移动代理探测移动IPv6的性能评价
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 Pub Date : 2003-09-23 DOI: 10.1109/ISCC.2003.1214180
V. Thing, Henry C. J. Lee, Yi Xu
{"title":"Performance evaluation of hop-by-hop local mobility agents probing for mobile IPv6","authors":"V. Thing, Henry C. J. Lee, Yi Xu","doi":"10.1109/ISCC.2003.1214180","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214180","url":null,"abstract":"Mobile Ipv6 (MIPv6) and fast handover (FHO) have been developed by the Internet Engineering Task Force (IETF) to address the IP mobility issues of roaming mobile devices, and to reduce handover latency due to link switching delay, movement detection and IP address configuration during MIPv6 operation, respectively. In an attempt to enhance the performance of MIPv6, the hop-by-hop local mobility management (HbH-LMAsP) localized mobility management (LMM) scheme was devised and proposed to IETF as an Internet draft. In this paper, simulations that were performed on MIPv6 and subsequently, on MIPv6 with the addition of the HbH-LMAsP functionality, were described. The results obtained based on registration delay, packet loss and the overhead computation, were analyzed and discussed. The improvements contributed by the HbH-LMAsP LMM scheme over the basic mobile IPv6 were shown to be significant. The discussion on load balancing was also covered.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122739988","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}
引用次数: 4
A dynamic and XML instantiated data accessing environment 动态和XML实例化的数据访问环境
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 Pub Date : 2003-09-23 DOI: 10.1109/ISCC.2003.1214157
M. Vlachos, G. Stassinopoulos
{"title":"A dynamic and XML instantiated data accessing environment","authors":"M. Vlachos, G. Stassinopoulos","doi":"10.1109/ISCC.2003.1214157","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214157","url":null,"abstract":"The purpose of this paper is to propose a methodology for defining database navigation rules with the help of the XML language. This enables the introduction of the concept of the dynamic application server - a server that can be instantiated with the help of a relevant, \"database-descriptive\" XML document and acquire from it all the necessary knowledge for performing queries on the particular database. In order to support those ideas, the paper presents several hierarchical models: business application information model, database model and database navigation model. In the end, those models are integrated into a single, concrete model that eases the definition and creation of three-tier business applications, whose main characteristic is the easy adaptation to any legacy database.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"73 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114131435","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}
引用次数: 0
Variable structure control in active queue management for TCP with ECN 基于ECN的TCP主动队列管理中的变结构控制
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 Pub Date : 2003-09-23 DOI: 10.1109/ISCC.2003.1214247
P. Yan, Yuan Gao, H. Özbay
{"title":"Variable structure control in active queue management for TCP with ECN","authors":"P. Yan, Yuan Gao, H. Özbay","doi":"10.1109/ISCC.2003.1214247","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214247","url":null,"abstract":"It has been shown that the TCP connections through the congested routers can be modeled as a feedback dynamic system. In this paper, we design a variable structure (VS) based control scheme in active queue management (AQM) supporting explicit congestion notification (ECN). By analyzing the robustness and performance of the control scheme for nonlinear TCP/AQM model, we show that the proposed design has good performance and robustness with respect to the uncertainties of the round-trip time (RTT) and the number of active TCP sessions, which are central to the notion of AQM. Implementation issues are discussed and ns simulations are provided to validate the design and compare its performance to other peer schemes' in different scenarios. The results show that the proposed design significantly outperforms the peer AQM schemes in terms of packet loss ratio, throughput and buffer fluctuation.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127554704","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}
引用次数: 12
Pilot pollution interference reduction using multi-carrier interferometry 利用多载波干涉法减少先导污染干扰
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 Pub Date : 2003-09-23 DOI: 10.1109/ISCC.2003.1214234
M. El-Said, Anup Kumar, Adel Said Elmaghraby
{"title":"Pilot pollution interference reduction using multi-carrier interferometry","authors":"M. El-Said, Anup Kumar, Adel Said Elmaghraby","doi":"10.1109/ISCC.2003.1214234","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214234","url":null,"abstract":"Mobile stations, in CDMA systems, have the capability to communicate with multiple base stations whenever it is located in the fringe areas covered by overlapping base station. However, it is not desirable for an overlay area to contain pilot signals from a large number of base stations. As this would create pilot pollution interference and overload the mobile station's RAKE receiver. Therefore, the mobile station's RAKE receiver attempts to separate paths from three or more dominant pilot signals in the time domain to utilize path diversity. In each diversity (path/branch/finger), a large interference component exists due to the finger's own signal and other's signals. We demonstrated the power of using novel multi-carrier chip pilot pollution interference. Simulation studies have been carried out to verify the appropriateness of the proposed approach and we have obtained very promising results.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131599009","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}
引用次数: 7
A two-phase handoff management scheme for synchronizing multimedia units over wireless networks 用于在无线网络上同步多媒体单元的两阶段切换管理方案
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 Pub Date : 2003-09-23 DOI: 10.1109/ISCC.2003.1214258
A. Boukerche, Sungbum Hong, Tom Jacob
{"title":"A two-phase handoff management scheme for synchronizing multimedia units over wireless networks","authors":"A. Boukerche, Sungbum Hong, Tom Jacob","doi":"10.1109/ISCC.2003.1214258","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214258","url":null,"abstract":"This paper presents a two-phase handoff management scheme for synchronization algorithms of wireless multimedia systems. This scheme allows mobile hosts to receive multimedia units without delivery interruption while they are moving from one cell to another cell. The messages passing among mobile hosts, base station and servers include a time stamp to compute delay time for each multimedia unit for each server. The scheme always search for a Quasi-receiver among base stations with which mobile hosts are communicating to synchronize multimedia units. We discuss the algorithms and also present a set of simulation experiments to evaluate the performance of our scheme using message complexity and buffer usage at each frame arrival time. Our results indicate that our scheme exhibits no underflow within the bounded delivery time.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134221093","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}
引用次数: 5
Performance analysis of the threshold CAC strategy for multimedia traffic in wireless networks 无线网络中多媒体流量阈值CAC策略的性能分析
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 Pub Date : 2003-09-23 DOI: 10.1109/ISCC.2003.1214295
D. Deniz, N. O. Mohamed
{"title":"Performance analysis of the threshold CAC strategy for multimedia traffic in wireless networks","authors":"D. Deniz, N. O. Mohamed","doi":"10.1109/ISCC.2003.1214295","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214295","url":null,"abstract":"Performance modeling and evaluation of the threshold call admission control (CAC) strategy in a wireless cell serving two types of customers; narrowband (n-type) customers whish require 1 channel and wideband (w-type) customers which require b/sup w/ /spl ges/ 1 channels is performed. The steady state probabilities, p(K) of the system for the threshold CAC strategy are computed using a modified matrix algorithmic technique. The results show that the handoff call loss probabilities can be made as small as possible with the use of appropriate threshold values for the new call attempts.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133884219","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}
引用次数: 4
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信