| 2012 | ||
|---|---|---|
| c34 | Hyunbum Kim, Jorge Arturo Cobb: Optimization trade-offs in the design of wireless sensor and actor networks. LCN 2012: 559-567 | |
| 2011 | ||
| j16 | Yi Xian, Chin-Tser Huang, Jorge Arturo Cobb: Look-Ahead Routing and Message Scheduling in Delay-Tolerant Networks. Computer Communications 34(18): 2184-2194 (2011) | |
| j15 | Jorge Arturo Cobb, Mohamed G. Gouda: Stabilization of max-min fair networks without per-flow state. Theor. Comput. Sci. 412(40): 5562-5579 (2011) | |
| c33 | Jorge Arturo Cobb: Rate equalization: A new approach to fairness in deterministic quality of service. LCN 2011: 50-57 | |
| c32 | Hyunbum Kim, Jorge Arturo Cobb: Optimal transmission range for multi-hop communication in wireless sensor and actor networks. LCN 2011: 223-226 | |
| c31 | Hyunbum Kim, Jorge Arturo Cobb: Optimal transmission range and actor movement in wireless sensor and Actor networks. WCNC 2011: 1197-1202 | |
| 2010 | ||
| c30 | Jorge Arturo Cobb: Maintaining Safety in Interdomain Routing with Hierarchical Path-Categories. ICDCN 2010: 30-41 | |
| c29 | Yi Xian, Chin-Tser Huang, Jorge Arturo Cobb: Look-ahead routing and Message Scheduling in delay-tolerant networks. LCN 2010: 40-47 | |
| c28 | ||
| e1 | Shlomi Dolev, Jorge Arturo Cobb, Michael J. Fischer, Moti Yung (Eds.): Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings. Lecture Notes in Computer Science 6366, Springer 2010, isbn 978-3-642-16022-6 | |
| 2009 | ||
| c27 | ||
| c26 | Jorge Arturo Cobb, Chin-Tser Huang: Stabilization of Maximal-Metric Routing without Knowledge of Network Size. PDCAT 2009: 306-311 | |
| 2008 | ||
| c25 | Jorge Arturo Cobb: Work-Conserving Fair-Aggregation with Rate-Independent Delay. ICCCN 2008: 400-405 | |
| c24 | Jorge Arturo Cobb, Mohamed G. Gouda: Stabilization of Max-Min Fair Networks without Per-flow State. SSS 2008: 156-172 | |
| c23 | Taehwan Choi, Sooel Son, Mohamed G. Gouda, Jorge Arturo Cobb: Pharewell to Phishing. SSS 2008: 233-245 | |
| 2007 | ||
| j14 | Ravi Musunuri, Jorge Arturo Cobb: Distributed out-bound load balancing in inter-AS routing by random matchings. Telecommunication Systems 34(1-2): 27-36 (2007) | |
| c22 | Jorge Arturo Cobb, Zhe Xu: Work-Conserving Fair-Aggregation Across Multiple Core Networks. ICCCN 2007: 932-938 | |
| c21 | ||
| 2006 | ||
| c20 | Mohamed G. Gouda, Jorge Arturo Cobb, Chin-Tser Huang: Fault Masking in Tri-redundant Systems. SSS 2006: 304-313 | |
| 2005 | ||
| j13 | Jorge Arturo Cobb: Scalable quality of service across multiple domains. Computer Communications 28(18): 1997-2008 (2005) | |
| j12 | Jorge Arturo Cobb, Mohamed G. Gouda, Deepinder P. Sidhu: Hello again: Stabilization of the Hello protocol in OSPF. J. High Speed Networks 14(1): 39-57 (2005) | |
| j11 | Ravi Musunuri, Jorge Arturo Cobb: An overview of solutions to avoid persistent BGP divergence. IEEE Network 19(6): 28-34 (2005) | |
| c19 | Jorge Arturo Cobb, Zhe Xu: Maintaining flow isolation in work-conserving flow aggregation. GLOBECOM 2005: 6 | |
| c18 | ||
| 2004 | ||
| j10 | Jorge Arturo Cobb, Miaohua Lin: The timely token protocol. Computer Communications 27(7): 569-580 (2004) | |
| c17 | Jorge Arturo Cobb, Ravi Musunuri: Enforcing convergence in inter-domain routing. GLOBECOM 2004: 1353-1358 | |
| c16 | ||
| 2003 | ||
| c15 | Jorge Arturo Cobb, Mohamed G. Gouda, Ravi Musunuri: A Stabilizing Solution to the Stable Path Problem. Self-Stabilizing Systems 2003: 169-183 | |
| 2002 | ||
| j9 | Sangman Bak, Jorge Arturo Cobb, Ernst L. Leiss: Performance Evaluation of Load-Balanced Routing via Bounded Randomization. CLEI Electron. J. 3(2) (2002) | |
| j8 | Jorge Arturo Cobb, Miaohua Lin: A theory of multi-channel schedulers for quality of service. J. High Speed Networks 12(1-2): 61-86 (2002) | |
| j7 | Jorge Arturo Cobb, Mohamed G. Gouda: Stabilization of General Loop-Free Routing. J. Parallel Distrib. Comput. 62(5): 922-944 (2002) | |
| j6 | Jorge Arturo Cobb: Preserving quality of service guarantees in spite of flow aggregation. IEEE/ACM Trans. Netw. 10(1): 43-53 (2002) | |
| c14 | ||
| 2001 | ||
| c13 | ||
| c12 | Jorge Arturo Cobb: Providing Quality of Service Guarantees without Per-Flow State. ICNP 2001: 211-219 | |
| c11 | ||
| 2000 | ||
| c10 | ||
| c9 | Sangman Bak, Albert Mo Kim Cheng, Jorge Arturo Cobb, Ernst L. Leiss: Load-Balanced Routing and Scheduling for Real-Time Traffic in Packet-Switch Networks. LCN 2000: 634-643 | |
| 1999 | ||
| j5 | Jorge Arturo Cobb: Universal Timestamp-Scheduling for real-time networks. Computer Networks 31(22): 2341-2360 (1999) | |
| c8 | Jorge Arturo Cobb: An In-Depth Look at Flow Aggregation for Efficient Quality of Service. ICNP 1999: 127-134 | |
| c7 | ||
| 1998 | ||
| j4 | Jorge Arturo Cobb, Mohamed G. Gouda, Amal El-Nahas: Time-shift scheduling - fair scheduling of flows in high-speed networks. IEEE/ACM Trans. Netw. 6(3): 274-285 (1998) | |
| c6 | Jorge Arturo Cobb: Preserving Quality of Service Guarantees in Spite of Flow Aggregation. ICNP 1998: 90-97 | |
| 1997 | ||
| j3 | Jorge Arturo Cobb, Mohamed G. Gouda: The Request Reply Family of Group Routing Protocols. IEEE Trans. Computers 46(6): 659-672 (1997) | |
| j2 | ||
| c5 | ||
| c4 | Jorge Arturo Cobb, Mohamed Waris: Propagated timestamps: a scheme for the stabilization of maximum-flow routing protocols. WSS 1997: 185-200 | |
| 1996 | ||
| j1 | Jorge Arturo Cobb, Mohamed G. Gouda: Group routing without group routing tables: an exercise in protocol design. Computer Communications 19(14): 1161-1174 (1996) | |
| c3 | Jorge Arturo Cobb, Mohamed G. Gouda: Group Routing without Group Routing Tables. ICDCS 1996: 344-351 | |
| c2 | Jorge Arturo Cobb, Mohamed G. Gouda, Amal El-Nahas: Time-Shift Scheduling: Fair Scheduling of Flows in High Speed Networks. ICNP 1996: 6-13 | |
| 1994 | ||
| c1 | Jorge Arturo Cobb, Mohamed G. Gouda, Prathima Agrawal: Protocol synchronization with sparse timestraps. PSTV 1994: 169-184 | |
Colors in the list of coauthors
Last update Sun May 26 10:54:30 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page