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

筛选
英文 中文
Size-distortion optimization for application-specific packet dropping: the case of video traffic 针对特定应用的数据包丢弃的大小失真优化:视频流量的情况
Imed Bouazizi
{"title":"Size-distortion optimization for application-specific packet dropping: the case of video traffic","authors":"Imed Bouazizi","doi":"10.1109/ISCC.2003.1214231","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214231","url":null,"abstract":"Streaming video over the best-effort Internet arises some challenging issues. The available bandwidth and packet transmission delays are often subject to severe changes. As a consequence, a significant ratio of video packets is dropped by network routers because of lack of capacity on congested links. The impacts of video packet drops on the observed quality at receiver side may vary from unnoticed to unacceptable. This is due to the different values of each video packet for the decoding process at the receiver. Classical queueing disciplines do not have the ability to distinguish between different packet values. It is often the case that a packet of higher value is dropped, in favor of a lower valued packet. The value of a packet is measured in terms of the induced distortion, when the packet is not received correctly. In this paper, we introduce an application-specific queueing system, which drops packets in a size-distortion optimized manner. Out of all packets present in the queue, the system selects the packets to be dropped, if necessary, in order to meet a queue size constraint while minimizing the overall distortion. Important improvements in video quality for the receiver, and an efficient utilization of the available bandwidth have been observed throughout different simulations.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"39 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":"122683856","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}
引用次数: 3
A self-adaptive protocol for broadcast LANs with variable packet length 一种用于可变分组长度广播局域网的自适应协议
G. Papadimitriou, Georgios D. Pallas, A. Pomportsis
{"title":"A self-adaptive protocol for broadcast LANs with variable packet length","authors":"G. Papadimitriou, Georgios D. Pallas, A. Pomportsis","doi":"10.1109/ISCC.2003.1214288","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214288","url":null,"abstract":"In this letter, a new medium-access sublayer self-adaptive protocol for broadcast networks is introduced. This new protocol is capable of operating efficiently under heavily bursty traffic conditions and can handle stations, which transmit packet of arbitrary length. TDMA, RTDMA and other fixed-assignment protocols have various drawbacks, that learning protocols such as LTDMA are known to resolve. But as a result of LTDMS's fixed-sized timeslots, reduced channel usage, wasted timeslots, as well as network equipment overloading can occur. The VPL/LTDMA protocol, which is here introduced, is tested using real LAN traffic traces and is proved to be successfully resolving the above issues. In addition it achieves a high throughput-delay performance when operating under realistic traffic conditions.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"90 5 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":"128010687","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}
引用次数: 3
Power efficient system for sensor networks 用于传感器网络的节能系统
S. Ergen, A. Puri, P. Varaiya
{"title":"Power efficient system for sensor networks","authors":"S. Ergen, A. Puri, P. Varaiya","doi":"10.1109/ISCC.2003.1214221","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214221","url":null,"abstract":"We propose a power efficient system architecture that exploits the characteristics of sensor networks in order to decrease the power consumption in the network. The primary characteristic of sensor networks is that the destination of all the data packets in the network is a central data collector, which is usually denoted as access point (AP), has unlimited transmission power and energy whereas the sensor nodes have one battery energy to remain alive fro several years. Our system uses the AP to directly synchronize and explicitly schedule the nodes' transmissions over time division multiple access (TDMA) time slots. Simulations performed in TOSSIM, a simulation environment for the TinyOS, show that the battery lifetime of the network with this scheme can be increased to 1-2 years from 10 days that can be obtained from a general random access network.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"5 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":"128515607","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}
引用次数: 38
Towards a component model for universal data streams 面向通用数据流的组件模型
Frank Stoinski
{"title":"Towards a component model for universal data streams","authors":"Frank Stoinski","doi":"10.1109/ISCC.2003.1214273","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214273","url":null,"abstract":"Component technology is a modern instrument for software designers and engineers to create complex software applications in a rapid way. Much effort has been made to integrate audio and video streams into component applications. Today people realize that component technology promises a great value for distributed data stream processing applications beyond video conferencing. This paper presents the theoretical foundation for a specification and implementation framework for data-stream-enabled components. By means of the CORBA component model an enhanced meta-model for CORBA components that allows for the integration of universal data streams is presented and solutions for the functional extension of the CORBA component container as the runtime environment for data stream components is discussed. Design and implementation decisions with respect to an envisioned prototype close this paper.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"214 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":"115849300","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
Real-time multiple description and layered encoded video streaming with optimal diverse routing 实时多描述和分层编码视频流与最优的多样化路由
A. Begen, Y. Altunbasak, Özlem Ergun, Mehmet A. Begen
{"title":"Real-time multiple description and layered encoded video streaming with optimal diverse routing","authors":"A. Begen, Y. Altunbasak, Özlem Ergun, Mehmet A. Begen","doi":"10.1109/ISCC.2003.1214229","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214229","url":null,"abstract":"Multiple description (MD) and layered coding (LC) are two source-coding approaches proposed for adaptive and robust video streaming over lossy networks. Both streaming methods aim to improve the streaming quality by transmitting the generated multiple sub-bitstreams over partially link-disjoint paths. However, the achieved qualities heavily depend on the media characteristics, path conditions and application requirements. In order to attain the highest quality, we study optimal multi-path selection methods for both MD and LC streaming. The simulations run over an overlay infrastructure show 9.0 - 12.5 dB peak signal-to-noise ratio (PSNR) improvement when the video is streamed over intelligently selected multiple paths instead of the shortest path or maximally link-disjoint paths. By the help of the proposed path selection methods, the end users estimate the expected qualities of MD and LC streaming for the given network conditions and application requirements prior to the streaming, which allows the users to make a choice accordingly.","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":"124943241","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
Multi-service link layer enhancements for the wireless Internet 无线互联网的多业务链路层增强
G. Xylomenos, George C. Polyzos
{"title":"Multi-service link layer enhancements for the wireless Internet","authors":"G. Xylomenos, George C. Polyzos","doi":"10.1109/ISCC.2003.1214268","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214268","url":null,"abstract":"Although TCP and UDP application performance over wireless links may be substantially improved via link layer error recovery, different schemes are appropriate for each application class. We present a multi-service link layer architecture that simultaneously enhances the performance of diverse applications by supporting multiple error recovery mechanisms in parallel. We simulated concurrent file transfers and WWW browsing over TCP and continuous media distribution over UDP using our architecture. The results show that each application achieves similar improvements as when it operates alone over its preferred scheme, despite the parallel execution of diverse applications.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"488 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":"123402176","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
Network level call admission control algorithms for generalized processor sharing scheduling discipline 基于广义处理器共享调度的网络级调用允许控制算法
F. Németh, P. Barta, J. Bíró
{"title":"Network level call admission control algorithms for generalized processor sharing scheduling discipline","authors":"F. Németh, P. Barta, J. Bíró","doi":"10.1109/ISCC.2003.1214293","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214293","url":null,"abstract":"This paper proposes network level call admission control (CAC) algorithms for the most significant theoretical traffic scheduling algorithm, generalized processor sharing (GPS), and highlights important issues that arise when generalizing single node CAC results to the network level. The framework allows arbitrary network topology, in which competing leaky bucket controlled sessions are considered to be arbitrary weighted. This weighting relaxes bandwidth-delay coupling and extends the usable weight space of the admissible region, which make possible to build resource efficient CAC algorithms on the network level when combined with the tight delay bounds of [Barta, F. et al., 2001]. In order to keep end-to-end delay bounds under control, network nodes apply traffic shaping to eliminate the effects of complex traffic interactions.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"245 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131486958","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}
引用次数: 3
Dynamic fair queuing (DFQ): a novel fair scheduler improving wireless transmission over hybrid LANs 动态公平排队(DFQ):一种改进混合局域网无线传输的新型公平调度方法
C. Shieh, Yu-Ben Miao, Ming-Qi Shieh, W. Hwang
{"title":"Dynamic fair queuing (DFQ): a novel fair scheduler improving wireless transmission over hybrid LANs","authors":"C. Shieh, Yu-Ben Miao, Ming-Qi Shieh, W. Hwang","doi":"10.1109/ISCC.2003.1214310","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214310","url":null,"abstract":"Local area network (LAN) will be a hybrid network that includes wired and wireless links together. Nonetheless, the wired hosts always take the most bandwidth and bring about the bandwidth allocation unfairness. This problem is caused by the flow control mechanism that is dominated by the round-trip time (RTT). Among the connections on a share link, the ones with shorter RTT tend to acquire bandwidth easier and exhaust the link bandwidth eventually. The RTT of wireless transmission is much longer than wired transmission. Therefore, the protocol that implements flow control mechanism such as TCP suffers a severe low performance problem on wireless links. This paper proposed a new scheme called DFQ that works on gateway. It prevents the wired hosts from grabbing the bandwidth of share link too much and averts the unfairness or starvation of wireless connections. The experiment result shows that DFQ is practicable and makes wireless network to work with wired network seamlessly.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"1 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":"130590155","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
Supporting mobile devices in Gnutella file sharing network with mobile agents 支持移动设备在Gnutella文件共享网络与移动代理
T. Hu, Binh Thai, A. Seneviratne
{"title":"Supporting mobile devices in Gnutella file sharing network with mobile agents","authors":"T. Hu, Binh Thai, A. Seneviratne","doi":"10.1109/ISCC.2003.1214251","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214251","url":null,"abstract":"The use of peer to peer file sharing networks such as Gnutella is proliferating on the Internet, but its use is bandwidth consuming due to the broadcast nature of some peer to peer protocols. This is undesirable for mobile devices due to their bandwidth and power constraints. This paper proposes an architecture that uses mobile agents to participate in the Gnutella network on behalf of mobile devices in order to reduce the amount of traffic for the mobile device, as well as providing support for device mobility. Using real Gnutella traffic characteristics, analysis on the viability of the architecture is presented.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"81 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":"130668141","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}
引用次数: 54
Co-DRR: an integrated uplink and downlink scheduler for bandwidth management over wireless LANs Co-DRR:用于无线局域网带宽管理的集成上行和下行调度程序
H. Wei, Ching-Chuang Chiang, Ying-Dar Lin
{"title":"Co-DRR: an integrated uplink and downlink scheduler for bandwidth management over wireless LANs","authors":"H. Wei, Ching-Chuang Chiang, Ying-Dar Lin","doi":"10.1109/ISCC.2003.1214311","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214311","url":null,"abstract":"Bandwidth management over wired bottleneck links has been an effective way to utilize network resources. For the rapidly emerging IEEE 802.11 wireless LAN (WLAN), the limited WLAN bandwidth becomes a new bottleneck and requires bandwidth management. Most possible existing solutions only exclusively focus on optimizing multimedia traffic, pure downlink or pure uplink fairness, or are incompatible with IEEE 802.11. This study proposes a cooperative deficit round robin (co-DRR), an IEEE 802.11-compatible host based fair scheduling algorithm based on the deficit round robin (DRR) and distributed-DRR (DDRR) schemes, to cooperate the uplink and downlink quantum calculations to simultaneously control uplink and downlink bandwidth. Co-DRR uses the standard PCF mode to utilize the contention-free period to compensate for the unfairness in the contention period. Numerical results demonstrate that: co-DRR can scale up to 100 mobile hosts even under high bit error rate (0.0001) while simultaneous achieving uplink/downlink long-term fairness (CoV<0.01) among competing mobile hosts.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"18 2 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":"129842646","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}
引用次数: 13
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学术文献互助群
群 号:604180095
Book学术官方微信