Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMart L. Molle
Person information
- affiliation: University of California, Riverside, Department of Computer Science and Engineering, CA, USA
- affiliation: University of Toronto, Computer Systems Research Institute, ON, Canada
- affiliation (PhD 1981): University of California, Los Angeles, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2008
[j27]Essia Hamouda Elhafsi, Mart L. Molle, D. Manjunath:
On the application of forking nodes to product-form queueing networks. Int. J. Commun. Syst. 21(2): 135-165 (2008)- 2007
- [j26]Zhenqiang Ye, Lap Kong Law, Srikanth V. Krishnamurthy
, Zhong Xu, Suvidhean Dhirakaosal, Satish K. Tripathi, Mart L. Molle:
Predictive channel reservation for handoff prioritization in wireless cellular networks. Comput. Networks 51(3): 798-822 (2007) - [j25]Ioannis Broustis, Srikanth V. Krishnamurthy, Michalis Faloutsos, Mart L. Molle, Jeffrey R. Foerster:
Multiband Media Access Control in Impulse-Based UWB Ad Hoc Networks. IEEE Trans. Mob. Comput. 6(4): 351-366 (2007) - 2006
- [j24]Ioannis Broustis, Mart L. Molle, Srikanth V. Krishnamurthy, Michalis Faloutsos, Jeffrey R. Foerster:
A new binary conflict resolution-based MAC protocol for impulse-based UWB ad hoc networks. Wirel. Commun. Mob. Comput. 6: 933-949 (2006) - 2005
- [j23]Mart L. Molle, Zhong Xu:
Short-circuiting the congestion signaling path for AQM algorithms using reverse flow matching. Comput. Commun. 28(18): 2082-2093 (2005) - 2004
- [j22]Michalis Faloutsos, Mart L. Molle:
A linear-time optimal-message distributed algorithm for minimum spanning trees. Distributed Comput. 17(2): 151-170 (2004) - [j21]Thomas Karagiannis, Mart L. Molle, Michalis Faloutsos:
Long-Range Dependence: Ten Years of Internet Traffic Modeling. IEEE Internet Comput. 8(5): 57-64 (2004) - 2003
- [j20]Thomas Karagiannis, Michalis Faloutsos, Mart L. Molle:
A user-friendly self-similarity analysis tool. Comput. Commun. Rev. 33(3): 81-93 (2003) - 1999
- [j19]Ying-Yi Huang, Mart L. Molle:
An Improved Topology Discovery Algorithm for Networks with Wormhole Routing and Directed Links. Comput. Networks 31(1-2): 79-88 (1999) - [j18]Kenneth J. Christensen, Mart L. Molle, Boaz Yeger:
The Design of a Station-Centric Network Model for Evaluating Changes to the IEEE 802.3 Ethernet Standard. Simul. 72(1): 33-46 (1999) - 1998
- [j17]Mart L. Molle, Kenneth J. Christensen:
The effects of controlling capture on multimedia traffic for shared Ethernet systems. Telecommun. Syst. 9(3-4): 287-314 (1998) - 1997
- [j16]Mart L. Molle, Mohan Kalkunte, Jayant Kadambi:
Frame bursting: a technique for scaling CSMA/CD to gigabit speeds. IEEE Netw. 11(4): 6-15 (1997) - 1996
- [j15]Mart L. Molle, Greg Watson:
100Base-T/IEEE 802.12/packet switching. IEEE Commun. Mag. 34(8): 64-73 (1996) - 1995
- [j14]D. Manjunath, Mart L. Molle:
The Effect of Bandwidth Allocation Policies on Delay in Unidirectional Bus Networks. IEEE J. Sel. Areas Commun. 13(7): 1309-1323 (1995) - 1994
- [j13]George C. Polyzos, Mart L. Molle:
A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events. Queueing Syst. Theory Appl. 16(3-4): 339-361 (1994) - 1993
- [j12]George C. Polyzos, Mart L. Molle:
A queueing theoretic approach to the delay analysis for the FCFS 0.487 conflict resolution algorithm. IEEE Trans. Inf. Theory 39(6): 1887-1906 (1993) - 1991
- [j11]Mart L. Molle:
Prioritized-virtual-time CSMA: head-of-the-line priority classes without added overhead. IEEE Trans. Commun. 39(6): 915-927 (1991) - 1990
- [j10]Mart L. Molle:
On the cutoff point for pairwise enabling in multiple access systems. IEEE Trans. Inf. Theory 36(5): 1127-1133 (1990) - 1989
- [j9]Mart L. Molle:
Analysis of a Class of Distributed Queues with Applications. Perform. Evaluation 9(4): 271-286 (1989) - [j8]Frank R. Kschischang, Mart L. Molle:
The helical window token ring. IEEE Trans. Inf. Theory 35(3): 626-636 (1989) - 1987
- [j7]Mart L. Molle, Khosrow Sohraby, Anastasios N. Venetsanopoulos:
Space-Time Models of Asynchronous CSMA Protocols for Local Area Networks. IEEE J. Sel. Areas Commun. 5(6): 956-968 (1987) - [j6]Khosrow Sohraby, Anastasios N. Venetsanopoulos, Mart L. Molle:
On the performance and stability of a sample gated conflict resolution algorithm. Kybernetika 23(3): 252-259 (1987) - [j5]Khosrow Sohraby, Mart L. Molle, Anastasios N. Venetsanopoulos:
Comments on "Throughput Analysis for Persistent CSMA Systems". IEEE Trans. Commun. 35(2): 240-243 (1987) - [j4]George C. Polyzos, Mart L. Molle, Anastasios N. Venetsanopoulos:
Performance Analysis of Finite Nonhomogeneous Population Tree Conflict Resolution Algorithms Using Constant Size Window Access. IEEE Trans. Commun. 35(11): 1124-1138 (1987) - 1985
- [j3]Mart L. Molle, Leonard Kleinrock:
Virtual Time CSMA: Why Two Clocks Are Better than One. IEEE Trans. Commun. 33(9): 919-933 (1985) - 1984
- [j2]Panos Economopoulos, Mart L. Molle:
On the performance of slotted ALOHA in a spread spectrum environment. Comput. Commun. Rev. 14(2): 234-241 (1984) - 1982
- [j1]Mart L. Molle:
On the capacity of infinite population multiple access protocols. IEEE Trans. Inf. Theory 28(3): 396-401 (1982)
Conference and Workshop Papers
- 2011
- [c27]Smruti Parichha, Mart L. Molle:
More (messages) is less (accuracy) in localization. MILCOM 2011: 772-779 - 2010
- [c26]M. Farhan Habib, Mart L. Molle:
Efficient computation of queueing delay at a network port from output link packet traces. ITC 2010: 1-8 - 2008
- [c25]Wojciech Jawor, Marek Chrobak, Mart L. Molle:
Experimental Analysis of Scheduling Algorithms for Aggregated Links. WAOA 2008: 253-266 - 2006
- [c24]Essia Hamouda Elhafsi, Mart L. Molle:
Optimal Routing Between Alternate Paths With Different Network Transit Delays. GLOBECOM 2006 - [c23]Ioannis Broustis, Gentian Jakllari, Thomas Repantis, Mart L. Molle:
A Comprehensive Comparison of Routing Protocols for Large-Scale Wireless MANETs. SECON 2006: 951-956 - 2005
- [c22]Banit Agrawal, Nitin Kumar, Mart L. Molle:
Controlling spam Emails at the routers. ICC 2005: 1588-1592 - [c21]Ioannis Broustis, Srikanth V. Krishnamurthy, Michalis Faloutsos, Mart L. Molle, Jeffrey R. Foerster:
A multiband mac protocol for impulse-based UWB ad hoc networks. SECON 2005: 452-462 - [c20]Mineo Takai, Rajive L. Bagrodia, Mario Gerla, Babak Daneshrad, Michael P. Fitz, Mani B. Srivastava, Elizabeth M. Belding-Royer, Srikanth V. Krishnamurthy, Mart L. Molle, Prasant Mohapatra, Ramesh R. Rao, Urbashi Mitra, Chien-Chung Shen, Joseph B. Evans:
Scalable Testbed for Next-Generation Wireless Networking Technologies Mineo Takai. TRIDENTCOM 2005: 162-171 - 2004
- [c19]Michael Erlinger, Mart L. Molle, Titus Winters, Chris Lundberg, Roy Shea:
TinkerNet: A Low-Cost Networking Laboratory. ACE 2004: 63-67 - [c18]Thomas Karagiannis, Mart L. Molle, Michalis Faloutsos, Andre Broido:
A Nonstationary Poisson View of Internet Traffic. INFOCOM 2004: 1558-1569 - [c17]Minli Zhu, Mart L. Molle, Bala Brahmam:
Design and Implementation of Application-Based Secure VLAN. LCN 2004: 407-408 - 2003
- [c16]Arun Saha, Mart L. Molle:
Thinking Outside the Box: Extending 802.1x Authentication to Remote "Splitter" Ports by Combining Physical and Data Link Layer Techniques. LCN 2003: 324-333 - 2002
- [c15]Zhong Xu, Zhenqiang Ye, Srikanth V. Krishnamurthy, Satish K. Tripathi, Mart L. Molle:
A New Adaptive Channel Reservation Scheme for Handoff Calls in Wireless Cellular Networks. NETWORKING 2002: 672-684 - 1998
- [c14]Kenneth J. Christensen, Mart L. Molle, Sifang Li:
Comparison of the Gigabit Ethernet Full-Duplex Repeater, CSMA/CD, and 1000/100-Mbps Switched Ethernet. LCN 1998: 336-344 - 1997
- [c13]Ying-Yi Huang, Mart L. Molle:
An Improved Topology Discovery Algorithm for Networks with Wormhole Routing and Directed Links. ICCCN 1997: 98-105 - [c12]Mart L. Molle, Mohan Kalkunte, Jayant Kadambi:
Scaling CSMA/CD to 1Gb/s with Frame Bursting. LCN 1997: 211-219 - [c11]Mart L. Molle, Boaz Yeger:
Reducing the Effects of Large Propagation Delays on High Speed IEEE 802.3 CSMA/CD Networks using Collision Truncation. LCN 1997: 317-326 - 1996
- [c10]Michalis Faloutsos, Mart L. Molle:
What features really make distributed minimum spanning tree algorithms efficient?. ICPADS 1996: 106- - [c9]D. Manjunath, Mart L. Molle:
Passive Estimation Algorithms for Queueing Delays in LANs and Other Polling Systems. INFOCOM 1996: 240-247 - 1995
- [c8]Wayne Hayes, Mart L. Molle:
Solving capture in switched two-node Ethernets by changing only one node. LCN 1995: 387-395 - [c7]Michalis Faloutsos, Mart L. Molle:
Optimal Distributed Algorithm for Minimum Spanning Trees Revisited. PODC 1995: 231-237 - 1987
- [c6]George C. Polyzos, Mart L. Molle:
Delay Analysis of a Window Tree Conflict Resolution Algorithm in a Local Area Network Environment. SIGMETRICS 1987: 234-244 - 1986
- [c5]Giovanni V. Guardalben, Mart L. Molle:
On the Coexistence of Different CSMA Protocols on the Same Network. ICC 1986: 603-609 - [c4]Khosrow Sohraby, Mart L. Molle, Anastasios N. Venetsanopoulos:
On the Stochastic Structure of Asynchronous CSMA Protocols Applied to Liner (Bus-Like) Networks. ICC 1986: 1863-1867 - 1983
- [c3]Mart L. Molle, Dimitri Konstantas:
A Simulation Study of Retransmission Strategies for the Asynchronous Virtual Time CSMA Protocol. Performance 1983: 295-308 - [c2]Mart L. Molle:
Asynchronous multiple access tree algorithms. SIGCOMM 1983: 214-218 - 1979
- [c1]Mart L. Molle, Leonard Kleinrock:
Analysis of concentrated ALOHA satellite links. SIGCOMM 1979: 87-95
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
