1528 search results - page 141 / 306 » On Signatures for Communication Graphs |
165
click to vote
SIGCOMM
1992
ACM
15 years 10 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
192
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— In this paper, we study the performance of the 2-hop routing scheme proposed for ad hoc wireless networks with mobile nodes, considering realistic node mobility patterns. First...
171
click to vote
OPODIS
2007
15 years 7 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
172
click to vote
COMCOM
1998
15 years 6 months ago
1998
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
182
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...