Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.最新文献_第2页

A best first search based optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings 一种基于最佳优先搜索的最佳波长分配算法，以最小化WDM环中SONET adm的数量

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523954

Sethuraman Janardhanan, A. Mahanti, Debashis Saha, S. Sadhukhan

引用次数: 0

Self-certified group key generation for ad hoc clusters in wireless sensor networks 无线传感器网络中自组织簇的自认证组密钥生成

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523886

O. Arazi, H. Qi

引用次数: 20

A simple method for balancing network utilization and quality of routing 平衡网络利用率和路由质量的简单方法

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523811

Yuxi Li, J. Harms, R. Holte

引用次数: 12

A scalable scheduling algorithm to avoid conflicts in switch-memory-switch routers 一种避免交换-内存-交换路由器冲突的可伸缩调度算法

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523809

Yang Xu, Beibei Wu, Wenjie Li, B. Liu

{"title":"A scalable scheduling algorithm to avoid conflicts in switch-memory-switch routers","authors":"Yang Xu, Beibei Wu, Wenjie Li, B. Liu","doi":"10.1109/ICCCN.2005.1523809","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523809","url":null,"abstract":"Although output queued (OQ) switches are prominent for their high performance, they are not easy to implement due to the high speedup requirement. Using a special scheduling algorithm in the first stage switch, a more scalable switch-memory-switch (SMS) architecture can emulate an OQ switch, where cells must be transferred from the inputs to the shared memories per time slot without arrival and departure conflicts. Although scheduling algorithm achieves good performance, the time complexity for constructing the bipartite graph is too high to be used in practice. In this paper, we propose a new iterative random round-Robin matching (iRRM) algorithm together with its constrained version CiRRM, where no bipartite graph is required to be constructed in advance to solve the departure conflict, and thus high computation overhead is avoided. In our algorithms, both the arrival and the departure conflicts are melted in the iterations. Each iterations consist of two steps: request step and grant step, where randomness and more easily implemented round-robin principle are used respectively. Through theoretical analysis, we obtain that with M=2/spl phi/(N-1) shared memories, where N is the port number and /spl phi/ is a constant larger than (2N-1)/(2N-2), iRRM/CiRRM can complete a matching within O(logM) iterations with high probability in M and the time complexity of CiRRM is only O(log/sup 2/M/loglogM), which is much lower than prior algorithms.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128710035","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

An anchor-based routing protocol with cell ID management system for ad hoc networks 一种基于锚点的路由协议，具有自组织网络的小区ID管理系统

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523853

Huaizhi Li, M. Singhal

{"title":"An anchor-based routing protocol with cell ID management system for ad hoc networks","authors":"Huaizhi Li, M. Singhal","doi":"10.1109/ICCCN.2005.1523853","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523853","url":null,"abstract":"Ad hoc networks, which do not rely on any infrastructure such as access points or base station, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. So ad hoc networks have attractive applications in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. Nowadays, more and more wireless devices are being used, which can form large ad hoc networks. It is important to design a scalable routing protocol for ad hoc networks. In this paper, we propose anchor-based routing protocol with cell ID management system (ARPC), a scalable routing protocol for ad hoc networks. ARPC is a hybrid routing protocol, which combines the advantages of table-based routing strategy and geographic routing strategy, and avoids the burden-GPS (Global Positioning System) (E. D. Kaplan, 1996) support. Simulation results show that ARPC is efficient and scales well to large networks. Especially for large networks (1000 and 1600 nodes), ARPC achieves 21 percent higher packet delivery ratio than AODV, and has 19 percent lower overhead. This denotes that ARPC has better scalability than AODV.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130729700","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

Attack diagnosis: throttling distributed denial-of-service attacks close to the attack sources 攻击诊断:对靠近攻击源的分布式拒绝服务攻击进行抑制

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523866

Ruiliang Chen, J. Park

{"title":"Attack diagnosis: throttling distributed denial-of-service attacks close to the attack sources","authors":"Ruiliang Chen, J. Park","doi":"10.1109/ICCCN.2005.1523866","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523866","url":null,"abstract":"Attack mitigation schemes actively throttle attack traffic generated in distributed denial-of-service (DDoS) attacks. This paper presents attack diagnosis (AD), a novel attack mitigation scheme that combines the concepts of Pushback and packet marking. AD's architecture is inline with the ideal DDoS attack countermeasure paradigm, in which attack detection is performed near the victim host and attack mitigation is executed close to the attack sources. AD is a reactive defense that is activated by a victim host after an attack has been detected. A victim activates AD by sending AD-related commands to its upstream routers. On receipt of such commands, the AD-enabled upstream routers deterministically mark each packet destined for the victim with the information of the input interface that processed that packet. By collecting the router interface information recorded in the packet markings, the victim can trace back the attack traffic to the attack sources. Once the traceback is complete, the victim issues messages that command AD-enabled routers to filter attack packets close to the source. The AD commands can be authenticated by the TTL field of the IP header without relying on any global key distribution infrastructure in Internet. Although AD can effectively filter traffic generated by a moderate number of attack sources, it is not effective against large-scale attacks. To address this problem, we propose an extension to AD called parallel attack diagnosis (PAD) that is capable of throttling traffic coming from a large number of attack sources simultaneously. AD and PAD are analyzed and evaluated using a realistic network topology based on the Skitter Internet map. Both schemes are shown to be robust against IP spoofing and incur low false positive ratios.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130487864","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}

引用次数: 31

Roaming, hand-off and services continuity for voice services in converged wireless networks 融合无线网络中话音业务的漫游、切换和业务连续性

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523916

G. Mandyam

{"title":"Roaming, hand-off and services continuity for voice services in converged wireless networks","authors":"G. Mandyam","doi":"10.1109/ICCCN.2005.1523916","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523916","url":null,"abstract":"The success of Wi-Fi and emergence of Wi-MAX creates exciting technology and business challenges for the communication industry. Roaming, seamless voice and data hand-offs, in conjunction with continuity of voice services such as messaging, push-to-talk, and voicemail, are posing the next technology and business challenges. Services convergence among Wi-Fi, Wi-MAX, and cellular networks is creating opportunities for both wireless, and wireline service providers. Similar opportunity exists for enterprises for the first time. Services convergence can give enterprises the freedom similar to \"PBX\"es for wireless access on and off campuses. As the business cases for enterprises and wireline service providers are pitted against each other on the commercial front, the technologies will evolve out of market leverage, presence and acceptance. This poses a challenge for technologists to create a technology that is easily deployable in target scenarios. The requirements exist for a solution that, independently of the end user and service providing entity, can fulfil the \"service quality\" expectations of users and providers. In this talk, we discuss the requirements of voice service convergence solutions, protocols, standardization effort, and challenges for solution development. We also allude to the opportunities for research and development of newer technologies. These innovations will breach the current gaps in convergence of services beyond packet to circuit call control mechanisms and extend them across different access technologies, such as Wi-Fi, Wi-MAX, GSM, CDMA, and others.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123250809","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

Active and passive measurements on campus, regional and national network backbone paths 主动和被动测量校园，区域和国家网络骨干路径

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523933

P. Calyam, Dima Krymskiy, M. Sridharan, P. Schopis

{"title":"Active and passive measurements on campus, regional and national network backbone paths","authors":"P. Calyam, Dima Krymskiy, M. Sridharan, P. Schopis","doi":"10.1109/ICCCN.2005.1523933","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523933","url":null,"abstract":"It has become a common practice for Internet service providers (ISPs) to instrument their networks with network measurement infrastructures (NMIs). These NMIs support network-wide \"active\" and \"passive\" measurement data collection and analysis to: 1) identify end-to-end performance bottlenecks in network paths and 2) broadly understand Internet traffic characteristics, on an ongoing basis. In this paper, we present our analysis of the active and passive measurement data collected along network backbone paths within typical campus, regional and national networks which carry traffic of cutting-edge Internet applications such as high-quality voice and video conferencing, multimedia streaming and distributed file sharing. The active measurement data has been obtained by using \"ActiveMon\" software, which we have developed and deployed along the above network backbone paths. The passive measurement data has been obtained using SNMP, Syslog and NetFlow data available at the intermediate routers located at strategic points along the same network backbone paths. Our analysis of the measurement data includes studying notable trends, network events and relative performance issues of the network backbone paths which are reflected in the active and passive measurement data collected regularly over several months. Our results thus provide valuable insights regarding traffic dynamics in the different academic network backbones and can be used for better design and control of networks and also to develop traffic source models based on empirical data from real-networks.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126250111","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}

引用次数: 33

Synergy: an overlay internetworking architecture 协同:一个覆盖的互连网络架构

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523896

Minseok Kwon, S. Fahmy

引用次数: 31

Grid based two transmission range strategy for MANETs 基于网格的多网双传输距离策略

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523856

Zhijun Wang, Jingyuan Zhang

{"title":"Grid based two transmission range strategy for MANETs","authors":"Zhijun Wang, Jingyuan Zhang","doi":"10.1109/ICCCN.2005.1523856","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523856","url":null,"abstract":"In a mobile ad hoc network (MANET), it becomes practically viable to use virtual infrastructures to improve energy efficiency. The square-based infrastructure divides the network area into squares of the same size. Fourand eight-directional forwarding are two popular forwarding methods in the square-based infrastructure. In four-directional (or eight-directional) forwarding, packets can be forwarded from a square to its four (or eight) neighboring squares. Previous research shows, to achieve the maximum energy saving, each forwarding method must choose a proper square size for the infrastructure, and each method has its advantageous directions in terms of energy saving. That indicates an adaptive strategy combining both methods will save more energy in every direction. However, it is costly for nodes to maintain two infrastructures. Instead of maintaining two infrastructures, this paper proposes to use two different power levels for transmitting packets. The low power level is used for transmission of packets to horizontal or vertical neighbors and the high power level for transmission to diagonal neighbors. The proposed two transmission range scheme has the advantages of both four- and eight-directional forwarding schemes, yet only one infrastructure needs to be maintained. The paper compares the energy efficiency between the proposed scheme and related schemes analytically and numerically. It shows that the two transmission range strategy outperforms both eight- and four-directional forwarding in terms of path optimality, network lifetime, and average node power consumption.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132747480","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