scispace - formally typeset
Search or ask a question
Conference

IEEE International Conference Computer and Communications 

About: IEEE International Conference Computer and Communications is an academic conference. The conference publishes majorly in the area(s): Throughput & Wireless sensor network. Over the lifetime, 3577 publications have been published by the conference receiving 70913 citations.


Papers
More filters
Proceedings ArticleDOI
23 Apr 2006
TL;DR: The evaluations show that MaxProp performs better than protocols that have access to an oracle that knows the schedule of meetings between peers, and performs well in a wide variety of DTN environments.
Abstract: Disruption-tolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little information about the state of the partitioned network and transfer opportunities between peers are of limited duration. In this paper, we propose MaxProp, a protocol for effective routing of DTN messages. MaxProp is based on prioritizing both the schedule of packets transmitted to other peers and the schedule of packets to be dropped. These priorities are based on the path likelihoods to peers according to historical data and also on several complementary mechanisms, including acknowledgments, a head-start for new packets, and lists of previous intermediaries. Our evaluations show that MaxProp performs better than protocols that have access to an oracle that knows the schedule of meetings between peers. Our evaluations are based on 60 days of traces from a real DTN network we have deployed on 30 buses. Our network, called UMassDieselNet, serves a large geographic area between five colleges. We also evaluate MaxProp on simulated topologies and show it performs well in a wide variety of DTN environments.

2,148 citations

Proceedings ArticleDOI
23 Apr 2006
TL;DR: In this paper, the authors analyze Skype functions such as login, NAT and firewall traversal, call establishment, media transfer, codecs, and conferencing under three different network setups.
Abstract: Skype is a peer-to-peer VoIP client developed in 2003 by the organization that created Kazaa. Skype claims that it can work almost seamlessly across NATs and firewalls and has better voice quality than other VoIP clients. It encrypts calls end-to-end, and stores user information in a decentralized fashion. Skype also supports instant messaging and conferencing. This paper analyzes key Skype functions such as login, NAT and firewall traversal, call establishment, media transfer, codecs, and conferencing under three different network setups. Analysis is performed by careful study of the Skype network traffic and by intercepting the shared library and system calls of Skype. We draw a map of super nodes to which Skype establishes a TCP connection at login.

1,067 citations

Proceedings ArticleDOI
23 Apr 2006
TL;DR: This paper presents an interference-aware channel assignment algorithm and protocol for multi-radio wireless mesh networks that address this interference problem and demonstrates its practicality through the evaluation of a prototype implementation in a IEEE 802.11 testbed.
Abstract: The capacity problem in wireless mesh networks can be alleviated by equipping the mesh routers with multiple radios tuned to non-overlapping channels However, channel assignment presents a challenge because co-located wireless networks are likely to be tuned to the same channels The resulting increase in interference can adversely affect performance This paper presents an interference-aware channel assignment algorithm and protocol for multi-radio wireless mesh networks that address this interference problem The proposed solution intelligently assigns channels to radios to minimize interference within the mesh network and between the mesh network and co-located wireless networks It utilizes a novel interference estimation technique implemented at each mesh router An extension to the conflict graph model, the multi-radio conflict graph, is used to model the interference between the routers We demonstrate our solution’s practicality through the evaluation of a prototype implementation in a IEEE 80211 testbed We also report on an extensive evaluation via simulations In a sample multi-radio scenario, our solution yields performance gains in excess of 40% compared to a static assignment of channels

861 citations

Proceedings ArticleDOI
23 Apr 2006
TL;DR: This paper develops a basic scheme as a building block for all other advanced algorithms of the VN assignment problem and develops a selective VN reconfiguration scheme that prioritizes the reconfigurations of the most critical VNs.
Abstract: Recent proposals for network virtualization provide a promising way to overcome the Internet ossification. The key idea of network virtualization is to build a diversified Internet to support a variety of network services and architectures through a shared substrate. A major challenge in network virtualization is the assigning of substrate resources to virtual networks (VN) efficiently and on-demand. This paper focuses on two versions of the VN assignment problem: VN assignment without reconfiguration (VNA-I) and VN assignment with reconfiguration (VNAII). For the VNA-I problem, we develop a basic scheme as a building block for all other advanced algorithms. Subdividing heuristics and adaptive optimization strategies are then presented to further improve the performance. For the VNA-II problem, we develop a selective VN reconfiguration scheme that prioritizes the reconfiguration of the most critical VNs. Extensive simulation experiments demonstrate that the proposed algorithms can achieve good performance under a wide range of network conditions.

818 citations

Proceedings ArticleDOI
23 Apr 2006
TL;DR: This work proposes several vehicle-assisted data delivery (VADD) protocols to forward the packet to the best road with the lowest data-delivery delay, and Experimental results show that the proposed VADD protocols outperform existing solutions in terms of packet-del delivery ratio, data packet Delay, and protocol overhead.
Abstract: Multihop data delivery through vehicular ad hoc networks is complicated by the fact that vehicular networks are highly mobile and frequently disconnected. To address this issue, we adopt the idea of carry and forward, where a moving vehicle carries a packet until a new vehicle moves into its vicinity and forwards the packet. Being different from existing carry and forward solutions, we make use of predictable vehicle mobility, which is limited by traffic pattern and road layout. Based on the existing traffic pattern, a vehicle can find the next road to forward the packet to reduce the delay. We propose several vehicle-assisted data delivery (VADD) protocols to forward the packet to the best road with the lowest data-delivery delay. Experimental results show that the proposed VADD protocols outperform existing so- lutions in terms of packet-delivery ratio, data packet delay, and protocol overhead. Among the proposed VADD protocols, the Hybrid Probe (H-VADD) protocol has a much better performance.

666 citations

Performance
Metrics
No. of papers from the Conference in previous years
YearPapers
2020423
2019395
2018494
2017573
2016902
201593