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

EDS: a new scalable service differentiation architecture for Internet EDS:一种新的可扩展的因特网服务差异化体系结构

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

B. Gaidioz, P. Primet

引用次数: 22

Internet topology modeler based on map sampling 基于地图采样的互联网拓扑建模器

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

D. Magoni, Jean-Jacques Pansiot

引用次数: 72

MAC layer packet-length adaptive CLSP/DS-CDMA radio networks: performance in flat Rayleigh fading channel MAC层包长自适应CLSP/DS-CDMA无线网络:在平坦瑞利衰落信道中的性能

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

V. Phan, S. Glisic

引用次数: 3

Power and cost aware localized routing with guaranteed delivery in wireless networks 无线网络中具有功率和成本意识的保证传输的局部路由

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

I. Stojmenovic, S. Datta

{"title":"Power and cost aware localized routing with guaranteed delivery in wireless networks","authors":"I. Stojmenovic, S. Datta","doi":"10.1109/ISCC.2002.1021654","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021654","url":null,"abstract":"In a localized routing algorithm, each node currently holding message makes routing decision solely based on the information about itself its neighbors and destination. In a unit graph, two nodes can communicate if and only if the distance between them is no more than the transmission radius, which is the same for each node. A localized routing algorithm that guarantees delivery in connected unit graphs has been described previously. Also, several power, cost and power-cost aware metrics and localized loop-free routing algorithms for wireless networks based on the exact power needed for transmission between two nodes, and/or remaining battery power at nodes were proposed. However, these algorithms did not guarantee the delivery of a message in connected unit graphs. This paper proposes such localized routing algorithms, aimed at minimizing total power for routing a message, or maximizing the total number of routing tasks that a network can perform before a partition. The algorithms are combinations of known greedy power and/or cost aware localized routing algorithms and an algorithm that guarantees delivery. A shortcut procedure is introduced in later algorithm to enhance its performance. The efficiency of proposed algorithms is verified experimentally by comparing their power savings, and the number of routing tasks a network can perform before a node loses all its energy, with, the corresponding shortest weighted path algorithms, and localized algorithms that use fixed transmission power at each node. Significant energy savings (which depend mainly on network density and maximum transmission radius) are obtained.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"11 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":"131355949","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}

引用次数: 52

Scheduling constant bit rate flows in data over cable networks 在有线网络上调度恒定比特率的数据流

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

Nir Naaman, R. Rom

{"title":"Scheduling constant bit rate flows in data over cable networks","authors":"Nir Naaman, R. Rom","doi":"10.1109/ISCC.2002.1021732","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021732","url":null,"abstract":"The Data Over Cable Systems Interface Specification (DOCSIS) is the leading standard for data over cable networks. We consider the problem of scheduling constant bit rate (CBR) flows in a DOCSIS compliant cable network. CBR flows are required to support the delivery of voice and other real-time applications that generate fixed size data packets on a periodic basis. The primary application of CBR flows is voice over IP (VoIP) which cable operators intend to use in order to provide cable telephony services. DOCSIS 1.1 is enhanced with quality of service (QoS) capabilities; it defines the unsolicited grant service as the mechanism for supporting CBR flows. The scheduling algorithms, however, are not defined by the standard. We present the scheduling problem and examine several interesting special cases of it. We show that deciding whether a set of CBR flows can be legally scheduled is NP-complete whenever there are two or more different grant intervals. We model the scheduling problem as a variant of bin packing where bin sizes can be modified in a constrained manner This model enables the development of scheduling algorithms which are based on known algorithms for bin packing. We present an algorithm based on the next-fit algorithm and investigate its performance. We show that under certain assumptions which typically hold for VoIP and many other practical applications, a simple polynomial time scheduling algorithm is sufficient.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":" 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114101716","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}

引用次数: 10

The interrelation of TCP responsiveness and smoothness in heterogeneous networks 异构网络中TCP响应性与平滑性的相互关系

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

Chi Zhang, V. Tsaoussidis

{"title":"The interrelation of TCP responsiveness and smoothness in heterogeneous networks","authors":"Chi Zhang, V. Tsaoussidis","doi":"10.1109/ISCC.2002.1021692","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021692","url":null,"abstract":"TCP(/spl alpha/,/spl beta/) protocols trade the congestion window increase value /spl alpha/ for the decrease ratio /spl beta/, to generate smoother traffic patterns and to maintain a friendly behavior. We study the design assumptions of TCP(/spl alpha/,/spl beta/) protocols and discuss the impact of equation-based modulation of /spl alpha/ and /spl beta/ on application efficiency. We confirm experimentally that, in general, smoothness and responsiveness constitute a tradeoff; however, we uncover undesirable dynamics of the protocols when the network or flow characteristics do not follow a prescribed and static behavior. For example, we show that smooth backward adjustments confine the protocol's capability to exploit resources that become available rapidly, and embarrass the fair and efficient growth of incoming flows. Furthermore, we show that in the context of wireless networks with high error rate, a low /spl alpha/ dictates a conservative behavior that degrades the protocol performance with both delay-tolerant and delay-sensitive applications; and in the context of high contention of heterogeneous flows, a low /spl alpha/ does not contribute to efficiency and friendliness.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"7 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":"114137123","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

Mechanism for multi-domain marking in DiffServ architecture DiffServ体系结构中的多域标记机制

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

I. Niang, F. Jacquet, D. Seret

引用次数: 0

A new method for finding generalized frequent itemsets in generalized association rule mining 在广义关联规则挖掘中寻找广义频繁项集的一种新方法

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

Kritsada Sriphaew, T. Theeramunkong

引用次数: 46

Exploiting the structure of space-time codes 利用空时编码的结构

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

N. Al-Dhahir

引用次数: 0

Increasing security and availability of an Internet voting system 提高互联网投票系统的安全性和可用性

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

G. Dini

引用次数: 4