Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)最新文献

筛选
英文 中文
On packet loss estimation for virtual private networks services 虚拟专用网业务丢包估计研究
Dongli Zhang, D. Ionescu
{"title":"On packet loss estimation for virtual private networks services","authors":"Dongli Zhang, D. Ionescu","doi":"10.1109/ICCCN.2004.1401618","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401618","url":null,"abstract":"When provisioning the quantitative QoS based VPN services over packet switched networks, parameters such as packet loss, delay and delay jitter, besides the required bandwidth, have to be guaranteed. While the bandwidth is easier to guarantee during the lifetime of a VPN service, maintaining a value of the loss parameter below a preset value presents serious difficulties. Thus one of the main issues to be solved is to estimate the packet loss parameter effectively and accurately. Linking the stochastic characteristics of the traffic process to the loss probability has been examined as a solution under various contexts. Based on the large deviation theory (LDT), two types of asymptotic loss estimators have been studied extensively: the large buffer asymptotic and the large number of source asymptotic. This paper explores the application of the above estimators to the core links which aggregates lots of VPN services. To reduce the computational complexity, aggregate traffic approximation estimator is employed instead on the latter of the study. Firstly, the two practical estimators are derived based on LDT and Gaussian traffic model. Then their performances are evaluated in the live MPLS VPN network. Conclusion and suggestion for future research are formulated at the end of this paper","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"438 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123612555","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
Minimizing the differential delay for virtually concatenated Ethernet over SONET systems 最小化SONET系统上虚拟连接以太网的差分延迟
S. Ahuja, T. Korkmaz, M. Krunz
{"title":"Minimizing the differential delay for virtually concatenated Ethernet over SONET systems","authors":"S. Ahuja, T. Korkmaz, M. Krunz","doi":"10.1109/ICCCN.2004.1401628","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401628","url":null,"abstract":"We consider the problem of minimizing the differential delay in a virtually concatenated Ethernet over SONET (EoS) system by suitable path selection. The link capacity adjustment scheme (LCAS) enables network service providers to dynamically add STS-n channels to or drop them from a virtually concatenated group (VCG). A new STS-n channel can be added to the VCG provided that the differential delay between the new STS-n channel and the existing STS-n channels in the VCG is within a certain bound that reflects the available memory buffer supported by the EoS system. We model the problem of finding such a STS-n channel as a constrained path selection problem where the cost of the required (feasible) path is constrained not only by an upper bound but also by a lower bound. We propose two algorithms to find such a path. Algorithm I uses the well-known k-shortest-path algorithm. Algorithm II is based on a modified link metric that linearly combines the original link weight (the link delay) and the inverse of that weight. The theoretical properties of such a metric are studied and used to develop a highly efficient heuristic for path selection. Simulations are conducted to evaluate the performance of both algorithms in terms of the miss rate and the execution time (average computational complexity)","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130213150","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}
引用次数: 40
Stochastic modelling of maintaining specified QoS constraints in discrete-time domain 在离散时间域中保持指定QoS约束的随机建模
L. Guan, M. Woodward, I. Awan
{"title":"Stochastic modelling of maintaining specified QoS constraints in discrete-time domain","authors":"L. Guan, M. Woodward, I. Awan","doi":"10.1109/ICCCN.2004.1401601","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401601","url":null,"abstract":"Quality of service (QoS) is of extreme importance to accommodate the increasingly diverse ranges of services and types of traffic in the Internet, and maintaining the delay at a specified value is a key QoS requirement. In this paper, a two-state Markov-modulated Bernoulli process (MMBP) is set up as our source model. To satisfy some specified delay, we present an analytical model for a discrete-time finite capacity queue, which incorporates two thresholds (L/sub 1/ in state-one and L/sub 2/ in state-two) in the system so that the source can be blocked. If the number of packets in the system reaches the threshold, then the source stops sending the packets, otherwise the source operates normally. That can be considered as an implicit feedback from the queue to the arrival process. In addition, when the arrival process is in a specific state, this information is used to adjust the thresholds L/sub 1/ and L/sub 2/ so that the mean delay through the queue is maintained at some specified value to satisfy QoS requirements.","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121444222","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
Efficient collection of sensor data in remote fields using mobile collectors 利用移动采集器在偏远地区高效采集传感器数据
Yuldi Tirta, Zhiyuan Li, Yung-Hsiang Lu, S. Bagchi
{"title":"Efficient collection of sensor data in remote fields using mobile collectors","authors":"Yuldi Tirta, Zhiyuan Li, Yung-Hsiang Lu, S. Bagchi","doi":"10.1109/ICCCN.2004.1401721","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401721","url":null,"abstract":"This paper proposes using a mobile collector, such as an airplane or a vehicle, to collect sensor data from remote fields. We present three different schedules for the collector: round-robin, rate-based, and min movement. The data are not immediately transmitted to the base station after being sensed but buffered at a cluster head; hence, it is important to ensure the latency is within an acceptable range. We compare the latency and the energy expended of the three schedules. We use the ns-2 network simulator to study the scenarios and illustrate conditions under which rate-based outperforms round-robin in latency, and vice-versa. The benefit of min movement is in minimizing the energy expended","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120960276","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}
引用次数: 90
Reducing queue-fill variability for emergency traffic in a differentiated services network 减少差异化业务网络中紧急流量的队列填充可变性
Manali Joshi, C. Beard
{"title":"Reducing queue-fill variability for emergency traffic in a differentiated services network","authors":"Manali Joshi, C. Beard","doi":"10.1109/ICCCN.2004.1401603","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401603","url":null,"abstract":"Supporting emergency services applications using the Internet has gained considerable interest in the recent past. A simple multiple average multiple threshold (MAMT) random early detection (RED) scheme is used to provide the necessary quality of service for emergency traffic. We have studied the RED dropping function as one of the contributing factors towards the variation observed in the queue fill. This may cause interactive emergency applications to experience large delay and delay variation thus deteriorating the service provided to them. Hence, we compare the performance of the linear dropping function in terms of average delay and variation in queue fill with that of the three other dropping functions namely: concave, convex and step. With the help of an exhaustive simulation study conducted using the network simulator-2, we conclude that the concave function provides the best performance","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"322 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132423210","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
Email worm modeling and defense 电子邮件蠕虫建模和防御
C. Zou, D. Towsley, W. Gong
{"title":"Email worm modeling and defense","authors":"C. Zou, D. Towsley, W. Gong","doi":"10.1109/ICCCN.2004.1401687","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401687","url":null,"abstract":"Email worms constitute one of the major Internet security problems. In this paper, we present an email worm model that accounts for the behaviors of email users by considering email checking time and the probability of opening email attachments. Email worms spread over a logical network defined by email address relationship, which plays an important role in determining the spreading dynamics of an email worm. Our observations suggest that the node degrees of an email network are heavy-tailed distributed. We compare email worm propagation on three topologies: power law, small world and random graph topologies; and then study how the topology affects immunization defense on email worms. The impact of the power law topology on the spread of email worms is mixed: email worms spread more quickly on a power law topology than on a small world topology or a random graph topology, but immunization defense is more effective on a power law topology than on the other two","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131526229","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}
引用次数: 126
Continuous space estimation for WLAN location determination systems 无线局域网定位系统的连续空间估计
M. Youssef, A. Agrawala
{"title":"Continuous space estimation for WLAN location determination systems","authors":"M. Youssef, A. Agrawala","doi":"10.1109/ICCCN.2004.1401614","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401614","url":null,"abstract":"WLAN location determination systems add to the value of a wireless network by providing the user location without using any extra hardware. Current systems return the estimated user location from a set of discrete locations in the area of interest, which limits the accuracy of such systems to how far apart the selected points are. In this paper, we present two techniques to estimate the user location in the continuous physical space, namely the center of mass technique and time averaging technique. We test the performance of the two techniques in the context of the Horus WLAN location determination system under two different testbeds. Using the center of mass technique, the performance of the Horus system is enhanced by more than 13% for the first testbed and more than 6% for the second testbed. The time-averaging technique enhances the performance of the Horus system by more than 24% for the first testbed and more than 15% for the second testbed. The techniques are general and can be applied to any of the current WLAN location determination systems to enhance their accuracy. Moreover, the two techniques are independent and can be applied together to further enhance the accuracy of the current WLAN location determination systems","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126818150","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}
引用次数: 48
A load balancing hierarchical model for micro-mobility 微移动负载均衡分层模型
Jing Li, S. Sampalli
{"title":"A load balancing hierarchical model for micro-mobility","authors":"Jing Li, S. Sampalli","doi":"10.1109/ICCCN.2004.1401665","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401665","url":null,"abstract":"The design of micro-mobility management protocols stands out as an important challenge in integrating wireless networks into the IP-based Internet, especially when such networks are deployed for real-time multimedia applications. We present a new load balancing hierarchical model for micro-mobility management for the wireless access network. The scheme includes a novel anchor selection algorithm. The hierarchical model and the anchor selection algorithm enable load balancing by distributing the number of mobile hosts managed by each anchor. In addition to load balancing, the proposed scheme has the advantages of QoS (quality of service) support, robustness, scalability, and fast handoff. Simulation results of our model indicate that it provides good load balancing performance in the presence of multiple QoS classes of applications","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123767322","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}
引用次数: 2
Cooperative patching: a client based P2P architecture for supporting continuous live video streaming 协作补丁:基于客户端的P2P架构,支持连续的视频直播
M. Guo, M. Ammar, E. Zegura
{"title":"Cooperative patching: a client based P2P architecture for supporting continuous live video streaming","authors":"M. Guo, M. Ammar, E. Zegura","doi":"10.1109/ICCCN.2004.1401712","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401712","url":null,"abstract":"We propose a cooperative patching architecture to achieve continuous live video streaming to a set of cooperative but unreliable end hosts. In this design, each end host caches an initial portion of the video content before playback. It then keeps the video that has been played out for a certain time before discarding it. An end host maintains a list of patching parents, and retrieves lost data from one of its patching parents. Any end host that has the requested video content can be a patching parent. Several parent selection algorithms are proposed and evaluated in this paper. This architecture relieves server load by completely shifting video patching responsibility to the client side. Video content is replicated in multiple locations across the overlay network to provide fast and timely data recovery. Cooperative patching is especially advantageous for legacy video systems, since it does not require modification of the video server. Simulation experiments demonstrate that our design can achieve continuous video streaming with moderate cost","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114862466","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
A TCP-friendly congestion control to guarantee smoothness by slack term 一种tcp友好的拥塞控制,通过松弛项保证平滑
Y. Lai, S. Chien
{"title":"A TCP-friendly congestion control to guarantee smoothness by slack term","authors":"Y. Lai, S. Chien","doi":"10.1109/ICCCN.2004.1401642","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401642","url":null,"abstract":"With the rapid advance of network technologies over the past decade, more and more real-time multimedia applications, such as telephony and video conference, are widely deployed in the Internet. These multimedia applications are commonly implemented using UDP because some characteristics of TCP, for example, the burst transmission and frequent window variation, are not suitable for them. However, since UDP does not employ any congestion control, the unfair treatment towards TCP occurs. For these reasons, a new concept, \"TCP-friendliness\" is advocated. A TCP-friendly flow shares bandwidth similar to competing TCP flows. In this paper, we present a new TCP-friendly congestion control, slack term, by patching TCP-friendly rate control (TFRC). Slack term limits the variation of sending rate to guarantee the smoothness, records the deficit or excess of bandwidth, and then returns it in the future to guarantee the friendliness. Simulation results show that our algorithm can enhance them with the smoother transmission rate and achieve the similar friendliness to TCP flows","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116766276","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}
引用次数: 9
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学术官方微信