Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications最新文献_第4页

Comparison of voice activity detection algorithms for VoIP VoIP语音活动检测算法比较

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021726

R. V. Prasad, A. Sangwan, H. Jamadagni, M. Chiranth, R. Sah, V. Gaurav

引用次数: 110

SIP call setup delay in 3G networks 3G网络中的SIP呼叫设置延迟

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021770

I. Curcio, Miikka Lundan

引用次数: 54

Introducing distribution into applications: a reflective approach for transparency and dynamic fine-grained object allocation 将分布引入应用程序:透明和动态细粒度对象分配的反射方法

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021740

A. Stefano, G. Pappalardo, E. Tramontana

引用次数: 17

Scheduling real time parallel structure on cluster computing 基于集群计算的实时并行结构调度

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021660

R. Ammar, A. Alhamdan

{"title":"Scheduling real time parallel structure on cluster computing","authors":"R. Ammar, A. Alhamdan","doi":"10.1109/ISCC.2002.1021660","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021660","url":null,"abstract":"Scheduling a large number of high performance computing applications on a cluster-computing environment is a complex task. This becomes more critical in real time systems. Efficient scheduling strategies are critically important to achieving good performance. A cluster scheduler without enough knowledge of the state of the cluster and the scheduled tasks cannot adequately manage the cluster resources. Accordingly, the available processing power of the participating nodes may experience uncontrolled fragmentation. Thus, some of the submitted applications may be rejected due to tasks missing their deadlines. The literature on scheduling real-time task graphs is much less extensive, especially for providing timing guarantees while maximizing the processing power utilization. In this paper, we present a framework for allocating and scheduling real-time applications represented as parallel task graphs on a cluster. We utilize the available processing power on each processor to accommodate as many tasks as possible while satisfying the required deadline of each task. The algorithm also reduces the communication cost among tasks and the possibility of processing power fragmentation.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114309062","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}

引用次数: 14

Using distributed component model for active service deployment 使用分布式组件模型进行主动服务部署

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021688

R. Kilany, A. Serhrouchni

引用次数: 8

Efficiency/friendliness tradeoffs in TCP Westwood TCP Westwood中的效率/友好性权衡

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021694

Ren Wang, Massimo Valla, M. Sanadidi, Bryan C H Kwok, Fai Ng, M. Gerla

{"title":"Efficiency/friendliness tradeoffs in TCP Westwood","authors":"Ren Wang, Massimo Valla, M. Sanadidi, Bryan C H Kwok, Fai Ng, M. Gerla","doi":"10.1109/ISCC.2002.1021694","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021694","url":null,"abstract":"We propose a refinement of TCP Westwood which allows management of the efficiency/friendliness-to-NewReno tradeoff. We show that the refined TCP Westwood is able to achieve higher efficiency yet at the same time maintain friendliness. TCP Westwood (TCPW) implements a novel window congestion control algorithm based on available bandwidth estimation. The performance of TCPW has been promising, exceeding that of TCP NewReno in high speed and/or wired/wireless networks. However, under certain circumstances, TCP NewReno may experience some performance degradation because TCPW possesses more information and thus can take better advantage of available bandwidth. We propose combining the original TCPW sampling strategy that produces available bandwidth estimates (BE), with a new strategy that produces rate estimates (RE). Our studies show that RE works best when packet losses are mostly due to congestion. If on the other hand, the packet losses are mostly due to link errors, BE gives better performance. To achieve the \"best of all worlds\", we introduce a method we call combined rate and bandwidth estimation (CRB). A connection first infers the predominant cause of packet losses, and then uses the most appropriate estimation method. We also introduce the efficiency/friendliness tradeoff graph that provides better tradeoff visualization. In our experiments, we found that CRB provides a better compromise between efficiency and friendliness, and the means to manage such a tradeoff.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125233423","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}

引用次数: 78

Network constrained smoothing: enhanced multiplexing of MPEG-4 video 网络约束平滑:增强的MPEG-4视频复用

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021666

C. Bewick, R. Pereira, M. Merabti

引用次数: 16

Mining negative association rules 挖掘负面关联规则

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021739

Xiaohui Yuan, B. Buckles, Zhaoshan Yuan, Jian Zhang

引用次数: 62

Differentiated services: an experimental vs. simulated case study 差异化服务:实验与模拟案例研究

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021705

S. Andreozzi

引用次数: 2

A study of QoS performance for real time applications over a differentiated services network 差异化服务网络上实时应用的QoS性能研究

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021707

Evi Tsolakou, E. Nikolouzou, I. Venieris

引用次数: 6